Luiz R. Monnerat ., and Claudio L. Amorim COPPE - Computer and Systems...  Home/Search
Context Related
| cos.ufrj.br/~monne...orim_D1HT_2006.pdf 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: cos.ufrj.br/~monnerat/ (more) (Enter author homepages) |
Rate this article:      (best)Comment on this article |
Abstract: Distributed Hash Tables (DHTs) have been used in a variety of applications, but most DHTs so far have opted to solve lookups with multiple hops, which sacrifices performance in order to keep little routing information and minimize maintenance traffic. In this paper, we introduce D1HT, a novel single hop DHT that is able to maximize performance with reasonable maintenance traffic overhead even for huge and dynamic peer-to-peer (P2P) systems. We formally define the algorithm we propose to detect... (Update)
Cited by: More
D1HT: A Distributed One Hop Hash Table - Monnerat, Amorim (2005) (Correct)
Active bibliography (related documents): More All
0.4: Minimizing Churn in Distributed Systems - Brighten Godfrey Scott (2006) (Correct)
0.4: Proceedings of the 12th International Conference on.. - Achieving One-Hop Dht (Correct)
0.3: On the Use of Online Analytic Performance Models in.. - Menasce, Bennani, Ruan (2005) (Correct)
Similar documents based on text:
0.0: Unknown - (Correct)
BibTeX entry: (Update)
@inproceedings{ monnerat2006a,
author= {Luiz R. Monnerat and Claudio L. Amorim},
title = {{D1HT: A Distributed One Hop Hash Table}},
booktitle = {Proceedings of the 20th IEEE International Parallel and Distributed Processing Symposium (IPDPS)},
URL = {citeseer.ist.psu.edu/article/amorim05dht.html},
URL = {http://www.cos.ufrj.br/~monnerat/papers/Monnerat_et_Amorim_D1HT_2006.pdf},
year = {2006},
month = {April},
note = {{Previous version published as TR ES-676/05, COPPE/UFRJ, May 2005}} }
Citations (may not include all citations):1023 A scalable content addressable network - Ratnasamy, Francis et al. - 2001
338 A measurement study of peer-to-peer file sharing systems - Saroiu, Gummadi et al. - 2002
206 Consistent hashing and random trees: Distributed caching pro.. - Karger, Lehman et al. - 1997
128 Viceroy: A scalable and dynamic emulation of the butterfly - Malkhi, Naor et al. - 2002
100 Skipnet: A scalable overlay network with practical locality .. - Harvey, Jones et al. - 2003
88 Querying the internet with PIER - Huebsch, Hellerstein et al. - 2003
80 Chord: a scalable peer-to-peer lookup protocol for Internet .. - Stoica, Morris et al. - 2003
45 Analysis of the evolution of peer-to-peer systems (context) - Liben-Nowell, Balakrishnan et al. - 2002
40 Tapestry: A global-scale overlay for rapid service deploymen.. (context) - Zhao, Huang et al. - 2004
39 Availability and locality measurements of peer-to-peer file .. - Chu, Labonte et al. - 2002
26 ACM Transactions on Database Systems (context) - Litwin, Neimat et al. - 1996
24 The design of a robust peer-to-peer system - Rodrigues, Liskov et al. - 2002
22 Kelip Building efficient and stable PP DHT through increased.. - Linga, van Renesse et al. - 2003
16 Comparing the performance of distributed hash tables under c.. - Li, Stribling et al. - 2004
15 Efficient routing for peer-to-peer overlays - Gupta, Liskov et al. - 2004
9 Structured Superpeers: Leveraging heterogeneity to provide c.. - Mizrak, Cheng et al. - 2003
7 decentraized object location and routing for large-scale pee.. (context) - Rowstron, Druschel et al. - 2001
7 lookup performance for power-law query distributions in peer.. (context) - Ramasubramanian, Sirer - 2004
7 Bandwidthefficient management of DHT routing tables (context) - Li, Stribling et al. - 2005
5 Exploring the use of BitTorrent as the basis for a large tra.. (context) - Bellissimo, Shenoy et al. - 2004
4 When multi-hop peer-to-peer routing matters - Rodrigues, Blake - 2004
3 cost framework for evaluating DHT design tradeoffs (context) - Li, Stribling et al. - 2005
3 framework self optimizing Grid using PP component - Schutt, for et al. - 2003
Documents on the same site (http://www.cos.ufrj.br/~monnerat/):
Efficiently Adapting to Sharing Patterns in Software DSMs - Monnerat, Bianchini (1998) (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