Chord: A scalable peer-to-peer lookup service for internet applications
Proceedings of the 2001 conference on Applications, technologies, architectures, and protocols for computer communications
A scalable content-addressable network
Proceedings of the 2001 conference on Applications, technologies, architectures, and protocols for computer communications
Can Heterogeneity Make Gnutella Scalable?
IPTPS '01 Revised Papers from the First International Workshop on Peer-to-Peer Systems
Pastry: Scalable, Decentralized Object Location, and Routing for Large-Scale Peer-to-Peer Systems
Middleware '01 Proceedings of the IFIP/ACM International Conference on Distributed Systems Platforms Heidelberg
Application-Level Multicast Using Content-Addressable Networks
NGC '01 Proceedings of the Third International COST264 Workshop on Networked Group Communication
Making gnutella-like P2P systems scalable
Proceedings of the 2003 conference on Applications, technologies, architectures, and protocols for computer communications
Tapestry: An Infrastructure for Fault-tolerant Wide-area Location and
Tapestry: An Infrastructure for Fault-tolerant Wide-area Location and
Secure routing for structured peer-to-peer overlay networks
OSDI '02 Proceedings of the 5th symposium on Operating systems design and implementationCopyright restrictions prevent ACM from being able to make the PDFs for this conference available for downloading
SeAl: Managing Accesses and Data in Peer-to-Peer Sharing Networks
P2P '04 Proceedings of the Fourth International Conference on Peer-to-Peer Computing
Survey of research towards robust peer-to-peer networks: search methods
Computer Networks: The International Journal of Computer and Telecommunications Networking
Similarity-based clustering strategy for mobile ad hoc multimedia databases
Mobile Information Systems
Enhancing P2P file-sharing with an internet-scale query processor
VLDB '04 Proceedings of the Thirtieth international conference on Very large data bases - Volume 30
Exploiting the synergy between gossiping and structured overlays
ACM SIGOPS Operating Systems Review - Gossip-based computer networking
Self-organized customized content delivery architecture for ambient assisted environments
UPGRADE '08 Proceedings of the third international workshop on Use of P2P, grid and agents for the development of content networks
Dynamic Querying in Structured Peer-to-Peer Networks
DSOM '08 Proceedings of the 19th IFIP/IEEE international workshop on Distributed Systems: Operations and Management: Managing Large-Scale Service Deployment
The observable part of a network
IEEE/ACM Transactions on Networking (TON)
Peer-exchange schemes to handle mismatch in peer-to-peer systems
The Journal of Supercomputing
P2P Networking and Applications
P2P Networking and Applications
Node-capability-aware replica management for peer-to-peer grids
IEEE Transactions on Systems, Man, and Cybernetics, Part A: Systems and Humans
DSI: A model for distributed multimedia semantic indexing and content integration
ACM Transactions on Multimedia Computing, Communications, and Applications (TOMCCAP)
Sampling networks by the union of m shortest path trees
Computer Networks: The International Journal of Computer and Telecommunications Networking
On the robustness of complex networks by using the algebraic connectivity
NETWORKING'08 Proceedings of the 7th international IFIP-TC6 networking conference on AdHoc and sensor networks, wireless networks, next generation internet
Enabling Dynamic Querying over Distributed Hash Tables
Journal of Parallel and Distributed Computing
Hierarchical semantic-based index for ad hoc image retrieval
Journal of Mobile Multimedia
A Read-Only Distributed Hash Table
Journal of Grid Computing
Clustering in peer-to-peer file sharing workloads
IPTPS'04 Proceedings of the Third international conference on Peer-to-Peer Systems
A hierarchical approach to improve performance of unstructured peer-to-peer system
International Journal of Communication Networks and Distributed Systems
| Hi-index | 0.00 |
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 structured overlay? We believe the answer is yes. We replaced the random graph in Gnutella by a structured overlay while retaining the content placement and discovery mechanisms of unstructured overlays to support complex queries. Our preliminary results indicate that we can use structure to improve the performance of floods and rondom walks. They also indicate that structure can be used to reduce maintenance overhead, which is surprising because it is commonly believed that unstructured overlays have lower maintenance overhead than structured overlays.