Should we build Gnutella on a structured overlay?

@article{Castro2004ShouldWB,
  title={Should we build Gnutella on a structured overlay?},
  author={Miguel Castro and Manuel Costa and Antony Ian Taylor Rowstron},
  journal={ACM SIGCOMM Computer Communication Review},
  year={2004},
  volume={34},
  pages={131 - 136}
}
There has been much interest in both unstructured and structured overlays recently. Unstructured overlays, like Gnutella, build a random graph and use flooding or random walks on the graph to discover data stored by overlay nodes. Structured overlays assign keys to data items and build a graph that maps each key to a specific node. The structure of the graph enables efficient discovery of data items given their keys but it does not support complex queries.Should we build Gnutella on a… 

Figures from this paper

Janus: Build Gnutella-Like File Sharing System over Structured Overlay
TLDR
Janus is presented, which build unstructured file sharing system over structured overlay, which keeps bidirectional links in its routing table and with one-hop replication and biased random walk Janus make it possible to implement complex queries in the scalable manner.
A Hybrid Structured-Unstructured P 2 P Search Infrastructure
  • Computer Science
TLDR
Through extensive measurements of the Gnutella network from multiple vantage points, this work argues for a hybrid search solution, where structured search techniques are used to index and locate rare items, and flooding techniques areused for locating highly replicated content.
Improving Search Using a Fault-Tolerant Overlay in Unstructured P2P Systems
TLDR
This work used local information at each node to construct an overlay, Makalu, that improved search performance and reduced bandwidth consumption and maximized the expansion from each node's neighborhood while minimizing the latency to its neighbors.
Hybrid Overlay Structure Based on Virtual Node
TLDR
Aiming at integrating the flexibility of unstructured architectures with the regularity of structured architectures, a hybrid overlay structure based on virtual node is proposed, which can work well with low maintenance cost in the dynamic environment.
Multicast and Bulk Lookup in Structured Overlay Networks
TLDR
This chapter argues that structured overlay networks are suitable for doing efficient group communication, and provides algorithms that enable a node to efficiently broadcast a message to all other nodes in a structured overlay network, without inducing any redundant messages.
Considering complex search techniques in DHTs under churn
  • J. Furness, M. Kolberg
  • Computer Science
    2011 IEEE Consumer Communications and Networking Conference (CCNC)
  • 2011
TLDR
Novel results comparing blind search over Chord and Pastry while under varying levels of churn are presented and how different data replication strategies can be used to enhance the query success rate is considered.
Examining the Tradeoffs of Structured Overlays in a Dynamic Non-Transitive Network
TLDR
The results indicate that non-transitivity can have a large effect on the performance of some overlays, while the amount of churn seen on PlanetLab tends to have a less significant impact.
Pastel: Bridging the Gap between Structured and Large-State Overlays
TLDR
Pastel is presented, an extension to Pastry that bridges the gap between the two types of overlays, and a novel API is proposed, to give applications control over the type of lookups (structured, multi-hop routing, or attempt direct contact).
A Survey of Blind Search Techniques in Structured P2P Networks
TLDR
This work reviews the existing methods for performing complex queries on top of structured P2P networks; focusing on methods which allow for full-text search rather than only key- word queries.
Assisted Peer-to-Peer Search with Partial Indexing
TLDR
Experiments show that the assisted search with a lightweight partial indexing service can significantly improve the success rate in locating data than Gnutella and a hit-rate-based protocol in unstructured P2P systems, while incurring low search latency and overheads.
...
...

References

SHOWING 1-10 OF 27 REFERENCES
YAPPERS: a peer-to-peer lookup service over arbitrary topology
TLDR
This paper proposes a hybrid scheme for building a peer-to-peer lookup service over arbitrary network topology that can reduce the nodes contacted for a lookup by an order of magnitude, allows rapid searching of nearby nodes through quick fan-out, does not reorganize the underlying overlay, and isolates the effect of topology changes to small areas for better scalability and stability.
An evaluation of scalable application-level multicast built using peer-to-peer overlays
  • M. Castro, Michael B. Jones, A. Wolman
  • Business, Computer Science
    IEEE INFOCOM 2003. Twenty-second Annual Joint Conference of the IEEE Computer and Communications Societies (IEEE Cat. No.03CH37428)
  • 2003
TLDR
This paper reports the first head-to-head comparison of CAN-style versus Pastry-style overlay networks, using multicast communication workloads running on an identical simulation infrastructure and shows that Pastry provides better performance than CAN.
Exploiting network proximity in peer-to-peer overlay networks
TLDR
This paper presents a comprehensive study of the network locality properties of a p2p overlay network, and results obtained via analysis and via simulation of two large-scale topology models indicate that it is possible to efficiently exploit network proximity in self-organizing p2P substrates.
Making gnutella-like P2P systems scalable
TLDR
This work proposes several modifications to Gnutella's design that dynamically adapt the overlay topology and the search algorithms in order to accommodate the natural heterogeneity present in most peer-to-peer systems.
Pastry: Scalable, distributed object location and routing for large-scale peer-to-
TLDR
Experimental results obtained with a prototype implementa tion on a simulated network of up to 100,000 nodes confirm Pastry’s scalability, its ability to selfconfigure and adapt to node failures, and its good network loc ality properties.
Secure routing for structured peer-to-peer overlay networks
TLDR
This paper studies attacks aimed at preventing correct message delivery in structured peer-to-peer overlays and presents defenses to these attacks, and describes and evaluates techniques that allow nodes to join the overlay, to maintain routing state, and to forward messages securely in the presence of malicious nodes.
Efficient Broadcast in Structured P2P Networks
TLDR
An efficient algorithm for performing a broadcast operation with minimal cost in structured DHT-based P2P networks and considers broadcasting as a basic service that adds to existing DHTs the ability to search using arbitrary queries as well as dissiminate/collect global information.
Chord: A scalable peer-to-peer lookup service for internet applications
TLDR
Results from theoretical analysis, simulations, and experiments show that Chord is scalable, with communication cost and the state maintained by each node scaling logarithmically with the number of Chord nodes.
Pastry: Scalable, Decentralized Object Location, and Routing for Large-Scale Peer-to-Peer Systems
TLDR
Experimental results obtained with a prototype implementation on an emulated network of up to 100,000 nodes confirm Pastry's scalability and efficiency, its ability to self-organize and adapt to node failures, and its good network locality properties.
How to model an internetwork
TLDR
This work considers the problem of efficiently generating graph models that accurately reflect the topological properties of real internetworks, and proposes efficient methods for generating topologies with particular properties, including a transit-stub model that correlates well with the internet structure.
...
...