456:
advertised as destination addresses and path descriptions to reach those destinations. The path, expressed in terms of the domains (or confederations) traversed so far, is carried in a special path attribute that records the sequence of routing domains through which the reachability information has passed. A route is defined as a pairing between a destination and the attributes of the path to that destination, thus the name, path-vector routing; The routers receive a vector that contains paths to a set of destinations.
361:.) Each node, on a regular basis, sends to each neighbor node its own current assessment of the total cost to get to all the destinations it knows of. The neighboring nodes examine this information and compare it to what they already know; anything that represents an improvement on what they already have, they insert in their own table. Over time, all the nodes in the network discover the best next hop and total cost for all destinations.
594:
increase throughput. A popular path selection objective is to reduce the average completion times of traffic flows and the total network bandwidth consumption. Recently, a path selection metric was proposed that computes the total number of bytes scheduled on the edges per path as selection metric. An empirical analysis of several path selection metrics, including this new proposal, has been made available.
712:
primarily to BGP's lack of a mechanism to directly optimize for latency, rather than to selfish routing policies. It was also suggested that, were an appropriate mechanism in place, ISPs would be willing to cooperate to reduce latency rather than use hot-potato routing. Such a mechanism was later published by the same authors, first for the case of two ISPs and then for the global case.
188:
174:
744:, routing techniques can be used that aim to optimize global and network-wide performance metrics. This has been used by large internet companies that operate many data centers in different geographical locations attached using private optical links, examples of which include Microsoft's Global WAN, Facebook's Express Backbone, and Google's B4.
202:
160:
455:
The path-vector routing algorithm is similar to the distance vector algorithm in the sense that each border router advertises the destinations it can reach to its neighboring router. However, instead of advertising networks in terms of a destination and the distance to that destination, networks are
131:
are structured and that similar addresses imply proximity within the network. Structured addresses allow a single routing table entry to represent the route to a group of devices. In large networks, structured addressing (routing, in the narrow sense) outperforms unstructured addressing (bridging).
593:
Depending on the application for which path selection is performed, different metrics can be used. For example, for web requests one can use minimum latency paths to minimize web page load time, or for bulk data transfers one can choose the least utilized path to balance load across the network and
585:
A few routing algorithms do not use a deterministic algorithm to find the best link for a packet to get from its original source to its final destination. Instead, to avoid congestion hot spots in packet systems, a few algorithms use a randomized algorithm—Valiant's paradigm—that routes a path to a
975:
To eliminate network hot spots, ... a two phase routing algorithm. This involves every packet being first sent to a randomly chosen intermediate destination; from the intermediate destination it is forwarded to its final destination. This algorithm, referred to as
Universal Routing, is designed to
747:
Global performance metrics to optimize include maximizing network utilization, minimizing traffic flow completion times, maximizing the traffic delivered prior to specific deadlines and reducing the completion times of flows. Work on the later over private WAN discusses modeling routing as a graph
640:
protocol that produces a sequence of ASs through which packets flow. Each AS may have multiple paths, offered by neighboring ASs, from which to choose. These routing decisions often correlate with business relationships with these neighboring ASs, which may be unrelated to path quality or latency.
451:
The speaker node creates a routing table and advertises it to neighboring speaker nodes in neighboring autonomous systems. The idea is the same as distance vector routing except that only speaker nodes in each autonomous system can communicate with each other. The speaker node advertises the path,
383:
of the network is the fundamental data used for each node. To produce its map, each node floods the entire network with information about the other nodes it can connect to. Each node then independently assembles this information into a map. Using this map, each router independently determines the
548:
In some small systems, a single central device decides ahead of time the complete path of every packet. In some other small systems, whichever edge device injects a packet into the network decides ahead of time the complete path of that particular packet. In either case, the route-planning device
364:
When a network node goes down, any nodes that used it as their next hop discard the entry and convey the updated routing information to all adjacent nodes, which in turn repeat the process. Eventually, all the nodes in the network receive the updates and discover new paths to all the destinations
641:
Second, once an AS-level path has been selected, there are often multiple corresponding router-level paths to choose from. This is due, in part, because two ISPs may be connected through multiple connections. In choosing the single router-level path, it is common practice for each ISP to employ
602:
In some networks, routing is complicated by the fact that no single entity is responsible for selecting paths; instead, multiple entities are involved in selecting paths or even parts of a single path. Complications or inefficiency can result if these entities choose paths to optimize their own
415:
is the optimized Link State
Routing Protocol (OLSR). OLSR is proactive; it uses Hello and Topology Control (TC) messages to discover and disseminate link-state information through the mobile ad hoc network. Using Hello messages, each node discovers 2-hop neighbor information and elects a set of
711:
A 2003 measurement study of
Internet routes found that, between pairs of neighboring ISPs, more than 30% of paths have inflated latency due to hot-potato routing, with 5% of paths being delayed by at least 12 ms. Inflation due to AS-level path selection, while substantial, was attributed
569:
In large systems, there are so many connections between devices, and those connections change so frequently, that it is infeasible for any one device to even know how all the devices are connected to each other, much less calculate a complete path through them. Such systems generally use
273:
association where datagrams are routed to any single member of a group of potential receivers that are all identified by the same destination address. The routing algorithm selects the single receiver from the group based on which is the nearest according to some distance or cost
396:
rooted at the current node, such that the path through the tree from the root to any other node is the least-cost path to that node. This tree then serves to construct the routing table, which specifies the best next hop to get from the current node to any other node.
446:
Path-vector routing is used for inter-domain routing. It is similar to distance vector routing. Path-vector routing assumes that one node (there can be many) in each autonomous system acts on behalf of the entire autonomous system. This node is called the
442:
routing. Distance vector routing is subject to instability if there are more than a few hops in the domain. Link state routing needs significant resources to calculate routing tables. It also creates heavy traffic due to flooding.
702:
Additionally, a similar routing challenge can be observed in cellular networks, where different packets are destined for various endpoints, and each link exhibits varying spectral efficiency. In this context, the selection of the
561:
by setting up a path once for the first packet between some source and some destination; later packets between that same source and that same destination continue to follow the same path without recalculating until the circuit
707:
path involves considering latency and packet error rate. To address this, multiple independent entities, one for each base station, play a crucial role in path selection while striving to optimize overall network performance.
556:
In high-speed systems, there are so many packets transmitted every second that it is infeasible for a single device to calculate the complete path for each and every packet. Early high-speed systems dealt with this with
262:
association; datagrams are routed simultaneously in a single transmission to many recipients. Multicast differs from broadcast in that the destination address designates a subset, not necessarily all, of the accessible
544:
A local administrator can set up host-specific routes that provide more control over network usage, permits testing, and better overall security. This is useful for debugging network connections or routing tables.
525:: When comparing route table entries from different sources such as different routing protocols and static configuration, a lower administrative distance indicates a more reliable source and thus a preferred route.
581:
algorithm. When a device chooses a path to a particular final destination, that device always chooses the same path to that destination until it receives information that makes it think some other path is better.
112:. Routing tables maintain a record of the routes to various network destinations. Routing tables may be specified by an administrator, learned by observing network traffic or built with the assistance of
724:
business tools, there has been increased interest in techniques and methods to monitor the routing posture of networks. Incorrect routing or routing issues cause undesirable performance degradation,
312:, allowing the network to act nearly autonomously in avoiding network failures and blockages. Dynamic routing dominates the Internet. Examples of dynamic-routing protocols and algorithms include
353:
When a node first starts, it only knows of its immediate neighbors and the direct cost involved in reaching them. (This information — the list of destinations, the total cost to each, and the
586:
randomly picked intermediate destination, and from there to its true final destination. In many early telephone switches, a randomizer was often used to select the start of a path through a
625:(AGVs) on a terminal, reservations are made for each vehicle to prevent simultaneous use of the same part of an infrastructure. This approach is also referred to as context-aware routing.
549:
needs to know a lot of information about what devices are connected to the network and how they are connected to each other. Once it has this information, it can use an algorithm such as
748:
optimization problem by pushing all the queuing to the end-points. The authors also propose a heuristic to solve the problem efficiently while sacrificing negligible performance.
699:
the work of sending it along an expensive trans-Atlantic link, but causes the message to experience latency 125 ms when the other route would have been 20 ms faster.
517:: When comparing routes learned via the same routing protocol, a lower metric is preferred. Metrics cannot be compared between routes learned from different routing protocols.
502:
In case of overlapping or equal routes, algorithms consider the following elements in priority order to decide which routes to install into the routing table:
244:. The network automatically replicates datagrams as needed to reach all the recipients within the scope of the broadcast, which is generally an entire network
645:: sending traffic along the path that minimizes the distance through the ISP's own network—even if that path lengthens the total distance to the destination.
1548:
1662:
1622:
321:
346:
number to each of the links between each node in the network. Nodes send information from point A to point B via the path that results in the lowest
1502:
938:
606:
A classic example involves traffic in a road system, in which each driver picks a path that minimizes their travel time. With such routing, the
1037:
1636:
1591:
1467:
1448:
1429:
1400:
1369:
1350:
773:
406:
1490:
636:(ISPs), each of which controls routes involving its network. Routing occurs at multiple levels. First, AS-level paths are selected via the
1203:
1484:
967:
1231:
Noormohammadpour, Mohammad; Raghavendra, Cauligi (16 July 2018). "Datacenter
Traffic Control: Understanding Techniques and Tradeoffs".
1678:
1618:
1414:
1383:
1189:
295:
51:
842:"Tabu search algorithm for routing, modulation and spectrum allocation in elastic optical network with anycast and unicast traffic"
438:, but not between autonomous systems. Both of these routing protocols become intractable in large networks and cannot be used in
333:
1217:
566:. Later high-speed systems inject packets into the network without any one device ever calculating a complete path for packets.
1657:
237:
1709:
541:
to each route, where smaller administrative distances indicate routes learned from a protocol assumed to be more reliable.
509:: A matching route table entry with a longer subnet mask is always preferred as it specifies the destination more exactly.
473:
1601:
1165:
An
Efficient Security Way of Authentication and Pair wise Key Distribution with Mobile Sinks in Wireless Sensor Networks
629:
435:
429:
380:
313:
90:
78:
468:
to multiple routes to select (or predict) the best route. Most routing algorithms use only one network path at a time.
278:
Unicast is the dominant form of message delivery on the
Internet. This article focuses on unicast routing algorithms.
741:
374:
222:
association between a sender and destination: each destination address uniquely identifies a single receiver endpoint.
1541:
1112:
1052:
In R.R. Negenborn and Z. Lukszo and H. Hellendoorn (Eds.) Intelligent
Infrastructures, Ch. 14, pp. 355–382. Springer.
339:
1534:
990:"Poster Abstract: Minimizing Flow Completion Times using Adaptive Routing over Inter-Datacenter Wide Area Networks"
1683:
1628:
633:
563:
492:
225:
173:
168:
1146:
1129:
671:
connected by a 5 ms link. Suppose both ISPs have trans-Atlantic links that connect their two networks, but
529:
Because a routing metric is specific to a given routing protocol, multi-protocol routers must use some external
294:
that can change rapidly, making the manual construction of routing tables unfeasible. Nevertheless, most of the
1652:
1596:
819:
798:
622:
317:
47:
31:
740:
In networks where a logically centralized control is available over the forwarding state, for example, using
308:
attempts to solve this problem by constructing routing tables automatically, based on information carried by
1581:
758:
538:
521:
389:
298:(PSTN) uses pre-computed routing tables, with fallback routes if the most direct route becomes blocked (see
105:
also forward packets and perform routing, although they have no specially optimized hardware for the task.
46:
or between or across multiple networks. Broadly, routing is performed in many types of networks, including
1168:
479:
In computer networking, the metric is computed by a routing algorithm, and can cover information such as
132:
Routing has become the dominant form of addressing on the
Internet. Bridging is still widely used within
480:
434:
Distance vector and link-state routing are both intra-domain routing protocols. They are used inside an
412:
124:
269:
delivers a message to any one out of a group of nodes, typically the one nearest to the source using a
1079:
841:
1509:
1299:
929:
928:
Michael
Mitzenmacher; Andréa W. Richa; Ramesh Sitaraman, "Randomized Protocols for Circuit Routing",
804:
778:
513:
495:, reliability, and communication cost. The routing table stores only the best possible routes, while
254:
delivers a message to a group of nodes that have expressed interest in receiving the message using a
94:
1044:
1173:
814:
611:
550:
299:
1013:"Minimizing Flow Completion Times using Adaptive Routing over Inter-Datacenter Wide Area Networks"
1494:
1315:
1289:
1258:
1240:
788:
768:
763:
642:
133:
86:
1091:
1463:
1444:
1425:
1410:
1396:
1379:
1365:
1346:
1087:
956:
861:
793:
558:
469:
241:
74:
1080:
Multi-agent reinforcement learning for network routing in integrated access backhaul networks
1704:
1571:
1557:
1307:
1250:
1095:
1062:
1016:
993:
887:
853:
809:
721:
607:
571:
309:
291:
113:
82:
55:
957:"The IEEE 1355 Standard: Developments, Performance and Application in High Energy Physics"
903:
Baumann, Rainer; Heimlicher, Simon; Strasser, Mario; Weibel, Andreas (February 10, 2007),
729:
578:
305:
290:, small networks may use manually configured routing tables. Larger networks have complex
240:) from one sender is routed to all of the possibly multiple endpoints associated with the
128:
1303:
1066:
725:
465:
385:
287:
98:
66:
65:
In packet switching networks, routing is the higher-level decision making that directs
43:
1698:
1277:
1012:
989:
783:
657:
484:
109:
1319:
1262:
1036:
Zutt, Jonne; van Gemund, Arjan J.C.; de Weerdt, Mathijs M.; Witteveen, Cees (2010).
1576:
452:
not the metric, of the nodes in its autonomous system or other autonomous systems.
439:
70:
1390:
997:
857:
1099:
1021:
891:
663:
587:
30:
This article is about routing in packet switching networks. For other uses, see
1311:
1254:
904:
1338:
1276:
Noormohammadpour, Mohammad; Srivastava, Ajitesh; Raghavendra, Cauligi (2018).
496:
393:
245:
120:
1407:
1376:
1069:". IEEE Network Magazine, special issue on Interdomain Routing, Nov/Dec 2005.
865:
1278:"On Minimizing the Completion Times of Long Flows over Inter-Datacenter WAN"
530:
488:
251:
187:
182:
603:
objectives, which may conflict with the objectives of other participants.
233:
102:
59:
840:
Goścień, Róża; Walkowiak, Krzysztof; Klinkowski, Mirosław (2015-03-14).
17:
1116:
420:(MPRs). MPRs distinguish OLSR from other link-state routing protocols.
266:
215:
201:
196:
159:
154:
1632:
668:
1526:
976:
maximize capacity and minimize delay under conditions of heavy load.
679:'s has latency 120 ms. When routing a message from a source in
1294:
1245:
931:
The Power of Two Random
Choices: A Survey of Techniques and Results
533:
to select between routes learned from different routing protocols.
1586:
1163:
Santhi, P.; Ahmed, Md Shakeel; Mehertaj, Sk; Manohar, T. Bharath.
610:
routes can be longer than optimal for all drivers. In particular,
534:
499:
or topological databases may store all other information as well.
384:
least-cost path from itself to every other node using a standard
350:(i.e. the sum of the costs of the links between the nodes used).
1150:
1133:
69:
from their source toward their destination through intermediate
1530:
728:
or downtime. Monitoring routing in a network is achieved using
108:
The routing process usually directs forwarding on the basis of
637:
1204:"Building Express Backbone: Facebook's new long-haul network"
1038:"Dealing with Uncertainty in Operational Transport Planning"
1190:"How Microsoft builds its fast and reliable global network"
357:
to send data to get there — makes up the routing table, or
27:
Process of selecting paths in a data communications network
119:
Routing, in a narrower sense of the term, often refers to
1460:
Network Routing: Algorithms, Protocols, and Architectures
476:
techniques enable the use of multiple alternative paths.
621:
In a single-agent model used, for example, for routing
228:
delivers a message to all nodes in the network using a
1128:
Ratul Mahajan, David Wetherall, and Thomas Anderson. "
1458:
Medhi, Deepankar & Ramasamy, Karthikeyan (2007).
1145:
Ratul Mahajan, David Wetherall, and Thomas Anderson.
988:
Noormohammadpour, M.; Raghavendra, C. S. (Apr 2018).
537:
routers, for example, attribute a value known as the
218:
delivers a message to a single specific node using a
211:
Routing schemes differ in how they deliver messages:
1011:
Noormohammadpour, M; Raghavendra, C. S. (Apr 2018).
42:
is the process of selecting a path for traffic in a
1671:
1645:
1610:
1564:
1130:Negotiation-Based Routing Between Neighboring ISPs
1111:Neil Spring, Ratul Mahajan, and Thomas Anderson. "
1147:Mutually Controlled Routing with Independent ISPs
1499:, ways of avoiding the count-to-infinity problem
1439:Kurose, James E. & Ross, Keith W. (2004).
691:may choose to immediately send the message to
81:to another. Intermediate nodes are typically
1542:
1343:Dynamic Routing in Telecommunication Networks
411:A link-state routing algorithm optimized for
8:
1389:Doyle, Jeff & Carroll, Jennifer (2001).
1360:Doyle, Jeff & Carroll, Jennifer (2005).
720:As the Internet and IP networks have become
77:is the transit of network packets from one
1549:
1535:
1527:
1218:"Inside Google's Software-Defined Network"
322:Enhanced Interior Gateway Routing Protocol
73:by specific packet forwarding mechanisms.
1293:
1244:
1233:IEEE Communications Surveys and Tutorials
1172:
1020:
1113:Quantifying the Causes of Path Inflation
660:, connected by a fast link with latency
832:
379:When applying link-state algorithms, a
683:'s London network to a destination in
401:Optimized Link State Routing algorithm
774:Edge disjoint shortest pair algorithm
407:Optimized Link State Routing Protocol
147:
7:
1078:Shahaf Yamin and Haim H. Permuter. "
1067:BGP routing policies in ISP networks
675:'s link has latency 100 ms and
1362:Routing TCP/IP, Volume I, Second Ed
973:from the original on May 16, 2019,
464:Path selection involves applying a
365:that do not involve the down node.
338:Distance vector algorithms use the
1422:Routing in the Internet, Second Ed
1188:Khalidi, Yousef (March 15, 2017).
25:
944:from the original on Dec 13, 2023
628:The Internet is partitioned into
614:shows that adding a new road can
577:Most systems use a deterministic
296:public switched telephone network
52:public switched telephone network
648:For example, consider two ISPs,
334:Distance-vector routing protocol
200:
186:
172:
158:
618:travel times for all drivers.
1:
1441:Computer Networking, Third Ed
474:equal-cost multi-path routing
1086:, Volume 153, 2024, 103347,
998:10.1109/INFCOMW.2018.8406853
858:10.1016/j.comnet.2014.12.004
667:—and each has a presence in
430:Path-vector routing protocol
314:Routing Information Protocol
1505:about Routing and Switching
1420:Huitema, Christian (2000).
1282:IEEE Communications Letters
1100:10.1016/j.adhoc.2023.103347
1022:10.13140/RG.2.2.36009.90720
906:A Survey on Routing Metrics
742:software-defined networking
588:multistage switching fabric
375:Link-state routing protocol
1726:
1312:10.1109/LCOMM.2018.2872980
1255:10.1109/COMST.2017.2782753
634:internet service providers
427:
404:
372:
342:. This approach assigns a
331:
328:Distance vector algorithms
127:. IP routing assumes that
29:
1485:Count-To-Infinity Problem
1392:Routing TCP/IP, Volume II
1025:– via ResearchGate.
1000:– via ResearchGate.
656:. Each has a presence in
623:automated guided vehicles
493:maximum transmission unit
48:circuit-switched networks
1510:"IP Routing and Subnets"
820:Turn restriction routing
799:Path computation element
318:Open Shortest Path First
32:Routing (disambiguation)
759:Black hole (networking)
553:to find the best path.
539:administrative distance
522:Administrative distance
123:and is contrasted with
732:tools and techniques.
695:in London. This saves
413:mobile ad hoc networks
340:Bellman–Ford algorithm
232:association; a single
1710:Internet architecture
1503:Cisco IT Case Studies
1443:. Benjamin/Cummings.
687:'s New York network,
369:Link-state algorithms
282:Topology distribution
1491:"Stability Features"
955:Stefan Haas (1998),
805:Policy-based routing
779:Flood search routing
424:Path-vector protocol
390:Dijkstra's algorithm
260:many-to-many-of-many
1462:. Morgan Kaufmann.
1304:2018arXiv181000169N
1061:Matthew Caesar and
815:Small-world routing
736:Centralized routing
551:A* search algorithm
491:, path cost, load,
300:routing in the PSTN
256:one-to-many-of-many
134:local area networks
1514:www.eventhelix.com
789:Geographic routing
769:Deflection routing
764:Collective routing
643:hot-potato routing
630:autonomous systems
392:. The result is a
388:algorithm such as
271:one-to-one-of-many
101:. General-purpose
1692:
1691:
1558:Routing protocols
1469:978-0-12-088588-6
1450:978-0-321-22735-5
1431:978-0-321-22735-5
1424:. Prentice–Hall.
1402:978-1-57870-089-9
1371:978-1-58705-202-6
1352:978-0-07-006414-0
1288:(12): 2475–2478.
846:Computer Networks
794:Heuristic routing
559:circuit switching
472:and specifically
470:Multipath routing
436:autonomous system
418:multipoint relays
310:routing protocols
242:broadcast address
209:
208:
129:network addresses
114:routing protocols
79:network interface
75:Packet forwarding
56:computer networks
16:(Redirected from
1717:
1551:
1544:
1537:
1528:
1523:
1521:
1520:
1498:
1493:. Archived from
1473:
1454:
1435:
1406:
1375:
1356:
1324:
1323:
1297:
1273:
1267:
1266:
1248:
1239:(2): 1492–1525.
1228:
1222:
1221:
1214:
1208:
1207:
1200:
1194:
1193:
1185:
1179:
1178:
1176:
1160:
1154:
1143:
1137:
1126:
1120:
1109:
1103:
1076:
1070:
1063:Jennifer Rexford
1059:
1053:
1051:
1050:on Sep 22, 2017.
1049:
1043:. Archived from
1042:
1033:
1027:
1026:
1024:
1008:
1002:
1001:
985:
979:
978:
972:
961:
952:
946:
945:
943:
936:
925:
919:
918:
917:
916:
911:
900:
894:
885:
879:
876:
870:
869:
837:
810:Wormhole routing
722:mission critical
666:
612:Braess's paradox
204:
190:
176:
162:
144:
143:
140:Delivery schemes
85:devices such as
83:network hardware
21:
1725:
1724:
1720:
1719:
1718:
1716:
1715:
1714:
1695:
1694:
1693:
1688:
1667:
1646:Special-purpose
1641:
1606:
1560:
1555:
1518:
1516:
1508:
1489:
1481:
1476:
1470:
1457:
1451:
1438:
1432:
1419:
1403:
1395:. Cisco Press.
1388:
1372:
1364:. Cisco Press.
1359:
1353:
1345:. McGraw–Hill.
1337:
1333:
1331:Further reading
1328:
1327:
1275:
1274:
1270:
1230:
1229:
1225:
1220:. May 14, 2017.
1216:
1215:
1211:
1202:
1201:
1197:
1187:
1186:
1182:
1162:
1161:
1157:
1144:
1140:
1127:
1123:
1110:
1106:
1084:Ad Hoc Networks
1077:
1073:
1060:
1056:
1047:
1040:
1035:
1034:
1030:
1010:
1009:
1005:
987:
986:
982:
970:
959:
954:
953:
949:
941:
934:
927:
926:
922:
914:
912:
909:
902:
901:
897:
886:
882:
877:
873:
839:
838:
834:
829:
824:
754:
738:
730:route analytics
718:
716:Route analytics
661:
600:
598:Multiple agents
579:dynamic routing
462:
432:
426:
409:
403:
377:
371:
336:
330:
306:Dynamic routing
284:
148:Routing schemes
142:
67:network packets
35:
28:
23:
22:
15:
12:
11:
5:
1723:
1721:
1713:
1712:
1707:
1697:
1696:
1690:
1689:
1687:
1686:
1681:
1675:
1673:
1669:
1668:
1666:
1665:
1660:
1655:
1649:
1647:
1643:
1642:
1640:
1639:
1625:
1614:
1612:
1608:
1607:
1605:
1604:
1599:
1594:
1589:
1584:
1579:
1574:
1568:
1566:
1562:
1561:
1556:
1554:
1553:
1546:
1539:
1531:
1525:
1524:
1506:
1500:
1497:on 2015-09-25.
1487:
1480:
1479:External links
1477:
1475:
1474:
1468:
1455:
1449:
1436:
1430:
1417:
1401:
1386:
1370:
1357:
1351:
1334:
1332:
1329:
1326:
1325:
1268:
1223:
1209:
1206:. May 1, 2017.
1195:
1180:
1174:10.1.1.392.151
1155:
1138:
1121:
1104:
1071:
1054:
1028:
1003:
980:
966:, p. 15,
947:
937:, p. 34,
920:
895:
880:
871:
831:
830:
828:
825:
823:
822:
817:
812:
807:
802:
796:
791:
786:
781:
776:
771:
766:
761:
755:
753:
750:
737:
734:
717:
714:
632:(ASs) such as
599:
596:
527:
526:
518:
510:
466:routing metric
461:
460:Path selection
458:
428:Main article:
425:
422:
405:Main article:
402:
399:
386:shortest paths
373:Main article:
370:
367:
359:distance table
332:Main article:
329:
326:
288:static routing
283:
280:
276:
275:
264:
249:
223:
207:
206:
193:
192:
179:
178:
165:
164:
151:
150:
141:
138:
110:routing tables
58:, such as the
50:, such as the
26:
24:
14:
13:
10:
9:
6:
4:
3:
2:
1722:
1711:
1708:
1706:
1703:
1702:
1700:
1685:
1682:
1680:
1677:
1676:
1674:
1670:
1664:
1661:
1659:
1656:
1654:
1651:
1650:
1648:
1644:
1638:
1634:
1630:
1626:
1624:
1620:
1616:
1615:
1613:
1611:Vendor-driven
1609:
1603:
1600:
1598:
1595:
1593:
1590:
1588:
1585:
1583:
1580:
1578:
1575:
1573:
1570:
1569:
1567:
1563:
1559:
1552:
1547:
1545:
1540:
1538:
1533:
1532:
1529:
1515:
1511:
1507:
1504:
1501:
1496:
1492:
1488:
1486:
1483:
1482:
1478:
1471:
1465:
1461:
1456:
1452:
1446:
1442:
1437:
1433:
1427:
1423:
1418:
1416:
1415:1-57870-089-2
1412:
1409:
1404:
1398:
1394:
1393:
1387:
1385:
1384:1-58705-202-4
1381:
1378:
1373:
1367:
1363:
1358:
1354:
1348:
1344:
1340:
1336:
1335:
1330:
1321:
1317:
1313:
1309:
1305:
1301:
1296:
1291:
1287:
1283:
1279:
1272:
1269:
1264:
1260:
1256:
1252:
1247:
1242:
1238:
1234:
1227:
1224:
1219:
1213:
1210:
1205:
1199:
1196:
1191:
1184:
1181:
1175:
1170:
1166:
1159:
1156:
1152:
1148:
1142:
1139:
1135:
1131:
1125:
1122:
1118:
1114:
1108:
1105:
1101:
1097:
1093:
1089:
1085:
1081:
1075:
1072:
1068:
1064:
1058:
1055:
1046:
1039:
1032:
1029:
1023:
1018:
1014:
1007:
1004:
999:
995:
991:
984:
981:
977:
969:
965:
958:
951:
948:
940:
933:
932:
924:
921:
908:
907:
899:
896:
893:
889:
884:
881:
875:
872:
867:
863:
859:
855:
851:
847:
843:
836:
833:
826:
821:
818:
816:
813:
811:
808:
806:
803:
800:
797:
795:
792:
790:
787:
785:
784:Fuzzy routing
782:
780:
777:
775:
772:
770:
767:
765:
762:
760:
757:
756:
751:
749:
745:
743:
735:
733:
731:
727:
723:
715:
713:
709:
706:
700:
698:
694:
690:
686:
682:
678:
674:
670:
665:
659:
655:
651:
646:
644:
639:
635:
631:
626:
624:
619:
617:
613:
609:
604:
597:
595:
591:
589:
583:
580:
575:
573:
567:
565:
560:
554:
552:
546:
542:
540:
536:
532:
524:
523:
519:
516:
515:
511:
508:
507:Prefix length
505:
504:
503:
500:
498:
494:
490:
486:
485:network delay
482:
477:
475:
471:
467:
459:
457:
453:
450:
449:speaker node.
444:
441:
437:
431:
423:
421:
419:
414:
408:
400:
398:
395:
391:
387:
382:
381:graphical map
376:
368:
366:
362:
360:
356:
351:
349:
345:
341:
335:
327:
325:
323:
319:
315:
311:
307:
303:
301:
297:
293:
289:
281:
279:
272:
268:
265:
261:
257:
253:
250:
247:
243:
239:
235:
231:
227:
224:
221:
217:
214:
213:
212:
205:
203:
198:
195:
194:
191:
189:
184:
181:
180:
177:
175:
170:
167:
166:
163:
161:
156:
153:
152:
149:
146:
145:
139:
137:
135:
130:
126:
122:
117:
115:
111:
106:
104:
100:
96:
92:
88:
84:
80:
76:
72:
71:network nodes
68:
63:
61:
57:
53:
49:
45:
41:
37:
33:
19:
1577:B.A.T.M.A.N.
1517:. Retrieved
1513:
1495:the original
1459:
1440:
1421:
1391:
1361:
1342:
1285:
1281:
1271:
1236:
1232:
1226:
1212:
1198:
1183:
1164:
1158:
1141:
1124:
1107:
1083:
1074:
1057:
1045:the original
1031:
1006:
983:
974:
963:
950:
930:
923:
913:, retrieved
905:
898:
883:
874:
849:
845:
835:
746:
739:
719:
710:
704:
701:
696:
692:
688:
684:
680:
676:
672:
653:
649:
647:
627:
620:
615:
605:
601:
592:
584:
576:
568:
555:
547:
543:
528:
520:
512:
506:
501:
478:
463:
454:
448:
445:
440:inter-domain
433:
417:
410:
378:
363:
358:
354:
352:
347:
343:
337:
304:
285:
277:
270:
259:
255:
229:
219:
210:
199:
185:
171:
157:
118:
107:
64:
54:(PSTN), and
39:
38:
36:
1339:Ash, Gerald
852:: 148–165.
608:equilibrium
320:(OSPF) and
1699:Categories
1519:2018-04-28
1408:Ciscopress
1377:Ciscopress
1295:1810.00169
1246:1712.03530
915:2020-05-04
827:References
497:link-state
394:tree graph
348:total cost
292:topologies
230:one-to-all
220:one-to-one
121:IP routing
1627:(Nortel)
1169:CiteSeerX
1132:". Proc.
1115:". Proc.
1092:1570-8705
866:1389-1286
574:routing.
531:heuristic
489:hop count
481:bandwidth
324:(EIGRP).
252:Multicast
226:Broadcast
183:Multicast
169:Broadcast
103:computers
95:firewalls
1617:(Cisco)
1341:(1997).
1320:52898719
1263:28143006
1149:. Proc.
968:archived
939:archived
878:RFC 3626
752:See also
726:flapping
658:New York
616:lengthen
572:next-hop
564:teardown
355:next hop
274:measure.
234:datagram
125:bridging
99:switches
91:gateways
60:Internet
18:Routable
1705:Routing
1672:Defunct
1565:General
1300:Bibcode
1117:SIGCOMM
964:INSPIRE
705:optimal
662:5
316:(RIP),
267:Anycast
216:Unicast
197:Anycast
155:Unicast
87:routers
44:network
40:Routing
1633:R-SMLT
1466:
1447:
1428:
1413:
1399:
1382:
1368:
1349:
1318:
1261:
1171:
1090:
890:
864:
669:London
514:Metric
263:nodes.
246:subnet
238:packet
1663:DVMRP
1637:DSMLT
1623:EIGRP
1587:IS-IS
1572:Babel
1316:S2CID
1290:arXiv
1259:S2CID
1241:arXiv
1153:2007.
1136:2005.
1119:2003.
1048:(PDF)
1041:(PDF)
971:(PDF)
960:(PDF)
942:(PDF)
935:(PDF)
910:(PDF)
801:(PCE)
535:Cisco
286:With
97:, or
1679:BGMP
1658:CSPF
1629:SMLT
1619:IGRP
1597:OSPF
1592:OLSR
1464:ISBN
1445:ISBN
1426:ISBN
1411:ISBN
1397:ISBN
1380:ISBN
1366:ISBN
1347:ISBN
1151:NSDI
1134:NSDI
1088:ISSN
892:1322
862:ISSN
652:and
344:cost
236:(or
1684:EGP
1653:CTP
1602:RIP
1582:BGP
1308:doi
1251:doi
1096:doi
1082:".
1065:. "
1017:doi
994:doi
888:RFC
854:doi
638:BGP
302:).
258:or
1701::
1635:/
1631:/
1621:/
1512:.
1314:.
1306:.
1298:.
1286:22
1284:.
1280:.
1257:.
1249:.
1237:20
1235:.
1167:.
1094:,
1015:.
992:.
962:,
860:.
850:79
848:.
844:.
664:ms
590:.
487:,
483:,
136:.
116:.
93:,
89:,
62:.
1550:e
1543:t
1536:v
1522:.
1472:.
1453:.
1434:.
1405:.
1374:.
1355:.
1322:.
1310::
1302::
1292::
1265:.
1253::
1243::
1192:.
1177:.
1102:.
1098::
1019::
996::
868:.
856::
697:A
693:B
689:A
685:B
681:A
677:B
673:A
654:B
650:A
248:.
34:.
20:)
Text is available under the Creative Commons Attribution-ShareAlike License. Additional terms may apply.
