Heuristic Algorithms for Optimization of Data Distribution in P2P Networks

Peer-to-Peer (P2P) systems have gained much popularity over the past few years. P2P networks contribute a significant portion of the Internet traffic and cause increasing costs incurred by Internet Service Providers (ISP). Present P2P systems are generally selecting peers in random manner, regardless of the network cost, which generates much redundant traffic over the core network and congest the Internet. Therefore the need to optimize P2P networks arises. The following article presents the research on heuristic algorithms to optimize distribution problems in P2P networks. We propose a construction algorithm called Backward Cost Selection and a Tabu Search algorithm. Simulation comparison against optimal results yielded by CPLEX solver shows that both algorithms produce results close to optimal ones, while the execution time is significantly lower than CPLEX.

[1]  Gang Wu.  Peer to Peer File Download and Streaming , 2005 .

[2]  Dr. Zbigniew Michalewicz,et al.  How to Solve It: Modern Heuristics , 2004 .

[3]  Gustavo de Veciana,et al.  Service capacity of peer to peer networks , 2004, IEEE INFOCOM 2004.

[4]  Michel Gendreau,et al.  An Introduction to Tabu Search , 2003, Handbook of Metaheuristics.

[5]  Ying Zhu,et al.  Overlay Networks with Linear Capacity Constraints , 2005, IEEE Transactions on Parallel and Distributed Systems.

[6]  Alexandru Iosup,et al.  Correlating Topology and Path Characteristics of Overlay Networks and the Internet , 2006, Sixth IEEE International Symposium on Cluster Computing and the Grid (CCGRID'06).

[7]  Jan-Ming Ho,et al.  Improving the Download Time of BitTorrent-Like Systems , 2007, 2007 IEEE International Conference on Communications.

[8]  Anup Basu,et al.  Traceroute-Based Fast Peer Selection without Offline Database , 2006, Eighth IEEE International Symposium on Multimedia (ISM'06).

[9]  Hamid R. Rabiee,et al.  An optimal discrete rate allocation for overlay video multicasting , 2008, Comput. Commun..

[10]  Chuan Wu,et al.  On meeting P2P streaming bandwidth demand with limited supplies , 2008, Electronic Imaging.

[11]  Mukund Seshadri,et al.  On Cooperative Content Distribution and the Price of Barter , 2005, 25th IEEE International Conference on Distributed Computing Systems (ICDCS'05).

[12]  Richard Weber,et al.  E-cient File Dissemination using Peer-to-Peer Technology , 2005 .

[13]  Michael Vrable,et al.  The Overlay Network Content Distribution Problem , 2005 .

[14]  Rina Panigrahy,et al.  Analyzing BitTorrent and related peer-to-peer networks , 2006, SODA '06.

[15]  Hideki Tode,et al.  CAT: A Cost-Aware BitTorrent , 2007, 32nd IEEE Conference on Local Computer Networks (LCN 2007).

[16]  Deep Medhi,et al.  Routing, flow, and capacity design in communication and computer networks , 2004 .

[17]  Christian Scheideler,et al.  Can ISPS and P2P users cooperate for improved performance? , 2007, CCRV.

[18]  Klaus Wehrle,et al.  Peer-to-Peer Systems and Applications , 2005, Peer-to-Peer Systems and Applications.

[19]  Krzysztof Walkowiak.  Offline Approach to Modeling and Optimization of Flows in Peer-to-Peer Systems , 2008, 2008 New Technologies, Mobility and Security.

[20]  Laurent Massoulié,et al.  Coupon replication systems , 2008, TNET.