Options
Self-stabilizing local k-placement of replicas with local minimum variance
Publikationstyp
Journal Article
Date Issued
2015-08-02
Sprache
English
Author(s)
Institut
TORE-URI
Journal
Volume
591
Start Page
15
End Page
27
Citation
Theoretical Computer Science (591): 15-27 (2015-08-02)
Publisher DOI
Scopus ID
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.
Subjects
Backup placement
Replication
Self-stabilizing algorithms
More Funding Information
DFG contract number TU 221/3-1.