Enhancing the Computation of Distributed Shortest Paths on Power-law Networks in Dynamic Scenarios
- 151 Downloads
The problem of finding and keeping updated 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 the new technique 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 of memory requirements per node.
KeywordsDesign and analysis of algorithms Computer communication networks Distributed algorithms Dynamic algorithms Shortest paths Experimental analysis
- 5.Bu, T., Towsleym, D.: On distinguishing between internet power law topology generators. In: Proceedings 21st Annual Joint Conference of the IEEE Computer and Communications Societies (INFOCOM2002) IEEE , pp 37–48 (2002)Google Scholar
- 11.D’Angelo, G., D’Emidio, M., Frigioni, D., Romano, D.: Enhancing the computation of distributed shortest paths on real dynamic networks. In: Proceedings 1st Mediterranean Conference on Algorithms (MEDALG2012), volume 7659 of Lecture Notes in Computer Science, pp 148–158 (2012)Google Scholar
- 12.Elmeleegy, K., Cox, A.L., Ng, T.S.E.: On count-to-infinity induced forwarding loops in ethernet networks. In: Proceedings 25th IEEE Conference on Computer Communications (INFOCOM2006), pp 1–13 (2006)Google Scholar
- 16.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.Italiano, G.F.: Distributed algorithms for updating shortest paths. In: International Workshop on Distributed Algorithms, volume 579 of Lecture Notes in Computer Science, pp 200–211 (1991)Google Scholar
- 18.McQuillan, J.: Adaptive Routing Algorithms for Distributed Computer Networks. Technical Report BBN Report 2831. Cambridge, MA (1974)Google Scholar
- 19.Moy, J.T.: OSPF: Anatomy of an Internet routing protocol. Addison-Wesley, Reading (1998)Google Scholar
- 20.Myers, A., Ng, E., Zhang, H.: Rethinking the service model: Scaling ethernet to a million nodes. In: Proceedings 3rd Workshop on Hot Topics in Networks (ACM HotNets). ACM Press (2004)Google Scholar
- 22.OMNeT ++: Discrete event simulation environment. http://www.omnetpp.org.
- 27.Rosen, E.C.: The updating protocol of arpanet’s new routing algorithm. Comput. Netw. 4, 11–19 (1980)Google Scholar
- 29.Yao, N., Gao, E., Qin, Y., Zhang, H.: Rd: Reducing message overhead in DUAL. In: Proceedings 1st International Conference on Network Infrastructure and Digital Content (IC-NIDC2009), IEEE Press, pp 270–274 (2009)Google Scholar
- 30.Zhao, C., Liu, Y., Liu, K.: A more efficient diffusing update algorithm for loop-free routing. In: Proceedings 5th International Conference on Wireless Communications, Networking and Mobile Computing (WiCom2009), IEEE Press, pp 1–4 (2009)Google Scholar