Date Added: Jun 2010
When using Link-State Protocols such as OSPF or IS-IS used in the networks, As a response to a topological change forwarding loops can occur transiently when the routers adapt their forwarding tables. In this paper, the authors proposed and simulate a mechanism that lets the network converge to its optimal state with loop free and the related packet lossless. The mechanism is based on an ordering of the updates of the forwarding tables of the routers.. Typically they have chosen a Network consisting of routers. Link costs are generated randomly for simulation. Dijkstra's algorithm has been employed for computing shortest paths. Routing tables are computed dynamically.