Jochen Behrens
Abstract
A new family of routing algorithms for the distributed maintenance of routing information in large networks and internets is introduced. This family is called link vector algorithms (LVA), and is based on the selective diffusion of link-state information based on the distributed computation of preferred paths, rather than on the flooding of complete link-state information based on the distributed computation of preferred paths, rather than on the flooding of complete link-state information to all routers. According to LVA, each router maintains a subset of the topology that corresponds to the links used by its neighbor routers in their preferred paths to known destinations. Based on that subset of topology information, the router derives its own preferred paths and communicates the corresponding link-state information to its neighbors. An update message contains a vector of updates; each such update specifies a link and its parameters. LVAs can be used for different types of routing. The correctness of LVA is verified for arbitrary types of routing when correct and deterministic algorithms are used to select preferred paths at each router. LVA is shown to have smaller complexity than link-state and distance-vector algorithms, and to have better average performance than the ideal topology-broadcast algorithm and the distributed Bellman-Ford algorithm.
- 1 R. Albrightson, J.J. Garcia-Luna-Aceves, and J. Boyle, "EiGRP-A Fast Routing Protocol Based on Distance Vectors'' Proc. Networtd/Interop 96, Las Vegas, Nevada, May 1994.]]Google Scholar
- 2 B. Awerbuch, I. Cidon, and S. Kutten, "Communication-Optimal Maintenance of Replicated Information," Proc. IEEE FOCS '90, pp. 492-502, August 1990.]]Google Scholar
- 3 D. Bertsekas and R. Gallager, Data Networks, Second Edition, Prentice-Hall, Inc., 1992.]] Google ScholarDigital Library
- 4 L. Bosack, "Method and Apparatus for Routing Communications among Computer Networks," U.S. Patent assigned to Cisco Systems, inc., Menlo Park, California, February 1992.]]Google Scholar
- 5 C. Cheng, R. Riley, S. Kumar, and J.J. Garcia-Luna- Aceves, "A Loop-Free Extended Bellman-Ford Routing Protocol without Bouncing Effect," A CM Computer Comm. Review, Vol. 19, No. 4, pp. 224-236, September 1989.]] Google ScholarDigital Library
- 6 J.N. Chiappa, "A New IP Routing and Addressing Architecture,'' Unpublished Draft, 1991.]]Google Scholar
- 7 D. Estrin and K. Obraczka, "Connectivity Database Overhead for Inter-Domain Policy Routing," Proc. of IEEE INFOCOM '91, Miami, Florida, pp. 265-278, April 1991.]]Google Scholar
- 8 D. Estrin, Y. Rekhter, and S. Hotz, "Scalable Inter-Domain Routing Architecture," Computer Comm. Review, Vol. 22, No. 4, 1992.]] Google ScholarDigital Library
- 9 D. Estrin, M. Steenstrup, and G. Tsudik, "A Protocol for Route Establishment and Packet Forwarding across Multidomain Internets," IEEE/A CM Trans. on Networking, Vol. 1, No. 1, February 1993, pp. 56-70.]] Google ScholarDigital Library
- 10 E. Gafni, "Generalized Scheme for Topology-Update in Dynamic Networks," Lecture Notes in Computer Science (G. Goos and J. Hartmanis, Eds.), No. 312, pp. 187-196, 1987.]] Google ScholarDigital Library
- 11 J.J. Garcia-Luna-Aceves, "A Fail-Safe Routing Algorithm for Multihop Packet-Radio Networks," Proc. o} IEEE iNFO- COM '86, Miami, Florida, April 1986.]]Google Scholar
- 12 --, "Routing Management in Very Large-Scale Networks," Future Generation Computing Systems (FGCS), North- Holland, Vol. 4, No. 2, pp. 81-93, 1988.]] Google ScholarDigital Library
- 13 --, "Loop-Free Routing Using Diffusing Computations," IEEE/A CM Trans. Networking, Vol. 1, No. 1, 1993.]] Google ScholarDigital Library
- 14 --, "Reliable Broadcast of Routing Information Using Diffusing Computations," Proc. IEEE Globecome 92, Orlando, Florida, December 1992.]]Google Scholar
- 15 J.J. Garcia-Luna-Aceves and J. Behrens, "Distributed, Scalable Routing Based on Vectors of Link States," Unpublished Report, Buskin Center for CE & C/S, University of California, Santa Cruz, CA, 1994.]]Google Scholar
- 16 J.J. Garcia-Luna-Aceves and W.T. Zaumen, "Area-Based, Loop-Free Internet Routing," Proc. IEEE INFOCOM 96, Toronto, Oe~nade~, June 1994.]]Google Scholar
- 17 J. Hagouel, "Issues in Routing for Large and Dynamic Networks," IBM Research Report RC 9942 (No. 44055) Communications, IBM Thomas J. Watson Research Center, Yorktown Heights, New York, April 1983.]]Google Scholar
- 18 C. Hedrick, "Routing Information Protocol," RFC 1058, Network Information Center, SRI International, Menlo Park, CA, June 1988.]] Google ScholarDigital Library
- 19 P.A. Humbler and S.R. Soloway, "Topology Broadcast Algorithms,'' Computer Networks and ISDN Systems, Vol. 16, pp. 179-186, 1989.]] Google ScholarDigital Library
- 20 P. Humblet, "Another Adaptive Distributed Shortest Path Algorithm," IEEE Trans. Comm., Vol. 39, No. 6, pp. 995- 1003, June 1991.]]Google ScholarCross Ref
- 21 International Standards Organization, 1989: "Intra-Domain IS-IS Routing Protocol," ISO/IEC JTC1/SC6 WG2 N323, September 1989.]]Google Scholar
- 22 International Standards Organization, "Protocol for Exchange of Inter-domain Routing Information among intermediate Systems to Support Forwarding of ISO 8473 PDUs," ISO/IEC/JTC1/SC6 CD10747.]]Google Scholar
- 23 J.M. Jaffe, "Algorithms for Finding Paths with Multiple Constraints," Networks, Vol. 14, pp. 95-116, 1984.]]Google ScholarCross Ref
- 24 J.M. Jaffe, A.E. Berets, and A. Segall, "Subtle Design Issues in the implementation of Distributed, Dynamic Routing Algorithms,'' Computer Networks and ISDN Systems, Vol. 12, pp. 147-158, 1986.]] Google ScholarDigital Library
- 25 L. Kleinrock and F. Kamoun, "Hierarchical Routing for Large Networks: Performance Evaluation and Optimization," Computer Networks, Vol. 1, pp. 155-174.]]Google Scholar
- 26 K. Lougheed and Y. Rekhter, "Border Gateway Protocol 3 (BGP-3)," RFC 1267, SRI International, Menlo Park, CA, October 1991.]] Google ScholarDigital Library
- 27 J. McQuillan, "Adaptive Routing Algorithms for Distributed Computer Networks," BBN Rep. 2831, Bolt Beranek and Newman Inc., Cambridge MA, May 1974.]]Google Scholar
- 28 J. Moy, "OSPF Version 2," Network Working Group Internet Draft, November 1992.]]Google Scholar
- 29 R. Perlman, "Fault-Tolerant Broadcast of Routing Information,'' in Computer Networks, North-Holland, Vol. 7, pp. 395- 405, 1983.]]Google Scholar
- 30 B. Rajagopalan and M. Faiman, "A Responsive Distributed Shortest-Path Routing Algorithm within Autonomous Systems,'' lnternetworking: Research and Experience, Vol. 2, No. 1, pp. 51-69, March 1991.]]Google Scholar
- 31 Y. Rekhter, "Inter-Domain Routing Protocol (IDRP)," Internetworking: Research and Experience, Wiley, Vol. 4, No. 2, June 1993, pp. 61-80.]]Google Scholar
- 32 G.G. Riddle, "Message Routing in a Computer Network," U.S. Patent assigned to AT&T Bell Telephone Laboratories, Inc., Patent Number 4,466,060, August 1984.]]Google Scholar
- 33 M. Steenstrup, "Inter-Domain Policy Routing Protocol Specification: Version 1," internet Draft, May 1992.]] Google ScholarDigital Library
- 34 J. Spinelli and R. Gallager, "Event Driven Topology Broadcast without Sequence Numbers," IEEE Trans. Commun., Vol. 37, pp. 468-474, May 1989.]]Google Scholar
- 35 P. Tsuchiya, "The Landmark Hierarchy: A New Hierarchy for Routing in Very Large Networks," Computer Comm. Review, Vol. 18, No. 4, 1988, pp. 43-54.]] Google ScholarDigital Library
- 36 W. Zaumen and J.J. Garcia-Luna-Aceves, "Dynamics of Distributed Shortest-Path Routing Algorithms," Computer Comm. Review, Vol. 21, No. 4, pp. 31-42, September 1991.]] Google ScholarDigital Library
- 37 --, "Dynamics of Link-State and Loop-Free Distance-Vector Routing Algorithms," Journal o.f Internetworking: Research and Experience, Vol. 3, No. 4, pp. 161-188 December 1992.]]Google Scholar
Index Terms
- Distributed, scalable routing based on link-state vectors
Recommendations
Distributed, scalable routing based on link-state vectors
SIGCOMM '94: Proceedings of the conference on Communications architectures, protocols and applicationsA new family of routing algorithms for the distributed maintenance of routing information in large networks and internets is introduced. This family is called link vector algorithms (LVA), and is based on the selective diffusion of link-state ...
Distributed, scalable routing based on vectors of link states
We have present a new method for distributed routing in computer networks and internets using link-state information. Link vector algorithms (LVA) are introduced for the distributed maintenance of routing information in large networks and internets. ...
Reviews
Jeffrey David Oldham
The authors introduce link vector algorithms for routing in large networks. Each router executing a link-vector algorithm maintains information about preferred paths to all other network routers rather than maintaining information about all links in the network. Thus, router storage and communication requirements are less than for distance-vector and link-state algorithms. To construct its set of preferred paths, a source router requests the preferred paths of all neighboring routers and then uses a path-selection algorithm such as shortest-path routing. When a link's performance parameters (for example, congestion level or availability) change enough to affect routing, the adjacent nodes notify their neighbors of all changes to their sets of preferred paths. Each router that changes its set of preferred paths continues propagating the information. The authors compare their algorithms with existing algorithms for routing in a distributed network and present a pseudocode implementation. After proving that every router receives recent link-state information and that the routing tables do not contain loops, they show that the communication, time, and router storage complexity are bounded by the complexity of current router algorithms. The paper ends with limited results from a simulation. This well-written paper omits discussion of whether the algorithm prevents oscillations in path preference. The authors need to conduct more extensive simulations to validate the effectiveness of the routing algorithms . A succinct discussion of existing router algorithms motivates the link vector algorithms while assisting readers less familiar with routing. The algorithmic analysis uses a minimum of mathematical notation.
Access critical reviews of Computing literature here
Become a reviewer for Computing Reviews.
Comments