Skip to main content

Reversible Phase Transitions in a Structured Overlay Network with Churn

  • Conference paper
  • First Online:

Part of the book series: Lecture Notes in Computer Science ((LNCCN,volume 9944))

Abstract

Distributed applications break down when the underlying system has too many node or communication failures. In this paper, we propose a general approach to building distributed applications that lets them survive hostile conditions such as these failures. We extend an existing Structured Overlay Network (SON) that hosts a transactional replicated key/value store to be Reversible, i.e., it is able to regain its original functionality as the environment hostility recedes. For this paper we consider the environment hostility to be measured by the Churn parameter, i.e., the rate of node turnover (nodes failing and being replaced by new correct nodes). In order to describe the qualitative behavior of the SON at high churn, we introduce the concept of Phase of the SON. All nodes in a phase exhibit the same qualitative properties, which are different for the nodes in different phases. We demonstrate the existence of Phase Transitions (i.e., a significant fraction of nodes changes phase) as churn varies and show that our concept of phase is analogous to the macroscopic phase of physical systems. We empirically identify the Critical Points (i.e., when there exists more than one phase simultaneously in significant fractions of the system) observed in our experiments. We propose an API to allow the application layer to be informed about the current phase of a node. We analyze how the application layer can use this knowledge for self-adaptation, self-optimization and achieve reversibility in the application-level semantics.

This research is partially funded by the SyncFree project in the European Union Seventh Framework Programme under Grant Agreement No. 609551 and by the Erasmus Mundus Doctorate Programme under Grant Agreement No. 2012-0030. Authors would like to thank Manuel Bravo and Zhongmiao Li for their participation to refine the concept of Reversibility.

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

Buying options

Chapter
USD   29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD   39.99
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD   54.99
Price excludes VAT (USA)
  • Compact, lightweight 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

Learn about institutional subscriptions

References

  1. Aberer, K., Alima, L.O., Ghodsi, A., Girdzijauskas, S., Hauswirth, M., Haridi, S.: The essence of P2P: a reference architecture for overlay networks. In: Proceedings of P2P (2005)

    Google Scholar 

  2. Aberer, K., Datta, A., Hauswirth, M.: Route maintenance overheads in DHT overlays. In: Proceedings of WDAS (2004)

    Google Scholar 

  3. Aikat, J., Kaur, J., Smith, F.D., Jeffay, K.: Variability in TCP round-trip times. In: Proceedings of ACM SIGCOMM IMC (2003)

    Google Scholar 

  4. Alima, L.O., El-Ansary, S., Brand, P., Haridi, S.: DKS (n, k, f): a family of low communication, scalable and fault-tolerant infrastructures for p2p applications. In: Proceedings of CCGrid (2003)

    Google Scholar 

  5. Apel, S., Böhm, K.: Self-organization in overlay networks. In: CAiSE Workshop on Adaptive and Self-Managing Enterprise Applications (ASMEA) (2005)

    Google Scholar 

  6. Banaei-Kashani, F., Shahabi, C.: Criticality-based analysis and design of unstructured peer-to-peer networks as “complex systems”. In: Proceedings of CCGrid (2003)

    Google Scholar 

  7. Dijkstra, E.W.: Self-stabilizing systems in spite of distributed control. Commun. ACM 17(11), 643–644 (1974)

    Article  MATH  Google Scholar 

  8. El-Ansary, S., Aurell, E., Brand, P., Haridi, S.: Experience with a physics-style approach for the study of self properties in structured overlay networks. In: SELF-STAR: International Workshop on Self-* Properties in Complex Information Systems (2004)

    Google Scholar 

  9. El-Ansary, S., Aurell, E., Haridi, S.: A physics-inspired performance evaluation of a structured peer-to-peer overlay network. In: Proceedings of PDCN (2005)

    Google Scholar 

  10. Freedman, M.J., Lakshminarayanan, K., Rhea, S., Stoica, I.: Non-transitive connectivity and DHTs. In: Proceedings of WORLDS (2005)

    Google Scholar 

  11. Ghodsi, A.: Distributed k-ary system: algorithms for distributed hash tables. Ph.D. thesis, KTH, Sweden (2006)

    Google Scholar 

  12. Gummadi, K., Gummadi, R., Gribble, S., Ratnasamy, S., Shenker, S., Stoica, I.: The impact of DHT routing geometry on resilience and proximity. In: Proceedings of ACM SIGCOMM (2003)

    Google Scholar 

  13. Jelasity, M., Babaoglu, O.: T-Man: gossip-based overlay topology management. In: Brueckner, S.A., Di Marzo Serugendo, G., Hales, D., Zambonelli, F. (eds.) ESOA 2005. LNCS (LNAI), vol. 3910, pp. 1–15. Springer, Heidelberg (2006)

    Chapter  Google Scholar 

  14. Kong, J.S., Bridgewater, J.S.A., Roychowdhury, V.P.: Resilience of structured P2P systems under churn: the reachable component method. Comput. Commun. 31, 2109–2123 (2008)

    Article  Google Scholar 

  15. Krishnamurthy, S., Ardelius, J.: An analytical framework for the performance evaluation of proximity-aware structured overlays. Technical report, SICS, Sweden (2008)

    Google Scholar 

  16. Krishnamurthy, S., El-Ansary, S., Aurell, E., Haridi, S.: An analytical study of a structured overlay in the presence of dynamic membership. IEEE/ACM TON 16(4), 814–825 (2008)

    Article  Google Scholar 

  17. Krishnamurthy, S., El-Ansary, S., Aurell, E., Haridi, S.: Comparing maintenance strategies for overlays. In: Proceedings of PDP (2008)

    Google Scholar 

  18. Leitao, J., Pereira, J., Rodrigues, L.: Epidemic broadcast trees. In: SRDS 2007 (2007)

    Google Scholar 

  19. Liben-Nowell, D., Balakrishnan, H., Karger, D.: Analysis of the evolution of peer-to-peer systems. In: Proceedings of PODC (2002)

    Google Scholar 

  20. Mejías, B.: Beernet: A relaxed approach to the design of scalable systems with self-managing behaviour and transactional robust storage. Ph.D. thesis, UCL, Belgium (2010)

    Google Scholar 

  21. Paul, R.R., Van Roy, P., Vlassov, V.: Interaction between network partitioning and churn in a self-healing structured overlay network. In: Proceedings of ICPADS (2015)

    Google Scholar 

  22. Scholtes, I., Botev, J., Höhfeld, A., Schloss, H., Esch, M.: Awareness-driven phase transitions in very large scale distributed systems. In: Proceedings of SASO (2008)

    Google Scholar 

  23. Shafaat, T.M.: Partition tolerance and data consistency in structured overlay networks. Ph.D. thesis, KTH, Sweden (2013)

    Google Scholar 

  24. Stoica, I., Morris, R., Karger, D., Kaashoek, F., Balakrishnan, H.: Chord: A scalable peer-to-peer lookup service for internet applications. In: Proceedings of ACM SIGCOMM (2001)

    Google Scholar 

  25. Wikipedia. Phase (matter) (2016). https://en.wikipedia.org/wiki/Phase_(matter)

Download references

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Ruma R. Paul .

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2016 Springer International Publishing AG

About this paper

Cite this paper

Paul, R.R., Van Roy, P., Vlassov, V. (2016). Reversible Phase Transitions in a Structured Overlay Network with Churn. In: Abdulla, P., Delporte-Gallet, C. (eds) Networked Systems. NETYS 2016. Lecture Notes in Computer Science(), vol 9944. Springer, Cham. https://doi.org/10.1007/978-3-319-46140-3_26

Download citation

  • DOI: https://doi.org/10.1007/978-3-319-46140-3_26

  • Published:

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-319-46139-7

  • Online ISBN: 978-3-319-46140-3

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics