Optimization of Flows in Level-Constrained Multiple Trees for P2P Multicast System

Peer-to-Peer multicast defined for overlay networks, has been taking an advantage over IP Multicast during recent years. It derives from the fact that the overlay architecture for P2P streaming provides potential scalability and easy deployment of new protocols independent of the network layer solutions at relatively low costs. In this paper, we focus on modelling and optimization of multiple trees for flow assignment in P2P multicast systems. The optimization covers multicast flow arrangement on multiple paths in order to minimize the overall streaming cost. Due to quality of service requirements in such kind of systems, we apply a basic hop-constrained spanning tree and capacitated spanning tree problems and we define level-constrained multiple trees problem with bandwidth capacity constraints for multicast flow assignment in overlay system. We propose and compare two Mixed Integer Programming formulations for the problem. In addition, we examine multicast flows in relation to various fragmentation of the content. Keywords-P2P; Multicast; Flows; Network Optimization

[1]  Kemal Altinkemer,et al.  Using a Hop-Constrained Model to Generate Alternative Communication Network Design , 2015, INFORMS J. Comput..

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

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

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

[5]  Christos H. Papadimitriou,et al.  The complexity of the capacitated tree problem , 1978, Networks.

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

[7]  Luís Gouveia,et al.  MPLS over WDM network design with packet level QoS constraints based on ILP models , 2003, IEEE INFOCOM 2003. Twenty-second Annual Joint Conference of the IEEE Computer and Communications Societies (IEEE Cat. No.03CH37428).

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

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

[10]  Luís Gouveia,et al.  Modeling hop-constrained and diameter-constrained minimum spanning tree problems as Steiner tree problems over layered graphs , 2011, Math. Program..

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

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

[13]  Geir Dahl,et al.  The 2-hop spanning tree problem , 1998, Oper. Res. Lett..

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

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

[16]  L. Gouveia.  Multicommodity flow models for spanning trees with hop constraints , 1996 .

[17]  Larry J. LeBlanc,et al.  Packet Routing in Telecommunication Networks with Path and Flow Restrictions , 1999, INFORMS J. Comput..

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

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