The drinking philosophers problem
ACM Transactions on Programming Languages and Systems (TOPLAS) - Lecture notes in computer science Vol. 174
Concurrency in heavily loaded neighborhood-constrained systems
ACM Transactions on Programming Languages and Systems (TOPLAS)
Leader election algorithms for mobile ad hoc networks
DIALM '00 Proceedings of the 4th international workshop on Discrete algorithms and methods for mobile computing and communications
Competitive concurrent distributed queuing
Proceedings of the twentieth annual ACM symposium on Principles of distributed computing
The Arrow Distributed Directory Protocol
DISC '98 Proceedings of the 12th International Symposium on Distributed Computing
Analysis of link reversal routing algorithms for mobile ad hoc networks
Proceedings of the fifteenth annual ACM symposium on Parallel algorithms and architectures
A Highly Adaptive Distributed Routing Algorithm for Mobile Wireless Networks
INFOCOM '97 Proceedings of the INFOCOM '97. Sixteenth Annual Joint Conference of the IEEE Computer and Communications Societies. Driving the Information Revolution
Dynamic analysis of the arrow distributed protocol
Proceedings of the sixteenth annual ACM symposium on Parallelism in algorithms and architectures
Analysis of Link Reversal Routing Algorithms
SIAM Journal on Computing
An asynchronous leader election algorithm for dynamic networks
IPDPS '09 Proceedings of the 2009 IEEE International Symposium on Parallel&Distributed Processing
Brief announcement: full reversal routing as a linear dynamical system
Proceedings of the twenty-third annual ACM symposium on Parallelism in algorithms and architectures
Full reversal routing as a linear dynamical system
SIROCCO'11 Proceedings of the 18th international conference on Structural information and communication complexity
SIROCCO'11 Proceedings of the 18th international conference on Structural information and communication complexity
Efficient checking of link-reversal-based concurrent systems
CONCUR'12 Proceedings of the 23rd international conference on Concurrency Theory
Hi-index | 0.00 |
We analyze the correctness and the complexity of two well-known routing algorithms, introduced by Gafni and Bertsekas (1981): By reversing the directions of some edges, these algorithms transform an arbitrary directed acyclic input graph into an output graph with at least one route from each node to a special destination node (while maintaining acyclicity). The resulting graph can thus be used to route messages in a loop-free manner. Gafni and Bertsekas implement these algorithms by assigning to each node of the graph an unbounded "height" in some total order. The relative order of the heights of two neighboring nodes induces a logical direction on the edge between them; the direction of an edge is reversed by modifying the height of one endpoint. In this work, we present a novel formalization for these algorithms based only on directed graphs with binary labels for edges. Using this formalization, we define a distributed algorithm for establishing routes in acyclic graphs, and we derive requirements on the input graph for correctness of the algorithm. The algorithms of Gafni and Bertsekas are special cases of our more general algorithm. Moreover, this simple formalization allows us to give an exact complexity analysis. In particular, we provide an expression for the exact number of steps taken by each node during an execution of the algorithm, and prove that this complexity only depends on the input graph.