Countering Count-to-Infinity in High Speed Networks

Provided by: International Journal of Electronics and Computer Science Engineering
Topic: Mobility
Format: PDF
Routing tables of all the routers needs frequent updates due topology changes resulting because of link failures or link metric modifications. Each of those updates may cause transient routing loops. These loops pose significant stability problems in Wireless Networks. Distributed routing algorithms capable of avoiding such transient loops in network path are deemed efficient. Some earlier approaches like Shortest path routing (Dijkstra), etc. have problems maintaining the balance between node delays and link delays. Besides an earlier algorithm, Distributed Path Computation with Intermediate Variables (DIV) guarantees steady-state, with no transient loops.

Find By Topic