[Olsr-users] getting second best route from dikjstra's algorithm
Fri Jun 14 06:20:46 CEST 2013
On 06/13/2013 07:06 PM, Teco Boot wrote:
> There is something around that uses 2nd best next hop in cases where best path doesn't work. To be used for L2 retransmit. Loop prevention needs attention.
Ok, will search for that. I agree that loop prevention needs to be taken
> Op 13 jun. 2013, om 15:10 heeft Henning Rogge <(spam-protected)> het volgende geschreven:
>> On 06/13/2013 02:48 PM, Vigneswaran R wrote:
>>> Is there any way (API) to get the second best route to a destination
>>> from dikjtra's algorithm (when multiple routes are available between
>>> source and the destination)?
>> Difficult. I am not aware of such an algorithm.
>>> The idea is to write a plugin to get the second (third etc.,) best
>>> routes (for destinations) and keep them in separate routing tables.
>>> Later policy routing can be used to route different kinds of traffic
>>> through different paths (which are unused otherwise).
>> You don't want to use the second-best route for this anyways.
>> The second best route will be most likely the same as the best one, with some small change (maybe one/two links different). You want a second/third path that has a certain "distance" to the first one.
>> Theoretically you can do this by dijkstra again by adding "penalty" costs to every link that touches the "best route". Not sure if it would work out well.
>> Henning Rogge
>> Diplom-Informatiker Henning Rogge , Fraunhofer-Institut für
>> Kommunikation, Informationsverarbeitung und Ergonomie FKIE
>> Kommunikationssysteme (KOM)
>> Fraunhofer Straße 20, 53343 Wachtberg, Germany
>> Telefon +49 228 9435-961, Fax +49 228 9435 685
>> mailto:(spam-protected) http://www.fkie.fraunhofer.de
>> Olsr-users mailing list
More information about the Olsr-users