[ Pagewise preview ]
| Category | Value | ||
| Available via | http://dbpubs.stanford.edu/pub/2002-33 | ||
| Previous version | 2002-5 | ||
| Submitted on | 13th of June 2002 | ||
| Author | Mayur Datar | ||
| Title | Butterflies and Peer-to-Peer Networks | ||
| Date of publication | 13th of June 2002 | ||
| Published in | Proceedings of ESA 2002 (LNCS). | ||
| Citation | Mayur Datar. Butterflies and Peer-to-Peer Networks, Proceedings of ESA 2002 (LNCS). | ||
| Number of pages | 14 | ||
| Language | English | ||
| Project | Peers | ||
| Type | Conference or Journal Paper | ||
| Subject group | Distributed Systems | ||
| Abstract | Research in Peer-to-peer systems has focussed on building efficient Content Addressable Networks (CANs), which are essentially distributed hash tables (DHT) that support location of resources based on unique keys. While most proposed schemes are robust to a large number of random faults, there are very few schemes that are robust to a large number of adversarial faults. In a recent paper Fiat and Saia have proposed such a solution that is robust to adversarial faults. We propose a new solution based on multi-butterflies that improves upon the previous solution by Fiat and Saia. Our new network, multi-hypercube, is a fault tolerant version of the hypercube, and may find applications to other problems as well. We also demonstrate how this network can be maintained dynamically. This addresses the first open problem in the paper by Fiat and Saia. | ||
| Keywords | DHT CAN Censorship-Resistant Multi-butterfly Fault-tolerance | ||
| Fulltext source |
| Management of the document by | siroker@db.stanford.edu
| |
[ Pagewise preview ]