Self-stabilizing Local k-Placement of Replicas with Minimal Variance

  • Sven Köhler
  • Volker Turau
  • Gerhard Mentges
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 7596)


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.


Potential Function Load Balance Minimal Variance Malicious Node Load Variable 
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.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. 1.
    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)Google Scholar
  2. 2.
    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)MathSciNetCrossRefGoogle Scholar
  3. 3.
    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)Google Scholar
  4. 4.
    Kangasharju, J., Roberts, J.W., Ross, K.W.: Object replication strategies in content distribution networks. Computer Communications 25(4), 376–383 (2002)CrossRefGoogle Scholar
  5. 5.
    Karger, D.R., Ruhl, M.: Simple efficient load-balancing algorithms for peer-to-peer systems. Theory Comput. Syst. 39(6), 787–804 (2006)MathSciNetzbMATHCrossRefGoogle Scholar
  6. 6.
    Kessels, J.L.W.: An exercise in proving self-stabilization with a variant function. Information Processing Letters 29(1), 39–42 (1988)MathSciNetzbMATHCrossRefGoogle Scholar
  7. 7.
    Ko, B.-J., Rubenstein, D.: Distributed self-stabilizing placement of replicated resources in emerging networks. IEEE/ACM Trans. Networking 13, 476–487 (2005)CrossRefGoogle Scholar
  8. 8.
    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)CrossRefGoogle Scholar
  9. 9.
    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)CrossRefGoogle Scholar
  10. 10.
    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)Google Scholar
  11. 11.
    Sauerwald, T., Sun, H.: Tight bounds for randomized load balancing on arbitrary network topologies. CoRR abs/1201.2715 (2012)Google Scholar
  12. 12.
    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)CrossRefGoogle Scholar
  13. 13.
    Turau, V.: Efficient transformation of distance-2 self-stabilizing algorithms. Journal of Parallel and Distributed Computing 72(4), 603–612 (2012)zbMATHCrossRefGoogle Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2012

Authors and Affiliations

  • Sven Köhler
    • 1
  • Volker Turau
    • 1
  • Gerhard Mentges
    • 1
  1. 1.Institute of TelematicsHamburg University of TechnologyHamburgGermany

Personalised recommendations