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. © 2011 Springer-Verlag.
CITATION STYLE
D’Angelo, G., D’Emidio, M., Frigioni, D., & Maurizio, V. (2011). A speed-up technique for distributed shortest paths computation. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 6783 LNCS, pp. 578–593). https://doi.org/10.1007/978-3-642-21887-3_44
Mendeley helps you to discover research relevant for your work.