[OLSR-users] (no subject)

[Laurent Dehoey]

Hi Scol Scout

scol sout wrote:

> j'aimerai comprendre comment l'olsr utilise le chemin le plus cours  
> (DIJKSTRA).

DIJKSTRA in OLSR RFC 3626 is a multi stage process : neighbor 
discovering, then two hops neighbor discovering, topology 
building,...then adding all those nodes in the routing table.

An example of the process is well described in the 10th section of the RFC

> Ou se trouve DIJKSTRA dans votre code.

As a consequence of the above statement the complete DIJKSTRA mecanism 
is not located in a single place but you can look at the  
routing_table.c file in the source code and in particular the 
olsr_insert_routing_table, olsr_fill_routing_table_with_neighbors, 
olsr_fill_routing_table_with_two_hop_neighbors and 
olsr_calculate_routing_table functions.

You should also note that the code of olsr.org also include an optionnal 
but not RFC compatible way of route calculation that is not based on 
shortest path, but link quality path (LQ)

HTH

laurent

PS: note that this is an international mailling list so english is 
commonly considered the "lingua franca" ;-)

> Merci.


-------------- next part --------------
An HTML attachment was scrubbed...
URL: <http://lists.olsr.org/pipermail/olsr-users/attachments/20060110/4506eaae/attachment.html>