Distributed backup placement in networks

Magnús M. Halldórsson, Boaz Patt-Shamir, Sven Köhler, Dror Rawitz

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

Abstract

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.

Original languageEnglish
Title of host publicationSPAA 2015 - Proceedings of the 27th ACM Symposium on Parallelism in Algorithms and Architectures
PublisherAssociation for Computing Machinery
Pages274-283
Number of pages10
ISBN (Electronic)9781450335881
DOIs
StatePublished - 13 Jun 2015
Event27th ACM Symposium on Parallelism in Algorithms and Architectures, SPAA 2015 - Portland, United States
Duration: 13 Jun 201515 Jun 2015

Publication series

NameAnnual ACM Symposium on Parallelism in Algorithms and Architectures
Volume2015-June

Conference

Conference27th ACM Symposium on Parallelism in Algorithms and Architectures, SPAA 2015
Country/TerritoryUnited States
CityPortland
Period13/06/1515/06/15

Fingerprint

Dive into the research topics of 'Distributed backup placement in networks'. Together they form a unique fingerprint.

Cite this