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
SIGMETRICS '05 Proceedings of the 2005 ACM SIGMETRICS international conference on Measurement and modeling of computer systems
The bittorrent p2p file-sharing system: measurements and analysis
IPTPS'05 Proceedings of the 4th international conference on Peer-to-Peer Systems
Global stability of Peer-to-Peer file sharing systems
Computer Communications
Stability properties of linear file-sharing networks: invited presentation, extended abstract
Proceedings of the Fourth International ICST Conference on Performance Evaluation Methodologies and Tools
On the Efficiency of Peer-to-Peer File Sharing
Journal of Signal Processing Systems
E2E blocking probability of IPTV and P2PTV
NETWORKING'08 Proceedings of the 7th international IFIP-TC6 networking conference on AdHoc and sensor networks, wireless networks, next generation internet
Estimating self-sustainability in peer-to-peer swarming systems
Performance Evaluation
IWSOS'06/EuroNGI'06 Proceedings of the First international conference, and Proceedings of the Third international conference on New Trends in Network Architectures and Services conference on Self-Organising Systems
Content availability and bundling in swarming systems
IEEE/ACM Transactions on Networking (TON)
Hi-index | 0.00 |
In this paper we study the population dynamics and resource usage optimization of a P2P file sharing system, where the availability of the requested file is not guaranteed. We study the system first by a deterministic fluid model and then by a more detailed Markov chain analysis that allows estimating the life time of the system. In addition, the underlying topology of the network is modelled by a simple geometry. Using the resulting spatio-temporal model we assess how much the resource usage of the network can be reduced, e.g., by selecting the nearest seed for download instead of a random one.