Datar, Mayur (2002) Butterflies and Peer-to-Peer Networks. Technical Report. Stanford InfoLab. (Publication Note: 10th European Symposium on Algorithms (ESA 2002), September 17-21, 2002, Rome, Italy)
This is the latest version of this item.
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.
|Item Type:||Techreport (Technical Report)|
|Uncontrolled Keywords:||DHT CAN Censorship-Resistant Multi-butterfly Fault-tolerance|
|Subjects:||Computer Science > Distributed Systems|
|Related URLs:||Project Homepage||http://infolab.stanford.edu/peers/|
|Deposited By:||Import Account|
|Deposited On:||12 Jun 2002 17:00|
|Last Modified:||25 Dec 2008 09:02|
Available Versions of this Item
- Butterflies and Peer-to-Peer Networks. (deposited 27 Jan 2002 16:00)
- Butterflies and Peer-to-Peer Networks. (deposited 12 Jun 2002 17:00) [Currently Displayed]
Repository Staff Only: item control page