Spinneret: A Log Random Substrate for P2P Networks

Until now, structured and unstructured networks have been considered in absentia of each other. We believe that next-generation P2P services will require both structured and unstructured algorithms, and that it therefore makes sense to consider a unified substrate that provides good service for both. In this paper we argue for the creation of a semi-structured overlay substrate, called Spinneret, which can serve as the base layer for a variety of structured and unstructured search algorithms. In order to validate that this structure forms a good foundation for various services, we present two algorithms simulated on top of the Spinneret substrate: an unstructured k-walker random walk search as well as a logarithmic DHT search. Further, we argue that such a substrate strikes a balance between the resilience and reliability of unstructured networks and the efficiency of structured networks.

• Type: Conference
• Year: 2007
• Where: IPPS
• Authors: Jeff Rose, Cyrus P. Hall, Antonio Carzaniga
• Keywords: Distributed And Parallel Computing, IPPS 2007, Structured, Unstructured Networks, Unstructured Search Algorithms