A measurement study of the structured overlay network in P2P file-sharing systems
Advances in Multimedia
Building a reliable P2P system out of unreliable P2P clients: the case of KAD
CoNEXT '07 Proceedings of the 2007 ACM CoNEXT conference
Improving scalability of autonomic systems: the frequency-aware search approach
Autonomics '08 Proceedings of the 2nd International Conference on Autonomic Computing and Communication Systems
P2P Networking and Applications
P2P Networking and Applications
Decentralized Bootstrapping of P2P Systems: A Practical View
NETWORKING '09 Proceedings of the 8th International IFIP-TC 6 Networking Conference
Long term study of peer behavior in the KAD DHT
IEEE/ACM Transactions on Networking (TON)
Trace driven analysis of the long term evolution of Gnutella peer-to-peer traffic
PAM'07 Proceedings of the 8th international conference on Passive and active network measurement
Large-scale monitoring of DHT traffic
IPTPS'09 Proceedings of the 8th international conference on Peer-to-peer systems
Proactive replication and search for rare objects in unstructured peer-to-peer networks
WAIM'10 Proceedings of the 11th international conference on Web-age information management
P2Prec: a P2P recommendation system for large-scale data sharing
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
Proactive replication for rare objects in unstructured peer-to-peer networks
Journal of Network and Computer Applications
Montra: A large-scale DHT traffic monitor
Computer Networks: The International Journal of Computer and Telecommunications Networking
Hi-index | 0.00 |
Existing peer-to-peer systems rely on overlay network protocols for object storage and retrieval and message routing. These overlay protocols can be broadly classified as structured and unstructured - structured overlays impose constraints on the network topology for efficient object discovery, while unstructured overlays organize nodes in a random graph topology that is arguably more resilient to peer population transiency. There is an ongoing discussion on the pros and cons of both approaches. This paper contributes to the discussion a multiple-site, measurement-based study of two operational and widely-deployed file-sharing systems. The two protocols are evaluated in terms of resilience, message overhead, and query performance. We validate our findings and further extend our conclusions through detailed analysis and simulation experiments.