A Speed-Up Technique for Distributed Shortest Paths Computation

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.

[1]  Giuseppe F. Italiano.  Distributed Algorithms for Updating Shortest Paths (Extended Abstract) , 1991, WDAG.

[2]  Albert,et al.  Emergence of scaling in random networks , 1999, Science.

[3]  Roch Guérin,et al.  Always Acyclic Distributed Path Computation , 2010, IEEE/ACM Transactions on Networking.

[4]  Alan L. Cox,et al.  On Count-to-Infinity Induced Forwarding Loops Ethernet Networks , 2006, Proceedings IEEE INFOCOM 2006. 25TH IEEE International Conference on Computer Communications.

[5]  Yuan’an Liu,et al.  A More Efficient Diffusing Update Algorithm For Loop-Free Routing , 2009, 2009 5th International Conference on Wireless Communications, Networking and Mobile Computing.

[6]  John M. Mcquillan,et al.  Adaptive routing algorithms for distributed computer networks , 1974 .

[7]  Daniele Frigioni,et al.  A New Fully Dynamic Algorithm for Distributed Shortest Paths and Its Experimental Evaluation , 2010, SEA.

[8]  Nancy A. Lynch,et al.  Distributed Algorithms , 1992, Lecture Notes in Computer Science.

[9]  J. J. Garcia-Luna-Aceves,et al.  Loop-free routing using diffusing computations , 1993, TNET.

[10]  Eugene Ch'ng,et al.  Rethinking the service model: Scaling Ethernet to a million nodes , 2004 .

[11]  Albert-László Barabási,et al.  Statistical mechanics of complex networks , 2001, ArXiv.

[12]  Chenglin Zhao,et al.  PN Code Sequence Estimation Based on SOM Neural Network , 2009, 2009 5th International Conference on Wireless Communications, Networking and Mobile Computing.

[13]  Daniele Frigioni,et al.  Engineering a New Algorithm for Distributed Shortest Paths on Dynamic Networks , 2012, Algorithmica.

[14]  Daniele Frigioni,et al.  Partially dynamic efficient algorithms for distributed shortest paths , 2010, Theor. Comput. Sci..

[15]  J. Moy,et al.  OSPF: Anatomy of an Internet Routing Protocol , 1998 .

[16]  Dimitri P. Bertsekas,et al.  Data Networks , 1986 .