[permalink] [id link]
OSPF uses the Dijkstra algorithm.
from
Wikipedia
Some Related Sentences
OSPF and uses
PNNI uses the same shortest-path-first algorithm used by OSPF and IS-IS to route IP packets to share topology information between switches and select a route through a network.
Interior routing mostly uses link-state routing protocols such as OSPF and IS-IS.
Like the OSPF protocol, IS-IS uses Dijkstra's algorithm for computing the best path through the network.
OSPF uses multicast addressing for route flooding on a broadcast network link.
OSPF uses both unicast and multicast to send " hello packets " and link state updates.
OSPF uses path cost as its basic routing metric, which was defined by the standard not to equate to any standard value such as speed, so the network designer could pick a metric important to the design.
OSPF and Dijkstra
Both IS-IS and OSPF are link state protocols, and both use the same Dijkstra algorithm for computing the best path through the network.
OSPF and algorithm
Dijkstra's algorithm is used in SPF, Shortest Path First, which is used in the routing protocols OSPF and IS-IS.
Since link-state routing requires the topology database to be synchronized across the network, OSPF and IS-IS perform topology flooding using a reliable algorithm.
OSPF and .
MPLS Traffic Engineering relies upon the use of TE extensions to Open Shortest Path First ( OSPF ) or Intermediate System To Intermediate System ( IS-IS ) and RSVP.
An example would be the joining of a number of large OSPF ( Open Shortest Path First ) networks where OSPF by itself would not scale to size.
IS-IS was developed at roughly the same time that the Internet Engineering Task Force IETF was developing a similar protocol called OSPF.
OSPF, on the other hand, was designed for IPv4.
IS-IS differs from OSPF in the way that " areas " are defined and routed between.
In OSPF, areas are delineated on the interface such that an area border router ( ABR ) is actually in two or more areas at once, effectively creating the borders between areas inside the ABR, whereas in IS-IS area borders are in between routers, designated as Level 2 or Level 1-2.
The logical view is that OSPF creates something of a spider web or star topology of many areas all attached directly to Area Zero and IS-IS by contrast creates a logical topology of a backbone of Level 2 routers with branches of Level 1-2 and Level 1 routers forming the individual areas.
IS-IS also differs from OSPF in the methods by which it reliably floods topology and topology change information through the network.
OSPF has a larger set of extensions and optional features.
Given the same set of resources, IS-IS can support more routers in an area than OSPF.
Open Shortest Path First ( OSPF ) is an adaptive routing protocol for Internet Protocol ( IP ) networks.
It is defined as OSPF Version 2 in RFC 2328 ( 1998 ) for IPv4.
OSPF is perhaps the most widely used interior gateway protocol ( IGP ) in large enterprise networks.
OSPF was designed to support variable-length subnet masking ( VLSM ) or Classless Inter-Domain Routing ( CIDR ) addressing models.
OSPF detects changes in the topology, such as link failures, very quickly and converges on a new loop-free routing structure within seconds.
Identical copies of the LSDB are periodically updated through flooding on all OSPF routers.
The OSPF routing policies to construct a route table are governed by link cost factors ( external metrics ) associated with each routing interface.
An OSPF network may be structured, or subdivided, into routing areas to simplify administration and optimize traffic and resource utilization.
uses and Dijkstra
Actually, in Guarded commands, Dijkstra uses only one kind of predicate transformers: the well-known weakest preconditions ( see below ).
uses and algorithm
He also was the original author of rzip, which uses a similar algorithm to rsync.
In one application, it is actually a benefit: the password-hashing method used in OpenBSD uses an algorithm derived from Blowfish that makes use of the slow key schedule ; the idea is that the extra computational effort required gives protection against dictionary attacks.
The " smooth curve " feature of charts in Microsoft Excel also uses this algorithm.
In a symmetric key algorithm ( e. g., DES and AES ), the sender and receiver must have a shared key set up in advance and kept secret from all other parties ; the sender uses this key for encryption, and the receiver uses the same key for decryption.
Another simulation uses illumination plotted from a radiosity algorithm, or a combination of these two.
* < tt > sum </ tt >, a Unix command ( also ported to Win32 ) that generates order-independent sums ; uses two different algorithms for calculating, the SYSV checksum algorithm and the BSD checksum ( default ) algorithm.
The situation is further complicated by the traditional uses of the terms parallel and distributed algorithm that do not quite match the above definitions of parallel and distributed systems ; see the section Theoretical foundations below for more detailed discussion.
The algorithm, named after its inventor, Jay Earley, is a chart parser that uses dynamic programming ; it is mainly used for parsing in computational linguistics.
EDGE, like GPRS, uses a rate adaptation algorithm that adapts the modulation and coding scheme ( MCS ) according to the quality of the radio channel, and thus the bit rate and robustness of data transmission.
This generalized Euclidean algorithm can be put to many of the same uses as Euclid's original algorithm in the ring of integers: in any Euclidean domain, one can apply the Euclidean algorithm to compute the greatest common divisor of any two elements.
Currently Freenet uses the DSA algorithm.
In other words, instead of coding, the developer uses Table-driven algorithm programming ( See also control tables that can be used for this purpose ).
Rader's algorithm, exploiting the existence of a generator for the multiplicative group modulo prime, expresses a DFT of prime size as a cyclic convolution of ( composite ) size, which can then be computed by a pair of ordinary FFTs via the convolution theorem ( although Winograd uses other convolution methods ).
A 4-way floodfill algorithm that uses the adjacency technique and a queue as its seed pixel store yields an expanding lozenge-shaped fill.
A much more efficient method is the Euclidean algorithm, which uses a division algorithm such as long division in combination with the observation that the gcd of two numbers also divides their difference.
The algorithm below uses a trailing pointer for the insertion into the sorted list.
* There is a fully polynomial-time approximation scheme, which uses the pseudo-polynomial time algorithm as a subroutine, described below.
** A second hierarchy match algorithm was therefore created which uses the taxonomic hierarchies found in WordNet ( deep hierarchies ) and partially in LDOCE ( flat hierarchies ).
Example pseudocode for top down merge sort algorithm which uses recursion to divide the list into sub-lists, then merges sublists during returns back up the call chain.
0.443 seconds.