A data tracking scheme for general networks

R. Rajaraman, A. W. Richa, B. Vöcking, G. Vuppuluri

Research output: Chapter in Book/Report/Conference proceedingConference contribution

18 Scopus citations


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 nearby 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 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.

Original languageEnglish (US)
Title of host publicationAnnual ACM Symposium on Parallel Algorithms and Architectures
Number of pages8
StatePublished - 2001
Event13th Annual Symposium on Parallel Algorithms and Architectures (SPAA 2001) - Crete Island, Greece
Duration: Jul 3 2001Jul 6 2001


Other13th Annual Symposium on Parallel Algorithms and Architectures (SPAA 2001)
CityCrete Island

ASJC Scopus subject areas

  • Software
  • Safety, Risk, Reliability and Quality


Dive into the research topics of 'A data tracking scheme for general networks'. Together they form a unique fingerprint.

Cite this