Full Reversal Routing as a Linear Dynamical System

Link reversal is a versatile algorithm design paradigm, originally proposed by Gafni and Bertsekas in 1981 for routing, and subsequently applied to other problems includingmutual exclusion and resource allocation. Although these algorithms arewell-known, until nowthere have been only preliminary results on time complexity, even for the simplest link reversal scheme for routing, called FullReversal (FR). In this paper we tackle this open question for arbitrary communication graphs. Our central technical insight is to describe the behavior of FR as a dynamical system, and to observe that this systemis linear in the min-plus algebra. Fromthis characterization, we derive the first exact formula for the time complexity: Given any node in any (acyclic) graph, we present an exact formula for the time complexity of that node, in terms of some simple properties of the graph. These results for FR are instrumental in analyzing a broader class of link reversal routing algorithms, as we show in a companion paper that such algorithms can be reduced to FR. In the current paper, we further demonstrate the utility of our formulas by using them to show the previously unknown fact that FR is time-efficient when executed on trees.

[1]  Matthias Függer,et al.  Partial is Full , 2011, SIROCCO.

[2]  Nitin H. Vaidya,et al.  A Mutual Exclusion Algorithm for Ad Hoc Mobile Networks , 2001, Wirel. Networks.

[3]  Nitin H. Vaidya,et al.  GeoTORA: a protocol for geocasting in mobile ad hoc networks , 2000, Proceedings 2000 International Conference on Network Protocols.

[4]  Sergio Rajsbaum,et al.  Analysis of Distributed Algorithms based on Recurrence Relations (Preliminary Version) , 1991, WDAG.

[5]  Maurice Herlihy,et al.  Self-stabilizing distributed queuing , 2006 .

[6]  Kerry Raymond,et al.  A tree-based algorithm for distributed mutual exclusion , 1989, TOCS.

[7]  Nitin H. Vaidya,et al.  Leader election algorithms for mobile ad hoc networks , 2000, DIALM '00.

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

[9]  Jennifer L. Welch,et al.  Routing without ordering , 2009, SPAA '09.

[10]  Shmuel Zaks,et al.  A lower bound on the period length of a distributed scheduler , 2005, Algorithmica.

[11]  Nadjib Badache,et al.  A Self-Stabilizing Leader Election Algorithm in Highly Dynamic Ad Hoc Mobile Networks , 2008, IEEE Transactions on Parallel and Distributed Systems.

[12]  Mohamed Naimi,et al.  A Log(N) Distributed Mutual Exclusion Algorithm Based on Path Reversal , 1996, J. Parallel Distributed Comput..

[13]  Eli Gafni,et al.  Concurrency in heavily loaded neighborhood-constrained systems , 1989, ICDCS.

[14]  M. S. Corson,et al.  A highly adaptive distributed routing algorithm for mobile wireless networks , 1997, Proceedings of INFOCOM '97.

[15]  Srikanta Tirthapura,et al.  Analysis of Link Reversal Routing Algorithms , 2005, SIAM J. Comput..

[16]  Dimitri P. Bertsekas,et al.  Distributed Algorithms for Generating Loop-Free Routes in Networks with Frequently Changing Topology , 1981, IEEE Trans. Commun..

[17]  Geert Jan Olsder,et al.  Max Plus at Work-Modelling and Analysis of Synchronized Systems , 2006 .

[18]  K. Mani Chandy,et al.  The drinking philosophers problem , 1984, ACM Trans. Program. Lang. Syst..

[19]  Jennifer L. Welch,et al.  Link Reversal: How to Play Better to Work Less , 2009, ALGOSENSORS.

[20]  Jennifer L. Welch,et al.  An asynchronous leader election algorithm for dynamic networks , 2009, 2009 IEEE International Symposium on Parallel & Distributed Processing.

[21]  K. Mani Chandy,et al.  An example of stepwise refinement of distributed programs: quiescence detection , 1986, TOPL.

[22]  Srikanta Tirthapura,et al.  Analysis of link reversal routing algorithms for mobile ad hoc networks , 2003, SPAA '03.

[23]  Hagit Attiya,et al.  A Provably Starvation-Free Distributed Directory Protocol , 2010, SSS.