Maximum flow trees in overlay multicast: Modeling and optimization

Recently, peer-to-peer (P2P) multicast has become more and more popular approach of simultaneous content delivery to a group of users. It is especially valuable for multimedia applications realized in the Internet. Apart from network-based IP multicast, P2P multicast forms an overlay structure of routing where end-hosts actively contribute to the network by sharing their data streams across other receivers. The overlay structure is routed then via IP network using well-defined unicast flows. This paper focuses on modeling and optimization of content routing in overlay multicast systems. Having a set of overlay nodes interested in joining the same, single source multicast transmission, where every node is subject to limited upload and download access link capacity, we aim at providing an optimal overlay multicast in order to maximize the total system throughput and we formulate maximum flow trees problem related to multicast in overlay network. We also present an original Greedy Algorithm and Golden Ratio Heuristic for solving the problem. These algorithms are evaluated in relation to optimal results yielded by CPLEX solver and random benchmarks.

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

[2]  Ravindra K. Ahuja,et al.  Network Flows: Theory, Algorithms, and Applications , 1993 .

[3]  T. Ho,et al.  On Linear Network Coding , 2010 .

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

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

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

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

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

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

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

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

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

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

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

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

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

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

[18]  Muriel Médard,et al.  An algebraic approach to network coding , 2003, TNET.

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

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

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

[22]  Oktay Günlük,et al.  The multicast packing problem , 2000, TNET.

[23]  Fouad A. Tobagi,et al.  Optimum routing of multicast streams , 1994, Proceedings of INFOCOM '94 Conference on Computer Communications.

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

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

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

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

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

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

[30]  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).

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

[32]  Yunnan Wu,et al.  A unification of network coding and tree-packing (routing) theorems , 2006, TNET.

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

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

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

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

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

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