Skip to main content

Conclusions and Future Works

  • Chapter
  • First Online:
Rendezvous in Distributed Systems
  • 697 Accesses

Abstract

In this book, we introduce the fundamental process in constructing a distributed system, which is referred to as rendezvous. A distributed system is composed of multiple autonomous entities that can make decisions locally. Through appropriate cooperation among these distributed entities, the system can be utilized to carry out some global computational tasks. In order for the entities to cooperate, communication links have to be made use of dynamically and effectively through their connected external ports; entities may fail to connect to the others if they make a wrong choice of the external ports. To be able to access the correct connected pair of external ports by the two entities involved in a communication act is essential in all cooperation, and the aim of the rendezvous algorithms we study is to achieve that efficiently.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 84.99
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 109.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info
Hardcover Book
USD 159.99
Price excludes VAT (USA)
  • Durable hardcover edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

References

  1. Alpern, S., & Lim, W. S. (1998). The symmetric rendezvous-evasion game. SIAM Journal of Control and Optimization, 36(3), 948–959.

    Article  MathSciNet  MATH  Google Scholar 

  2.  Alpern, S., & Gal, S. (2003). The theory of search games and rendezvous. Berlin: Springer.

    Google Scholar 

  3. Anderson, E. J., & Weber, R. R. (1990). The rendezvous problem on discrete locations. Journal of Applied Probability, 28, 839–851.

    Article  MathSciNet  MATH  Google Scholar 

  4. Chen, L., Bian, K., Chen, L., Liu, C., Park, J.-M. J., & Li, X. (2014). A Group-theoretic framework for rendezvous in heterogeneous cognitive radio networks. In MobiHoc.

    Google Scholar 

  5. Gu, Z., Hua, Q.-S., & Dai, W. (2014). Fully distributed algorithms for blind rendezvous in cognitive radio networks. In MOBIHOC.

    Google Scholar 

  6. Li, G., Gu, Z., Lin, X., Pu, H., & Hua, Q-S. (2014). Deterministic distributed rendezvous algorithms for multi-radio cognitive radio networks. In MSWiM.

    Google Scholar 

  7. Paul, R., Jembre, Y. Z., & Choi, Y.-J. (2014). Multi-interface rendezvous in self-organizing cognitive radio networks. In DySPAN.

    Google Scholar 

  8. Yu, L., Liu, H., Leung, Y.-W., Chun, X.,& Lin, Z. (2013). Multiple radios for effective rendezvous in cognitive radio networks. In ICC.

    Google Scholar 

  9. Zhang, J.,& Zhang, Z. (2011). Initial link establishment in cognitive radio networks without common control channel. In WCNC.

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Zhaoquan Gu .

Rights and permissions

Reprints and permissions

Copyright information

© 2017 Springer Nature Singapore Pte Ltd.

About this chapter

Cite this chapter

Gu, Z., Wang, Y., Hua, QS., Lau, F.C.M. (2017). Conclusions and Future Works. In: Rendezvous in Distributed Systems. Springer, Singapore. https://doi.org/10.1007/978-981-10-3680-4_20

Download citation

  • DOI: https://doi.org/10.1007/978-981-10-3680-4_20

  • Published:

  • Publisher Name: Springer, Singapore

  • Print ISBN: 978-981-10-3679-8

  • Online ISBN: 978-981-10-3680-4

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics