Distributed backup placement in networks

DOI10.1007/S00446-017-0299-XMaRDI QIDQ1741963zbMATH OpenOpenAlexFDO

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

Publication date 11 April 2018

Published in Distributed Computing (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/s00446-017-0299-x

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Randomized algorithms (68W20) Approximation algorithms (68W25) Reliability, testing and fault tolerance of networks and computer systems (68M15) Distributed algorithms (68W15) Network design and communication in computer systems (68M10) Distributed systems (68M14)

Recommendations

• Distributed approximation of \(k\)-service assignment
• Approximation algorithms for data placement in arbitrary networks
• Algorithms – ESA 2005
• Self-stabilizing local \(k\)-placement of replicas with local minimum variance
• Approximation Algorithms for Data Placement Problems

Cites work

• A faster distributed algorithm for computing maximal matchings deterministically
• A generalization of Hungarian method and Hall's theorem with applications in wireless sensor networks
• A note on parallel complexity of maximum \(f\)-matching
• An $n^{5/2} $ Algorithm for Maximum Matchings in Bipartite Graphs
• An approximation algorithm for the load-balanced semi-matching problem in weighted bipartite graphs
• Another look at the degree constrained subgraph problem
• Assigning papers to referees
• Complexity of network synchronization
• Convergence time to Nash equilibrium in load balancing
• Distributed 2-approximation algorithm for the semi-matching problem
• Distributed Computing: A Locality-Sensitive Approach
• Distributed algorithms for covering, packing and maximum weighted matching
• Distributed approximation of \(k\)-service assignment
• Distributed approximation of cellular coverage
• Faster algorithms for semi-matching problems
• Improved Distributed Approximate Matching
• Maximum bounded 3-dimensional matching is MAX SNP-complete
• Maximum semi-matching problem in bipartite graphs
• On computing an optimal semi-matching
• On the approximability of some degree-constrained subgraph problems
• On the complexity of approximating \(k\)-set packing
• Semi-matchings for bipartite graphs and load balancing
• Some simple distributed algorithms for sparse networks
• The Competitiveness of On-Line Assignments
• The Convergence Time for Selfish Bin Packing
• The locality of distributed symmetry breaking
• The price of anarchy for polynomial social cost

Cited in

(8)

• Self-stabilizing local \(k\)-placement of replicas with local minimum variance
• Algorithms – ESA 2005
• Distributed approximation of \(k\)-service assignment
• Distributed backup placement
• Maximum length-constrained flows and disjoint paths: distributed, deterministic, and fast
• Enhanced management method of storage area network (SAN) server with random remote backups
• Improved bounds for distributed load balancing
• Distributed backup placement in one round and its applications to maximum matching approximation and self-stabilization

This page was built for publication: Distributed backup placement in networks

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1741963)