Efficient content distribution in wireless P2P networks
Proceedings of the 5th International ICST Conference on Heterogeneous Networking for Quality, Reliability, Security and Robustness
A heterogeneous peer-to-peer network testbed
ICUFN'09 Proceedings of the first international conference on Ubiquitous and future networks
GLOBECOM'09 Proceedings of the 28th IEEE conference on Global telecommunications
Analysis of distribution time of multiple files in a P2P network
Computer Networks: The International Journal of Computer and Telecommunications Networking
| Hi-index | 0.07 |
Peer-to-Peer file sharing applications in the Internet, such as BitTorrent, Gnutella, etc., have been immensely popular. Prior research mainly focuses on peer and content discovery, overlay topology formation, fairness and incentive issues, etc. However, little attention has been paid to investigate the data distribution problem which is also a core component of any file sharing application. In this paper, we present the first effort in addressing this collaborative file distribution problem and formally define the scheduling problem in a simplified context. We develop several algorithms to solve the problem and study their performance. We deduce a theoretical bound on the minimum download time experienced by users and also perform simulations to evaluate our algorithms. Simulation results show that our graph-based dynamically weighted maximum-flow algorithm outperforms all other algorithms. Therefore, we believe our algorithm is a promising solution to be employed as the core scheduling module in P2P file sharing applications