Fractional spanning tree packing problem with survivability constraints for throughput maximization in overlay multicast networks

Overlay-based multicast has been proposed as an efficient solution to ensure multicast communication in the Internet. In contrast to IP multicast, it uses a virtual topology created in an overlay network and eliminates many drawbacks related to scalability or management control. In this paper we focus on modelling and optimization of survivability of overlay multicast system which is aimed at throughput maximization. Based on fractional Steiner trees, we employ the fractional spanning tree packing problem and propose various constraints in order to model features of real systems comprising robustness against a single link failure. The paper compares optimal results of the tree packing model with a general formulation based on conceptual flows dedicated to maximizing throughput in an overlay multicast system with node capacity constraints. Although the linear program of tree packing problem cannot guarantee globally the best utilization of overlay system's resources, but it provides a relative tradeoff between applicability in result quality and time consumption meaning.

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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