Download:
|
by Rajmohan Rajaraman, Andrea W. Richa
http://www.mpi-sb.mpg.de/~voecking/papers/SPAA01.ps.gz
Add To MetaCart
Abstract:
Consider an arbitrary distributed network in which large numbers of objects are continuously being created, replicated, and destroyed. A basic problem arising in such an environment is that of organizing a distributed directory service for locating object copies. In this paper, we present a new data tracking scheme for locating nearby copies of objects in arbitrary distributed environments. Our tracking scheme supports ecient accesses to data objects while keeping the local memory overhead low. In particular, our tracking scheme achieves an expected polylog(n)-approximation in the cost of any access operation, for an arbitrary network. The memory overhead incurred by our scheme is O(polylog(n)) times the maximum number of objects stored at any node, with high probability. We also show that our tracking scheme adapts well to dynamic changes in the network. 1
Citations
|
1206
|
Introduction to Parallel Algorithms and Architectures: Arrays
– Leighton
- 1992
|
|
643
|
Oceanstore: An architecture for global-scale persistent storage
– Kubiatowicz, Bindel, et al.
- 2000
|
|
470
|
Universal classes of hash functions
– Carter, Wegman
- 1979
|
|
375
|
Accessing nearby copies of replicated objects in a distributed environment
– Plaxton, Rajaraman, et al.
- 1997
|
|
318
|
Consistent hashing and random trees: distributed caching protocols for relieving hot spots on the World Wide Web
– Karger, Lehman, et al.
- 1997
|
|
229
|
Probabilistic approximation of metric spaces and its algorithmic applications
– Bartal
|
|
190
|
Concurrent online tracking of mobile users
– Awerbuch, Peleg
- 1991
|
|
163
|
On Approximating Arbitrary Metrices by Tree Metrics
– Bartal
|
|
134
|
Sparse partitions
– Awerbuch, Peleg
- 1990
|
|
132
|
Locating Nearby Copies of Replicated Internet Servers
– Guyton, Schwartz
- 1995
|
|
123
|
An Adaptive Data Replication Algorithms
– Wolfson, Jajodia, et al.
- 1997
|
|
104
|
Competitive Algorithms for Distributed Data Management
– Bartal, Fiat, et al.
- 1992
|
|
87
|
On the placement of Internet instrumentation
– Jamin, Jin, et al.
- 2000
|
|
59
|
Distributed paging for general networks
– Awerbuch, Bartal, et al.
- 1996
|
|
42
|
S.: A Model for Worldwide Tracking of Distributed Objects
– Steen, Hauck, et al.
- 1996
|
|
36
|
A polynomial time approximation scheme for minimum routing cost spanning trees
– Wu, Lancia, et al.
|
|
29
|
Exploiting Locality for Data Management in Systems of Limited Bandwidth
– Maggs, Heide, et al.
- 1997
|
|
25
|
On Approximating Planar Metrics by Tree Metrics
– Konjevod, Ravi, et al.
- 1997
|
|
16
|
Near-linear cost sequential and distributed constructions of sparse neighborhood covers
– Awerbuch, Berger, et al.
- 1993
|
|
16
|
Routing with polynomial communication - space trade-off
– Awerbuch, Peleg
- 1990
|
|
16
|
Caching in net-works
– Heide, Vocking, et al.
- 2000
|
|
14
|
Serverless network systems
– Anderson, Dahlin, et al.
- 1995
|
|
10
|
Competitive distributed allocation
– Awerbuch, Bartal, et al.
- 1993
|
