TY - GEN

T1 - Distributed backup placement in networks

AU - Halldórsson, Magnús M.

AU - Patt-Shamir, Boaz

AU - Köhler, Sven

AU - Rawitz, Dror

N1 - Publisher Copyright:
Copyright © 2015 ACM.

PY - 2015/6/13

Y1 - 2015/6/13

N2 - We consider the backup placement problem, defined as follows. Some nodes (processors) in a given network have objects (e.g., files, tasks) whose backups should be stored in additional nodes for increased fault resilience. To minimize the disturbance in case of a failure, it is required that a backup copy should be located at a neighbor of the primary node. The goal is to find an assignment of backup copies to nodes which minimizes the maximum load (number or total size of copies) over all nodes in the network. It is known that a natural selfish local improvement policy has approximation ratio Ω(log n/log log n); we show that it may take this policy Ω(√n) time to reach equilibrium in the distributed setting. Our main result in this paper is a distributed algorithm which finds a placement in polylogarithmic time and achieves approximation ratio O (log n/log log n). We obtain this result using a distributed approximation algorithm for f-matching in bipartite graphs that may be of independent interest.

AB - We consider the backup placement problem, defined as follows. Some nodes (processors) in a given network have objects (e.g., files, tasks) whose backups should be stored in additional nodes for increased fault resilience. To minimize the disturbance in case of a failure, it is required that a backup copy should be located at a neighbor of the primary node. The goal is to find an assignment of backup copies to nodes which minimizes the maximum load (number or total size of copies) over all nodes in the network. It is known that a natural selfish local improvement policy has approximation ratio Ω(log n/log log n); we show that it may take this policy Ω(√n) time to reach equilibrium in the distributed setting. Our main result in this paper is a distributed algorithm which finds a placement in polylogarithmic time and achieves approximation ratio O (log n/log log n). We obtain this result using a distributed approximation algorithm for f-matching in bipartite graphs that may be of independent interest.

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

U2 - 10.1145/2755573.2755583

DO - 10.1145/2755573.2755583

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

AN - SCOPUS:84950293102

T3 - Annual ACM Symposium on Parallelism in Algorithms and Architectures

SP - 274

EP - 283

BT - SPAA 2015 - Proceedings of the 27th ACM Symposium on Parallelism in Algorithms and Architectures

PB - Association for Computing Machinery

T2 - 27th ACM Symposium on Parallelism in Algorithms and Architectures, SPAA 2015

Y2 - 13 June 2015 through 15 June 2015

ER -