Evolutionary Algorithm for P2P Multicasting Network Design Problem

P2P multicasting is a novel approach to provide cost effective streaming services over the Internet. This paper addresses the overlay network design for P2P multicasting. We assume that the P2P multicasting system is static with low membership change rate (e.g., corporate videoconferencing, distance learning, delivery of important messages, IPTV with STB). The problem consists in joint optimization of multicast flows and access link capacity. The objective is to minimize the network cost calculated as the cost of access links. An effective evolutionary algorithm is proposed. We report results of the algorithm with comparison against optimal results and other heuristic algorithms including Lagrangean relaxation algorithm and constructive algorithm. The proposed algorithm can be used to various problems related to overlay networks, e.g., streaming services, computing and storage systems.

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

[2]  Steffen Wolf,et al.  Evolutionary Local Search for Designing Peer-to-Peer Overlay Topologies Based on Minimum Routing Cost Spanning Trees , 2006, PPSN.

[3]  Michal Wozniak.  Evolutionary approach to produce classifier ensemble based on weighted voting , 2009, 2009 World Congress on Nature & Biologically Inspired Computing (NaBIC).

[4]  Fabián E. Bustamante,et al.  Resilience in Overlay Multicast Protocols , 2006, 14th IEEE International Symposium on Modeling, Analysis, and Simulation.

[5]  Markus Leitner,et al.  Accelerating Column Generation for a Survivable Network Design Problem , 2009 .

[6]  Ying Zhu,et al.  Overlay Networks with Linear Capacity Constraints , 2008, IEEE Trans. Parallel Distributed Syst..

[7]  Krzysztof Walkowiak.  P2P multicasting network design problem — Heuristic approach , 2010, 2010 IEEE Globecom Workshops.

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

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

[10]  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..

[11]  Michael de la Maza,et al.  Book review: Genetic Algorithms + Data Structures = Evolution Programs by Zbigniew Michalewicz (Springer-Verlag, 1992) , 1993 .

[12]  Sasu Tarkoma.  Overlay Networks - Toward Information Networking , 2010 .

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

[14]  Emilio Corchado,et al.  Hybrid intelligent algorithms and applications , 2010, Inf. Sci..

[15]  Edmund K. Burke,et al.  Parallel Problem Solving from Nature - PPSN IX: 9th International Conference, Reykjavik, Iceland, September 9-13, 2006, Proceedings , 2006, PPSN.