Rendezvous in Distributed Systems [electronic resource] : Theory, Algorithms and Applications /
Gu, Zhaoquan.author.
Wang, Yuexuan.author.
Hua, Qiang-Sheng.author.
Lau, Francis C.M.author.(orcid)0000-0003-1082-9333https://orcid.org/0000-0003-1082-9333aut
This book introduces novel solutions to the rendezvous problem in distributed systems, a fundamental problem that underpins the construction of many important functions in distributed systems and networks. The book covers rendezvous theories, distributed rendezvous algorithms, and rendezvous applications in practical systems, presents state-of-the-art rendezvous results and highlights the latest methods of rendezvous in distributed systems. It provides in particular an in-depth treatment of the blind rendezvous and oblivious blind rendezvous problems and their solutions. Further, it sheds new light on rendezvous applications in cognitive radio networks and rendezvous search in graphs. As such, it will also be of interest to readers from other research fields such as robotics, wireless sensor networks, and game theory. .
Includes bibliographical references.
Part I: Distributed Rendezvous Theory -- Chapter 1 Distributed Systems -- Chapter 2 Rendezvous Theory and Its Applications -- Part II: Blind Rendezvous in Distributed Systems -- Chapter 3 The Blind Rendezvous Problem -- Chapter 4 Global Sequence Based Rendezvous Algorithms -- Chapter 5 Local Sequence Based Rendezvous Algorithms -- Part III: Oblivious Blind Rendezvous in Distributed Systems -- Chapter 6 The Oblivious Blind Rendezvous Problem -- Chapter 7 Randomized Algorithms for Anonymous Users -- Chapter 8 Deterministic Algorithms for Non-anonymous Users -- Chapter 9 Fully Distributed Rendezvous Algorithms -- Part IV: Distributed Rendezvous Applications -- Chapter 10 Rendezvous in Cognitive Radio Networks -- Chapter 11 Rendezvous Search in Graphs -- Chapter 12 Rendezvous Games -- Part V: Conclusions and Future Works -- Chapter 13 Conclusions and Future Works.
This book introduces novel solutions to the rendezvous problem in distributed systems, a fundamental problem that underpins the construction of many important functions in distributed systems and networks. The book covers rendezvous theories, distributed rendezvous algorithms, and rendezvous applications in practical systems, presents state-of-the-art rendezvous results and highlights the latest methods of rendezvous in distributed systems. It provides in particular an in-depth treatment of the blind rendezvous and oblivious blind rendezvous problems and their solutions. Further, it sheds new light on rendezvous applications in cognitive radio networks and rendezvous search in graphs. As such, it will also be of interest to readers from other research fields such as robotics, wireless sensor networks, and game theory. .
Computer organization.
Algorithms.
Computer science-Mathematics.
Computer mathematics.
Computer science.
Computer Systems Organization and Communication Networks.
Algorithm Analysis and Problem Complexity.
Mathematical Applications in Computer Science.
Computational Mathematics and Numerical Analysis.
Popular Computer Science.