Search results

Jump to navigation Jump to search
  • ...[[routing]], as opposed to [[virtual circuit]] packet switching. Datagram routing allow new paths to be decided on a per-packet basis, although this rarely h ...s, the [[locality of networks|scope]] of addresses is global to the entire routing environment, while data units in a virtual circuit system (e.g., [[MPLS]] o
    1 KB (217 words) - 15:19, 28 September 2008
  • A major revision of the [[Open Shortest Path First]] interior routing protocol, principally to let it carry both [[Internet Protocol version 4]]
    292 bytes (38 words) - 21:48, 19 October 2008
  • ...around the limitations of [[routing]] technology of the time, a move to [[routing protocol]]s that could usefully distribute CIDR information, and, with diff ...omputers; there were no [[personal computer]]s, [[local area network]], or routing within organizations.
    4 KB (587 words) - 14:57, 20 March 2024
  • ...>A widely used [[Internet operations]] tool that can show the hop-by-hop [[routing]] to a destination, as opposed to the simple reachability of [[ping]]; it c
    261 bytes (38 words) - 18:57, 2 October 2010
  • {{rpl|Routing convergence}}
    282 bytes (34 words) - 10:36, 4 April 2024
  • ...02.3]], but replaces the [[Internet Protocol Suite|TCP/IP]] end-to-end and routing protocols with their InfiniBand equivalents.
    323 bytes (41 words) - 14:52, 28 July 2010
  • ==Datagram routing== In what was historically called the datagram paradigm, but now often simply routing, every packet may contain complete source and destination information such
    3 KB (406 words) - 16:21, 30 March 2024
  • {{seealso|Routing/Related Articles}} for other concepts in the design of routed networks ...s rid of it as quickly as possible. Hot potato is also called closest exit routing, and does minimize the workload required to route the information.
    5 KB (820 words) - 05:17, 31 May 2009
  • ...trics, but also the additional MPLS information that is used to refine the routing table computation. The [[Internet Engineering Task Force]] (IETF) intends t | title= Routing Extensions in Support of Generalized Multi-Protocol Label Switching (GMPLS)
    2 KB (351 words) - 18:23, 10 February 2011
  • ...take, or must not take. Control plane functions, such as participating in routing protocols, run in the control element.<ref name=rfc3746>{{citation ...lled a routing information base (RIB), or, more commonly and informally, a routing table. Minimally, the RIB contains a list of ordered pairs of <destination,
    9 KB (1,432 words) - 15:01, 20 March 2024
  • ...ions to the [[OSPF]] version 2 (i.e., for [[Internet Protocol version 4]]) routing protocol, intended to provide information for route computation that is opt
    332 bytes (42 words) - 10:59, 7 September 2008
  • {{r|Routing}}
    174 bytes (21 words) - 09:21, 24 June 2024
  • ...is the number of bits, starting on the left, to be considered in making [[routing]] decisions
    362 bytes (51 words) - 10:58, 8 August 2010
  • {{r|Routing protocol scalability}}
    155 bytes (16 words) - 14:59, 20 March 2024
  • ...ne of implementing and operating large, [[Internet Protocol]] (IP) based [[routing|routed]] networks such as the public [[Internet]] and secure IP networks (e
    456 bytes (60 words) - 16:03, 10 June 2010
  • {{r|Routing policy}}
    138 bytes (15 words) - 14:59, 20 March 2024
  • {{r|Routing}}
    350 bytes (40 words) - 10:37, 11 September 2009
  • {{r|Routing}}
    224 bytes (29 words) - 19:23, 10 January 2010
  • ...s to it, take the one with the lowest metric. Especially for BGP exterior routing, and in an increasing number of complex enterprise networks, the idea of po ...finitions. Technically, they cover more than simple ''reachabilility'' and routing metric, but also cover economics, security, availability, and operational m
    6 KB (946 words) - 16:24, 30 March 2024
  • {{r|Routing}}
    336 bytes (41 words) - 09:41, 22 June 2024
View ( | ) (20 | 50 | 100 | 250 | 500)