HEURISTIC ALGORITHMS FOR SURVIVABLE P2P MULTICASTING

The growing volume of Internet traffic, increasing popularity of streaming services, and limited scalability of existing network techniques trigger the need to develop new delivery solutions based on a multicasting approach. Multicasting—defined as a one-to-many delivery technique—enables effective distribution of many kinds of content to end users. In this article we focus on peer-to-peer (P2P) multicasting, which combines concepts of P2P systems and multicasting solutions; in other words, the multicast tree is constructed using end hosts (peers). Because P2P multicasting can be applied to deliver content with high reliability requirements, we introduce to P2P multicasting additional survivability constraints that guarantee delivery of content in the case of network failures. We formulate a mixed-integer programming (MIP) optimization problem of survivable P2P multicasting. Because the problem is nondeterministic polynomial time (NP)-hard and exact methods such as branch-and-cut can be applied for only a relatively small problem instance, we propose two heuristic algorithms based on evolutionary approach and Tabu Search methods. Extensive computational experiments show that both heuristic algorithms provide results close to optimal—the average gap to optimal results is 0.26% and 5.15% in the case of evolutionary and Tabu Search methods, respectively.

[1]  David E. Goldberg,et al.  Large-Scale Permutation Optimization with the Ordering Messy Genetic Algorithm , 2000, PPSN.

[2]  D. Goldberg,et al.  BOA: the Bayesian optimization algorithm , 1999 .

[3]  Kalyanmoy Deb,et al.  RapidAccurate Optimization of Difficult Problems Using Fast Messy Genetic Algorithms , 1993, ICGA.

[4]  Krzysztof Walkowiak.  Survivability of P2P multicasting , 2009, 2009 7th International Workshop on Design of Reliable Communication Networks.

[5]  G. Harik.  Linkage Learning via Probabilistic Modeling in the ECGA , 1999 .

[6]  D. Goldberg,et al.  A Survey of Linkage Learning Techniques in Genetic and Evolutionary Algorithms , 2007 .

[7]  R. Eberhart,et al.  Comparing inertia weights and constriction factors in particle swarm optimization , 2000, Proceedings of the 2000 Congress on Evolutionary Computation. CEC00 (Cat. No.00TH8512).

[8]  Krzysztof Walkowiak,et al.  Evolutionary Algorithm for Congestion Problem in Connection-Oriented Networks , 2005, ICCSA.

[9]  Chuan Wu,et al.  Optimal peer selection for minimum-delay peer-to-peer streaming with rateless codes , 2005, P2PMMS'05.

[10]  Nikolaos Efthymiopoulos,et al.  VITAL++, a new communication paradigm: embedding P2P technology in next generation networks , 2011, IEEE Communications Magazine.

[11]  P. J. Angeline,et al.  Using selection to improve particle swarm optimization , 1998, 1998 IEEE International Conference on Evolutionary Computation Proceedings. IEEE World Congress on Computational Intelligence (Cat. No.98TH8360).

[12]  David E. Goldberg,et al.  Linkage Problem, Distribution Estimation, and Bayesian Networks , 2000, Evolutionary Computation.

[13]  Krzysztof Walkowiak,et al.  Modeling and optimization of survivable P2P multicasting , 2011, Comput. Commun..

[14]  Pablo Rodriguez,et al.  On next-generation telco-managed P2P TV architectures , 2008, IPTPS.

[15]  Russell C. Eberhart,et al.  A new optimizer using particle swarm theory , 1995, MHS'95. Proceedings of the Sixth International Symposium on Micro Machine and Human Science.

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

[17]  Luís Gouveia,et al.  On Formulations and Methods for the Hop-Constrained Minimum Spanning Tree Problem , 2006, Handbook of Optimization in Telecommunications.

[18]  Michal Wozniak,et al.  Optimizing distributed computing systems for k-nearest neighbours classifiers - evolutionary approach , 2011, Log. J. IGPL.

[19]  Kalyanmoy Deb,et al.  Don't Worry, Be Messy , 1991, ICGA.

[20]  David B. Fogel,et al.  Evolutionary Computation: Towards a New Philosophy of Machine Intelligence , 1995 .

[21]  Kalyanmoy Deb,et al.  Sufficient conditions for deceptive and easy binary functions , 1994, Annals of Mathematics and Artificial Intelligence.

[22]  Andries Petrus Engelbrecht,et al.  A Cooperative approach to particle swarm optimization , 2004, IEEE Transactions on Evolutionary Computation.

[23]  G. Harik.  Learning gene linkage to efficiently solve problems of bounded difficulty using genetic algorithms , 1997 .

[24]  Xuemin Shen,et al.  Handbook of Peer-to-Peer Networking , 2009 .

[25]  Luís Gouveia,et al.  Modeling hop-constrained and diameter-constrained minimum spanning tree problems as Steiner tree problems over layered graphs , 2011, Math. Program..

[26]  Thomas Bäck,et al.  Evolutionary computation: Toward a new philosophy of machine intelligence , 1997, Complex..

[27]  Fred W. Glover,et al.  Future paths for integer programming and links to artificial intelligence , 1986, Comput. Oper. Res..

[28]  Chuan Wu,et al.  Optimal Rate Allocation in Overlay Content Distribution , 2007, Networking.

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

[30]  Halina Kwasnicka,et al.  Multi Population Pattern Searching Algorithm: A New Evolutionary Method Based on the Idea of Messy Genetic Algorithm , 2011, IEEE Transactions on Evolutionary Computation.

[31]  Kalyanmoy Deb,et al.  Messy Genetic Algorithms: Motivation, Analysis, and First Results , 1989, Complex Syst..

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

[33]  Piet Demeester,et al.  Network Recovery: Protection and Restoration of Optical, SONET-SDH, IP, and MPLS , 2004 .

[34]  David E. Goldberg,et al.  OMEGA - Ordering Messy GA: Solving Permutation Problems with the Fast Genetic Algorithm and Random Keys , 2000, GECCO.

[35]  Eng Keong Lua,et al.  P2p Networking And Applications , 2009 .