Link reversal is a versatile algorithm design technique that has been used in numerous distributed algorithms for a variety of problems. The common thread in these algorithms is that the distributed system is viewed as a graph, with vertices representing the computing nodes and edges representing some other feature of the system (for instance, point-to-point communication channels or a conflict relationship). Each algorithm assigns a virtual direction to the edges of the graph, producing a directed version of the original graph. As the algorithm proceeds, the virtual directions of some of the links in the graph change in order to accomplish some algorithm-specific goal. The criterion for changing link directions is based on information that is local to a node (such as the node having no outgoing links) and thus this approach scales well, a feature that is desirable for distributed algorithms. This monograph presents, in a tutorial way, a representative sampling of the work on link-reversal-based distributed algorithms. The algorithms considered solve routing, leader election, mutual exclusion, distributed queueing, scheduling, and resource allocation. The algorithms can be roughly divided into two types, those that assume a more abstract graph model of the networks, and those that take into account more realistic details of the system. In particular, these more realistic details include the communication between nodes, which may be through asynchronous message passing, and possible changes in the graph, for instance, due to movement of the nodes. We have not attempted to provide a comprehensive survey of all the literature on these topics. Instead, we have focused in depth on a smaller number of fundamental papers, whose common thread is that link reversal provides a way for nodes in the system to observe their local neighborhoods, take only local actions, and yet cause global problems to be solved. We conjecture that future interesting uses of link reversal are yetto be discovered. Table of Contents: Introduction / Routing in a Graph: Correctness / Routing in a Graph: Complexity / Routing and Leader Election in a Distributed System / Mutual Exclusion in a Distributed System / Distributed Queueing / Scheduling in a Graph / Resource Allocation in a Distributed System / Conclusion

Autorentext

Jennifer Welch received her Ph.D. in Computer Science from MIT in 1988. She is currently a professor in the Department of Computer Science and Engineering at Texas A&M University. She has published numerous technical papers on the theory of distributed computing, is a coauthor on a textbook, has served on the program committees for several international conferences, and is currently a member of the editorial board for the journal Distributed Computing. Her research interests include algorithms and lower bounds for distributed computing systems, in particular mobile and wireless networks, and distributed shared objects. Jennifer E. Walter received her Ph.D. from Texas A&M University in 2000. She is currently an associate professor and Chair of the Computer Science Department at Vassar College. Her research involves the development and simulation of distributed algorithms for mobile ad hoc networks and self-reconfigurable robotic systems.

Inhalt
Introduction.- Routing in a Graph: Correctness.- Routing in a Graph: Complexity.- Routing and Leader Election in a Distributed System.- Mutual Exclusion in a Distributed System.- Distributed Queueing.- Scheduling in a Graph.- Resource Allocation in a Distributed System.- Conclusion.