Click here for full text:
Bounds on the Replication Cost for QoS
Karlsson, Magnus; Karamanolis, Christos
HPL-2003-156
Keyword(s): data replication; QoS; placement algorithms; lower bounds; integer programming
Abstract: Data replication is used extensively in wide-area
distributed systems to achieve low data-access
latency. Minimizing the cost of the resources
used for replication is a key problem in these
systems. The paper proposes a method to calculate
lower bounds for the replication cost required to
achieve certain QoS goals. We obtain bounds for
the general case as well as for certain classes
of replica placement heuristics. We observe that
the cost of heuristics depends heavily on the
workload and QoS goal. Based on these results, we
discuss the inherent properties of heuristics
that affect their cost and applicability to
different environments.
27 Pages
Back to Index
| 
printable version
