Advertisement

Regular Register: An Implementation in a Churn Prone Environment

  • Roberto Baldoni
  • Silvia Bonomi
  • Michel Raynal
Part of the Lecture Notes in Computer Science book series (LNCS, volume 5869)

Abstract

Due to their capability to hide the complexity generated by the messages exchanged between processes, shared objects are one of the main abstractions provided to the developers of distributed applications. Among all the shared objects, the register object is fundamental. Several protocols have been proposed to build fault resilient registers on top of message-passing system, but, unfortunately, failure are not the only challenge in modern distributed systems. New issues arise from the dynamicity introduced in the system by the continuous arrival and departure of nodes (churn phenomenon). This paper addresses the construction of a single writer/multiple readers regular register in a distributed system affected by the continuous arrival/departure of participants. In particular, a general protocol implementing a regular register is proposed and feasibility conditions on the arrival and departure of the processes are given. Interestingly, the protocol is proved correct under the assumption that the constraint on the churn is satisfied.

Keywords

Distribute Hash Table Arrival Model Node Distribution Read Operation Shared Object 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 1.
    Aguilera, M.K.: A Pleasant Stroll Through the Land of Infinitely Many Creatures. ACM SIGACT News, Distributed Computing Column 35(2), 36–59 (2004)CrossRefGoogle Scholar
  2. 2.
    Baldoni, R., Bertier, M., Raynal, M., Tucci, S.: Looking for a Definition of Dynamic Distributed Systems. In: Malyshkin, V.E. (ed.) PaCT 2007. LNCS, vol. 4671, pp. 1–14. Springer, Heidelberg (2007)CrossRefGoogle Scholar
  3. 3.
    Baldoni, R., Bonomi, S., Kermarrec, A.M., Raynal, M.: Implementing a Register in a Dynamic Distributed System. In: To appear in Proc. 29th IEEE Int’l Conference on Distributed Computing Systems (ICDCS 2009), June 2009. IEEE Computer Society Press, Montreal (2009), ftp://ftp.irisa.fr/techreports/2008/PI-1913.pdf Google Scholar
  4. 4.
    Dolev, S., Gilbert, S., Lynch, N., Shvartsman, A., Welch, J.: Geoquorum: Implementing Atomic Memory in Ad hoc Networks. In: Fich, F.E. (ed.) DISC 2003. LNCS, vol. 2848, pp. 306–320. Springer, Heidelberg (2003)CrossRefGoogle Scholar
  5. 5.
    Friedman, R., Raynal, M., Travers, C.: Abstractions for Implementing Atomic Objects in Distributed Systems. In: Anderson, J.H., Prencipe, G., Wattenhofer, R. (eds.) OPODIS 2005. LNCS, vol. 3974, pp. 73–87. Springer, Heidelberg (2006)CrossRefGoogle Scholar
  6. 6.
    Hadzilacos, V., Toueg, S.: Reliable Broadcast and Related Problems. In: Distributed Systems, pp. 97–145. ACM Press, New York (1993)Google Scholar
  7. 7.
    Godfrey, B., Shenker, S., Stoica, I.: Minimizing churn in distributed systems. In: Proceedings of the 2006 conference on Applications, technologies, architectures, and protocols for computer communications (SIGCOMM), pp. 147–158 (2006)Google Scholar
  8. 8.
    Gummadi, P., Dunn, R., Saroiu, S., Gribble, S., Levy, H., Zahorjan, J.: Measurement, modeling, and analysis of a peer-to-peer file-sharing workload. In: Proceedings of the nineteenth ACM symposium on Operating systems principles, pp. 314–329 (2003)Google Scholar
  9. 9.
    Ko, S., Hoque, I., Gupta, I.: Using Tractable and Realistic Churn Models to Analyze Quiescence Behavior of Distributed Protocols. In: Proc. 27th IEEE Int’l Symposium on Reliable Distributed Systems, SRDS 2008 (2008)Google Scholar
  10. 10.
    Kuhn, F., Schmid, S., Wattenhofer, R.: A self-repairing peer-to-peer system resilient to dynamic adversarial churn. In: Castro, M., van Renesse, R. (eds.) IPTPS 2005. LNCS, vol. 3640, pp. 13–23. Springer, Heidelberg (2005)CrossRefGoogle Scholar
  11. 11.
    Kuhn, F., Schmid, S., Smit, J., Wattenhofer, R.: A Blueprint for Constructing Peer-to-Peer Systems Robust to Dynamic Worst-Case Joins and Leaves. In: Proceeding of 14th IEEE International Workshop on Quality of Service, IWQoS (2006)Google Scholar
  12. 12.
    Lamport, L.: On Interprocess Communication, Part 1: Models, Part 2: Algorirhms. Distributed Computing 1(2), 77–101 (1986)MathSciNetCrossRefGoogle Scholar
  13. 13.
    Leonard, D., Yao, Z., Rai, V., Loguinov, D.: On lifetime-based node failure and stochastic resilience of decentralized peer-to-peer networks. IEEE/ACM Transaction on Networking 15(3), 644–656 (2007)CrossRefGoogle Scholar
  14. 14.
    Liben-Nowell, D., Balakrishnan, H., Karger, D.R.: Analysis of the Evolution of Peer-to-peer Systems. In: 21th ACM Symp. PODC, pp. 233–242. ACM Press, New York (2002)Google Scholar
  15. 15.
    Lynch, N., Shvartsman, A.: RAMBO: A Reconfigurable Atomic Memory Service for Dynamic Networks. In: Malkhi, D. (ed.) DISC 2002. LNCS, vol. 2508, pp. 173–190. Springer, Heidelberg (2002)CrossRefGoogle Scholar
  16. 16.
    Mostefaoui, A., Raynal, M., Travers, C., Peterson, S.: From Static Distributed Systems to Dynamic Systems. In: 24th IEEE Symposium on Reliable Distributed Systems (SRDS 2005), pp. 109–119. IEEE Computer Society Press, Los Alamitos (2005)CrossRefGoogle Scholar
  17. 17.
    Merritt, M., Taubenfeld, G.: Computing with Infinitely Many Processes. In: Herlihy, M.P. (ed.) DISC 2000. LNCS, vol. 1914, pp. 164–178. Springer, Heidelberg (2000)CrossRefGoogle Scholar
  18. 18.
    Roy, M., Bonnet, F., Querzoni, L., Bonomi, S., Killijian, M.O., Powell, D.: Geo-Registers: an Abstraction for Spatial-Based Distributed Computing. In: Baker, T.P., Bui, A., Tixeuil, S. (eds.) OPODIS 2008. LNCS, vol. 5401, pp. 534–537. Springer, Heidelberg (2008)CrossRefGoogle Scholar
  19. 19.
    Tucci Piergiovanni, S., Baldoni, R.: Connectivity in Eventually Quiescent Dynamic Distributed Systems. In: Bondavalli, A., Brasileiro, F., Rajsbaum, S. (eds.) LADC 2007. LNCS, vol. 4746, pp. 38–56. Springer, Heidelberg (2007)CrossRefGoogle Scholar
  20. 20.
    Tucci-Piergiovanni, S., Baldoni, R.: Eventual Leader Election in the Infinite Arrival Message-passing System Model. In: Taubenfeld, G. (ed.) DISC 2008. LNCS, vol. 5218, pp. 518–519. Springer, Heidelberg (2008), http://www.dis.uniroma1.it/~midlab/articoli/DISC08-tucci.pdf CrossRefGoogle Scholar
  21. 21.
    Tulone, D.: Ensuring strong data guarantees in highly mobile ad hoc networks via quorum systems. Ad Hoc Networks 5(8), 1251–1271 (2007)CrossRefGoogle Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2010

Authors and Affiliations

  • Roberto Baldoni
    • 1
  • Silvia Bonomi
    • 1
  • Michel Raynal
    • 2
  1. 1.Universitá La SapienzaRomaItaly
  2. 2.IRISAUniversité de RennesRennesFrance

Personalised recommendations