Distributed routing algorithm for loop detection and resolution

After a brief discussion of the distributed Bellman-Ford algorithm and the associated looping problems, a routing algorithm for loop detection and resolution is proposed. The proposed algorithm detects and resolves all kinds of loops within a finite time depending on the number of nodes in a loop, while requiring a small computation and memory overhead. No extra control messages are generated and communicated over the network. The proposed algorithm does not allow any serious looping effects and maintains the simplicity of the distributed Bellman-Ford algorithm.<
>