Self-stabilizing local k-placement of replicas with minimal variance

Sven Köhler; Volker Turau; Gerhard Mentges

doi:10.1007/978-3-642-33536-5_2

Self-stabilizing local k-placement of replicas with minimal variance

Sven Köhler, Volker Turau, Gerhard Mentges

Hamburg University of Technology

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

3 Scopus citations

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.

Original language	English
Title of host publication	Stabilization, Safety, and Security of Distributed Systems - 14th International Symposium, SSS 2012, Proceedings
Pages	16-30
Number of pages	15
DOIs	https://doi.org/10.1007/978-3-642-33536-5_2
State	Published - 2012
Externally published	Yes
Event	14th International Symposium on Stabilization, Safety, and Security of Distributed Systems, SSS 2012 - Toronto, ON, Canada Duration: 1 Oct 2012 → 4 Oct 2012

Publication series

Name	Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume	7596 LNCS
ISSN (Print)	0302-9743
ISSN (Electronic)	1611-3349

Conference

Conference	14th International Symposium on Stabilization, Safety, and Security of Distributed Systems, SSS 2012
Country/Territory	Canada
City	Toronto, ON
Period	1/10/12 → 4/10/12

Access to Document

10.1007/978-3-642-33536-5_2

Cite this

Köhler, S., Turau, V., & Mentges, G. (2012). Self-stabilizing local k-placement of replicas with minimal variance. In Stabilization, Safety, and Security of Distributed Systems - 14th International Symposium, SSS 2012, Proceedings (pp. 16-30). (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 7596 LNCS). https://doi.org/10.1007/978-3-642-33536-5_2

Köhler, Sven ; Turau, Volker ; Mentges, Gerhard. / Self-stabilizing local k-placement of replicas with minimal variance. Stabilization, Safety, and Security of Distributed Systems - 14th International Symposium, SSS 2012, Proceedings. 2012. pp. 16-30 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)).

@inproceedings{7b6c86f81d0b4691aebaa4ffcf1d04a0,

title = "Self-stabilizing local k-placement of replicas with minimal variance",

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.",

author = "Sven K{\"o}hler and Volker Turau and Gerhard Mentges",

year = "2012",

doi = "10.1007/978-3-642-33536-5_2",

language = "אנגלית",

isbn = "9783642335358",

series = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",

pages = "16--30",

booktitle = "Stabilization, Safety, and Security of Distributed Systems - 14th International Symposium, SSS 2012, Proceedings",

note = "14th International Symposium on Stabilization, Safety, and Security of Distributed Systems, SSS 2012 ; Conference date: 01-10-2012 Through 04-10-2012",

}

Köhler, S, Turau, V & Mentges, G 2012, Self-stabilizing local k-placement of replicas with minimal variance. in Stabilization, Safety, and Security of Distributed Systems - 14th International Symposium, SSS 2012, Proceedings. Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), vol. 7596 LNCS, pp. 16-30, 14th International Symposium on Stabilization, Safety, and Security of Distributed Systems, SSS 2012, Toronto, ON, Canada, 1/10/12. https://doi.org/10.1007/978-3-642-33536-5_2

Self-stabilizing local k-placement of replicas with minimal variance. / Köhler, Sven; Turau, Volker; Mentges, Gerhard.
Stabilization, Safety, and Security of Distributed Systems - 14th International Symposium, SSS 2012, Proceedings. 2012. p. 16-30 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 7596 LNCS).

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

TY - GEN

T1 - Self-stabilizing local k-placement of replicas with minimal variance

AU - Köhler, Sven

AU - Turau, Volker

AU - Mentges, Gerhard

PY - 2012

Y1 - 2012

N2 - 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.

AB - 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.

UR - http://www.scopus.com/inward/record.url?scp=84868275559&partnerID=8YFLogxK

U2 - 10.1007/978-3-642-33536-5_2

DO - 10.1007/978-3-642-33536-5_2

M3 - ???researchoutput.researchoutputtypes.contributiontobookanthology.conference???

AN - SCOPUS:84868275559

SN - 9783642335358

T3 - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

SP - 16

EP - 30

BT - Stabilization, Safety, and Security of Distributed Systems - 14th International Symposium, SSS 2012, Proceedings

T2 - 14th International Symposium on Stabilization, Safety, and Security of Distributed Systems, SSS 2012

Y2 - 1 October 2012 through 4 October 2012

ER -

Köhler S, Turau V, Mentges G. Self-stabilizing local k-placement of replicas with minimal variance. In Stabilization, Safety, and Security of Distributed Systems - 14th International Symposium, SSS 2012, Proceedings. 2012. p. 16-30. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)). doi: 10.1007/978-3-642-33536-5_2

Self-stabilizing local k-placement of replicas with minimal variance

Abstract

Publication series

Conference

Access to Document

Other files and links

Fingerprint

Cite this