A loop-free extended Bellman-Ford routing protocol without bouncing effect
Distributed algorithms for shortest-path problems are important in the context of routing in computer communication networks. We present a protocol that maintains the shortest-p...