Performance comparison of routing protocols using MaRS: distance-vector versus link-state

There are two approaches to adaptive routing protocols for wide-area store-and-forward networks: distance-vector and link-state. Distance-vector algorithms use <italic>O(N x e)</italic> storage at each node, whereas link-state algorithms use <italic>O(N<supscrpt>2</supscrpt>)</italic>, where <italic>N</italic> is the number of nodes in the network and <italic>e</italic> is the average degree of a node. The ARPANET started with a distance-vector algorithm (Distributed Bellman-Ford), but because of long-lived loops, changed to a link-state algorithm (SPF). We show, using a recently developed network simulator, MaRS, that a newly proposed distance-vector algorithm (ExBF) performs as well as SPF. This suggests that distance-vector algorithms are appropriate for very large wide-area networks.

[1]  Eric C. Rosen,et al.  The New Routing Algorithm for the ARPANET , 1980, IEEE Trans. Commun..

[2]  D. R. Fulkerson,et al.  Flows in Networks. , 1964 .

[3]  Bala Rajagopalan,et al.  A new responsive distributed shortest-path rounting algorithm , 1989, SIGCOMM '89.

[4]  Jeffrey M. Jaffe,et al.  A Responsive Distributed Routing Algorithm for Computer Networks , 1982, ICDCS.

[5]  J. J. Garcia-Luna-Aceves,et al.  A unified approach to loop-free routing using distance vectors or link states , 1989, SIGCOMM '89.

[6]  G. G. Stokes.  "J." , 1890, The New Yale Book of Quotations.

[7]  Khalid Sayood,et al.  An extended least-hop distributed routing algorithm , 1990, IEEE Trans. Commun..

[8]  Raj Jain,et al.  Packet Trains-Measurements and a New Model for Computer Network Traffic , 1986, IEEE J. Sel. Areas Commun..

[9]  Edsger W. Dijkstra,et al.  Termination Detection for Diffusing Computations , 1980, Inf. Process. Lett..

[10]  Edsger W. Dijkstra,et al.  A note on two problems in connexion with graphs , 1959, Numerische Mathematik.

[11]  Robert B. Cooper,et al.  Queueing systems, volume II: computer applications : By Leonard Kleinrock. Wiley-Interscience, New York, 1976, xx + 549 pp. , 1977 .

[12]  Robert G. Gallager,et al.  A Minimum Delay Routing Algorithm Using Distributed Computation , 1977, IEEE Trans. Commun..

[13]  A. Udaya Shankar,et al.  MaRS (Maryland Routing simulator)—version 1.0 user's , 1991 .

[14]  Donald F. Towsley,et al.  Distributed routing with on-line marginal delay estimation , 1990, IEEE Trans. Commun..

[15]  Anthony Ephremides,et al.  Control and optimization methods in communication network problems , 1989 .

[16]  B. Rajagopalan,et al.  A new responsive distributed shortest-path rounting algorithm , 1989, SIGCOMM 1989.

[17]  A. Khanna,et al.  The revised ARPANET routing metric , 1989, SIGCOMM '89.

[18]  Dimitri P. Bertsekas,et al.  Dynamic behavior of shortest path routing algorithms for communication networks , 1982 .

[19]  Anthony Ephremides,et al.  A simple dynamic routing problem , 1980 .

[20]  Jon Crowcroft,et al.  Shortest path first with emergency exits , 1990, SIGCOMM 1990.

[21]  C. V. Ramamoorthy,et al.  An Adaptive Hierarchical Routing Protocol , 1989, IEEE Trans. Computers.

[22]  J. J. Garcia-Luna-Aceves.  A unified approach to loop-free routing using distance vectors or link states , 1989, SIGCOMM 1989.

[23]  Adrian Segall.  Advances in Verifiable Fail-Safe Routing Procedures , 1981, IEEE Trans. Commun..

[24]  J. J. Garcia-Luna-Aceves,et al.  Dynamics of distributed shortest-path routing algorithms , 1991, SIGCOMM '91.

[25]  G. J. A. Stern,et al.  Queueing Systems, Volume 2: Computer Applications , 1976 .

[26]  J. J. Garcia-Luna-Aceves,et al.  A loop-free extended Bellman-Ford routing protocol without bouncing effect , 1989, SIGCOMM 1989.

[27]  A. Khanna,et al.  The revised ARPANET routing metric , 1989, SIGCOMM 1989.

[28]  Adrian Segall,et al.  A Failsafe Distributed Routing Protocol , 1979, IEEE Trans. Commun..

[29]  Steven A. Heimlich.  Traffic characterization of the NSFNET national backbone , 1990, SIGMETRICS '90.