Data networks
The revised ARPANET routing metric
SIGCOMM '89 Symposium proceedings on Communications architectures & protocols
A unified approach to loop-free routing using distance vectors or link states
SIGCOMM '89 Symposium proceedings on Communications architectures & protocols
A loop-free extended Bellman-Ford routing protocol without bouncing effect
SIGCOMM '89 Symposium proceedings on Communications architectures & protocols
A new responsive distributed shortest-path rounting algorithm
SIGCOMM '89 Symposium proceedings on Communications architectures & protocols
An Adaptive Hierarchical Routing Protocol
IEEE Transactions on Computers
Shortest path first with emergency exits
SIGCOMM '90 Proceedings of the ACM symposium on Communications architectures & protocols
Dynamics of distributed shortest-path routing algorithms
SIGCOMM '91 Proceedings of the conference on Communications architecture & protocols
MaRS (Maryland Routing simulator)—version 1.0 user's
MaRS (Maryland Routing simulator)—version 1.0 user's
Performance comparison of routing protocols using MaRS: distance-vector versus link-state
SIGMETRICS '92/PERFORMANCE '92 Proceedings of the 1992 ACM SIGMETRICS joint international conference on Measurement and modeling of computer systems
AntNet: distributed stigmergetic control for communications networks
Journal of Artificial Intelligence Research
Multiple path routing algorithm for IP networks
Computer Communications
| Hi-index | 0.00 |
We compare the performance of two recently proposed distance-vector algorithms (Merlin-Segall and Extended Bellman-Ford) with a link-state algorithm (SPF), under varying file transfer workload. (Unlike the traditional distance-vector algorithms, these new distance-vector algorithms do not suffer from long-lived loops.) Our comparison is done using a recently developed network simulator. MaRS. We consider both dynamic and static file transfer connections, and both uniform and hotspot distributions of source-sink pairs. Our conclusion is that Extended Bellman-Ford performs as well as SPF in terms of delay and throughput. This suggests that distance-vector algorithms are appropriate for very large wide-area networks, since their space requirements are less than that of link-state algorithms.