My Account Log in

1 option

Rendezvous in Distributed Systems : Theory, Algorithms and Applications / by Zhaoquan Gu, Yuexuan Wang, Qiang-Sheng Hua, Francis C.M. Lau.

SpringerLink Books Computer Science (2011-2024) Available online

View online
Format:
Book
Author/Creator:
Gu, Zhaoquan, author.
Wang, Yuexuan, author.
Hua, Qiang-Sheng, author.
Lau, Francis C. M., author.
Contributor:
SpringerLink (Online service)
Series:
Computer Science (Springer-11645)
Language:
English
Subjects (All):
Computer organization.
Algorithms.
Computer science--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.
Local Subjects:
Computer Systems Organization and Communication Networks.
Algorithm Analysis and Problem Complexity.
Mathematical Applications in Computer Science.
Computational Mathematics and Numerical Analysis.
Popular Computer Science.
Physical Description:
1 online resource (XIX, 262 pages) : 99 illustrations, 22 illustrations in color
Edition:
First edition 2017.
Contained In:
Springer eBooks
Place of Publication:
Singapore : Springer Singapore : Imprint: Springer, 2017.
System Details:
text file PDF
Summary:
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. .
Contents:
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.
Other Format:
Printed edition:
ISBN:
978-981-10-3680-4
9789811036804
Access Restriction:
Restricted for use by site license.

The Penn Libraries is committed to describing library materials using current, accurate, and responsible language. If you discover outdated or inaccurate language, please fill out this feedback form to report it and suggest alternative language.

Find

Home Release notes

My Account

Shelf Request an item Bookmarks Fines and fees Settings

Guides

Using the Find catalog Using Articles+ Using your account