Search results
Jump to navigation
Jump to search
Page title matches
- '''Open Shortest Path First''' (OSPF) is a protocol for automatically distributing routing information {{seealso|Open Shortest Path First for IPv6}}23 KB (3,713 words) - 12:20, 30 March 2024
- #Redirect [[Open Shortest Path First]]38 bytes (5 words) - 21:20, 6 June 2008
- A standard IP [[routing protocol]], [[Open Shortest Path First]], has been issued in a major new version,<ref name=RFC5340>{{citation ...version 4]] and [[Internet Protocol version 6]]. Familiarity with basic [[Open Shortest Path First]] (OSPF) and [[link state routing]] terminology is assumed in this article.18 KB (3,085 words) - 15:00, 20 March 2024
- Auto-populated based on [[Special:WhatLinksHere/Open Shortest Path First]]. Needs checking by a human. {{r|Open Shortest Path First for IPv6}}907 bytes (117 words) - 14:59, 20 March 2024
- A major revision of the [[Open Shortest Path First]] interior routing protocol, principally to let it carry both [[Internet Pr292 bytes (38 words) - 21:48, 19 October 2008
- ...ptember 2003 | url = http://www.ietf.org/rfc/rfc3630.txt}}</ref> to the '''Open Shortest Path First (OSPF)''' Version 2 (i.e., for [[Internet Protocol version 4]] have been de2 KB (351 words) - 18:23, 10 February 2011
- 332 bytes (42 words) - 10:59, 7 September 2008
- Auto-populated based on [[Special:WhatLinksHere/Open Shortest Path First for IPv6]]. Needs checking by a human. {{r|Open Shortest Path First}}486 bytes (65 words) - 19:12, 11 January 2010
- Auto-populated based on [[Special:WhatLinksHere/Open Shortest Path First traffic engineering extensions]]. Needs checking by a human.575 bytes (71 words) - 19:12, 11 January 2010
Page text matches
- #REDIRECT [[Open Shortest Path First]]38 bytes (5 words) - 09:26, 6 June 2008
- #Redirect [[Open Shortest Path First]]38 bytes (5 words) - 21:20, 6 June 2008
- #Redirect [[Open Shortest Path First]]38 bytes (5 words) - 21:20, 6 June 2008
- #Redirect [[Open Shortest Path First]]38 bytes (5 words) - 21:20, 6 June 2008
- #REDIRECT [[Open Shortest Path First|Stub areas]]49 bytes (7 words) - 02:10, 13 January 2010
- #REDIRECT [[Open Shortest Path First for IPv6]]47 bytes (7 words) - 10:33, 7 September 2008
- #REDIRECT [[Open Shortest Path First for IPv6/Definition]]58 bytes (8 words) - 21:48, 19 October 2008
- Auto-populated based on [[Special:WhatLinksHere/Open Shortest Path First for IPv6]]. Needs checking by a human. {{r|Open Shortest Path First}}486 bytes (65 words) - 19:12, 11 January 2010
- ...hms for finding optimal topologies; also called [[link state]]; basic of [[Open Shortest Path First]]; sometimes called the Dijkstra algorithm217 bytes (28 words) - 10:40, 23 October 2009
- {{r|Open Shortest Path First for IPv6}} {{r|Open Shortest Path First}}842 bytes (109 words) - 14:59, 20 March 2024
- Part of an [[Open Shortest Path First]] routing domain, a lower-level hierarchical area that is not generally not201 bytes (31 words) - 02:12, 13 January 2010
- Auto-populated based on [[Special:WhatLinksHere/Open Shortest Path First]]. Needs checking by a human. {{r|Open Shortest Path First for IPv6}}907 bytes (117 words) - 14:59, 20 March 2024
- A major revision of the [[Open Shortest Path First]] interior routing protocol, principally to let it carry both [[Internet Pr292 bytes (38 words) - 21:48, 19 October 2008
- {{r|Open Shortest Path First}}225 bytes (27 words) - 22:48, 27 September 2008
- {{r|Open Shortest Path First traffic engineering extensions}} {{r|Open Shortest Path First}}1 KB (167 words) - 14:59, 20 March 2024
- *[[Open Shortest Path First]] (OSPF)916 bytes (131 words) - 22:12, 6 February 2010
- {{r|Open Shortest Path First}}328 bytes (46 words) - 17:33, 24 December 2009
- {{r|Open shortest path first}}416 bytes (49 words) - 10:55, 7 May 2008
- {{r|Open shortest path first}}526 bytes (63 words) - 10:56, 7 May 2008
- {{r|Open Shortest Path First}}527 bytes (67 words) - 20:07, 11 January 2010
- Auto-populated based on [[Special:WhatLinksHere/Open Shortest Path First traffic engineering extensions]]. Needs checking by a human.575 bytes (71 words) - 19:12, 11 January 2010
- {{r|Open Shortest Path First version 3}}633 bytes (72 words) - 06:31, 17 March 2024
- {{r|Open Shortest Path First}}605 bytes (77 words) - 17:30, 11 January 2010
- {{r|Open Shortest Path First}}732 bytes (101 words) - 12:31, 6 June 2008
- ...ptember 2003 | url = http://www.ietf.org/rfc/rfc3630.txt}}</ref> to the '''Open Shortest Path First (OSPF)''' Version 2 (i.e., for [[Internet Protocol version 4]] have been de2 KB (351 words) - 18:23, 10 February 2011
- {{r|Open Shortest Path First traffic engineering extensions}}924 bytes (116 words) - 18:42, 11 January 2010
- {{r|Open Shortest Path First}}1 KB (141 words) - 14:59, 20 March 2024
- ...ocol#interior routing protocol|interior routing protocols, the other being Open Shortest Path First. Technically, the version used in the Internet, to carry routing informatio2 KB (257 words) - 16:21, 30 March 2024
- {{r|Open Shortest Path First}}1 KB (165 words) - 05:56, 17 March 2024
- For example, a given organization might use [[Open Shortest Path First]] (OSPF) as its main [[interior routing protocol]], but have one or more ol1 KB (234 words) - 15:00, 20 March 2024
- *[[Open Shortest Path First]]<ref name=RFC4061>{{citation2 KB (310 words) - 15:00, 20 March 2024
- *[[Open Shortest Path First]] (OSPF), an [[Internet Engineering Task Force]] (IETF) protocol, which sup4 KB (647 words) - 15:00, 20 March 2024
- | Open Shortest Path First9 KB (1,543 words) - 16:22, 30 March 2024
- ...is best to use a routing protocol, such as the Border Gateway Protocol or Open Shortest Path First, that has an explicit router identifier that can disambiguate different ann3 KB (432 words) - 07:36, 18 March 2024
- There is an obscure but elegant way, in the [[Open Shortest Path First]] interior routing protocol, to create closest exits from its routing domai5 KB (820 words) - 05:17, 31 May 2009
- [[Open Shortest Path First]], the IPv6 version, is probably the best dynamic interior routing protocol9 KB (1,526 words) - 20:04, 25 March 2011
- A standard IP [[routing protocol]], [[Open Shortest Path First]], has been issued in a major new version,<ref name=RFC5340>{{citation ...version 4]] and [[Internet Protocol version 6]]. Familiarity with basic [[Open Shortest Path First]] (OSPF) and [[link state routing]] terminology is assumed in this article.18 KB (3,085 words) - 15:00, 20 March 2024
- ...onal routing table for multicast routes. Several routing protocols such as Open Shortest Path First | OSPF and Border Gateway Protocol | BGP maintain internal data bases of ca9 KB (1,432 words) - 15:01, 20 March 2024
- ...r, instead, a limitation on certain protocol activity. For example, in the Open Shortest Path First (OSPF) protocol, certain information used in building the routing "map" may ...s, or the public Internet. In a 1998 book, John Moy, the main architect of Open Shortest Path First (OSPF), summarized some thinking abut locality:10 KB (1,563 words) - 07:32, 18 March 2024
- '''Open Shortest Path First''' (OSPF) is a protocol for automatically distributing routing information {{seealso|Open Shortest Path First for IPv6}}23 KB (3,713 words) - 12:20, 30 March 2024
- ...NNI) protocol, an ATM routing protocol with considerable similarity to the Open Shortest Path First (OSPF) used for IP routing.12 KB (1,828 words) - 16:22, 30 March 2024
- | Open Shortest Path First16 KB (2,394 words) - 07:30, 18 March 2024
- *[[Open Shortest Path First]] (OSPF), called [[Open Shortest Path First for IPv6]] or OSPF Version 3 <ref name=RFC5340>{{citation39 KB (5,823 words) - 12:18, 30 March 2024
- ...rotocol such as the Border Gateway Protocol (BGP)<ref name=rfc4364 /> or [[Open Shortest Path First]] (OSPF) <ref name=rfc4577>{{citation15 KB (2,421 words) - 05:49, 8 April 2024