Introduction to algorithms
Introduction to parallel algorithms and architectures: array, trees, hypercubes
Introduction to parallel algorithms and architectures: array, trees, hypercubes
Routing with polynomial communication-space trade-off
SIAM Journal on Discrete Mathematics
Competitive distributed file allocation
STOC '93 Proceedings of the twenty-fifth annual ACM symposium on Theory of computing
Online tracking of mobile users
Journal of the ACM (JACM)
Locating nearby copies of replicated Internet servers
SIGCOMM '95 Proceedings of the conference on Applications, technologies, architectures, and protocols for computer communication
Competitive algorithms for distributed data management
Journal of Computer and System Sciences - Special issue on selected papers presented at the 24th annual ACM symposium on the theory of computing (STOC '92)
Serverless network file systems
SOSP '95 Proceedings of the fifteenth ACM symposium on Operating systems principles
An adaptive data replication algorithm
ACM Transactions on Database Systems (TODS)
Accessing nearby copies of replicated objects in a distributed environment
Proceedings of the ninth annual ACM symposium on Parallel algorithms and architectures
STOC '97 Proceedings of the twenty-ninth annual ACM symposium on Theory of computing
On approximating arbitrary metrices by tree metrics
STOC '98 Proceedings of the thirtieth annual ACM symposium on Theory of computing
Distributed paging for general networks
Proceedings of the seventh annual ACM-SIAM symposium on Discrete algorithms
A polynomial time approximation scheme for minimum routing cost spanning trees
Proceedings of the ninth annual ACM-SIAM symposium on Discrete algorithms
Caching in networks (extended abstract)
SODA '00 Proceedings of the eleventh annual ACM-SIAM symposium on Discrete algorithms
OceanStore: an architecture for global-scale persistent storage
ASPLOS IX Proceedings of the ninth international conference on Architectural support for programming languages and operating systems
Exploiting Locality for Data Management in Systems of Limited Bandwidth
FOCS '97 Proceedings of the 38th Annual Symposium on Foundations of Computer Science
Probabilistic approximation of metric spaces and its algorithmic applications
FOCS '96 Proceedings of the 37th Annual Symposium on Foundations of Computer Science
On name resolution in peer-to-peer networks
Proceedings of the second ACM international workshop on Principles of mobile computing
Object location in realistic networks
Proceedings of the sixteenth annual ACM symposium on Parallelism in algorithms and architectures
Using the small-world model to improve Freenet performance
Computer Networks: The International Journal of Computer and Telecommunications Networking
On hierarchical routing in doubling metrics
SODA '05 Proceedings of the sixteenth annual ACM-SIAM symposium on Discrete algorithms
Robust data location infrastructure in distributed collaborative environment
CSCWD'06 Proceedings of the 10th international conference on Computer supported cooperative work in design III
Hi-index | 0.00 |
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 data tracking scheme for locating object copies. In this paper, we present a new tracking scheme for locating nearly copies of replicated objects in arbitrary distributed environments.Our tracking scheme supports efficient 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 &Ogr;(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.