Back to index

A Loop-Free Extended Bellman-Ford Routing Protocol Without Bouncing Effect

Cheng, Riley, and Kumar

One-line summary: Routing loops and counting-to-infinity behaviors are possible with distance-vector routing; this paper shows how to eliminate them, with minimal performance hit for the routers.

Overview/Main Points


A better algorithm for distance-vector routing. Routing loops really do happen quite often; assymetric routing should only make them worse, I'd expect.


All theory; no implementation. Also, distance-vector routing is inherently painful in large networks.
Back to index