Rendezvous in Distributed Systems

Rendezvous in Distributed Systems

EnglishPaperback / softbackPrint on demand
Gu, Zhaoquan
Springer Verlag, Singapore
EAN: 9789811099397
Print on demand
Delivery on Friday, 21. of August 2026
CZK 2,116
Common price CZK 2,351
Discount 10%
pc
Do you want this product today?
Megabooks Praha Korunní
not available
Librairie Francophone Praha Štěpánská
not available
Megabooks Ostrava
not available
Megabooks Olomouc
not available
Megabooks Plzeň
not available
Megabooks Brno
not available
Megabooks Hradec Králové
not available
Megabooks České Budějovice
not available
Megabooks Liberec
not available

Detailed information

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. 

EAN 9789811099397
ISBN 9811099391
Binding Paperback / softback
Publisher Springer Verlag, Singapore
Publication date August 12, 2018
Pages 262
Language English
Dimensions 235 x 155
Country Singapore
Readership Professional & Scholarly
Authors Gu, Zhaoquan; Hua, Qiang-Sheng; Lau, Francis C.M.; Wang, Yuexuan
Illustrations XIX, 262 p. 99 illus., 22 illus. in color.
Edition Softcover reprint of the original 1st ed. 2017
Manufacturer information
The manufacturer's contact information is currently not available online, we are working intensively on the axle. If you need information, write us on [email protected], we will be happy to provide it.