Application of Hungarian algorithm for Optimal Download Strategy in P2P File- Sharing Systems
Replication techniques are popular in P2P filesharing systems because of its improving systems performance. In the literature, all sorts of replication schemes are presented and well-studied. In a replicated P2P file-sharing system, replicas of a file may have been hosted by a lot of peers in the system. Downloaders for a file may choose one from the peers hosting the file to download. Our main concern is to let downloaders make optimal selection from the peers hosting the file in order to obtain optimal download performance. We formulate the peer selection problem as the assignment problem which includes the balanced assignment problem and the unbalanced assignment problem. Furthermore, the Hungarian algorithm is applied to solve the assignment problem. Experimental results show that our method is effective.
Replication Scheme Hungarian algorithm Peer-to-Peer Assignment Problem
Yong Xu Jian Zhao
School of Mathematics and Information Sciences Zhaoqing University Zhaoqing, China School of Business Wenzhou University Wenzhou, China
国际会议
重庆
英文
562-566
2011-08-20（万方平台首次上网日期，不代表论文的发表时间）