Scheduling Algorithms for Peer-to-Peer Collaborative File Distribution Export

@inproceedings{citeulike:813729, abstract = {Peer-to-Peer file sharing applications on 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, but seldom investigates 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 suggest several types of algorithms, including a novel Bipartite Matching algorithm, for solving the problem. Simulation results show that our weighted bipartite algorithm finds an optimal solution for all cases tested. Therefore, we believe our algorithm is a promising solution to be employed as the core scheduling module in P2P file sharing applications, shortening the total download time experienced by users.}, author = {Chan, J. S. K. and Li, V. O. K. and Lui, King-Shan}, citeulike-article-id = {813729}, citeulike-linkout-0 = {http://ieeexplore.ieee.org/xpls/abs_all.jsp?arnumber=1651215}, journal = {Collaborative Computing: Networking, Applications and Worksharing, 2005 International Conference on}, keywords = {algorithm, distribution, file, p2p, scheduling}, pages = {1--10}, posted-at = {2006-08-23 13:49:02}, priority = {2}, title = {Scheduling Algorithms for Peer-to-Peer Collaborative File Distribution}, url = {http://ieeexplore.ieee.org/xpls/abs_all.jsp?arnumber=1651215}, year = {2005} }

TY - CONF ID - citeulike:813729 L3 - citeulike-article-id:813729 N2 - Peer-to-Peer file sharing applications on 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, but seldom investigates 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 suggest several types of algorithms, including a novel Bipartite Matching algorithm, for solving the problem. Simulation results show that our weighted bipartite algorithm finds an optimal solution for all cases tested. Therefore, we believe our algorithm is a promising solution to be employed as the core scheduling module in P2P file sharing applications, shortening the total download time experienced by users. JF - Collaborative Computing: Networking, Applications and Worksharing, 2005 International Conference on EP - 10 TI - Scheduling Algorithms for Peer-to-Peer Collaborative File Distribution SP - 1 KW - algorithm KW - distribution KW - file KW - p2p KW - scheduling AU - Chan, JSK AU - Li, VOK AU - Lui, King-Shan PY - 2005/// UR - http://ieeexplore.ieee.org/xpls/abs_all.jsp?arnumber=1651215 ER -