Optimal multicast route packing

This paper considers the hop-constrained multicast route packing problem with a bandwidth reservation to build QoS-guaranteed multicast routing trees with a minimum installation cost. Given a set of multicast sessions, each of which has a hop limit constraint and a bandwidth requirement, the problem is to determine the set of multicast routing trees in an arc-capacitated network with the objective of minimizing the cost. For the problem, we propose a branch-and-cut-and-price algorithm, which can be viewed as a branch-and-bound method incorporating both the strong cutting plane algorithm and the column generation method. We implemented and tested the proposed algorithm on randomly generated problem instances with sizes up to 30 nodes, 570 arcs, and 10 multicast sessions. The test results show that the algorithm can obtain the optimal solution to practically sized problem instances within a reasonable time limit in most cases.

[1]  C S Sung,et al.  Branch-and-price algorithm for a multicast routing problem , 1999, J. Oper. Res. Soc..

[2]  Donghan Kang,et al.  A New Mathematical Formulation for Generating a Multicast Routing Tree , 2006 .

[3]  Laurence A. Wolsey,et al.  Integer and Combinatorial Optimization , 1988 .

[4]  Ning Wang,et al.  An efficient algorithm for group multicast routing with bandwidth reservation , 1999, IEEE International Conference on Networks. ICON '99 Proceedings (Cat. No.PR00243).

[5]  Sungsoo Park,et al.  A polyhedral approach to edge coloring , 1991, Oper. Res. Lett..

[6]  Hanif D. Sherali,et al.  Sequential and Simultaneous Liftings of Minimal Cover Inequalities for Generalized Upper Bound Constrained Knapsack Polytopes , 1995, SIAM J. Discret. Math..

[7]  Martin W. P. Savelsbergh,et al.  Branch-and-Price: Column Generation for Solving Huge Integer Programs , 1998, Oper. Res..

[8]  Ellis L. Johnson,et al.  A note of the knapsack problem with special ordered sets , 1981, Oper. Res. Lett..

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

[10]  Cynthia Barnhart,et al.  Using Branch-and-Price-and-Cut to Solve Origin-Destination Integer Multicommodity Flow Problems , 2000, Oper. Res..

[11]  Kyungsik Lee,et al.  A branch-and-price algorithm for the Steiner tree packing problem , 2002, Comput. Oper. Res..

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

[13]  Sungsoo Park,et al.  ATM VP-based network design , 2004, Eur. J. Oper. Res..

[14]  J. S. Meditch,et al.  An algorithm for optimal multicast of multimedia streams , 1994, Proceedings of INFOCOM '94 Conference on Computer Communications.

[15]  Sungsoo Park,et al.  An Integer Programming Approach to the Bandwidth Packing Problem , 1996 .

[16]  S. Voß,et al.  The Steiner tree problem with hop constraints , 1999, Ann. Oper. Res..

[17]  Kim-Fung Man,et al.  Optimization of spare capacity in self-healing multicast ATM network using genetic algorithm , 2000, IEEE Trans. Ind. Electron..

[18]  Gang Feng,et al.  Efficient multicast routing with delay constraints , 1999, Int. J. Commun. Syst..

[19]  David S. Johnson,et al.  Computers and Intractability: A Guide to the Theory of NP-Completeness , 1978 .