Search results

Jump to navigation Jump to search
  • 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 de
    2 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 informatio
    2 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 ol
    1 KB (234 words) - 15:00, 20 March 2024
  • *[[Open Shortest Path First]]<ref name=RFC4061>{{citation
    2 KB (310 words) - 15:00, 20 March 2024
  • *[[Open Shortest Path First]] (OSPF), an [[Internet Engineering Task Force]] (IETF) protocol, which sup
    4 KB (647 words) - 15:00, 20 March 2024
  • | Open Shortest Path First
    9 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 ann
    3 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 domai
    5 KB (820 words) - 05:17, 31 May 2009
  • [[Open Shortest Path First]], the IPv6 version, is probably the best dynamic interior routing protocol
    9 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 ca
    9 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
View ( | ) (20 | 50 | 100 | 250 | 500)