Skip to Main content Skip to Navigation
Conference papers

A Speed-Up Technique for Distributed Shortest Paths Computation

Gianlorenzo d'Angelo 1, 2 Mattia d'Emidio 1 Daniele Frigioni 1 Vinicio Maurizio 1 
2 MASCOTTE - Algorithms, simulation, combinatorics and optimization for telecommunications
CRISAM - Inria Sophia Antipolis - Méditerranée , Laboratoire I3S - COMRED - COMmunications, Réseaux, systèmes Embarqués et Distribués
Abstract : We propose a simple and practical speed-up technique, which can be combined with every distance vector routing algorithm based on shortest paths, allowing to reduce the total number of messages sent by that algorithm. We combine the new technique with two algorithms known in the literature: DUAL, which is part of CISCO's widely used EIGRP protocol, and the recent DUST, which has been shown to be very effective on networks with power law node degree distribution. We give experimental evidence that these combinations lead to an important gain in terms of the number of messages sent by DUAL and DUST at the price of a little increase in terms of space occupancy per node.
Document type :
Conference papers
Complete list of metadata
Contributor : Gianlorenzo D'Angelo Connect in order to contact the contributor
Submitted on : Wednesday, November 23, 2011 - 2:51:50 PM
Last modification on : Saturday, June 25, 2022 - 11:06:55 PM
Long-term archiving on: : Friday, February 24, 2012 - 2:27:07 AM


Files produced by the author(s)




Gianlorenzo d'Angelo, Mattia d'Emidio, Daniele Frigioni, Vinicio Maurizio. A Speed-Up Technique for Distributed Shortest Paths Computation. 11th International Conference on Computational Science and Its Applications (ICCSA 2011), Jun 2011, Santander, Spain. pp.578-593, ⟨10.1007/978-3-642-21887-3_44⟩. ⟨hal-00644049⟩



Record views


Files downloads