Please use this identifier to cite or link to this item: https://doi.org/10.1007/s00446-008-0072-2
Title: Optimal inter-object correlation when replicating for availability
Authors: Yu, H. 
Gibbons, P.B.
Keywords: Availability
Data replication
Inter-object correlation
Multi-object operation
Object assignment
Issue Date: 2009
Source: Yu, H., Gibbons, P.B. (2009). Optimal inter-object correlation when replicating for availability. Distributed Computing 21 (5) : 367-384. ScholarBank@NUS Repository. https://doi.org/10.1007/s00446-008-0072-2
Abstract: Data replication is a key technique for ensuring data availability. Traditionally, researchers have focused on the availability of individual objects, even though user-level tasks (called operations) typically request multiple objects. Our recent experimental study has shown that the assignment of object replicas to machines results in subtle yet dramatic effects on the availability of these operations, even though the availability of individual objects remains the same. This paper is the first to approach the assignment problem from a theoretical perspective, and obtains a series of results regarding assignments that provide the best and the worst availability for user-level operations. We use a range of techniques to obtain our results, from standard combinatorial techniques and hill climbing methods to Janson's inequality (a strong probabilistic tool). Some of the results demonstrate that even quite simple versions of the assignment problem can have surprising answers. © 2008 Springer-Verlag.
Source Title: Distributed Computing
URI: http://scholarbank.nus.edu.sg/handle/10635/42037
ISSN: 01782770
DOI: 10.1007/s00446-008-0072-2
Appears in Collections:Staff Publications

Show full item record
Files in This Item:
There are no files associated with this item.

SCOPUSTM   
Citations

3
checked on Dec 6, 2017

WEB OF SCIENCETM
Citations

2
checked on Nov 20, 2017

Page view(s)

83
checked on Dec 10, 2017

Google ScholarTM

Check

Altmetric


Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.