Performance Evaluation of using a Dynamic Shortest Path Algorithm in OLSRv2

Ulrich Herberg 1
1 HIPERCOM - High performance communication
Inria Paris-Rocquencourt, UP11 - Université Paris-Sud - Paris 11, Inria Saclay - Ile de France, X - École polytechnique, CNRS - Centre National de la Recherche Scientifique : UMR
Abstract : MANET routing protocols are designed to scale up to thousands of routers with frequent changes of the topology. In preference, MANET routing protocols should also support constrained low-power devices. One of the bottlenecks of scalability in link-state routing protocols is the performance of the shortest path algorithm (e.g. Dijkstra). In this document, we investigate the in-node performance of OLSRv2 and, in particular, study the benefits of using a dynamic shortest path (DSP) algorithm for this routing protocol. A DSP algorithm is an algorithm that adds or removes edges in the routing tree incrementally and calculates shortest paths, also incrementally. The performance in OLSRv2 with classic Dijkstra vs. DSP is evaluated, by comparing the CPU time for calculating paths in a large emulated network. Additionally, it is demonstrated that frequent topology changes due to mobility in MANETs lead to frequent routing table recalculations with only few routes updated each time. This property of MANETs makes the use of a DSP in OLSRv2 appropriate.
Type de document :
[Research Report] RR-7174, INRIA. 2010, pp.16
Liste complète des métadonnées

Littérature citée [12 références]  Voir  Masquer  Télécharger
Contributeur : Ulrich Herberg <>
Soumis le : mardi 12 janvier 2010 - 09:57:29
Dernière modification le : vendredi 25 mai 2018 - 12:02:06
Document(s) archivé(s) le : jeudi 18 octobre 2012 - 12:15:51


Fichiers produits par l'(les) auteur(s)


  • HAL Id : inria-00446110, version 1



Ulrich Herberg. Performance Evaluation of using a Dynamic Shortest Path Algorithm in OLSRv2. [Research Report] RR-7174, INRIA. 2010, pp.16. 〈inria-00446110〉



Consultations de la notice


Téléchargements de fichiers