Shuheng Zhou, Gregory R. Ganger, Peter Steenkiste September 2003...  Home/Search
Context Related
| cmu.edu/PDLFTP/stra...CMUCS03171.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: cmu.edu/PDLFTP/stray/ (more) (Enter author homepages) |
Rate this article:      (best)Comment on this article |
Abstract: Current peer-to-peer systems based on DHTs struggle with routing locality and content locality because of random node ID assignment. To address these issues, we promote the use of location-based node IDs to encode physical topology and improve routing. This gives applications explicit knowledge about and control over data locality at a coarse-grain. Applications can place content in particular regions or route towards a close replica. Schemes to address the difficulties that ensue, particularly ... (Update)
Cited by: More
Balancing Locality and Randomness in DHTs - Shuheng Zhou Gregory (Correct)
Active bibliography (related documents): More All
1.5: Location-based Node IDs: Enabling Explicit Locality in DHTs - Zhou, Ganger, Steenkiste (2003) (Correct)
0.1: Efficient Support for Range Queries in DHT-based Systems - Gao, Steenkiste (2003) (Correct)
0.1: Long-term traffic aspects of the NSFNET - Claffy, Polyzos, Braun (1993) (Correct)
BibTeX entry: (Update)
Shuheng Zhou, Gregory R. Ganger, and Peter Steenkiste. Location-based Node IDs: Enabling Explicit Locality in DHTs. Technical report CMU-CS-03-171. Carnegie Mellon University, September 2003. 8 http://citeseer.ist.psu.edu/article/zhou03locationbased.html More
@misc{ zhou03locationbased,
author = "S. Zhou and G. Ganger and P. Steenkiste",
title = "Location-based Node IDs: Enabling Explicit Locality in DHTs",
text = "Shuheng Zhou, Gregory R. Ganger, and Peter Steenkiste. Location-based Node
IDs: Enabling Explicit Locality in DHTs. Technical report CMU-CS-03-171.
Carnegie Mellon University, September 2003. 8",
year = "2003",
url = "citeseer.ist.psu.edu/article/zhou03locationbased.html" }
Citations (may not include all citations):1447 A mathematical theory of communication (context) - Shannon - 1948
1225 Chord: a scalable peer-to-peer lookup service for internet a.. - Stoica, Morris et al. - 2001
1023 A scalable content-addressable network - Ratnasamy, Francis et al. - 2001
458 Tapestry: an infrastructure for fault-tolerant wide-area loc.. - Zhao, Kubiatowicz et al. - 2001
449 OceanStore: an architecture for global-scale persistent stor.. - Kubiatowicz, Bindel et al. - 2000
338 A method for the construction of minimum-redundancy codes (context) - Huffman - 1952
282 Accessing nearby copies of replicated objects in a distribut.. - Plaxton, Rajaraman et al. - 1997
117 Topologically-aware overlay construction and server selectio.. - Ratnasamy, Handley et al. - 2002
105 Predicting Internet network distance with coordinates-based .. - Ng, Zhang - 2002
100 SkipNet: A Scalable Overlay Network with Practical Locality - Harvey, Jones et al. - 2003
93 The impact of DHT routing geometry on resilience and proximi.. - Gummadi, Gummadi et al. - 2003
85 decentralized object location and routing for large-scale pe.. (context) - Rowstron, Druschel et al. - 2001
76 Wide-area cooperative storage with CFS (context) - Dabek, Kaashoek et al. - 2001
73 SplitStream: High-bandwidth multicast in a cooperative envir.. - Castro, Druschel et al. - 2003
47 Arithmetic coding (context) - Langdon - 1979
46 persistent peer-to-peer storage utility (context) - Rowstron, Druschel et al. - 2001
37 A routing underlay for overlay networks (context) - Nakao, Peterson et al. - 2003
26 the naming and binding of network destinations (context) - Saltzer - 1993
19 A knowledge plane for the Internet (context) - Clark, Partridge et al. - 2003
15 Replication strategies for highly available peer-to-peer sto.. - Bhagwan, Moore et al. - 2002
11 Information theory and reliable communication (context) - Gallager - 1968
7 Design and evaluation of a distributed scalable content disc.. (context) - Gao, Steenkiste - 2003
6 Improving the routing and addressing of the Internet protoco.. (context) - Ford, Rekhter et al. - 1993
3 Published as Computer Networks (context) - Kleinrock, Kamoun et al. - 1977
2 Consistent hashing and random trees: tools for relieving hot.. (context) - Karger, Lehman et al. - 1997
Documents on the same site (http://www.pdl.cmu.edu/PDL-FTP/stray/): More
Scheduling Explicitly-Speculative Tasks - David Petrou Gregory (Correct)
Automated Disk Drive Characterization - Schindler, Ganger (1999) (Correct)
Cluster Scheduling for Explicitly-Speculative Tasks - Petrou, Ganger, Gibson (2004) (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