Abstract
Large scale distributed systems require replication of resources to amplify availability and to provide fault tolerance. The placement of replicated resources significantly impacts performance. This paper considers local k-placements: Each node of a network has to place k replicas of a resource among its direct neighbors. The load of a node in a given local k-placement is the number of replicas it stores. The local k-placement problem is to achieve a preferably homogeneous distribution of the loads. We present a novel self-stabilizing, distributed, asynchronous, scalable algorithm for the k-placement problem such that the standard deviation of the distribution of the loads assumes a local minimum.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Flatebo, M., Datta, A.K., Bourgon, B.: Self-stabilizing load balancing algorithms. In: Proc. IEEE 13th Annual Int. Phoenix Conf. on Computers and Communications, p. 303 (1994)
Gairing, M., Goddard, W., Hedetniemi, S., Kristiansen, P., McRae, A.: Distance-two information in self-stabilizing algorithms. Parallel Processing Letters 14(3-4), 387–398 (2004)
Gärtner, F.C., Pagnia, H.: Self-stabilizing load distribution for replicated servers on a per-access basis. In: Proc. 19th IEEE Int. Conf. on Distributed Computing Systems, Workshop on Self-Stabilizing Systems, Austin, Texas, pp. 102–109 (1999)
Kangasharju, J., Roberts, J.W., Ross, K.W.: Object replication strategies in content distribution networks. Computer Communications 25(4), 376–383 (2002)
Karger, D.R., Ruhl, M.: Simple efficient load-balancing algorithms for peer-to-peer systems. Theory Comput. Syst. 39(6), 787–804 (2006)
Kessels, J.L.W.: An exercise in proving self-stabilization with a variant function. Information Processing Letters 29(1), 39–42 (1988)
Ko, B.-J., Rubenstein, D.: Distributed self-stabilizing placement of replicated resources in emerging networks. IEEE/ACM Trans. Networking 13, 476–487 (2005)
Köhler, S., Turau, V.: A New Technique for Proving Self-stabilizing under the Distributed Scheduler. In: Dolev, S., Cobb, J., Fischer, M., Yung, M. (eds.) SSS 2010. LNCS, vol. 6366, pp. 65–79. Springer, Heidelberg (2010)
Köhler, S., Turau, V.: Space-Efficient Fault-Containment in Dynamic Networks. In: Défago, X., Petit, F., Villain, V. (eds.) SSS 2011. LNCS, vol. 6976, pp. 311–325. Springer, Heidelberg (2011)
Lenzen, C., Wattenhofer, R.: Tight bounds for parallel randomized load balancing: extended abstract. In: Proc. 43rd ACM Symp. on Theory of Computing, pp. 11–20. ACM (2011)
Sauerwald, T., Sun, H.: Tight bounds for randomized load balancing on arbitrary network topologies. CoRR abs/1201.2715 (2012)
Serbu, S., Bianchi, S., Kropf, P., Felber, P.: Dynamic load sharing in peer-to-peer systems: When some peers are more equal than others. IEEE Internet Computing 11, 53–61 (2007)
Turau, V.: Efficient transformation of distance-2 self-stabilizing algorithms. Journal of Parallel and Distributed Computing 72(4), 603–612 (2012)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2012 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Köhler, S., Turau, V., Mentges, G. (2012). Self-stabilizing Local k-Placement of Replicas with Minimal Variance. In: Richa, A.W., Scheideler, C. (eds) Stabilization, Safety, and Security of Distributed Systems. SSS 2012. Lecture Notes in Computer Science, vol 7596. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-33536-5_2
Download citation
DOI: https://doi.org/10.1007/978-3-642-33536-5_2
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-33535-8
Online ISBN: 978-3-642-33536-5
eBook Packages: Computer ScienceComputer Science (R0)