Moni Naor + Udi Wieder +  Home/Search
Context Related
| berkeley.edu/final...fault_tolerant.pdf wisdom.weizmann.ac.il/~uwied...iptps.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/program (more) (Enter author homepages) |
Rate this article:      (best)Comment on this article |
Abstract: We introduce a distributed hash table (DHT) with logarithmic degree and logarithmic dilation. We show two lookup algorithms. The first has a message complexity of log n and is robust under random deletion of nodes. The second has parallel time of log n and message complexity of log n. It is robust under spam induced by a random subset of the nodes. We then show a construction which is fault tolerant against random deletions and has an optimal degree-dilation tradeoff. The construction has... (Update)
Cited by: More
Appears in Proceedings of the 11th IEEE International.. - Exploiting Routing.. (Correct)
Dynamic Load Balancing in Distributed Hash Tables - Bienkowski, Korzeniowski.. (2004) (Correct)
A Framework for Structured Peer-to-Peer Overlay Networks - Alima, Ghodsi, Haridi (2004) (Correct)
Similar documents (at the sentence level):
54.8%: A Simple Fault Tolerant Distributed Hash Table - Naor, Wieder (2003) (Correct)
24.6%: Novel Architectures for P2P Applications: the.. - Naor, Wieder (2002) (Correct)
Active bibliography (related documents): More All
0.1: Viceroy: Scalable Emulation of Butterfly Networks for.. - Malkhi, Naor, Ratajzcak (2003) (Correct)
0.1: Asymptotically Efficient Approaches to Fault-Tolerance in.. - Hildrum, Kubiatowicz (2003) (Correct)
0.1: In Proceedings of the 17th International Symposium on .. - Fault-Tolerance In.. (Correct)
Similar documents based on text: More All
0.2: Censorship Resistant Peer-to-Peer Content Addressable Networks - Fiat, Saia (2002) (Correct)
0.2: Know thy Neighbor's Neighbor: Better Routing for Skip-Graphs.. - Naor, Wieder (2004) (Correct)
0.2: A Framework for Peer-to-Peer Lookup Services Based on.. - El-Ansary, Alima.. (2002) (Correct)
Related documents from co-citation: More All
26: Chord: A scalable peer-to-peer lookup service for Internet applications - Stoica, Morris et al. - 2001
24: Viceroy: A scalable and dynamic emulation of the butterfly - MALKHI, NAOR et al. - 2002
23: A scalable content-addressable network - Ratnasamy, Francis et al. - 2001
BibTeX entry: (Update)
Moni Naor and Udi Wieder. A simple fault tolerant distributed hash table. In Second International Workshop on Peer-to-Peer Systems, February 2003. http://citeseer.ist.psu.edu/article/naor03simple.html More
@misc{ naor03simple,
author = "M. Naor and U. Wieder",
title = "A simple fault tolerant distributed hash table",
text = "Moni Naor and Udi Wieder. A simple fault tolerant distributed hash table.
In Second International Workshop on Peer-to-Peer Systems, February 2003.",
year = "2003",
url = "citeseer.ist.psu.edu/article/naor03simple.html" }
Citations (may not include all citations):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 - 2001
217 A digital fountain approach to reliable distribution of bulk.. - Byers, Luby et al. - 1998
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
40 replication: A quantitative comparison (context) - Weatherspoon, Kubiatowicz et al. - 2002
36 Censorship resistant peer-to-peer content addressable networ.. - Fiat, Saia - 2002
34 Novel architecture pp application continuou discrete approac.. - Wieder, for et al. - 2002
24 Dynamically fault-tolerant content addressable networks - Saia, Fiat et al. - 2002
The graph only includes citing articles where the year of publication is known.
Documents on the same site (http://iptps03.cs.berkeley.edu/program.html): More
Efficient Broadcast in Structured P2P Networks - El-Ansary, Alima, Brand, Haridi (2003) (Correct)
On the Feasibility of Peer-to-Peer Web Indexing and.. - Li, Loo, Hellerstein.. (2003) (Correct)
Rationality and Self-Interest in Peer to Peer Networks - Shneidman, Parkes (2003) (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