Butterflies and Peer-to-Peer Networks

Abstract

The popularity of systems like Napster, Gnutella etc. have spurred recent interest in Peer-to-peer systems. A central problem in all these systems is efficient location of resources based on their keys. A network that supports such queries is referred to as Content Addressable Network (CAN). Many solutions have been proposed to building CANs. However most of these solutions do not focus on adversarial faults, which might be critical to building a censorship resistant peer-to-peer system. In a recent paper Fiat and Saia have proposed a solution to building such a system. We propose a new solution based on multi-butterflies that improves upon the previous solution by Fiat and Saia. Our new network, {\bf multi-hypercube}, is a fault tolerant version of hypercube. We also demonstrate how this network can be maintained dynamically. This addresses the first open problem in the paper by Fiat and Saia.

Available Versions of this Item

• Butterflies and Peer-to-Peer Networks. (deposited 27 Jan 2002 16:00) [Currently Displayed]
  • Butterflies and Peer-to-Peer Networks. (deposited 12 Jun 2002 17:00)