Data and computer communications
Data and computer communications
Subtle design issues in the implementation of distributed, dynamic routing algorithms
Computer Networks and ISDN Systems
A minimum-hop routing algorithm bases on distributed information
Computer Networks and ISDN Systems
Hi-index | 0.00 |
This paper discusses a new distributed, dynamic routing approach for communication networks. At each node, the best available route to the destination is selected and the message is forwarded to the next node on that route. The best route is evaluated at the new node again. The choice of the best mute is based on a parameter K, defined in the paper. This parameter is calculated for every path based on the characteristics of the path, such as - the number of hops, the speeds of the links, the load on the links, reliability of links etc. The method guarantees that as long as the network is connected the message will be delivered to the destination using the best available path. This approach does not have the counting to infinity problem and is loop-free. A comparative study of this scheme with some of the existing schemes is also included to demonstrate its generality and effectiveness.