Rajmohan Rajaraman Andr'ea W. Richa Berthold Vocking Gayathri Vuppuluri  Home/Search
Context Related
| asu.edu/~aricha/mypapers/tracking.ps Cached: PS.gz PS PDF This document uses CoBlitz to cache paper downloads. If your firewall is blocking outgoing connections to port 3125, you can use these links to download local copies.
Image Update HelpPS.gz PS PDF From: asu.edu/~aricha/publs (more) (Enter author homepages) |
Rate this article:      (best)Comment on this article |
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. (Update)
Cited by: More
On Name Resolution in Peer-to-Peer Networks - Xiaozhou Li Greg (Correct)
On Hierarchical Routing in Doubling Metrics - Hubert Chan Anupam (Correct)
Distributed Object Location in a Dynamic Network - Hildrum, Kubiatowicz, Rao, Zhao (2004) (Correct)
Similar documents (at the sentence level):
48.8%: A Data Tracking Scheme for General Networks - Rajaraman, Richa, Vöcking.. (2001) (Correct)
Active bibliography (related documents): More All
0.2: Placement Algorithms for Hierarchical Cooperative Caching - Korupolu, Plaxton, Rajaraman (1999) (Correct)
0.2: A Framework for Evaluating Replica Placement Algorithms - Karlsson, Karamanolis.. (2002) (Correct)
0.2: Unknown - Madhukar Korupolu Placement (Correct)
Similar documents based on text: More All
0.3: Tight Analyses of Two Local Load Balancing Algorithms - Ghosh, Leighton, Maggs.. (1995) (Correct)
0.2: Meet and Merge: Approximation Algorithms for Confluent Flows - Chen, Rajaraman, Sundaram (2003) (Correct)
0.2: Accessing Nearby Copies of Replicated Objects in a.. - Plaxton, Rajaraman.. (1997) (Correct)
Related documents from co-citation: More All
14: Accessing nearby copies of replicated objects in a distributed environment - Plaxton, Rajaram et al. - 1997
11: A scalable content-addressable network - Ratnasamy, Francis et al. - 2001
10: Chord: A scalable peer-to-peer lookup service for Internet applications - Stoica, Morris et al. - 2001
BibTeX entry: (Update)
R. Rajaraman, A. W. Richa, B. V6cking, G. Vuppuluri. A Data Tracking Scheme for General Networks. Thirteen ACM Symposium on Parallel Algorithms and Architectures, 2001. http://citeseer.ist.psu.edu/rajaraman01data.html More
@inproceedings{ rajaraman01data,
author = "Rajmohan Rajaraman and Andrea W. Richa and Berthold Vocking and Gayathri Vuppuluri",
title = "A data tracking scheme for general networks",
booktitle = "{ACM} Symposium on Parallel Algorithms and Architectures",
pages = "247-254",
year = "2001",
url = "citeseer.ist.psu.edu/rajaraman01data.html" }
Citations (may not include all citations):981 Introduction to Parallel Algorithms and Architectures: Array.. (context) - Leighton - 1992
449 Oceanstore: An architecture for global-scale persistent stor.. - Kubiatowicz, Bindel et al. - 2000
358 Universal Classes of Hash Functions (context) - Carter, Wegman - 1979
282 Accessing nearby copies of replicated objects in a distribut.. - Plaxton, Rajaraman et al. - 1999
206 Consistent hashing and random trees: Distributed caching pro.. - Karger, Lehman et al. - 1997
170 Serverless network file systems - Anderson, Dahlin et al. - 1995
151 Probabilistic approximation of metric spaces and its algorit.. - Bartal - 1996
106 Locating nearby copies of replicated Internet servers - Guyton, Schwartz - 1995
104 Sparse partitions (context) - Awerbuch, Peleg - 1990
101 Competitive algorithms for distributed data management - Bartal, Fiat et al. - 1995
93 On approximating arbitrary metrics by tree metrics - Bartal - 1998
80 The placement of Internet instrumentation - Jamin, Jin et al. - 2000
73 Competitive distributed file allocation - Awerbuch, Bartal et al. - 1993
64 Routing with polynomial communication space tradeoff - Awerbuch, Peleg - 1990
55 Online tracking of mobile users - Awerbuch, Peleg - 1995
44 Distributed paging for general networks - Awerbuch, Bartal et al. - 1996
25 Exploiting locality for data management in systems of limite.. - Maggs, auf et al. - 1997
24 A polynomial time approximation scheme for Minimum Routing C.. - Wu, Lancia et al. - 1998
19 On approximating planar metrics by tree metrics - Konjevod, Ravi et al. - 1997
11 A model for worldwide tracking of distributed objects - van Steen, Hauck et al. - 1996
10 Near-linear cost sequential and distributed constructions - Awerbuch, Berger et al. - 1993
9 Caching in networks (context) - auf, Vocking et al. - 2000
2 Huang An adaptive data replication algorithm ACM Transaction.. (context) - Wolfson, Jajodia - 1997
The graph only includes citing articles where the year of publication is known.
Documents on the same site (http://www.public.asu.edu/~aricha/publs.html): More
The Power of Two Random Choices: A Survey of Techniques .. - Mitzenmacher, Richa.. (2000) (Correct)
Application-oriented Self-organizing Hierarchical.. - Richa, Obraczka, Sen (Correct)
Finding Most Sustainable Paths in Networks with.. - Konjevod, Oh, Richa (Correct)
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC