Telecommunication networks: protocols, modeling and analysis
Telecommunication networks: protocols, modeling and analysis
Performance Analysis of Distributed Routing Strategies Free of Ping-Pong-Type Looping
IEEE Transactions on Computers
Computer networks
Communications of the ACM
Issues in routing for large and dynamic networks
Issues in routing for large and dynamic networks
Shortest paths and loop-free routing in dynamic networks
SIGCOMM '90 Proceedings of the ACM symposium on Communications architectures & protocols
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
Performance comparison of routing protocols under dynamic and static file transfer connections
ACM SIGCOMM Computer Communication Review
A distributed routing algorithm for mobile wireless networks
Wireless Networks
Avoiding Counting to Infinity in Distance Vector Routing
ICN '01 Proceedings of the First International Conference on Networking-Part 1
Dynamic agent population in agent-based distance vector routing
Second international workshop on Intelligent systems design and application
Design and performance of a loop free routing algorithm
ICCC '02 Proceedings of the 15th international conference on Computer communication
Loop-Free Internet Routing Using Hierarchical Routing Trees
INFOCOM '97 Proceedings of the INFOCOM '97. Sixteenth Annual Joint Conference of the IEEE Computer and Communications Societies. Driving the Information Revolution
Dynamic agent population in agent-based distance vector routing
Neural, Parallel & Scientific Computations - Special issue: Advances in intelligent systems and applications
IEEE/ACM Transactions on Networking (TON)
Alternate path routing for multicast
IEEE/ACM Transactions on Networking (TON)
Journal of Systems and Software - Special issue: Computer systems
Optimal maintenance of a spanning tree
Journal of the ACM (JACM)
Xl: an efficient network routing algorithm
Proceedings of the ACM SIGCOMM 2008 conference on Data communication
ICOIN'09 Proceedings of the 23rd international conference on Information Networking
Research: A loop-free routing protocol for large-scale internets using distance vectors
Computer Communications
| Hi-index | 0.00 |
Distributed shortest-path routing algorithms based on the Ford-Fulkerson method are simple to implement but they suffer from the cost-dependent looping problem: when link costs increase, routing table loops may form and convergence to correct paths may be too slow, depending on link costs. This problem can be eliminated if constraints are imposed on the order in which routing tables are updated at different nodes but the resulting internode protocols tend to be relatively complex. Furthermore, update constraints may restrict a node's ability to obtain alternate paths quickly in an environment where topology changes are frequent. In this paper, a new distributed shortest-path routing scheme based on the Ford-Fulkerson method is presented. Under the new scheme, each node uses partial topology information to eliminate the cost-dependent looping problem. No update constraints are imposed and no assumptions are made regarding link costs. In the worst case, the new scheme responds to link cost changes in O(D) update steps, where D is the diameter of the network after the occurrence of the changes.