Modeling and optimization of survivable P2P multicasting

Various solutions based on Peer-to-Peer (P2P) multicasting have been gaining much popularity in recent years, since P2P multicasting can effectively support live streaming of various content. In this work we assume that the P2P multicasting is used to distribute content with high reliability requirements, e.g., weather warnings, security updates, financial data, security warnings, etc. The main idea to provide protection of the system against network failures is to establish several (at least two) disjoint multicasting trees. Our discussion in this paper centers on the problem how additional survivability constraints to provide failure-disjoint trees impact the operation of P2P multicasting systems. As the performance metrics we propose to use: streaming cost, maximum delay and throughput. The possible failure scenario we take into account is a single failure of one of the following network elements: streaming server, overlay link, uploading node and ISP link. We examine the topic of survivable P2P multicasting applying offline optimization methods and simulations. In the former case we formulate Mixed Integer Programming (MIP) models and use the CPLEX solver to obtain optimal results. For the streaming cost objective we compare two MIP formulations in terms of the complexity and execution time. Results show that our formulation provides much better performance compared to the classical P2P multicasting formulation proposed in the literature. Moreover, in the case of the streaming cost problem we propose a new evolutionary algorithm that yields results for larger networks than the CPLEX solver. The simulations are run to emulate a distributed network environment, in which each node makes its own decisions. Results obtained using both research methods confirm that the survivability of P2P multicasting can be achieved with relatively low additional system overhead for all three considered performance metrics: streaming cost, maximum delay and system throughput.

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

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

[3]  Fabián E. Bustamante,et al.  Resilient peer-to-peer multicast without the cost , 2005, IS&T/SPIE Electronic Imaging.

[4]  Tomonori Aoyama,et al.  A new generation network: Beyond the Internet and NGN , 2009, IEEE Communications Magazine.

[5]  Laurent Massoulié,et al.  Is There a Future for Mesh-Based live Video Streaming? , 2008, 2008 Eighth International Conference on Peer-to-Peer Computing.

[6]  Oktay Günlük,et al.  A branch-and-cut algorithm for capacitated network design problems , 1999, Math. Program..

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

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

[9]  T. Koch,et al.  Solving Steiner Tree Problems in Graphs to Optimality , 1998 .

[10]  Peter Kubat,et al.  Reliable video broadcasts via protected Steiner trees , 2010, IEEE Communications Magazine.

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

[12]  Klara Nahrstedt,et al.  DagStream: locality aware and failure resilient peer-to-peer streaming , 2006, Electronic Imaging.

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

[14]  Binoy Ravindran,et al.  An approximation algorithm for minimum-delay peer-to-peer streaming , 2009, 2009 IEEE Ninth International Conference on Peer-to-Peer Computing.

[15]  Panos M. Pardalos,et al.  Handbook of Optimization in Telecommunications , 2006 .

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

[17]  Zongming Fei,et al.  A Proactive Tree Recovery Mechanism for Resilient Overlay Multicast , 2007, IEEE/ACM Transactions on Networking.

[18]  Rakesh Kumar,et al.  Stochastic Fluid Theory for P2P Streaming Systems , 2007, IEEE INFOCOM 2007 - 26th IEEE International Conference on Computer Communications.

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

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

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

[22]  Laurence A. Wolsey,et al.  Aggregation and Mixed Integer Rounding to Solve MIPs , 2001, Oper. Res..

[23]  Aravind Srinivasan,et al.  Resilient multicast using overlays , 2006, TNET.

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

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

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

[27]  Peter A. Dinda,et al.  FatNemo: Building a Resilient Multi-source Multicast Fat-Tree , 2004, WCW.

[28]  Raouf Boutaba,et al.  Network virtualization: state of the art and research challenges , 2009, IEEE Communications Magazine.

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

[30]  Helen J. Wang,et al.  Resilient peer-to-peer streaming , 2003, 11th IEEE International Conference on Network Protocols, 2003. Proceedings..

[31]  Gabi Dreo Rodosek,et al.  TOPICS IN NETWORK AND SERVICE MANAGEMENT , 2009 .

[32]  Zongpeng Li,et al.  On achieving optimal throughput with network coding , 2005, Proceedings IEEE 24th Annual Joint Conference of the IEEE Computer and Communications Societies..