Transient and steady-state performance of routing protocols: distance-vector versus link-state

We examine two approaches to adaptive routing protocols for wide-area store-and-forward networks, namely, distance-vector and link-state. Distance-vector algorithms have less storage requirements than link-state algorithms. 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 evaluate, using a recently developed network simulator, MaRS, the transient and steady-state performance of SPF and two newly proposed distance-vector algorithms (ExBF and MS). Overall, SPF and ExBF have comparable performance and MS is worse.

[1]  J. P. Ed,et al.  Transmission control protocol- darpa internet program protocol specification , 1981 .

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

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

[4]  Kirk Lougheed,et al.  Border Gateway Protocol (BGP) , 2021, IP Routing Protocols.

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

[6]  Stephen S. Lavenberg,et al.  Computer Performance Modeling Handbook , 1983, Int. CMG Conference.

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

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

[9]  Cengiz Alaettinoglu,et al.  Performance comparison of routing protocols under dynamic and static file transfer connections , 1992, CCRV.

[10]  Diana Shen,et al.  A Minimum Delay Routing Algorithm Using Distributed Computation , 1977 .

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

[12]  A. Udaya Shankar,et al.  Routing testbed: initial design , 1990 .

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

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

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

[16]  Cengiz Alaettinoglu,et al.  Performance comparison of routing protocols using MaRS: distance-vector versus link-state , 1992, SIGMETRICS '92/PERFORMANCE '92.

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

[18]  Wushow Chou,et al.  Queueing Systems, Volume II: Computer Applications - Leonard Kleinrock , 1977, IEEE Transactions on Communications.

[19]  Christos G. Cassandras,et al.  Performance comparison of routing algorithms in packet switched networks , 1990, [Proceedings] GLOBECOM '90: IEEE Global Telecommunications Conference and Exhibition.

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

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

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

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

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

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

[26]  Wushow Chou,et al.  The Need for Adaptive Routing in the Chaotic and Unbalanced Traffic Environment , 1981, IEEE Trans. Commun..

[27]  Martha Steenstrup,et al.  An Architecture for Inter-Domain Policy Routing , 1993, RFC.

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

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

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

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