[OLSR-users] Bellman-Ford without loops used in AODV RFC

[Benjamin Henrion]

Hi,

I just read the AODV RFC where they speak about BF without loops:

"The operation of AODV is loop-free, and by avoiding the Bellman-Ford
``counting to infinity'' problem offers quick convergence when the
ad hoc network topology changes (typically, when a node moves in
the network).  When links break, AODV causes the affected set of
nodes to be notified so that they are able to invalidate the routes
using the lost link."

Do you know where I could find examples of this Bellman Ford algo
without this counting to infinity problem?

I would be interested to have in OLSR.

-- 
Benjamin Henrion <(spam-protected)>
FFII Brussels - +32-484-566109 - +32-2-4148403