Network design problem for overlay multicast with limited tree delay - model and optimal results

Overlay multicast is an effective approach to the problem of streaming distribution. Other approaches proposed for streaming, i.e., unicast transmission and IP multicast have several drawbacks. The former method is not scalable with the growing number of users. The latter method - IP multicast - requires strong cooperation with ISPs (Internet Service Providers) what is not always realizable due to business issues. Based on our previous works, we focus on solving the overlay network design problem to economically distribute content among the participants using overlay multicast. The optimization goal is to minimize the overlay network cost expressed by the cost of access links. Additionally, we assume that the maximum total delay of a streaming tree is upper bounded to provide QoS (Quality of Service) guarantees. We show how various constraints following from real overlay systems influence the behavior of the distributing system. In numerical experiments we use real ISPs' price lists. To illustrate our approach we present optimal results obtained from the CPLEX solver.

[1]  Mario Gerla,et al.  Algorithms and Trade-Offs in Multicast Service Overlay Design , 2006, Simul..

[2]  Klara Nahrstedt,et al.  Optimal Resource Allocation in Overlay Multicast , 2006, IEEE Transactions on Parallel and Distributed Systems.

[3]  Helen J. Wang,et al.  Distributing streaming media content using cooperative networking , 2002, NOSSDAV '02.

[4]  Paul Francis,et al.  Chunkyspread: Multi-tree Unstructured Peer-to-Peer Multicast , 2006, IPTPS.

[5]  Klaus Wehrle,et al.  Peer-to-Peer Systems and Applications , 2005, Peer-to-Peer Systems and Applications.

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

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

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

[9]  Sonia Fahmy,et al.  Path-aware overlay multicast , 2005, Comput. Networks.

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

[11]  Jie Wu.  Handbook on Theoretical and Algorithmic Aspects of Sensor, Ad Hoc Wireless, and Peer-to-Peer Networks , 2005 .

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

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

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

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

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

[17]  Mark Handley,et al.  Topologically-aware overlay construction and server selection , 2002, Proceedings.Twenty-First Annual Joint Conference of the IEEE Computer and Communications Societies.

[18]  Samir Khuller,et al.  OMNI: An efficient overlay multicast infrastructure for real-time applications , 2006, Comput. Networks.

[19]  Krzysztof Walkowiak,et al.  Network design problem for overlay multicast with limited tree delay - model and optimal results , 2010, 2010 Fifth International Conference on Broadband and Biomedical Communications.

[20]  Thorsten Koch,et al.  Solving Steiner tree problems in graphs to optimality , 1998, Networks.

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

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