Distributed backup placement in networks

DOI10.1007/S00446-017-0299-XzbMATH Open1451.68048OpenAlexW2621150082MaRDI QIDQ1741963FDOQ1741963

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

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

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)

Cites Work

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

Cited In (9)

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

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)