|Publisher DOI:||10.1016/j.tcs.2015.04.019||Title:||Self-stabilizing local k-placement of replicas with local minimum variance||Language:||English||Authors:||Köhler, Sven
|Keywords:||Backup placement;Replication;Self-stabilizing algorithms||Issue Date:||2-Aug-2015||Source:||Theoretical Computer Science (591): 15-27 (2015-08-02)||Journal or Series Name:||Theoretical computer science||Abstract (english):||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.||URI:||http://hdl.handle.net/11420/3467||ISSN:||0304-3975||Institute:||Telematik E-17||Type:||(wissenschaftlicher) Artikel||Funded by:||DFG contract number TU 221/3-1.||Project:||Tolerance-Zone - Fehlertolerante Middleware-Idiome basierend auf selbststabilisierenden Techniken|
|Appears in Collections:||Publications without fulltext|
Show full item record
checked on Sep 28, 2020
Add Files to Item
Note about this record
Items in TORE are protected by copyright, with all rights reserved, unless otherwise indicated.