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
Search and replication in unstructured peer-to-peer networks
ICS '02 Proceedings of the 16th international conference on Supercomputing
Replication strategies in unstructured peer-to-peer networks
Proceedings of the 2002 conference on Applications, technologies, architectures, and protocols for computer communications
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
A proof of alon's second eigenvalue conjecture
Proceedings of the thirty-fifth annual ACM symposium on Theory of computing
Modeling and performance analysis of BitTorrent-like peer-to-peer networks
Proceedings of the 2004 conference on Applications, technologies, architectures, and protocols for computer communications
Analysis of search and replication in unstructured peer-to-peer networks
SIGMETRICS '05 Proceedings of the 2005 ACM SIGMETRICS international conference on Measurement and modeling of computer systems
Is high-quality vod feasible using P2P swarming?
Proceedings of the 16th international conference on World Wide Web
Push-to-Peer Video-on-Demand System: Design and Evaluation
IEEE Journal on Selected Areas in Communications
Data mining effect in peer-to-peer queries routing
Proceedings of the International Conference on Management of Emergent Digital EcoSystems
Efficient super-peer-based queries routing
Proceedings of the International Conference on Management of Emergent Digital EcoSystems
Estimating self-sustainability in peer-to-peer swarming systems
Performance Evaluation
Review: A survey on content-centric technologies for the current Internet: CDN and P2P solutions
Computer Communications
Hi-index | 0.00 |
In this paper, we consider hybrid peer-to-peer systems where users form an unstructured peer-to-peer network with the purpose of assisting a server in the distribution of data. We present a mathematical model that we use to analyze the scalability of hybrid peer-to-peer systems under two query propagation mechanisms: the random walk and the expanding ring. In particular, we characterize how the query load at the server, the load at peers as well as the query response time scale as the number of users in the peer-to-peer network increases. We show that, under a properly designed random walk propagation mechanism, hybrid peer-to-peer systems can support an unbounded number of users while requiring only bounded resources both at the server and at individual peers. This important result shows that hybrid peer-to-peer systems have excellent scalability properties. To the best of our knowledge, this is the first time that a theoretical study characterizing the scalability of such hybrid peer-to-peer systems has been presented. We illustrate our results through numerical studies.