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
Loop-free routing using diffusing computations
IEEE/ACM Transactions on Networking (TON)
Avoiding Counting to Infinity in Distance Vector Routing
ICN '01 Proceedings of the First International Conference on Networking-Part 1
Avoiding transient loops during the convergence of link-state routing protocols
IEEE/ACM Transactions on Networking (TON)
RIP-MTI: A New Way to Cope with Routing Loops
ICN '08 Proceedings of the Seventh International Conference on Networking
Ad Hoc Networking
| Hi-index | 0.00 |
In case of a link failure a routing algorithm can reorganize a network and keep it full functional if there are redundant links available. Redundant links are only available in a network system like the internet if the topology contains loops. However, topology loops are also the main reason for the occurrence of routing loops. A routing loop can be seen as a circular trace of a routing update Information which returns to the same router, either directly from the neighbor router or via a loop topology. It is necessary to recognize and to prevent routing loops because they consume a large amount of network bandwidth and impact the end-to-end performance of the network. We introduce a new routing algorithm which can detect routing loops Just by the evaluation of simple routing metrics. Our new algorithm is called Routing Information Protocol with Metric based Topology Investigation (RIP-MTI), which is a straightforward extension to tbe Routing Information Protocol (RIP) and is entirely compatible to RIP.