Performance comparison of routing protocols under dynamic and static file transfer connections
- 2 October 1992
- journal article
- Published by Association for Computing Machinery (ACM) in ACM SIGCOMM Computer Communication Review
- Vol. 22 (5) , 39-52
- https://doi.org/10.1145/141809.141813
Abstract
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.Keywords
This publication has 15 references indexed in Scilit:
- An extended least-hop distributed routing algorithmIEEE Transactions on Communications, 1990
- Traffic characterization of the NSFNET national backbonePublished by Association for Computing Machinery (ACM) ,1990
- Control and optimization methods in communication network problemsIEEE Transactions on Automatic Control, 1989
- A loop-free extended Bellman-Ford routing protocol without bouncing effectPublished by Association for Computing Machinery (ACM) ,1989
- The revised ARPANET routing metricPublished by Association for Computing Machinery (ACM) ,1989
- A unified approach to loop-free routing using distance vectors or link statesPublished by Association for Computing Machinery (ACM) ,1989
- Termination detection for diffusing computationsInformation Processing Letters, 1980
- A simple dynamic routing problemIEEE Transactions on Automatic Control, 1980
- A Minimum Delay Routing Algorithm Using Distributed ComputationIEEE Transactions on Communications, 1977
- A note on two problems in connexion with graphsNumerische Mathematik, 1959