Muutke küpsiste eelistusi

E-raamat: Rendezvous in Distributed Systems: Theory, Algorithms and Applications

, , ,
  • Formaat: PDF+DRM
  • Ilmumisaeg: 22-Aug-2017
  • Kirjastus: Springer Verlag, Singapore
  • Keel: eng
  • ISBN-13: 9789811036804
Teised raamatud teemal:
  • Formaat - PDF+DRM
  • Hind: 110,53 €*
  • * hind on lõplik, st. muud allahindlused enam ei rakendu
  • Lisa ostukorvi
  • Lisa soovinimekirja
  • See e-raamat on mõeldud ainult isiklikuks kasutamiseks. E-raamatuid ei saa tagastada.
Rendezvous in Distributed Systems: Theory, Algorithms and ApplicationsSuurem pilt
  • Formaat: PDF+DRM
  • Ilmumisaeg: 22-Aug-2017
  • Kirjastus: Springer Verlag, Singapore
  • Keel: eng
  • ISBN-13: 9789811036804
Teised raamatud teemal:

DRM piirangud

  • Kopeerimine (copy/paste):

    ei ole lubatud

  • Printimine:

    ei ole lubatud

  • Kasutamine:

    Digitaalõiguste kaitse (DRM)
    Kirjastus on väljastanud selle e-raamatu krüpteeritud kujul, mis tähendab, et selle lugemiseks peate installeerima spetsiaalse tarkvara. Samuti peate looma endale  Adobe ID Rohkem infot siin. E-raamatut saab lugeda 1 kasutaja ning alla laadida kuni 6'de seadmesse (kõik autoriseeritud sama Adobe ID-ga).

    Vajalik tarkvara
    Mobiilsetes seadmetes (telefon või tahvelarvuti) lugemiseks peate installeerima selle tasuta rakenduse: PocketBook Reader (iOS / Android)

    PC või Mac seadmes lugemiseks peate installima Adobe Digital Editionsi (Seeon tasuta rakendus spetsiaalselt e-raamatute lugemiseks. Seda ei tohi segamini ajada Adober Reader'iga, mis tõenäoliselt on juba teie arvutisse installeeritud )

    Seda e-raamatut ei saa lugeda Amazon Kindle's. 

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. 

Arvustused

The book is a comprehensive and valuable collection about the solutions of rendezvous problems encountered in distributed systems. Each of the twenty chapters has many figures, examples and summaries helping the reader to assimilate in an easier manner the complex concepts and algorithms that are exposed. The book has the potential to become a reference one for students, researchers and practitioners to fully understand the role of rendezvous processes in distributed systems . (Dana Petcu, zbMATH 1393.68006, 2018)

Part I Distributed Rendezvous Theory
1 Distributed Systems
3(12)
1.1 What Is Distributed System?
3(1)
1.2 Local Area Networks
4(3)
1.3 Email
7(1)
1.4 Wireless Sensor Networks
7(2)
1.5 Cognitive Radio Networks
9(2)
1.6 Telephone Networks
11(4)
References
12(3)
2 Distributed Computing
15(8)
2.1 What Is Distributed Computing?
15(2)
2.2 Communication Model
17(2)
2.3 Information Incompleteness
19(1)
2.4 Timing and Synchrony
20(3)
References
22(1)
3 Rendezvous Theory
23(16)
3.1 What Is the Rendezvous Problem?
23(1)
3.2 Rendezvous in Multichannel Wireless Networks
24(1)
3.3 Rendezvous in Cognitive Radio Networks
25(2)
3.4 Rendezvous in Distributed Systems
27(1)
3.5 Distributed Rendezvous Algorithms
28(11)
3.5.1 Distributed Telephone Coordination Algorithms
28(2)
3.5.2 Distributed Rendezvous Algorithms for Multichannel Networks
30(2)
3.5.3 Distributed Rendezvous Algorithms for Cognitive Radio Networks
32(3)
References
35(4)
4 Rendezvous Categories
39(14)
4.1 Symmetric and Asymmetric Algorithms
39(1)
4.2 Synchronous and Asynchronous
40(3)
4.3 Symmetric and Asymmetric Port Settings
43(1)
4.4 Anonymous and Non-anonymous Entities
44(1)
4.5 Oblivious and Non-oblivious Port Labeling
45(2)
4.6 Rendezvous Categories
47(6)
References
50(3)
Part II Blind Rendezvous in Distributed Systems
5 Blind Rendezvous Problem
53(8)
5.1 System Model
54(2)
5.2 Metrics
56(1)
5.3 Problem Definition
57(2)
5.4 Challenges
59(1)
5.5
Chapter Summary
60(1)
References
60(1)
6 Asymmetric Blind Rendezvous Algorithms
61(12)
6.1 Synchronous and Port-Symmetric Rendezvous
61(3)
6.1.1 Smallest Port Accessing Algorithm
62(1)
6.1.2 Quorum-Based Channel Hopping
62(2)
6.2 Asynchronous and Port-Symmetric Rendezvous
64(3)
6.2.1 Asynchronous Quorum-Based Channel Hopping
64(2)
6.2.2 Sequential Accessing Algorithm
66(1)
6.3 Synchronous and Port-Asymmetric Rendezvous
67(1)
6.3.1 Modified Sequential Accessing Algorithm
68(1)
6.4 Asynchronous and Port-Asymmetric Rendezvous
68(2)
6.4.1 Sequential Access and Temporary Wait for Rendezvous
69(1)
6.5
Chapter Summary
70(3)
References
72(1)
7 Synchronous Blind Rendezvous Algorithms
73(4)
7.1 Expanded Sequential Accessing Algorithm
73(2)
7.2
Chapter Summary
75(2)
8 Asynchronous Blind Rendezvous Algorithms for Anonymous Users
77(26)
8.1 Generated Orthogonal Sequence (GOS)
78(1)
8.2 Deterministic Rendezvous Sequence (DRSEQ)
79(1)
8.3 Channel Rendezvous Sequence (CRSEQ) Algorithm
80(1)
8.4 Jump Stay Algorithm
81(2)
8.5 Disjoint Relaxed Different Set (DRDS) Based Rendezvous Algorithm
83(12)
8.5.1 Global Sequence (GS)
83(1)
8.5.2 Disjoint Relaxed Difference Set (DRDS)
84(1)
8.5.3 Equivalence of DRDS and Good GS
85(1)
8.5.4 DRDS Construction
86(5)
8.5.5 DRDS Based Rendezvous Algorithm
91(2)
8.5.6 Improved DRDS Based Rendezvous Algorithm
93(2)
8.6 Lower Bound for GS Based Rendezvous Algorithms
95(5)
8.7
Chapter Summary
100(3)
References
101(2)
9 Local Sequence (LS) Based Rendezvous Algorithms
103(20)
9.1 Local Sequence (LS)
104(1)
9.2 Ring Walk Algorithm
104(1)
9.3 Alternate Hop-and-Wait (AHW) Algorithm
105(2)
9.4 A Simple LS Based Rendezvous Algorithm
107(7)
9.5 A Modified LS Based Rendezvous Algorithm
114(6)
9.6
Chapter Summary
120(3)
References
121(2)
10 Blind Rendezvous for Multi-users Multihop System
123(8)
10.1 Algorithm Description
123(1)
10.2 Correctness and Complexity
124(1)
10.3 Discussions
125(1)
10.4
Chapter Summary
126(5)
References
127(4)
Part III Oblivious Blind Rendezvous in Distributed Systems
11 Oblivious Blind Rendezvous
131(10)
11.1 System Model
132(2)
11.2 Metrics
134(1)
11.3 Problem Definition
134(2)
11.4 Examples of Oblivious Blind Rendezvous
136(2)
11.5
Chapter Summary
138(3)
References
139(2)
12 Asymmetric Oblivious Blind Rendezvous Algorithms
141(8)
12.1 Port-Symmetric Rendezvous
141(2)
12.2 Synchronous and Port-Asymmetric Rendezvous
143(3)
12.3 Asynchronous and Port-Asymmetric Rendezvous
146(2)
12.4
Chapter Summary
148(1)
13 Oblivious Blind Rendezvous for Non-anonymous Users
149(26)
13.1 Synchronous Oblivious Blind Rendezvous
149(7)
13.1.1 Synchronous Check and Hop Algorithm
150(2)
13.1.2 Correctness and Complexity
152(4)
13.2 Asynchronous Oblivious Blind Rendezvous
156(9)
13.2.1 ID Hopping Algorithm
156(4)
13.2.2 Multi-step Port Hopping Algorithm
160(5)
13.3 Lower Bound for Oblivious Blind Rendezvous
165(7)
13.3.1 Adversary Assignment Graph
166(2)
13.3.2 A Loose Lower Bound
168(2)
13.3.3 A Refined Lower Bound
170(2)
13.4
Chapter Summary
172(3)
Reference
173(2)
14 Fully Distributed Rendezvous Algorithm for Non-anonymous Users
175(10)
14.1 Conversion Based Hopping Algorithm
175(2)
14.2 Correctness and Complexity
177(6)
14.3
Chapter Summary
183(2)
Reference
183(2)
15 Oblivious Blind Rendezvous for Anonymous Users
185(24)
15.1 Hardness of Anonymity
185(2)
15.2 Port-Symmetric Rendezvous
187(17)
15.2.1 Intuitive Ideas
188(2)
15.2.2 Stay or Random Selection Algorithm
190(1)
15.2.3 Synchronous Users Scenario
191(4)
15.2.4 Asynchronous Users Scenario
195(9)
15.3 Port-Asymmetric Rendezvous
204(3)
15.3.1 Random Picking Algorithm
204(2)
15.3.2 Random Prime Selection and Sequential Accessing Algorithm
206(1)
15.4
Chapter Summary
207(2)
References
208(1)
16 Oblivious Blind Rendezvous for Multi-user Multihop CRN
209(6)
16.1 Algorithm Description
209(1)
16.2 Correctness and Complexity
210(1)
16.3
Chapter Summary
211(4)
References
211(4)
Part IV Distributed Rendezvous Applications
17 Rendezvous in Heterogeneous Cognitive Radio Networks
215(18)
17.1 Preliminaries
216(4)
17.1.1 System Model
216(2)
17.1.2 Problem Definition
218(2)
17.1.3 Challenges
220(1)
17.2 Rendezvous for Fully Available Spectrum
220(8)
17.2.1 Rendezvous Scheme for Two Available Channels
221(4)
17.2.2 Traversing Pointer Algorithm
225(1)
17.2.3 Correctness and Complexity
226(2)
17.3 Rendezvous for Partially Available Spectrum
228(3)
17.3.1 Moving Traversing Pointer Algorithm
228(2)
17.3.2 Correctness and Complexity
230(1)
17.4
Chapter Summary
231(2)
References
231(2)
18 Rendezvous Search in a Graph
233(10)
18.1 Symmetry of Rendezvous Search
233(2)
18.2 Rendezvous Search Along a Cycle
235(2)
18.3 Rendezvous Search Algorithms
237(3)
18.4
Chapter Summary
240(3)
Reference
241(2)
19 Neighbor Discovery in Wireless Sensor Networks
243(12)
19.1 Motivational Example
244(1)
19.2 Problem Definition
245(2)
19.3 Brute Force Algorithm
247(1)
19.4 Relax Difference Set Based Algorithm
248(1)
19.5 Co-Prime Algorithm
249(2)
19.6
Chapter Summary
251(4)
Part V Conclusions and Future Works
20 Conclusions and Future Works
255
20.1 Conclusions
255(5)
20.2 Future Works
260
References
262
Zhaoquan Gu is a post-doctoral researcher at The University of Hong Kong, China, where his work primarily involves arithmetic and computing in distributed networks and systems. He received his PhD degree and BS degree, both in computer science, from Tsinghua University (THU) in 2015 and 2011, respectively. During his undergraduate studies, he joined the Special Pilot Class (Yao Class) at the Institute for Interdisciplinary Information Science (IIIS). His doctoral dissertation was awarded as one of the best PhD theses by the THU. He has published many articles in journals and for international conferences on arithmetic design in wireless sensor networks, cognitive radio networks, and distributed computing.

Yuexuan Wang is an honorary professor and research scientist at Department of Computer Science at the University of Hong Kong. She was a full professor of Computer Science and Deputy Dean of Institute Information Sciences (IIIS) at Tsinghua University, Beijing, China. Prof. Wang has been appointed as visiting professor at Mathematics and Computer Science Division of Argonne National Laboratory (USA), University of Texas at Dallas, the Chinese University of Hong Kong and the City University of Hong Kong. She was the recipient of China National Teaching Achievements Award First Prize in 2014, Beijing Higher Education Achievement Award Grand Prize and Tsinghua University Teaching Achievements Grand Prize in 2012. Her research interests focus on Network Science and Distributed Computing, especially distributed algorithms in wireless networks and next-generation Internet. She is program chair/member of several international conferences, including WASA 2015, INFOCOM2014, HPC2014, WiOpt2013, AAAS2012, CWSN2011, and etc. 

Qiang-Sheng Hua is currently an associate professor at the School of Computer Science and Technology of Huazhong University of Science and Technology (HUST). Before joining HUST, from 2011 to 2014, he was an assistant professor at the Institute for Interdisciplinary Information Sciences (IIIS), Tsinghua University. He received his PhD degree in computer science in 2009 from The University of Hong Kong, where he remained for the next two years as a post-doctoral fellow. He received his B. Eng. and M. Eng. degrees, both in computer science, from Central South University, China. He has published more than 40 articles for international conferences and journals, as well as several book chapters. He is an editor for KSII Transactions on Internet and Information Systems and has served as a reviewer for many journals. He is a technical program committee member for many international conferences including INFOCOM and ICPADS. He is also actively involved in research projects sponsored by the National Natural Science Foundation of China (NNSFC).





Francis Chi Moon Lau is a professor at The University of Hong Kong. He received his BSc degree in computer science from Acadia, and his M.Math and PhD degrees in computer science from Waterloo. He joined the Department of computer science at The University of Hong Kong in 1987 and served as the department head from 2000 to 2005. He is currently an Associate Dean of the Faculty of Engineering. His chief research interests include systems research (both practical and theoretical), and the application of computing to the arts, in particular music. He is editor-in-chief of the Journal of Interconnection Networks, and several other journals. He has co-authored two books and published more than 300 articles for journals and conferences.
Lisainfo e-raamatute kohta Lisainfo e-raamatute kohta
Püsilink: https://www.kriso.ee/db/97898110368042e.html
Märksõnad: