468:. The core of the count-to-infinity problem is that if A tells B that it has a path somewhere, there is no way for B to know if the path has B as a part of it. To see the problem, imagine a subnet connected like AāBāCāDāEāF, and let the metric between the routers be "number of jumps". Now suppose that A is taken offline. In the vector-update-process B notices that the route to A, which was distance 1, is down ā B does not receive the vector update from A. The problem is, B also gets an update from C, and C is still not aware of the fact that A is down ā so it tells B that A is only two jumps from C (C to B to A). Since B doesn't know that the path from C to A is through itself (B), it updates its table with the new value "B to A = 2 + 1". Later on, B forwards the update to C and due to the fact that A is reachable through B (From C's point of view), C decides to update its table to "C to A = 3 + 1". This slowly propagates through the network until it becomes infinity (in which case the algorithm corrects itself, due to the relaxation property of Bellman-Ford).
66:
273:. It advertises its distance value (DV) calculated to other routers and receives similar advertisements from other routers unless changes are done in the local network or by neighbours (routers). Using these routing advertisements each router populates its routing table. In the next advertisement cycle, a router advertises updated information from its routing table. This process continues until the routing tables of each router
25:
366:
the changes and then inform its neighbours of the changes. This process has been described as ārouting by rumourā because routers are relying on the information they receive from other routers and cannot determine if the information is actually valid and true. There are a number of features which can be used to help with instability and inaccurate routing information.
524:
128:
1187:
For instance: A receives a DV from B that tells A there is a path via B to D, with a distance (or cost) of 7. Since the current "shortest-path" to B is 3, then A knows it has a path to D that costs 7+3=10. This path to D of length 10 (via B) is shorter than the existing "shortest-path" to D of length
1525:
This time, only routers A and D have new shortest-paths for their DVs. So they broadcast their new DVs to their neighbors: A broadcasts to B and C, and D broadcasts to C. This causes each of the neighbors receiving the new DVs to re-calculate their shortest paths. However, since the information from
849:
At this point, all the routers (A, B, C, D) have new "shortest-paths" for their DV (the list of distances that are from them to another router via a neighbor). They each broadcast this new DV to all their neighbors: A to B and C, B to C and A, C to A, B, and D, and D to C. As each of these neighbors
529:
We mark the current time (or iteration) in the algorithm with T, and begin (at time 0, or T=0) by creating distance matrices for each router to its immediate neighbours. As we build the routing tables below, the shortest path is highlighted in green, and a new shortest path is highlighted in yellow.
852:
For example: A receives a DV from C that tells A there is a path via C to D, with a distance (or cost) of 5. Since the current "shortest-path" to C is 23, then A knows it has a path to D that costs 23+5=28. As there are no other shorter paths that A knows about, it puts this as its current estimate
365:
Updates are performed periodically in a distance-vector protocol where all or part of a router's routing table is sent to all its neighbours that are configured to use the same distance-vector routing protocol. Once a router has this information it is able to amend its own routing table to reflect
394:
a RIPv1 packet every 30 second into all connected networks. RIPv1 is not suitable for large networks as it limits the number of hops to 15. This hop limit was introduced to avoid routing loops, but also means that networks that are connected through more than 15 routers are unreachable.
530:
Grey columns indicate nodes that are not neighbors of the current node, and are therefore not considered as a valid direction in its table. Red indicates invalid entries in the table since they refer to distances from a node to itself, or via itself.
483:
with poison reverse technique to reduce the chance of forming loops and uses a maximum number of hops to counter the 'count to infinity' problem. These measures avoid the formation of routing loops in some, but not all, cases. The addition of a
418:(TCP) session. Routers with BGP implementation determine the shortest path across a network based on a range of factors other than hops. BGP can also be configured by administrators so that certain routes are preferred or avoided. BGP is used by
361:
which is the exit interface of the router and the IP address of the interface of the receiving router. Distance is a measure of the cost to reach a certain node. The least cost route between any two nodes is the route with minimum distance.
382:(RIPv1). RIPv1 was formally standardised in 1988. It establishes the shortest path across a network purely on the basis of the hops, that is numbers of routers that need to be passed to reach the destination network. RIP is an
350:, hop count for a destination network and possibly other traffic related information. Routers that implement distance-vector protocol rely purely on the information provided to them by other routers, and do not assess the
1184:
Again, all the routers have gained in the last iteration (at T=1) new "shortest-paths", so they all broadcast their DVs to their neighbors; This prompts each neighbor to re-calculate their shortest distances again.
211:
and other factors that influence traffic on a given route. To determine the best route across a network, routers using a distance-vector protocol exchange information with one another, usually
146:
488:(refusing route updates for a few minutes after a route retraction) avoids loop formation in virtually all cases, but causes a significant increase in convergence times.
38:
215:
plus hop counts for destination networks and possibly other traffic information. Distance-vector routing protocols also require that a router inform its neighbours of
2160:"Detection of Invalid Routing Announcements in the RIP Protocol", D. Pei, D. Massey, and L. Zhang, IEEE Global Communications Conference (Globecom), December, 2003
342:(hops) a packet has to pass to reach its destination network. Additionally some distance-vector protocols take into account other traffic information, such as
430:
314:
2173:
503:. These avoid loop formation in all cases, but suffer from increased complexity, and their deployment has been slowed down by the success of
437:
in the 1980s and was designed to offer better convergence and cause less network traffic between routers than the link-state routing protocol
44:
226:
to calculate the best route. Another way of calculating the best route across a network is based on link cost, and is implemented through
87:
1526:
the DVs doesn't yield any shorter paths than they already have in their routing tables, then there are no changes to the routing tables.
203:
determines the best route for data packets based on distance. Distance-vector routing protocols measure the distance by the number of
2050:
2017:
1984:
1905:
480:
308:
182:
164:
109:
52:
390:(LANs) on interior or border routers. Routers with RIPv1 implementation exchange their routing tables with neighbouring routers by
357:
Distance-vector protocols update the routing tables of routers and determine the route on which a packet will be sent by the
425:
Among the distance-vector protocols that have been described as a hybrid, because it uses routing methods associated with
415:
326:
Routers that use distance-vector protocol determine the distance between themselves and a destination. The best route for
476:
379:
299:
293:
287:
254:
2208:
504:
426:
227:
457:
266:
223:
80:
74:
2203:
419:
407:
391:
383:
91:
438:
346:. To establish the best route, routers regularly exchange information with neighbouring routers, usually their
2170:
403:
491:
More recently, a number of loop-free distance vector protocols have been developed ā notable examples are
207:
a packet has to pass; one router counts as one hop. Some distance-vector protocols also take into account
274:
2128:
2083:
1938:
242:
2042:
2009:
1976:
1897:
387:
250:
339:
204:
2046:
2013:
1980:
1901:
399:
327:
245:) of distances to other nodes in the network. The distance vector algorithm was the original
2190:
in
Chapter "5 THE NETWORK LAYER" from "Computer Networks" 4th. Edition by Andrew S. Tanenbaum
2156:, J.J. Garcia-Luna-Aceves and S. Murthy, IEEE/ACM Transactions on Networking, February 1997
1862:
None of the routers have any new shortest-paths to broadcast. Therefore, none of the routers
2118:
2073:
2034:
2001:
1968:
1928:
1889:
500:
445:
375:
351:
270:
216:
1866:
any new information that might change their routing tables. The algorithm comes to a stop.
2177:
343:
208:
2035:
2002:
1969:
1890:
212:
2197:
2181:
347:
200:
461:
335:
2148:
2144:
2140:
2131:
2112:
2099:
2095:
2086:
2067:
1954:
1950:
1941:
1922:
269:. In these protocols, each router does not possess information about the full
850:
receives this information, they now recalculate the shortest path using it.
2187:
411:
523:
246:
2123:
2078:
1933:
280:
Some of these protocols have the disadvantage of slow convergence.
492:
434:
508:
496:
410:
and therefore implemented on border and exterior routers on the
331:
303:
378:, and the oldest distance-vector protocol, is version 1 of the
121:
59:
18:
444:
Another example of a distance-vector routing protocol is
1188:
28 (via C), so it becomes the new "shortest-path" to D.
302:(RIPng), an extension of RIP version 2 with support for
142:
414:. It exchanges information between routers through a
249:
routing algorithm and was implemented more widely in
853:for the shortest-path from itself (A) to D, via C.
137:
may be too technical for most readers to understand
519:In this network we have 4 routers A, B, C and D:
398:The distance-vector protocol designed for use in
237:refers to the fact that the protocol manipulates
2154:"A Path-Finding Algorithm for Loop-Free Routing
283:Examples of distance-vector routing protocols:
8:
300:Routing Information Protocol Next Generation
2171:Section "Link-State Versus Distance Vector"
53:Learn how and when to remove these messages
431:Enhanced Interior Gateway Routing Protocol
315:Enhanced Interior Gateway Routing Protocol
265:Distance-vector routing protocols use the
222:Distance-vector routing protocols use the
2122:
2077:
1932:
183:Learn how and when to remove this message
165:Learn how and when to remove this message
149:, without removing the technical details.
110:Learn how and when to remove this message
1782:
1698:
1617:
1536:
1445:
1361:
1280:
1199:
1104:
1024:
944:
864:
771:
693:
616:
539:
422:(ISPs) and telecommunication companies.
73:This article includes a list of general
2180:in the Chapter "Routing Basics" in the
1880:
338:is measured in terms of the numbers of
370:Development of distance-vector routing
294:Routing Information Protocol Version 2
2184:"Internetworking Technology Handbook"
147:make it understandable to non-experts
7:
464:from happening and suffers from the
79:it lacks sufficient corresponding
14:
309:Interior Gateway Routing Protocol
34:This article has multiple issues.
2188:Section 5.2 "Routing Algorithms"
2094:sec. 2.2.2. Updated by RFC
522:
197:distance-vector routing protocol
126:
64:
23:
1853:
1851:
1849:
1847:
1840:
1837:
1835:
1833:
1826:
1823:
1821:
1819:
1812:
1809:
1807:
1805:
1785:
1774:
1772:
1759:
1757:
1755:
1753:
1743:
1740:
1727:
1724:
1701:
1691:
1688:
1686:
1676:
1673:
1671:
1661:
1659:
1657:
1655:
1648:
1643:
1640:
1620:
1610:
1604:
1602:
1595:
1589:
1587:
1580:
1574:
1572:
1565:
1563:
1561:
1559:
1539:
1516:
1514:
1512:
1510:
1503:
1500:
1498:
1496:
1489:
1486:
1484:
1482:
1475:
1472:
1470:
1468:
1448:
1437:
1435:
1422:
1420:
1418:
1416:
1406:
1403:
1390:
1387:
1364:
1354:
1351:
1349:
1339:
1336:
1334:
1324:
1322:
1320:
1318:
1311:
1306:
1303:
1283:
1273:
1267:
1265:
1258:
1252:
1250:
1243:
1237:
1235:
1228:
1226:
1224:
1222:
1202:
1175:
1173:
1171:
1169:
1162:
1159:
1157:
1155:
1148:
1145:
1143:
1141:
1134:
1131:
1129:
1127:
1107:
1096:
1094:
1083:
1081:
1079:
1077:
1068:
1065:
1053:
1050:
1027:
1017:
1014:
1012:
1003:
1000:
998:
988:
986:
984:
982:
975:
970:
967:
947:
937:
934:
930:
923:
917:
915:
908:
902:
900:
893:
891:
889:
887:
867:
840:
838:
836:
834:
827:
824:
822:
820:
813:
809:
807:
800:
796:
794:
774:
763:
761:
750:
748:
746:
744:
735:
732:
721:
716:
696:
686:
682:
673:
670:
668:
659:
657:
655:
653:
646:
642:
639:
619:
609:
603:
596:
593:
589:
582:
577:
575:
568:
566:
564:
562:
542:
42:or discuss these issues on the
1:
2041:. Cengage Learning. pp.
2008:. Cengage Learning. pp.
1975:. Cengage Learning. pp.
1896:. Cengage Learning. pp.
433:(EIGRP). It was developed by
416:Transmission Control Protocol
2069:Routing Information Protocol
1924:Routing Information Protocol
505:link state routing protocols
427:link-state routing protocols
380:Routing Information Protocol
288:Routing Information Protocol
255:Routing Information Protocol
228:link-state routing protocols
2111:G. Malkin (November 1998).
2225:
2102:.
2037:Network+ Guide to Networks
2004:Network+ Guide to Networks
1971:Network+ Guide to Networks
1957:.
1892:Network+ Guide to Networks
420:internet service providers
16:Class of routing protocols
2117:. Network Working Group.
2072:. Network Working Group.
1927:. Network Working Group.
1861:
1524:
1183:
848:
472:Workarounds and solutions
466:count to infinity problem
452:Count to infinity problem
408:exterior gateway protocol
384:interior gateway protocol
2066:C. Hedrick (June 1988).
1921:C. Hedrick (June 1988).
439:Open Shortest Path First
404:Border Gateway Protocol
386:, so it can be used in
94:more precise citations.
2147:. Updated by RFC
458:BellmanāFord algorithm
267:BellmanāFord algorithm
224:BellmanāFord algorithm
219:changes periodically.
429:, is the proprietary
2033:Tamara Dean (2009).
2000:Tamara Dean (2009).
1967:Tamara Dean (2009).
1949:Updated by RFC
1888:Tamara Dean (2009).
2139:Obsoletes RFC
388:local area networks
251:local area networks
2209:Routing algorithms
2176:2010-12-14 at the
2137:Internet Standard.
400:wide area networks
277:to stable values.
2204:Routing protocols
1872:
1871:
1857:
1856:
1779:
1778:
1695:
1694:
1614:
1613:
1520:
1519:
1442:
1441:
1358:
1357:
1277:
1276:
1179:
1178:
1101:
1100:
1021:
1020:
941:
940:
844:
843:
768:
767:
690:
689:
613:
612:
460:does not prevent
406:(BGP). BGP is an
328:Internet Protocol
193:
192:
185:
175:
174:
167:
120:
119:
112:
57:
2216:
2135:
2126:
2124:10.17487/RFC2453
2103:
2090:
2081:
2079:10.17487/RFC1058
2063:
2057:
2056:
2040:
2030:
2024:
2023:
2007:
1997:
1991:
1990:
1974:
1964:
1958:
1945:
1936:
1934:10.17487/RFC1058
1918:
1912:
1911:
1895:
1885:
1783:
1699:
1618:
1537:
1446:
1362:
1281:
1200:
1105:
1025:
945:
865:
772:
694:
617:
540:
533:
532:
526:
376:routing protocol
352:network topology
271:network topology
217:network topology
188:
181:
170:
163:
159:
156:
150:
130:
129:
122:
115:
108:
104:
101:
95:
90:this article by
81:inline citations
68:
67:
60:
49:
27:
26:
19:
2224:
2223:
2219:
2218:
2217:
2215:
2214:
2213:
2194:
2193:
2178:Wayback Machine
2167:
2165:Further reading
2110:
2107:
2106:
2065:
2064:
2060:
2053:
2032:
2031:
2027:
2020:
1999:
1998:
1994:
1987:
1966:
1965:
1961:
1920:
1919:
1915:
1908:
1887:
1886:
1882:
1877:
517:
474:
454:
372:
344:network latency
324:
263:
235:distance vector
209:network latency
189:
178:
177:
176:
171:
160:
154:
151:
143:help improve it
140:
131:
127:
116:
105:
99:
96:
86:Please help to
85:
69:
65:
28:
24:
17:
12:
11:
5:
2222:
2220:
2212:
2211:
2206:
2196:
2195:
2192:
2191:
2185:
2166:
2163:
2162:
2161:
2158:
2152:
2127:. STD 53.
2105:
2104:
2058:
2051:
2025:
2018:
1992:
1985:
1959:
1913:
1906:
1879:
1878:
1876:
1873:
1870:
1869:
1867:
1859:
1858:
1855:
1854:
1852:
1850:
1848:
1846:
1842:
1841:
1839:
1836:
1834:
1832:
1828:
1827:
1825:
1822:
1820:
1818:
1814:
1813:
1811:
1808:
1806:
1804:
1800:
1799:
1796:
1793:
1790:
1787:
1780:
1777:
1776:
1773:
1771:
1768:
1765:
1761:
1760:
1758:
1756:
1754:
1752:
1748:
1747:
1744:
1742:
1739:
1736:
1732:
1731:
1728:
1726:
1723:
1720:
1716:
1715:
1712:
1709:
1706:
1703:
1696:
1693:
1692:
1690:
1687:
1685:
1682:
1678:
1677:
1675:
1672:
1670:
1667:
1663:
1662:
1660:
1658:
1656:
1654:
1650:
1649:
1647:
1644:
1642:
1639:
1635:
1634:
1631:
1628:
1625:
1622:
1615:
1612:
1611:
1609:
1606:
1603:
1601:
1597:
1596:
1594:
1591:
1588:
1586:
1582:
1581:
1579:
1576:
1573:
1571:
1567:
1566:
1564:
1562:
1560:
1558:
1554:
1553:
1550:
1547:
1544:
1541:
1534:
1530:
1529:
1527:
1522:
1521:
1518:
1517:
1515:
1513:
1511:
1509:
1505:
1504:
1502:
1499:
1497:
1495:
1491:
1490:
1488:
1485:
1483:
1481:
1477:
1476:
1474:
1471:
1469:
1467:
1463:
1462:
1459:
1456:
1453:
1450:
1443:
1440:
1439:
1436:
1434:
1431:
1428:
1424:
1423:
1421:
1419:
1417:
1415:
1411:
1410:
1407:
1405:
1402:
1399:
1395:
1394:
1391:
1389:
1386:
1383:
1379:
1378:
1375:
1372:
1369:
1366:
1359:
1356:
1355:
1353:
1350:
1348:
1345:
1341:
1340:
1338:
1335:
1333:
1330:
1326:
1325:
1323:
1321:
1319:
1317:
1313:
1312:
1310:
1307:
1305:
1302:
1298:
1297:
1294:
1291:
1288:
1285:
1278:
1275:
1274:
1272:
1269:
1266:
1264:
1260:
1259:
1257:
1254:
1251:
1249:
1245:
1244:
1242:
1239:
1236:
1234:
1230:
1229:
1227:
1225:
1223:
1221:
1217:
1216:
1213:
1210:
1207:
1204:
1197:
1193:
1192:
1190:
1181:
1180:
1177:
1176:
1174:
1172:
1170:
1168:
1164:
1163:
1161:
1158:
1156:
1154:
1150:
1149:
1147:
1144:
1142:
1140:
1136:
1135:
1133:
1130:
1128:
1126:
1122:
1121:
1118:
1115:
1112:
1109:
1102:
1099:
1098:
1095:
1093:
1091:
1089:
1085:
1084:
1082:
1080:
1078:
1076:
1072:
1071:
1069:
1067:
1064:
1061:
1057:
1056:
1054:
1052:
1049:
1046:
1042:
1041:
1038:
1035:
1032:
1029:
1022:
1019:
1018:
1016:
1013:
1011:
1009:
1005:
1004:
1002:
999:
997:
994:
990:
989:
987:
985:
983:
981:
977:
976:
974:
971:
969:
966:
962:
961:
958:
955:
952:
949:
942:
939:
938:
936:
933:
931:
929:
925:
924:
922:
919:
916:
914:
910:
909:
907:
904:
901:
899:
895:
894:
892:
890:
888:
886:
882:
881:
878:
875:
872:
869:
862:
858:
857:
855:
846:
845:
842:
841:
839:
837:
835:
833:
829:
828:
826:
823:
821:
819:
815:
814:
812:
810:
808:
806:
802:
801:
799:
797:
795:
793:
789:
788:
785:
782:
779:
776:
769:
766:
765:
762:
760:
758:
756:
752:
751:
749:
747:
745:
743:
739:
738:
736:
734:
731:
729:
725:
724:
722:
720:
718:
715:
711:
710:
707:
704:
701:
698:
691:
688:
687:
685:
683:
681:
679:
675:
674:
672:
669:
667:
665:
661:
660:
658:
656:
654:
652:
648:
647:
645:
643:
641:
638:
634:
633:
630:
627:
624:
621:
614:
611:
610:
608:
606:
604:
602:
598:
597:
595:
592:
590:
588:
584:
583:
581:
579:
576:
574:
570:
569:
567:
565:
563:
561:
557:
556:
553:
550:
547:
544:
537:
516:
513:
473:
470:
453:
450:
402:(WANs) is the
371:
368:
323:
320:
319:
318:
312:
306:
297:
291:
262:
259:
213:routing tables
191:
190:
173:
172:
134:
132:
125:
118:
117:
100:September 2010
72:
70:
63:
58:
32:
31:
29:
22:
15:
13:
10:
9:
6:
4:
3:
2:
2221:
2210:
2207:
2205:
2202:
2201:
2199:
2189:
2186:
2183:
2179:
2175:
2172:
2169:
2168:
2164:
2159:
2157:
2153:
2150:
2146:
2142:
2138:
2133:
2130:
2125:
2120:
2116:
2115:
2114:RIP Version 2
2109:
2108:
2101:
2097:
2093:
2088:
2085:
2080:
2075:
2071:
2070:
2062:
2059:
2054:
2052:9781423902454
2048:
2044:
2039:
2038:
2029:
2026:
2021:
2019:9781423902454
2015:
2011:
2006:
2005:
1996:
1993:
1988:
1986:9781423902454
1982:
1978:
1973:
1972:
1963:
1960:
1956:
1952:
1948:
1943:
1940:
1935:
1930:
1926:
1925:
1917:
1914:
1909:
1907:9781423902454
1903:
1899:
1894:
1893:
1884:
1881:
1874:
1868:
1865:
1860:
1844:
1843:
1830:
1829:
1816:
1815:
1802:
1801:
1797:
1794:
1791:
1788:
1784:
1781:
1769:
1766:
1763:
1762:
1750:
1749:
1745:
1737:
1734:
1733:
1729:
1721:
1718:
1717:
1713:
1710:
1707:
1704:
1700:
1697:
1683:
1680:
1679:
1668:
1665:
1664:
1652:
1651:
1645:
1637:
1636:
1632:
1629:
1626:
1623:
1619:
1616:
1607:
1599:
1598:
1592:
1584:
1583:
1577:
1569:
1568:
1556:
1555:
1551:
1548:
1545:
1542:
1538:
1535:
1532:
1531:
1528:
1523:
1507:
1506:
1493:
1492:
1479:
1478:
1465:
1464:
1460:
1457:
1454:
1451:
1447:
1444:
1432:
1429:
1426:
1425:
1413:
1412:
1408:
1400:
1397:
1396:
1392:
1384:
1381:
1380:
1376:
1373:
1370:
1367:
1363:
1360:
1346:
1343:
1342:
1331:
1328:
1327:
1315:
1314:
1308:
1300:
1299:
1295:
1292:
1289:
1286:
1282:
1279:
1270:
1262:
1261:
1255:
1247:
1246:
1240:
1232:
1231:
1219:
1218:
1214:
1211:
1208:
1205:
1201:
1198:
1195:
1194:
1191:
1189:
1182:
1166:
1165:
1152:
1151:
1138:
1137:
1124:
1123:
1119:
1116:
1113:
1110:
1106:
1103:
1092:
1090:
1087:
1086:
1074:
1073:
1070:
1062:
1059:
1058:
1055:
1047:
1044:
1043:
1039:
1036:
1033:
1030:
1026:
1023:
1010:
1007:
1006:
995:
992:
991:
979:
978:
972:
964:
963:
959:
956:
953:
950:
946:
943:
932:
927:
926:
920:
912:
911:
905:
897:
896:
884:
883:
879:
876:
873:
870:
866:
863:
860:
859:
856:
854:
847:
831:
830:
817:
816:
811:
804:
803:
798:
791:
790:
786:
783:
780:
777:
773:
770:
759:
757:
754:
753:
741:
740:
737:
730:
727:
726:
723:
719:
713:
712:
708:
705:
702:
699:
695:
692:
684:
680:
677:
676:
666:
663:
662:
650:
649:
644:
636:
635:
631:
628:
625:
622:
618:
615:
607:
605:
600:
599:
591:
586:
585:
580:
572:
571:
559:
558:
554:
551:
548:
545:
541:
538:
535:
534:
531:
527:
525:
520:
514:
512:
510:
506:
502:
498:
494:
489:
487:
482:
481:split horizon
478:
471:
469:
467:
463:
462:routing loops
459:
451:
449:
447:
442:
440:
436:
432:
428:
423:
421:
417:
413:
409:
405:
401:
396:
393:
389:
385:
381:
377:
369:
367:
363:
360:
355:
353:
349:
348:routing table
345:
341:
337:
333:
330:] that carry
329:
321:
316:
313:
310:
307:
305:
301:
298:
295:
292:
289:
286:
285:
284:
281:
278:
276:
272:
268:
260:
258:
256:
252:
248:
244:
240:
236:
231:
229:
225:
220:
218:
214:
210:
206:
202:
201:data networks
198:
187:
184:
169:
166:
158:
155:November 2013
148:
144:
138:
135:This article
133:
124:
123:
114:
111:
103:
93:
89:
83:
82:
76:
71:
62:
61:
56:
54:
47:
46:
41:
40:
35:
30:
21:
20:
2155:
2136:
2113:
2091:
2068:
2061:
2036:
2028:
2003:
1995:
1970:
1962:
1946:
1923:
1916:
1891:
1883:
1863:
1186:
851:
528:
521:
518:
490:
485:
475:
465:
455:
443:
424:
397:
392:broadcasting
373:
364:
358:
356:
336:data network
325:
282:
279:
264:
238:
234:
232:
221:
196:
194:
179:
161:
152:
136:
106:
97:
78:
50:
43:
37:
36:Please help
33:
374:The oldest
322:Methodology
92:introducing
2198:Categories
1875:References
75:references
39:improve it
2092:Historic.
1947:Historic.
486:hold time
479:uses the
334:across a
253:with the
233:The term
45:talk page
2174:Archived
507:such as
441:(OSPF).
412:Internet
359:next hop
275:converge
261:Overview
1864:receive
1786:from D
1702:from C
1621:from B
1540:from A
1449:from D
1365:from C
1284:from B
1203:from A
1108:from D
1028:from C
948:from B
868:from A
775:from D
697:from C
620:from B
543:from A
515:Example
340:routers
317:(EIGRP)
296:(RIPv2)
257:(RIP).
247:ARPANET
239:vectors
205:routers
141:Please
88:improve
2049:
2016:
2012:ā275.
1983:
1904:
1798:via D
1795:via C
1792:via B
1789:via A
1714:via D
1711:via C
1708:via B
1705:via A
1633:via D
1630:via C
1627:via B
1624:via A
1552:via D
1549:via C
1546:via B
1543:via A
1461:via D
1458:via C
1455:via B
1452:via A
1377:via D
1374:via C
1371:via B
1368:via A
1296:via D
1293:via C
1290:via B
1287:via A
1215:via D
1212:via C
1209:via B
1206:via A
1120:via D
1117:via C
1114:via B
1111:via A
1040:via D
1037:via C
1034:via B
1031:via A
960:via D
957:via C
954:via B
951:via A
880:via D
877:via C
874:via B
871:via A
787:via D
784:via C
781:via B
778:via A
709:via D
706:via C
703:via B
700:via A
632:via D
629:via C
626:via B
623:via A
555:via D
552:via C
549:via B
546:via A
311:(IGRP)
243:arrays
77:, but
2182:Cisco
1845:to D
1831:to C
1817:to B
1803:to A
1764:to D
1751:to C
1735:to B
1719:to A
1681:to D
1666:to C
1653:to B
1638:to A
1600:to D
1585:to C
1570:to B
1557:to A
1508:to D
1494:to C
1480:to B
1466:to A
1427:to D
1414:to C
1398:to B
1382:to A
1344:to D
1329:to C
1316:to B
1301:to A
1263:to D
1248:to C
1233:to B
1220:to A
1167:to D
1153:to C
1139:to B
1125:to A
1088:to D
1075:to C
1060:to B
1045:to A
1008:to D
993:to C
980:to B
965:to A
928:to D
913:to C
898:to B
885:to A
832:to D
818:to C
805:to B
792:to A
755:to D
742:to C
728:to B
714:to A
678:to D
664:to C
651:to B
637:to A
601:to D
587:to C
573:to B
560:to A
501:Babel
493:EIGRP
446:Babel
435:Cisco
290:(RIP)
2149:4822
2145:1388
2143:and
2141:1723
2132:2453
2100:1723
2098:and
2096:1388
2087:1058
2047:ISBN
2014:ISBN
1981:ISBN
1955:1723
1953:and
1951:1388
1942:1058
1902:ISBN
1533:T=3
1196:T=2
861:T=1
536:T=0
509:OSPF
499:and
497:DSDV
456:The
332:data
304:IPv6
2129:RFC
2119:doi
2084:RFC
2074:doi
2043:275
2010:274
1977:274
1939:RFC
1929:doi
1898:274
1810:10
1767:33
1746:12
1738:26
1730:15
1722:23
1684:13
1608:28
1605:10
1593:23
1578:25
1473:10
1430:51
1409:12
1401:26
1393:33
1385:23
1347:31
1271:28
1268:10
1256:23
1241:25
1132:28
1063:26
1048:23
996:26
973:25
935:28
921:23
906:25
717:23
594:23
477:RIP
199:in
145:to
2200::
2082:.
2045:.
1979:.
1937:.
1900:.
1838:5
1824:7
1775:5
1770:9
1741:2
1725:5
1689:7
1674:2
1669:8
1646:7
1641:3
1590:5
1575:3
1501:5
1487:7
1438:5
1433:9
1404:2
1388:5
1352:7
1337:2
1332:8
1309:7
1304:3
1253:5
1238:3
1160:5
1146:7
1097:5
1066:2
1051:5
1015:7
1001:2
968:3
918:5
903:3
825:5
764:5
733:2
671:2
640:3
578:3
511:.
495:,
448:.
354:.
230:.
195:A
48:.
2151:.
2134:.
2121::
2089:.
2076::
2055:.
2022:.
1989:.
1944:.
1931::
1910:.
241:(
186:)
180:(
168:)
162:(
157:)
153:(
139:.
113:)
107:(
102:)
98:(
84:.
55:)
51:(
Text is available under the Creative Commons Attribution-ShareAlike License. Additional terms may apply.