Properties of Link Reversal Algorithms for Routing and Leader Election
Properties of Link Reversal Algorithms for Routing and Leader Election

Author: Tsvetomira Radeva

Publisher:

Published: 2013

Total Pages: 77

ISBN-13:

DOWNLOAD EBOOK

We present two link-reversal algorithms and some interesting properties that they satisfy. First, we describe the Partial Reversal (PR) algorithm [13], which ensures that the underlying graph structure is destination-oriented and acyclic. These properties of PR make it useful in routing protocols and algorithms for solving leader election and mutual exclusion. While proofs exist to establish the acyclicity property of PR, they rely on assigning labels to either the nodes or the edges in the graph. In this work we present simpler direct proof of the acyclicity property of partial reversal without using any external or dynamic labeling mechanisms. Second, we describe the leader election (LE) algorithm of [16], which guarantees that a unique leader is elected in an asynchronous network with a dynamically-changing communication topology. The algorithm ensures that, no matter what pattern of topology changes occurs, if topology changes cease, then eventually every connected component contains a unique leader and all nodes have directed paths to that leader. Our contribution includes a complexity analysis of the algorithm showing that after topology changes stop, no more than 0(n) elections occur in the system. We also provide a discussion on certain situations in which a new leader is elected (unnecessarily) when there is already another leader in the same connected component. Finally, we show how the LE algorithm can be augmented in such a way that nodes also have the shortest path to the leader.

Link Reversal Algorithms
Link Reversal Algorithms

Author: Jennifer Welch

Publisher: Springer Nature

Published: 2022-05-31

Total Pages: 93

ISBN-13: 3031020065

DOWNLOAD EBOOK

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 yet to 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

Link Reversal Algorithms
Link Reversal Algorithms

Author: Jennifer Welch

Publisher: Morgan & Claypool Publishers

Published: 2012

Total Pages: 106

ISBN-13: 1608450414

DOWNLOAD EBOOK

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 yet to 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

Structural Information and Communication Complexity
Structural Information and Communication Complexity

Author: Adrian Kosowski

Publisher: Springer Science & Business Media

Published: 2011-06-24

Total Pages: 328

ISBN-13: 3642222110

DOWNLOAD EBOOK

This book constitutes the refereed proceedings of the 18th International Colloquium on Structural Information and Communication Complexity, SIROCCO 2011, held in Gdańsk, Poland, in June 2011. The 24 revised full papers presented together with 1 survey lecture and 2 invited talks were carefully reviewed and selected from 57 submissions. The papers are organized in topical section on fault tolerance, routing, mobile agents, mobile robots, probabilistic methods, distributed algorithms on graphs, and ad-hoc networks.

Algorithmic Aspects of Wireless Sensor Networks
Algorithmic Aspects of Wireless Sensor Networks

Author: Shlomi Dolev

Publisher: Springer Science & Business Media

Published: 2009-10-26

Total Pages: 273

ISBN-13: 3642054331

DOWNLOAD EBOOK

ALGOSENSORS, the International International Workshop on Algorithmic - pectsofWirelessSensorNetworks, isanannualforumforpresentationofresearch on all algorithmic aspects of sensor networks, including the theory, design, an- ysis, implementation, and application of algorithms for sensor networks. The 5th edition of ALGOSENSORS was held during July 10-11, 2009, on Rhodes, Greece. There were 41 extended abstracts submitted to ALGOSENSORS this year, and this volume contains the 21 contributions selected by the Program C- mittee. All submitted papers were read and evaluated by at least three Program Committeemembers, assistedbyexternalreviewers.The?naldecisionregarding every paper was taken following an electronic discussion. The proceedings also include two two-page-long Brief Announcements (BA). TheseBAsarepresentationsofongoingworksforwhichfullpapersarenotready yet, or of recent results whose full description will soon be presented or has been recently presented in other conferences. Researchers use the BA track to quickly draw the attention of the community to their experiences, insights and results from ongoing distributed computing research and projects. ALGOSENSORS 2009 was organized in cooperation with the EATCS and ICALP 2009. The support of Ben-Gurion University, the Foundations of Ad- tiveNetworkedSocieties ofTinyArtefacts(FRONTS) project, andCTIisgra- fully acknowledged. August 2009 Shlomi Dolev S C T A E Organization ALGOSENSORS, the International International Workshop on Algorithmic - pects of WirelessSensor Networks, is an annual forum for researchpresentations on all algoritmicfacets of sensor networks.ALGOSENSORS 2009 wasorganized in cooperation with the EATCS and ICALP 2009.

Innovations and Advanced Techniques in Computer and Information Sciences and Engineering
Innovations and Advanced Techniques in Computer and Information Sciences and Engineering

Author: Tarek Sobh

Publisher: Springer Science & Business Media

Published: 2007-09-04

Total Pages: 548

ISBN-13: 1402062680

DOWNLOAD EBOOK

This book includes a set of rigorously reviewed world-class manuscripts addressing and detailing state-of-the-art research projects in the areas of Computer Science, Computer Engineering and Information Sciences. The book presents selected papers from the conference proceedings of the International Conference on Systems, Computing Sciences and Software Engineering (SCSS 2006). All aspects of the conference were managed on-line.

Distributed Algorithms for Message-Passing Systems
Distributed Algorithms for Message-Passing Systems

Author: Michel Raynal

Publisher: Springer Science & Business Media

Published: 2013-06-29

Total Pages: 518

ISBN-13: 3642381235

DOWNLOAD EBOOK

Distributed computing is at the heart of many applications. It arises as soon as one has to solve a problem in terms of entities -- such as processes, peers, processors, nodes, or agents -- that individually have only a partial knowledge of the many input parameters associated with the problem. In particular each entity cooperating towards the common goal cannot have an instantaneous knowledge of the current state of the other entities. Whereas parallel computing is mainly concerned with 'efficiency', and real-time computing is mainly concerned with 'on-time computing', distributed computing is mainly concerned with 'mastering uncertainty' created by issues such as the multiplicity of control flows, asynchronous communication, unstable behaviors, mobility, and dynamicity. While some distributed algorithms consist of a few lines only, their behavior can be difficult to understand and their properties hard to state and prove. The aim of this book is to present in a comprehensive way the basic notions, concepts, and algorithms of distributed computing when the distributed entities cooperate by sending and receiving messages on top of an asynchronous network. The book is composed of seventeen chapters structured into six parts: distributed graph algorithms, in particular what makes them different from sequential or parallel algorithms; logical time and global states, the core of the book; mutual exclusion and resource allocation; high-level communication abstractions; distributed detection of properties; and distributed shared memory. The author establishes clear objectives per chapter and the content is supported throughout with illustrative examples, summaries, exercises, and annotated bibliographies. This book constitutes an introduction to distributed computing and is suitable for advanced undergraduate students or graduate students in computer science and computer engineering, graduate students in mathematics interested in distributed computing, and practitioners and engineers involved in the design and implementation of distributed applications. The reader should have a basic knowledge of algorithms and operating systems.

Distributed Computing
Distributed Computing

Author: Ajay D. Kshemkalyani

Publisher: Cambridge University Press

Published: 2011-03-03

Total Pages: 0

ISBN-13: 9780521189842

DOWNLOAD EBOOK

Designing distributed computing systems is a complex process requiring a solid understanding of the design problems and the theoretical and practical aspects of their solutions. This comprehensive textbook covers the fundamental principles and models underlying the theory, algorithms and systems aspects of distributed computing. Broad and detailed coverage of the theory is balanced with practical systems-related issues such as mutual exclusion, deadlock detection, authentication, and failure recovery. Algorithms are carefully selected, lucidly presented, and described without complex proofs. Simple explanations and illustrations are used to elucidate the algorithms. Important emerging topics such as peer-to-peer networks and network security are also considered. With vital algorithms, numerous illustrations, examples and homework problems, this textbook is suitable for advanced undergraduate and graduate students of electrical and computer engineering and computer science. Practitioners in data networking and sensor networks will also find this a valuable resource. Additional resources are available online at www.cambridge.org/9780521876346.

Interconnections
Interconnections

Author: Radia Perlman

Publisher: Addison-Wesley Professional

Published: 2000

Total Pages: 566

ISBN-13: 9780201634488

DOWNLOAD EBOOK

Perlman, a bestselling author and senior consulting engineer for Sun Microsystems, provides insight for building more robust, reliable, secure and manageable networks. Coverage also includes routing and addressing strategies, VLANs, multicasting, IPv6, and more.