Distributed backup placement in networks

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

Research output: Contribution to journalArticlepeer-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 backup 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 randomized distributed algorithm which finds a placement in polylogarithmic time and achieves approximation ratio O(lognloglogn). We obtain this result using a randomized distributed approximation algorithm for f-matching in bipartite graphs that may be of independent interest.

Original languageEnglish
Pages (from-to)83-98
Number of pages16
JournalDistributed Computing
Volume31
Issue number2
DOIs
StatePublished - 1 Apr 2018

Fingerprint

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

Cite this