Scribe David Garmire Agenda Two object location systems (CAN and...  Home/Search
Context
Related
| berkeley.edu/%7Esatishr/cs...41403.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: berkeley.edu/%7Esatishr/cs273/ (more) (Enter author homepages) |
Rate this article:      (best)Comment on this article |
Abstract: Pastry (Refer to the tree drawn in Figure 2.) Give nodes random IDs in base B, for this example assume B = 5. For every prefix # of an ID, store the closest node with ID #j, where j [0, b]. What is the smallest prefix of 1234? The empty set. Let's build a table of the possible prefixes. Tapestry/Pastry Scribe David Garmire Figure 1: Illustration of Grid in CAN Figure 2: Illustration of Tapestry Tree We are not going to show how to deal with getting to exact node. If you want a... (Update)
Active bibliography (related documents): More All
0.1: Distributed Object Location in a Dynamic Network - Hildrum, Kubiatowicz, Rao, Zhao (2004) (Correct)
0.0: Distributed Data Location in a Dynamic Network - Hildrum, Kubiatowicz, Rao, Zhao (2002) (Correct)
0.0: Decentralized Object Location and Routing: A New Networking Paradigm - Zhao (2004) (Correct)
Similar documents based on text: More All
0.6: A Note on the Nearest Neighbor in Growth-Restricted Metrics - Hildrum, Kubiatowicz, Ma.. (Correct)
0.4: CS 273: Prof. Satish Rao Notes - Scribe David Garmire (Correct)
0.4: Another Way to Find the Nearest Neighbor in.. - Hildrum, Kubiatowicz.. (2003) (Correct)
BibTeX entry: (Update)
@misc{ garmire-cs,
author = "Scribe David Garmire",
title = "CS 273: Kris Hildrum Notes",
url = "citeseer.ist.psu.edu/695524.html" }
Citations (may not include all citations):1023 A scalable contentaddressable network - Ratnasamy, Francis et al. - 2001
282 Accessing nearby copies of replicated objects in a distribut.. - Plaxton, Rajaraman et al. - 1997
96 Concurrent online tracking of mobile users - Awerbuch, Peleg - 1991
14 A data tracking scheme for general networks - Rajaraman, Richa et al. - 2001
12 Find nearest neighbors in growth-restricted metrics (context) - Karger, Ruhl - 2002
Documents on the same site (http://www.cs.berkeley.edu/%7Esatishr/cs273/): More
CS273 Foundations of Parallel Network Computing Spring 2001 - Lecturer Satish Rao (Correct)
CS 273: Prof. Satish Rao Notes - Scribe David Garmire (Correct)
Routing with Polynomial Communication-Space Tradeoff - Awerbuch, Peleg (1993) (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