Engineering a New Algorithm for Distributed Shortest Paths on Dynamic Networks
- 586 Downloads
We study the problem of dynamically updating all-pairs shortest paths in a distributed network while edge update operations occur to the network. We consider the practical case of a dynamic network in which an edge update can occur while one or more other edge updates are under processing. A node of the network might be affected by a subset of these changes, thus being involved in the concurrent executions related to such changes.
In this paper, we provide a new algorithm for this problem, and experimentally compare its performance with respect to those of the most popular solutions in the literature: the classical distributed Bellman-Ford method, which is still used in real network and implemented in the RIP protocol, and DUAL, the Diffuse Update ALgorithm, which is part of CISCO’s widely used EIGRP protocol. As input to the algorithms, we used both real-world and artificial instances of the problem. The experiments performed show that the space occupancy per node required by the new algorithm is smaller than that required by both Bellman-Ford and DUAL. In terms of messages, the new algorithm outperforms both Bellman-Ford and DUAL on the real-world topologies, while on artificial instances, the new algorithm sends a number of messages that is more than that of DUAL and much smaller than that of Bellman-Ford.
KeywordsShortest paths Distributed networks Dynamic algorithms Concurrent update Experimental analysis
Support for the IPv4 Routed/24 Topology Dataset is provided by National Science Foundation, US Department of Homeland Security, WIDE Project, Cisco Systems, and CAIDA.
- 1.Omnet++: the discrete event simulation environment. http://www.omnetpp.org/
- 9.Cicerone, S., D’Angelo, G., Di Stefano, G., Frigioni, D., Maurizio, V.: A new fully dynamic algorithm for distributed shortest paths and its experimental evaluation. In: Proceedings of the 9th International Symposium on Experimental Algorithms (SEA 2010). Lecture Notes in Computer Science, vol. 6049, pp. 59–70 (2010) Google Scholar
- 10.Cicerone, S., D’Angelo, G., Stefano, G.D., Frigioni, D., Petricola, A.: Partially dynamic algorithms for distributed shortest paths and their experimental evaluation. J. Comput. 2(9), 16–26 (2007) Google Scholar
- 15.Hyun, Y., Huffaker, B., Andersen, D., Aben, E., Shannon, C., Luckie, M., Claffy, K.: The CAIDA IPv4 Routed/24 Topology Dataset. http://www.caida.org/data/active/ipv4_routed_24_topology_dataset.xml
- 17.McQuillan, J.: Adaptive routing algorithms for distributed computer networks. Technical Report BBN Report 2831, Cambridge, MA (1974) Google Scholar
- 18.Moy, J.T.: OSPF-Anatomy of an Internet Routing Protocol. Addison-Wesley, Reading (1998) Google Scholar
- 23.Rosen, E.C.: The updating protocol of arpanet’s new routing algorithm. Comput. Netw. 4, 11–19 (1980) Google Scholar