Enhancing the computation of distributed shortest paths on real dynamic networks

Gianlorenzo d'Angelo 1 Mattia d'Emidio 2 Daniele Frigioni 2 Daniele Romano 2
1 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 : The problem of finding and updating shortest paths in distributed networks is considered crucial in today's practical applications. In the recent past, there has been a renewed interest in devising new efficient distance-vector algorithms as an attractive alternative to link-state solutions for large-scale Ethernet networks, in which scalability and reliability are key issues or the nodes can have limited storage capabilities. In this paper we present Distributed Computation Pruning (DCP), a new 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 and its space occupancy per node. To check its effectiveness, we combined DCP with DUAL (Diffuse Update ALgorithm), one of the most popular distance-vector algorithm in the literature, which is part of CISCO's widely used EIGRP protocol, and with the recently introduced LFR (Loop Free Routing) which has been shown to have good performances on real networks. We give experimental evidence that these combinations lead to a significant gain both in terms of number of messages sent and memory requirements per node.
Document type :
Conference papers
Complete list of metadatas

Cited literature [19 references]  Display  Hide  Download

https://hal.inria.fr/hal-00755395
Contributor : Gianlorenzo d'Angelo <>
Submitted on : Wednesday, November 21, 2012 - 10:43:34 AM
Last modification on : Monday, November 5, 2018 - 3:36:03 PM
Long-term archiving on : Friday, February 22, 2013 - 3:47:19 AM

File

main.pdf
Files produced by the author(s)

Identifiers

Collections

Citation

Gianlorenzo d'Angelo, Mattia d'Emidio, Daniele Frigioni, Daniele Romano. Enhancing the computation of distributed shortest paths on real dynamic networks. 1st Mediterranean Conference on Algorithms, Dec 2012, Ein-Gedi, Israel. pp.148-158, ⟨10.1007/978-3-642-34862-4_11⟩. ⟨hal-00755395⟩

Share

Metrics

Record views

403

Files downloads

199