Sciweavers

Share
TELSYS
2002

Avoiding Counting to Infinity in Distance Vector Routing

9 years 6 months ago
Avoiding Counting to Infinity in Distance Vector Routing
The Routing Information Protocol (RIP) may introduce misleading routing information into the routing table, due to network topology changes such as link or router failures. This is known as the counting to infinity problem. In the past, the distance metric had to be below 16 hops, in order to keep this counting within reasonable limits. In this paper a more elaborate approach is presented in order to recognize those router interfaces, which might have received misleading routing messages. This is accomplished by evaluating routing updates more carefully than is done by the well known split horizon approach. This new approach gets by without any additional message exchange between the RIP-protocol partners. In contrast to other approaches, the router interfaces are examined in pairs to determine if a loop exists between them. The algorithm locally extracts all the information it needs from the normal update messages that are exchanged between RIP neighbors and is thus executed in consta...
Andreas Schmid, Christoph Steigner
Added 23 Dec 2010
Updated 23 Dec 2010
Type Journal
Year 2002
Where TELSYS
Authors Andreas Schmid, Christoph Steigner
Comments (0)
books