Synchronous Blind Rendezvous Algorithms
In this chapter, we present symmetric algorithms for the blind rendezvous problem of two synchronous users. In the settings, we fix Alg and Time as:
- PDF / 6,822,539 Bytes
- 263 Pages / 453.543 x 683.15 pts Page_size
- 74 Downloads / 243 Views
dezvous in Distributed Systems Theory, Algorithms and Applications
Rendezvous in Distributed Systems
Zhaoquan Gu Yuexuan Wang Qiang-Sheng Hua Francis C.M. Lau •
•
Rendezvous in Distributed Systems Theory, Algorithms and Applications
123
Qiang-Sheng Hua Huazhong University of Science and Technology Wuhan China
Zhaoquan Gu Guangzhou University Guangzhou China and
Francis C.M. Lau The University of Hong Kong Hong Kong China
The University of Hong Kong Hong Kong China Yuexuan Wang Zhejiang University Hangzhou China and The University of Hong Kong Hong Kong China
ISBN 978-981-10-3679-8 DOI 10.1007/978-981-10-3680-4
ISBN 978-981-10-3680-4
(eBook)
Library of Congress Control Number: 2017947849 © Springer Nature Singapore Pte Ltd. 2017 This work is subject to copyright. All rights are reserved by the Publisher, whether the whole or part of the material is concerned, specifically the rights of translation, reprinting, reuse of illustrations, recitation, broadcasting, reproduction on microfilms or in any other physical way, and transmission or information storage and retrieval, electronic adaptation, computer software, or by similar or dissimilar methodology now known or hereafter developed. The use of general descriptive names, registered names, trademarks, service marks, etc. in this publication does not imply, even in the absence of a specific statement, that such names are exempt from the relevant protective laws and regulations and therefore free for general use. The publisher, the authors and the editors are safe to assume that the advice and information in this book are believed to be true and accurate at the date of publication. Neither the publisher nor the authors or the editors give a warranty, express or implied, with respect to the material contained herein or for any errors or omissions that may have been made. The publisher remains neutral with regard to jurisdictional claims in published maps and institutional affiliations. Printed on acid-free paper This Springer imprint is published by Springer Nature The registered company is Springer Nature Singapore Pte Ltd. The registered company address is: 152 Beach Road, #21-01/04 Gateway East, Singapore 189721, Singapore
To my family who have supported me in the past years. —Zhaoquan Gu To my husband and son, Giulio and Francesco. —Yuexuan Wang To my family, especially to my son, Hua Hua. —Qiang-Sheng Hua To all readers who are interested in math and computer science.
Preface
A distributed system is a collection of autonomous units able to make decisions locally. Through cooperation, these distributed units can solve global computational problems together. This book is dedicated to one of the most fundamental processes in operating a distributed system, referred to as the rendezvous process. Rendezvous takes place when the external ports belonging to two neighboring units become connected, and they can communicate and exchange information through this connection. There are five dimensions in which to define an instance of rendezvous. First of all, the a
Data Loading...
