Modeling and optimization of maximum flow survivable overlay multicast with predefined routing trees

Overlay networks employ underlying network technologies in order to provide end-system related communication and over the years overlays have been getting more and more attention in research community and in business world as well. Since overlays tackle many drawbacks present in pure “link-router-network” engineering, they have become an excellent solution for multimedia-oriented applications. A good example comprises multicast communications, where an overlay system, in contrast to IP Multicast, eliminates many issues related to scalability or management control. This paper focuses on modeling and optimization of overlay multicast networks aimed at realizing maximum throughput with survivability constraints, where survivability defines the ability of a multicast system to limit potential throughput losses in case of a failure of single virtual link. We present linear formulation derived from fractional tree packing problems based on predefined topologies which may route multicast traffic. Linear model might be used for obtaining optimal multicast structures, however its applicability is limited by increasing sizes of networks. Hence, we also design and evaluate heuristic searches dedicated to optimization of maximum flow survivable overlay multicast networks.

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

[2]  C. D. Gelatt,et al.  Optimization by Simulated Annealing , 1983, Science.

[3]  David K. Smith.  Network Flows: Theory, Algorithms, and Applications , 1994 .

[4]  A. Cayley.  A theorem on trees , 2009 .

[5]  Hui Zhang,et al.  A case for end system multicast (keynote address) , 2000, SIGMETRICS '00.

[6]  Supriya Chaluvadi,et al.  A Proactive Tree Recovery Mechanism for Resilient Overlay Multicast , 2012 .

[7]  Francisco Barahona,et al.  Packing Spanning Trees , 1995, Math. Oper. Res..

[8]  Abderrahim Benslimane.  Multimedia Multicast on the Internet , 2006 .

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

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

[11]  James P. G. Sterbenz,et al.  Modelling communication network challenges for Future Internet resilience, survivability, and disruption tolerance: a simulation-based approach , 2013, Telecommun. Syst..

[12]  Mario Gerla,et al.  Will IPTV ride the peer-to-peer stream? [Peer-to-Peer Multimedia Streaming] , 2007, IEEE Communications Magazine.

[13]  Anthony H. Dekker,et al.  Network Robustness and Graph Topology , 2004, ACSC.

[14]  Zongpeng Li,et al.  On achieving maximum multicast throughput in undirected networks , 2006, IEEE Transactions on Information Theory.

[15]  Peter Sanders,et al.  Polynomial time algorithms for network information flow , 2003, SPAA '03.

[16]  Mario Gerla,et al.  Multicast Service Overlay Design , 2005 .

[17]  R. Koetter,et al.  An algebraic approach to network coding , 2001, Proceedings. 2001 IEEE International Symposium on Information Theory (IEEE Cat. No.01CH37252).

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

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

[20]  Jacek Rak.  κ-Penalty: a novel approach to find κ-Disjoint paths with differentiated path costs , 2010, IEEE Communications Letters.

[21]  Christophe Diot,et al.  Deployment issues for the IP multicast service and architecture , 2000, IEEE Netw..

[22]  Srinivasan Seshan,et al.  A case for end system multicast , 2002, IEEE J. Sel. Areas Commun..

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

[24]  Klara Nahrstedt,et al.  Optimal resource allocation in overlay multicast , 2003, 11th IEEE International Conference on Network Protocols, 2003. Proceedings..

[25]  Bo Leuf,et al.  Peer to Peer: Collaboration and Sharing over the Internet , 2002 .

[26]  Krzysztof Walkowiak,et al.  Fractional spanning tree packing problem with survivability constraints for throughput maximization in overlay multicast networks , 2011, 2011 3rd International Congress on Ultra Modern Telecommunications and Control Systems and Workshops (ICUMT).

[27]  Krzysztof Walkowiak,et al.  An Improved Annealing Algorithm for Throughput Maximization in Static Overlay-Based Multicast Systems , 2011, HAIS.

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

[29]  Naveen Garg,et al.  Bandwidth Maximization in Multicasting , 2003, ESA.

[30]  Martin Grötschel,et al.  Packing Steiner trees: polyhedral investigations , 1996, Math. Program..

[31]  Jonathan S. Turner,et al.  Multicast routing and bandwidth dimensioning in overlay networks , 2002, IEEE J. Sel. Areas Commun..

[32]  Jacek Rak,et al.  Simultaneous optimization of unicast and anycast flows and replica location in survivable optical networks , 2013, Telecommun. Syst..

[33]  Baochun Li,et al.  Outreach: peer-to-peer topology construction towards minimized server bandwidth costs , 2007, IEEE Journal on Selected Areas in Communications.

[34]  Chuan Wu,et al.  rStream: resilient peer-to-peer streaming with rateless codes , 2005, MULTIMEDIA '05.

[35]  Krzysztof Walkowiak,et al.  On Modelling of Fair Throughput Allocation in Overlay Multicast Networks , 2011, NEW2AN.

[36]  Jun Chen,et al.  A Review of Resilient Approaches to Peer-to-Peer Overlay Multicast for Media Streaming , 2008, 2008 4th International Conference on Wireless Communications, Networking and Mobile Computing.

[37]  Zongpeng Li,et al.  A High-Throughput Overlay Multicast Infrastructure with Network Coding , 2005, IWQoS.

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

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

[40]  Rudolf Ahlswede,et al.  Network information flow , 2000, IEEE Trans. Inf. Theory.

[41]  Stephen E. Deering,et al.  Multicast routing in datagram internetworks and extended LANs , 1990, TOCS.

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

[43]  J. Edmonds.  Minimum partition of a matroid into independent subsets , 1965 .

[44]  Jacek Rak,et al.  Reliable anycast and unicast routing: protection against attacks , 2013, Telecommun. Syst..

[45]  Shuo-Yen Robert Li,et al.  Linear network coding , 2003, IEEE Trans. Inf. Theory.

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

[47]  Mohammad R. Salavatipour,et al.  Packing Steiner trees , 2003, SODA '03.

[48]  Krzysztof Walkowiak,et al.  Optimization of Flows in Level-Constrained Multiple Trees for P2P Multicast System , 2010, AP2PS 2010.

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

[50]  Peter Sanders,et al.  Polynomial time algorithms for multicast network code construction , 2005, IEEE Transactions on Information Theory.