Abstract
Distributed systems with churn, or dynamic distributed systems, allow the processes to join and leave the system at will. In this paper, we present a new consistency condition for shared read-write registers which is based on multi-writer regularity, but allows for the likelihood of the register to lose its state with some probability; we call this a dynamic regular register. We then describe an algorithm for implementing a dynamic regular register using copies of the register distributed among the processes. When a process joins the system, it attempts to obtain an up-to-date copy of the data from other processes. Copies of the register are updated by broadcasting information. To model the dynamicity of the system with churn, we use a continuous-time birth-death process which is a special case of continuous-time Markov processes. Then, we analyze the probability and the time duration that the dynamic regular register system keeps its state, given the joining rate and the leaving rate of the processes.
This research was supported in part by NSF grant CCF 1018500 and NSF grant 0964696.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
References
Aguilera, M.K.: A pleasant stroll through the land of infinitely many creatures. SIGACT News Distributed Computing Column 35, 36–59 (2004)
Anceaume, E., Défago, X., Potop-Butucaru, M., Roy, M.: A framework for proving the self-organization of dynamic systems. CoRR abs/1011.2312 (2010)
Baldoni, R., Bertier, M., Raynal, M., Tucci-Piergiovanni, 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)
Baldoni, R., Bonomi, S., Kermarrec, A.M., Raynal, M.: Implementing a register in a dynamic distributed system. In: The 29th IEEE International Conference on Distributed Computing Systems (ICDCS 2009), pp. 639–647 (2009)
Baldoni, R., Bonomi, S., Raynal, M.: Regular register: An implementation in a churn prone environment. In: Kutten, S., Žerovnik, J. (eds.) SIROCCO 2009. LNCS, vol. 5869, pp. 15–29. Springer, Heidelberg (2010)
Bhat, U.N.: An Introduction to Queuing Theory. Birkhäuser, Basel (2008)
Dolev, S., Gilbert, S., Lynch, N.A., Shvartsman, A.A., Welch, J.L.: GeoQuorums: Implementing atomic memory in mobile ad hoc networks. In: Fich, F.E. (ed.) DISC 2003. LNCS, vol. 2848, pp. 306–320. Springer, Heidelberg (2003)
Gafni, E., Koutsoupias, E.: On uniform protocols. Tech. rep. (1998), http://www.cs.ucla.edu/~eli/eli.html
Gilbert, S., Lynch, N.A., Shvartsman, A.A.: Rambo: A robust, reconfigurable atomic memory service for dynamic networks. Distributed Computing 23(4), 225–272 (2010)
Kijima, M.: Markov Processes for Stochastic Modeling. Chapman & Hall, Boca Raton (1997)
Ko, S.Y., Hoque, I., Gupta, I.: Using tractable and realistic churn models to analyze quiescence behavior of distributed protocols. In: IEEE Symposium on Reliable Distributed Systems (SRDS 2008), pp. 259–268 (2008)
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: 14th IEEE International Workshop on Quality of Service (IWQoS 2006), pp. 12–19 (2006)
Lamport, L.: On interprocess communication, Part I: Models, Part II: Algorithms. Distributed Computing 1(2), 77–101 (1986)
Leonard, D., Yao, Z., Rai, V., Loguinov, D.: On lifetime-based node failure and stochastic resilience of decentralized peer-to-peer networks. IEEE/ACM Trans. Netw. 15, 644–656 (2007)
Lynch, N.A., Shvartsman, A.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)
Merritt, M., Taubenfeld, G.: Computing with infinitely many processes under assumptions on concurrency and participation. In: Herlihy, M.P. (ed.) DISC 2000. LNCS, vol. 1914, pp. 164–178. Springer, Heidelberg (2000)
Neely, M.J., Golubchik, L.: Utility optimization for dynamic peer-to-peer networks with tit-for-tat constraints. In: 30th IEEE International Conference on Computer Communications, IEEE INFOCOM (2011)
Ross, S.M.: Introduction to Probability Models, 7th edn. Academic Press, London (2000)
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)
Shao, C., Welch, J.L., Pierce, E., Lee, H.: Multiwriter consistency conditions for shared memory registers. SIAM J. on Computing 40, 28–62 (2011)
Taylor, H.M., Karlin, S.: An Introduction to Stochastic Modeling, 3rd edn. Academic Press, London (1998)
Wolf, R.W.: Stochastic Modeling and the Theory of Queues. Prentice-Hall, Englewood Cliffs (1989)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2011 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Klappenecker, A., Lee, H., Welch, J.L. (2011). Dynamic Regular Registers in Systems with Churn. In: Défago, X., Petit, F., Villain, V. (eds) Stabilization, Safety, and Security of Distributed Systems. SSS 2011. Lecture Notes in Computer Science, vol 6976. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-24550-3_23
Download citation
DOI: https://doi.org/10.1007/978-3-642-24550-3_23
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-24549-7
Online ISBN: 978-3-642-24550-3
eBook Packages: Computer ScienceComputer Science (R0)