[Olsr-users] getting second best route from dikjstra's algorithm

[Vigneswaran R]

On 06/13/2013 06:40 PM, Henning Rogge wrote:
> On 06/13/2013 02:48 PM, Vigneswaran R wrote:
>> Hello,
>>
>> 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.

True.. We are just thinking of a mesh kind of network where this may be 
of help.

> 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.

Good idea! Let us try.


Regards,
Vignesh