The vulnerability of vote assignments
ACM Transactions on Computer Systems (TOCS)
Limitations on database availability when networks partition
PODC '86 Proceedings of the fifth annual ACM symposium on Principles of distributed computing
Concurrency control and recovery in database systems
Concurrency control and recovery in database systems
Linearizability: a correctness condition for concurrent objects
ACM Transactions on Programming Languages and Systems (TOPLAS)
Data caching issues in an information retrieval system
ACM Transactions on Database Systems (TODS)
A tight upper bound on the benefits of replication and consistency control protocols
PODS '91 Proceedings of the tenth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
Replica control in distributed systems: as asynchronous approach
SIGMOD '91 Proceedings of the 1991 ACM SIGMOD international conference on Management of data
Semantics-based concurrency control: beyond commutativity
ACM Transactions on Database Systems (TODS)
Bounded ignorance: a technique for increasing concurrency in a replicated system
ACM Transactions on Database Systems (TODS)
Temporal notions of synchronization and consistency in Beehive
Proceedings of the ninth annual ACM symposium on Parallel algorithms and architectures
A quantitative comparison of graph-based models for Internet topology
IEEE/ACM Transactions on Networking (TON)
Placement algorithms for hierarchical cooperative caching
Proceedings of the tenth annual ACM-SIAM symposium on Discrete algorithms
Feasibility of a serverless distributed file system deployed on an existing set of desktop PCs
Proceedings of the 2000 ACM SIGMETRICS international conference on Measurement and modeling of computer systems
Grapevine: an exercise in distributed computing
Communications of the ACM
Bandwidth constrained placement in a WAN
Proceedings of the twentieth annual ACM symposium on Principles of distributed computing
The costs and limits of availability for replicated services
SOSP '01 Proceedings of the eighteenth ACM symposium on Operating systems principles
Design and evaluation of a conit-based continuous consistency model for replicated services
ACM Transactions on Computer Systems (TOCS)
The Future of Systems Research
Computer
Competitive Hill-Climbing Strategies for Replica Placement in a Distributed File System
DISC '01 Proceedings of the 15th International Conference on Distributed Computing
On the Optimal Placement of Web Proxies in the Internet: The Linear Topology
HPN '98 Proceedings of the IFIP TC-6 Eigth International Conference on High Performance Networking
End-to-end WAN service availability
USITS'01 Proceedings of the 3rd conference on USENIX Symposium on Internet Technologies and Systems - Volume 3
Self-Organizing Subsets: From Each According to His Abilities, to Each According to His Needs
IPTPS '01 Revised Papers from the First International Workshop on Peer-to-Peer Systems
Application specific data replication for edge services
WWW '03 Proceedings of the 12th international conference on World Wide Web
Improving Availability and Performance with Application-Specific Data Replication
IEEE Transactions on Knowledge and Data Engineering
ACM Computing Surveys (CSUR)
Availability of multi-object operations
NSDI'06 Proceedings of the 3rd conference on Networked Systems Design & Implementation - Volume 3
Optimal inter-object correlation when replicating for availability
Proceedings of the twenty-sixth annual ACM symposium on Principles of distributed computing
Replication degree customization for high availability
Proceedings of the 3rd ACM SIGOPS/EuroSys European Conference on Computer Systems 2008
Quality of availability: replica placement for widely distributed systems
IWQoS'03 Proceedings of the 11th international conference on Quality of service
Future directions in distributed computing
Research of replication mechanism in P2P network
WSEAS Transactions on Computers
Utilization-aware redirection policy in CDN: a case for energy conservation
ICT-GLOW'11 Proceedings of the First international conference on Information and communication on technology for the fight against global warming
Review: A survey on content-centric technologies for the current Internet: CDN and P2P solutions
Computer Communications
A scalable framework for content replication in multicast-based content distribution networks
MMNS'06 Proceedings of the 9th IFIP/IEEE international conference on Management of Multimedia and Mobile Networks and Services
Integrating caching techniques on a content distribution network
ADBIS'06 Proceedings of the 10th East European conference on Advances in Databases and Information Systems
Automated functional testing of online search services
Software Testing, Verification & Reliability
Evaluating energy consumption in CDN servers
ICT-GLOW'12 Proceedings of the Second international conference on ICT as Key Technology against Global Warming
Live linked data: synchronising semantic stores with commutative replicated data types
International Journal of Metadata, Semantics and Ontologies
| Hi-index | 0.00 |
Today, the utility of many replicated Internet services is limited by availability rather than raw performance. To better understand the effects of replica placement on availability, we propose the problem of minimal replication cost for availability. Let replication cost be the cost associated with replica deployment, dynamic replica creation and teardown at n candidate locations. Given client access patterns, replica failure patterns, network partition patterns, a required consistency level and a target level of availability, the minimal replication cost is the lower bound on a system's replication cost. Solving this problem also answers the dual question of optimal availability given a constraint on replication cost.We design the first algorithm we are aware of to solve the problem, through reduction to integer linear programming and enumeration of pruned serialization orders. Using practical faultloads and workloads, we demonstrate that the exponential complexity of our algorithm is tractable for practical problems with hundreds of candidate locations. The lower bound computed by our algorithm is tight, but the tightness can be sacrificed by a proposed optimization for large problems. We also show that with low replica creation and teardown costs, the bound is close to tight in practical problems even with the optimization.