A data tracking scheme for general networks

R. Rajaraman, Andrea Richa, B. Vöcking, G. Vuppuluri

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

17 Citations (Scopus)

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 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
Pages247-254
Number of pages8
StatePublished - 2001
Externally publishedYes
Event13th Annual Symposium on Parallel Algorithms and Architectures (SPAA 2001) - Crete Island, Greece
Duration: Jul 3 2001Jul 6 2001

Other

Other13th Annual Symposium on Parallel Algorithms and Architectures (SPAA 2001)
CountryGreece
CityCrete Island
Period7/3/017/6/01

Fingerprint

Data storage equipment
Costs

ASJC Scopus subject areas

  • Software
  • Safety, Risk, Reliability and Quality

Cite this

Rajaraman, R., Richa, A., Vöcking, B., & Vuppuluri, G. (2001). A data tracking scheme for general networks. In Annual ACM Symposium on Parallel Algorithms and Architectures (pp. 247-254)

A data tracking scheme for general networks. / Rajaraman, R.; Richa, Andrea; Vöcking, B.; Vuppuluri, G.

Annual ACM Symposium on Parallel Algorithms and Architectures. 2001. p. 247-254.

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

Rajaraman, R, Richa, A, Vöcking, B & Vuppuluri, G 2001, A data tracking scheme for general networks. in Annual ACM Symposium on Parallel Algorithms and Architectures. pp. 247-254, 13th Annual Symposium on Parallel Algorithms and Architectures (SPAA 2001), Crete Island, Greece, 7/3/01.
Rajaraman R, Richa A, Vöcking B, Vuppuluri G. A data tracking scheme for general networks. In Annual ACM Symposium on Parallel Algorithms and Architectures. 2001. p. 247-254
Rajaraman, R. ; Richa, Andrea ; Vöcking, B. ; Vuppuluri, G. / A data tracking scheme for general networks. Annual ACM Symposium on Parallel Algorithms and Architectures. 2001. pp. 247-254
@inproceedings{bb60dbb0311b434d9af21dc73f74d706,
title = "A data tracking scheme for general networks",
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 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.",
author = "R. Rajaraman and Andrea Richa and B. V{\"o}cking and G. Vuppuluri",
year = "2001",
language = "English (US)",
pages = "247--254",
booktitle = "Annual ACM Symposium on Parallel Algorithms and Architectures",

}

TY - GEN

T1 - A data tracking scheme for general networks

AU - Rajaraman, R.

AU - Richa, Andrea

AU - Vöcking, B.

AU - Vuppuluri, G.

PY - 2001

Y1 - 2001

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

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

UR - http://www.scopus.com/inward/record.url?scp=0034825298&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=0034825298&partnerID=8YFLogxK

M3 - Conference contribution

AN - SCOPUS:0034825298

SP - 247

EP - 254

BT - Annual ACM Symposium on Parallel Algorithms and Architectures

ER -