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
Squirrel: a decentralized peer-to-peer web cache
Proceedings of the twenty-first annual symposium on Principles of distributed computing
Analyzing peer-to-peer traffic across large networks
Proceedings of the 2nd ACM SIGCOMM Workshop on Internet measurment
Can Heterogeneity Make Gnutella Scalable?
IPTPS '01 Revised Papers from the First International Workshop on Peer-to-Peer Systems
Complex Queries in DHT-based Peer-to-Peer Networks
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
Peer-to-peer information retrieval using self-organizing semantic overlay networks
Proceedings of the 2003 conference on Applications, technologies, architectures, and protocols for computer communications
The impact of DHT routing geometry on resilience and proximity
Proceedings of the 2003 conference on Applications, technologies, architectures, and protocols for computer communications
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
Measurement, modeling, and analysis of a peer-to-peer file-sharing workload
SOSP '03 Proceedings of the nineteenth ACM symposium on Operating systems principles
Performance and Dependability of Structured Peer-to-Peer Overlays
DSN '04 Proceedings of the 2004 International Conference on Dependable Systems and Networks
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
ATEC '04 Proceedings of the annual conference on USENIX Annual Technical Conference
High availability, scalable storage, dynamic peer networks: pick two
HOTOS'03 Proceedings of the 9th conference on Hot Topics in Operating Systems - Volume 9
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
Efficient peer-to-peer keyword searching
Proceedings of the ACM/IFIP/USENIX 2003 International Conference on Middleware
INFOCOM'96 Proceedings of the Fifteenth annual joint conference of the IEEE computer and communications societies conference on The conference on computer communications - Volume 2
Comparing the performance of distributed hash tables under churn
IPTPS'04 Proceedings of the Third international conference on Peer-to-Peer Systems
Clustering in peer-to-peer file sharing workloads
IPTPS'04 Proceedings of the Third international conference on Peer-to-Peer Systems
Exploiting Geographical and Temporal Locality to Boost Search Efficiency in Peer-to-Peer Systems
IEEE Transactions on Parallel and Distributed Systems
XScribe: a stateless, cross-layer approach to P2P multicast in multi-hop ad hoc networks
MobiShare '06 Proceedings of the 1st international workshop on Decentralized resource sharing in mobile computing and networking
Energy consumption and conservation in mobile peer-to-peer systems
MobiShare '06 Proceedings of the 1st international workshop on Decentralized resource sharing in mobile computing and networking
Autonomic network management: some pragmatic considerations
Proceedings of the 2006 SIGCOMM workshop on Internet network management
ACM SIGOPS Operating Systems Review - Systems work at Microsoft Research
Exploiting the synergy between gossiping and structured overlays
ACM SIGOPS Operating Systems Review - Gossip-based computer networking
Overlay Weaver: An overlay construction toolkit
Computer Communications
P2P multicast for pervasive ad hoc networks
Pervasive and Mobile Computing
SemreX: Efficient search in a semantic overlay for literature retrieval
Future Generation Computer Systems
A comparison of structured and unstructured P2P approaches to heterogeneous random peer selection
ATC'07 2007 USENIX Annual Technical Conference on Proceedings of the USENIX Annual Technical Conference
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
Small-World Peer-to-Peer for Resource Discovery
Information Networking. Towards Ubiquitous Networking and Services
P2P Networking and Applications
P2P Networking and Applications
An advertisement-based peer-to-peer search algorithm
Journal of Parallel and Distributed Computing
Proactive information caching for efficient resource discovery in a self-structured grid
BADS '09 Proceedings of the 2009 workshop on Bio-inspired algorithms for distributed systems
A novel approach to improving search efficiency in unstructured peer-to-peer networks
Journal of Parallel and Distributed Computing
Exploiting power-law node degree distribution in Chord overlays
NGI'09 Proceedings of the 5th Euro-NGI conference on Next Generation Internet networks
Structured flooding search in chord overlays
GIIS'09 Proceedings of the Second international conference on Global Information Infrastructure Symposium
NBean: a heteropastry-based P2P proxy system
WiCOM'09 Proceedings of the 5th International Conference on Wireless communications, networking and mobile computing
Information Sciences: an International Journal
Enabling efficient information discovery in a self-structured grid
Future Generation Computer Systems
Keyword searching in structured overlays via content distance addressing
DBISP2P'05/06 Proceedings of the 2005/2006 international conference on Databases, information systems, and peer-to-peer computing
A construction scheme for scale free DHT-based networks
GLOBECOM'09 Proceedings of the 28th IEEE conference on Global telecommunications
Achieving and maintaining cost-optimal operation of a hierarchical DHT system
ICC'09 Proceedings of the 2009 IEEE international conference on Communications
Enabling Dynamic Querying over Distributed Hash Tables
Journal of Parallel and Distributed Computing
A survey of structured P2P systems for RDF data storage and retrieval
Transactions on large-scale data- and knowledge-centered systems III
On predictable large-scale data delivery in prefix-based virtualized content networks
Computer Networks: The International Journal of Computer and Telecommunications Networking
Review: A survey on content-centric technologies for the current Internet: CDN and P2P solutions
Computer Communications
A Read-Only Distributed Hash Table
Journal of Grid Computing
Scaling microblogging services with divergent traffic demands
Middleware'11 Proceedings of the 12th ACM/IFIP/USENIX international conference on Middleware
Scaling microblogging services with divergent traffic demands
Proceedings of the 12th International Middleware Conference
| Hi-index | 0.00 |
We present a comparison of structured and unstructured overlays that decouples overlay topology maintenance from query mechanism. Structured overlays provide efficient support for simple exact-match queries but they constrain overlay topology to achieve this. Unstructured overlays do not constrain overlay topology or query complexity because they use flooding or random walks to discover data. It is commonly believed that structured overlays are more expensive to maintain, that their topology constraints make it harder to exploit heterogeneity, and that they cannot support complex queries efficiently. We performed a detailed comparison study using simulations driven by real-world traces that debunks these widespread myths. We describe techniques that exploit structural constraints to achieve low maintenance overhead and we present a modified neighbour selection algorithm that can exploit heterogeneity effectively. We also describe techniques to perform floods and random walks on structured topologies. These techniques exploit structural constraints to support complex queries with better performance than unstructured overlays.