Data networks
Loop-free routing using diffusing computations
IEEE/ACM Transactions on Networking (TON)
Fully dynamic algorithms for maintaining shortest paths trees
Journal of Algorithms
OSPF: Anatomy of an Internet Routing Protocol
OSPF: Anatomy of an Internet Routing Protocol
A fully dynamic algorithm for distributed shortest paths
Theoretical Computer Science - Latin American theoretical informatics
Partially dynamic efficient algorithms for distributed shortest paths
Theoretical Computer Science
A more efficient diffusing update algorithm for loop-free routing
WiCOM'09 Proceedings of the 5th International Conference on Wireless communications, networking and mobile computing
Always acyclic distributed path computation
IEEE/ACM Transactions on Networking (TON)
A speed-up technique for distributed shortest paths computation
ICCSA'11 Proceedings of the 2011 international conference on Computational science and its applications - Volume Part II
Engineering a new loop-free shortest paths routing algorithm
SEA'12 Proceedings of the 11th international conference on Experimental Algorithms
Hi-index | 0.00 |
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 this paper we present Distributed Computation Pruning (DCP), a new technique, which can be combined with every distance-vector 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, 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.