Article

Free access

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

Authors:

A. Udaya Shankar,

Cengiz Alaettinoğlu,

Klaudia Dussa-ZiegerAuthors Info & Claims

SIGMETRICS '92/PERFORMANCE '92: Proceedings of the 1992 ACM SIGMETRICS joint international conference on Measurement and modeling of computer systems

Pages 181 - 192

https://doi.org/10.1145/133057.133103

Published: 01 June 1992 Publication History

Abstract

There are two approaches to adaptive routing protocols for wide-area store-and-forward networks: distance-vector and link-state. Distance-vector algorithms use O(N x e) storage at each node, whereas link-state algorithms use O(N²), where N is the number of nodes in the network and e 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.

References

[1]

C. Alaettinoglu, K. Dussa-Zieger, I. Matta, and A. U. Shankar. MaRS (Maryland Routing Simulator) -Version 1.0 User's Manual. Technical Report UMIACS-TR- 91-80, CS-TR-2687, Department of Computer Science, University of Maryland, College Park, MD 20742, June 1991.

Digital Library

[2]

D. Bertsekas and R. Gallager. Data Networks, pages 297-333. Prentice-Hall, Inc., 1987.

Digital Library

[3]

D.P. Bertsekas. Dynamic behavior of shortest path routing algorithms for communication networks. IEEE Transactions on Automatic Control, 27(1):60-74, February 1982.

[4]

C. Cassandras, M. V. Abidi, and D. Towsley. Distributed routing with on-line marginal delay estimation. 38(3):348-359, March 1990.

[5]

C. Cheng, R. Riley, S. P. R. Kumar, and J. J. Garcia- Luna-Aceves. A loop-free Bellman-Ford routing protocol without bouncing effect. In A CM SIGCOMM '89, pages 224-237, September 1989.

Digital Library

[6]

Wushow Chou, Arnold Bragg, and Arne NUsson. The need for adaptive routing in the chaotic and unbalanced traffic. IEEE Transactions on Communications, 1981.

[7]

E. Dijkstra. A note on two problems in connection with graphs. Numer. Math., 1:269-271, 1959.

Digital Library

[8]

E. Dijkstra and C. Scholten. Termination detection for diffusing computations. Information Processing Letters, 11(1):1-4, 1980.

[9]

A. Ephremides, P. Varaiya, and J. Walrand. A simple dynamic routing problem. IEEE Transactions on Automatic Control, 25(4):690-693, August 1980.

[10]

A. Ephremides and S. Verdu. Control and optimization methods in communication network problems. IEEE Transactions on Automatic Control, 34(9):930- 942, September 1989.

[11]

L. Ford and D. Fulkerson. Flows in Networks, pages 297-333. Prentice-Hall, inc., 1962.

[12]

R. Gallager. A minimum delay routing algorithm using distributed computation. 1EEE Transactions on Communications, COM-25(1):73-85, January 1977.

[13]

J.J. Garcia-Luna-Aceves. A unified approach to loop free routing using distance vectors or link states. In A CM SIGCOMM '89, pages 212-223, September 1989.

Digital Library

[14]

S. A. Heimlich. Traffic characterization of the NSFNET national backbone. In Proc. USENIX '90, pages 207- 227, Washington, D.C., January 1990.

Digital Library

[15]

J. M. Jaffe and F.H. Moss. A responsive distributed routing algorithm for computer networks. IEEE Transactions on Communications, COM-30(7):1758-1762, July 1982.

[16]

R. Jain and S.A. Routhier. Packet trains- measurements and a new model for computer network traffic. IEEE Journal on Selected Areas in Communication, SAC-4(6):986-995, September 1986.

[17]

Dale Johnson. NSFnet report. In Proc. of the Nineteenth lnternet Engineering Task Force, pages 377- 382, University of Colorado, National Center for Atmospheric Research, December 1990.

[18]

A. Khanna and J. Zinky. A revised ARPANET routing metric. In A CM SIGCOMM '89, pages 45-56, September 1989.

Digital Library

[19]

L. Kleinrock. Queueing Systems, Volume ii: Computer Applications. John Wiley and Sons, Inc., 1976.

[20]

J. M. McQuillan, I. Richer, and E. C. Rosen. The new routing algorithm for the ARPANET. 1EEE Transactions on Communications, COM-28(5):711-719, May 1980.

[21]

P. M. Merlin and A. Segall. A failsafe distributed routing protocol. 1EEE Transactions on Communications, COM-27(9):1280-1287, September 1979.

[22]

D. J. Nelson, K. Sayood, and H. Chang. An extended least-hop distributed routing algorithm. IEEE Transactions on Communications, 38(4):520-528, April 1990.

[23]

B. Rajagopalan and M. Faiman. A new responsive distributed shortest-path routing algorithm, in ACM SIG- COMM '89, pages 237-246, September 1989.

Digital Library

[24]

A. Segal. Advances in verifiable fail-safe routing procedures. 1EEE Transactions on Communications, COM- 29(4):491-497, April 1981.

[25]

W.T. Tsai, C. Ramamoorthy, W.K. Tsai, and O. Nishiguchi. An adaptive hierarchical routing protocol. 1EEE Transactions on Computers, 38:1059-1075, August 1989.

Digital Library

[26]

Z. Wang and J. Crowcroft. Shortest path first with emergency exits. In ACM SIGCOMM '90, pages 166- 176, September 1990.

Digital Library

[27]

W. Zaurnen and J.J. Garcia-Luna-Aceves. Dynamics of distributed shortest-path routing algorithms. In A CM SIGCOMM '91, September 1991.

Digital Library

Cited By

Sanike ASubramanyam ARam GChakradhar J(2015)Performance of load balancing protocol with link failures on 5×5 grid in the communication networks2015 Conference on Power, Control, Communication and Computational Technologies for Sustainable Growth (PCCCTSG)10.1109/PCCCTSG.2015.7503953(332-336)Online publication date: Dec-2015
https://doi.org/10.1109/PCCCTSG.2015.7503953
Sanike ASubramanyam AReddy SRaghuRam G(2015)Load balancing technique to handle the congestion in the communication networks2015 Conference on Power, Control, Communication and Computational Technologies for Sustainable Growth (PCCCTSG)10.1109/PCCCTSG.2015.7503919(289-293)Online publication date: Dec-2015
https://doi.org/10.1109/PCCCTSG.2015.7503919
Farkas JArató Z(2009)Performance analysis of shortest path bridging control protocolsProceedings of the 28th IEEE conference on Global telecommunications10.5555/1811982.1812078(4191-4196)Online publication date: 30-Nov-2009
https://dl.acm.org/doi/10.5555/1811982.1812078
Show More Cited By

Index Terms

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

Recommendations

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 O(N x e) storage at each node, whereas link-state algorithms use O(N²), where N is the number ...
Routing Protocols: RIP and BGP Rbsw05e
IP routing protocols: RIP, OSPF, BGP, PNNI and Cisco routing protocols

Comments

Information & Contributors

Information

Published In

cover image ACM Conferences

SIGMETRICS '92/PERFORMANCE '92: Proceedings of the 1992 ACM SIGMETRICS joint international conference on Measurement and modeling of computer systems

June 1992

267 pages

ISBN:0897915070

DOI:10.1145/133057

Chairman:
Michael K. Molloy
Hewlett Packard, Ft. Collins, CO
,
Editor:
Blaine D. Gaither
Amdahl Corp., Rexburg, ID

ACM SIGMETRICS Performance Evaluation Review Volume 20, Issue 1
June 1992
260 pages
ISSN:0163-5999
DOI:10.1145/149439
Editor:
Blaine D. Gaither
Ahmdahl Corp., Rexburg, IN
Issue’s Table of Contents

Copyright © 1992 ACM.

Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected]

Sponsors

SIGMETRICS: ACM Special Interest Group on Measurement and Evaluation
IFIP WG 7.3: IFIP WG 7.3

Publisher

Association for Computing Machinery

New York, NY, United States

Publication History

Published: 01 June 1992

Permissions

Request permissions for this article.

Request Permissions

Check for updates

Qualifiers

Article

Conference

SIGMETRICS92

Sponsor:

SIGMETRICS
IFIP WG 7.3

SIGMETRICS92: ACM SIGMETRICS Conference on Measurement & Modeling of Computer Systems

June 1 - 5, 1992

Rhode Island, Newport, USA

Acceptance Rates

Overall Acceptance Rate 459 of 2,691 submissions, 17%

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

21
Total Citations
View Citations
1,058
Total Downloads

Downloads (Last 12 months)120
Downloads (Last 6 weeks)17

Reflects downloads up to 12 Nov 2024

Other Metrics

View Author Metrics

Citations

Cited By

Sanike ASubramanyam ARam GChakradhar J(2015)Performance of load balancing protocol with link failures on 5×5 grid in the communication networks2015 Conference on Power, Control, Communication and Computational Technologies for Sustainable Growth (PCCCTSG)10.1109/PCCCTSG.2015.7503953(332-336)Online publication date: Dec-2015
https://doi.org/10.1109/PCCCTSG.2015.7503953
Sanike ASubramanyam AReddy SRaghuRam G(2015)Load balancing technique to handle the congestion in the communication networks2015 Conference on Power, Control, Communication and Computational Technologies for Sustainable Growth (PCCCTSG)10.1109/PCCCTSG.2015.7503919(289-293)Online publication date: Dec-2015
https://doi.org/10.1109/PCCCTSG.2015.7503919
Farkas JArató Z(2009)Performance analysis of shortest path bridging control protocolsProceedings of the 28th IEEE conference on Global telecommunications10.5555/1811982.1812078(4191-4196)Online publication date: 30-Nov-2009
https://dl.acm.org/doi/10.5555/1811982.1812078
Farkas JArato Z(2009)Performance Analysis of Shortest Path Bridging Control ProtocolsGLOBECOM 2009 - 2009 IEEE Global Telecommunications Conference10.1109/GLOCOM.2009.5425776(1-6)Online publication date: Nov-2009
https://doi.org/10.1109/GLOCOM.2009.5425776
Aakanksha VBedi P(2009)A Self-organizing Self-healing On-demand Loop-free Path Routing Protocol Using Mobile Process Groups for Mobile Ad-hoc NetworksProceedings of the 2009 International Conference on Advances in Recent Technologies in Communication and Computing10.1109/ARTCom.2009.97(396-400)Online publication date: 27-Oct-2009
https://dl.acm.org/doi/10.1109/ARTCom.2009.97
Matta IShankar A(2006)Type-of-service routing in datagram delivery systemsIEEE Journal on Selected Areas in Communications10.1109/49.46471213:8(1411-1425)Online publication date: 1-Sep-2006
https://dl.acm.org/doi/10.1109/49.464712
Abolhasan MWysocki TDutkiewicz E(2004)A review of routing protocols for mobile ad hoc networksAd Hoc Networks10.1016/S1570-8705(03)00043-X2:1(1-22)Online publication date: Jan-2004
https://doi.org/10.1016/S1570-8705(03)00043-X
Baran BSosa R(2000)A new approach for AntNet routingProceedings Ninth International Conference on Computer Communications and Networks (Cat.No.00EX440)10.1109/ICCCN.2000.885506(303-308)Online publication date: 2000
https://doi.org/10.1109/ICCCN.2000.885506
Castañeda RDas SKodesh HBahl VImielinski TSteenstrup M(1999)Query localization techniques for on-demand routing protocols in ad hoc networksProceedings of the 5th annual ACM/IEEE international conference on Mobile computing and networking10.1145/313451.313534(186-194)Online publication date: 1-Aug-1999
https://dl.acm.org/doi/10.1145/313451.313534
Shah SMedhi D(1998)Performance under a failure of wide-area datagram networks with unicast and multicast traffic routingIEEE Military Communications Conference. Proceedings. MILCOM 98 (Cat. No.98CH36201)10.1109/MILCOM.1998.726979(939-945)Online publication date: 1998
https://doi.org/10.1109/MILCOM.1998.726979
Show More Cited By

View Options

View options

PDF

View or Download as a PDF file.

eReader

View online with eReader.

Get Access

Login options

Check if you have access through your login credentials or your institution to get full access on this article.

Full Access

Get this Publication

Media

Figures

Other

Tables

View Table of Contents