A Speed-Up Technique for Distributed Shortest Paths Computation - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Conference Papers Year : 2011

A Speed-Up Technique for Distributed Shortest Paths Computation

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.
Fichier principal
Vignette du fichier
dlp.pdf (403.91 Ko) Télécharger le fichier
Origin : Files produced by the author(s)

Dates and versions

hal-00644049 , version 1 (23-11-2011)

Identifiers

Cite

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⟩
127 View
233 Download

Altmetric

Share

Gmail Facebook X LinkedIn More