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

  • Authors:

  • A. Udaya Shankar;Cengiz Alaettinoğlu;Ibrahim Matta;Klaudia Dussa-Zieger

  • Affiliations:

  • Institute for Advanced Computer Studies, Department of Computer Science, University of Maryland, College Park, Maryland;Department of Computer Science, University of Maryland, College Park, Maryland;Department of Computer Science, University of Maryland, College Park, Maryland;Department of Computer Science, University of Maryland, College Park, Maryland

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

Quantified Score

Hi-index 0.00

Visualization

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(N2), 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.