by A. Udaya Shankar, Cengiz Alaettinoglu, Ibrahim Matta, Klaudia Dussa-zieger
ftp://ftp.cs.umd.edu/pub/sdag/MaRS/Papers/Sigmetrics92.ps.gz
Add To MetaCart
Abstract:
There are two approaches to adaptive routing protocols for wide-area store-and-forward networks: distancevector and link-state. Distance-vector algorithms use O(N \Theta e) storage at each node, whereas link-state algorithms use O(N 2), 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.
Citations
|
1267
|
Data Networks
– Bertsekas, Gallager
- 1992
|
|
507
|
A note on two problems in connection with graphs
– Dijkstra
- 1959
|
|
227
|
An Overview of the New Routing Algorithm for the ARPANET
– McQuillan, Richer, et al.
- 1995
|
|
217
|
Queueing Systems, volume II. Computer Applications
– Kleinrock
- 1976
|
|
212
|
Termination detection for diffusing computations
– Dijkstra, Scholten
- 1980
|
|
160
|
Packet trains: Measurements and a new model for computer network traffic
– Jain, Routhier
- 1986
|
|
108
|
The Revised ARPANET Routing Metric
– Khanna, Zinky
- 1989
|
|
106
|
A minimum delay routing algorithm using distributed computation
– Gallager
- 1977
|
|
74
|
A failsafe distributed routing protocol
– Merlin, Segall
- 1979
|
|
54
|
A Responsive Distributed Routing Algorithm for Computer Networks
– Jaffe, Moss
- 1982
|
|
46
|
A simple dynamic routing problem
– Ephremides, Varaiya, et al.
- 1980
|
|
41
|
Shortest Path First with Emergency Exits
– Wang, Crowcroft
- 1991
|
|
40
|
Traffic characterization of the nsfnet national backbone
– Heimlich
- 1990
|
|
33
|
Dynamic behavior of shortest path routing algorithms for communication networks
– Bertsekas
- 1982
|
|
27
|
A New Responsive Distributed Shortest-Path Routing Algorithm
– Rajagopalan, Faiman
- 1989
|
|
27
|
An Adaptive Hierarchical Routing Protocol
– Ramamoorthy
- 1989
|
|
16
|
Dynamics of distributed shortest-path routing algorithms
– Zaumen, Garcia-Luna-Aceves
- 1991
|
|
10
|
Distributed routing with on-line marginal delay estimation
– Cassandras, Abidi, et al.
- 1990
|
|
10
|
An Extended Least-hop Distributed Routing Algorithm
– Nelson, Sayood, et al.
- 1990
|
|
9
|
Garcia-Luna-Aceves. A loop-free Bellman-Ford routing protocol without bouncing e ect
– Cheng, Riley, et al.
- 1989
|
|
9
|
Control and Optimization Methods in Communication Network Problems
– Ephremides, Verdu
- 1989
|
|
8
|
Routing Simulator) -- Version 1.0 User's Manual
– MaRS
- 1991
|
|
8
|
The Need for Adaptive Routing in the Chaotic and Unbalanced Traffic Environment
– Chou, Bragg, et al.
- 1981
|
|
8
|
NSFnet Report
– Johnson
- 1990
|
|
7
|
A unified approach to loop free routing using distance vectors or link states
– Garcia-Luna-Aceves
- 1989
|
|
3
|
Advances in verifiable fail-safe routing procedures
– Segal
- 1981
|
