A Heuristic Algorithm for the Multi-constrained Multicast Tree

Multicasting is an important communication mechanism for implementing real-time multimedia applications, which usually require the underlying network to provide a number of quality-of-service (QoS) guarantees to users. In this paper, we study the problem concerning how to find a feasible multicast tree in which all the multicast paths satisfy the given set of QoS constraints. This problem is referred as the multi-constrained multicast tree (MCMT) problem. Based on tabu-search technique, a heuristic algorithm named MCMTS for the MCMT problem is proposed in this study. According to the experimental results, the probability of finding a feasible multicast tree by our MCMTS method is more than 99% if one exists. Furthermore, the MCMTS is also shown to be a simple and highly efficient method. As a result, it would be a practical approach for developing multicast routing protocol.

[1]  George N. Rouskas,et al.  Multicast Routing with End-to-End Delay and Delay Variation Constraints , 1997, IEEE J. Sel. Areas Commun..

[2]  Spyros Tragoudas,et al.  An efficient algorithm for finding a path subject to two additive constraints , 2002, Comput. Commun..

[3]  Alberto Leon-Garcia,et al.  QoS Based Multicast Routing Algorithms for Real Time Applications , 1998, Perform. Evaluation.

[4]  Wen-Lin Yang.  Solving the MCOP problem optimally , 2002, 27th Annual IEEE Conference on Local Computer Networks, 2002. Proceedings. LCN 2002..

[5]  BERNARD M. WAXMAN,et al.  Routing of multipoint connections , 1988, IEEE J. Sel. Areas Commun..

[6]  Xingming Liu,et al.  Heuristic algorithms for multi-constrained quality of service routing , 2001, Proceedings IEEE INFOCOM 2001. Conference on Computer Communications. Twentieth Annual Joint Conference of the IEEE Computer and Communications Society (Cat. No.01CH37213).

[7]  Wen-Lin Yang.  Exact and Heuristic Algorithms for Multi-constrained Path Selection Problem , 2002, IEEE Pacific Rim Conference on Multimedia.

[8]  Marwan Krunz,et al.  A randomized algorithm for finding a path subject to multiple QoS constraints , 1999, Seamless Interconnection for Universal Services. Global Telecommunications Conference. GLOBECOM'99. (Cat. No.99CH37042).

[9]  Jeffrey M. Jaffe,et al.  Algorithms for finding paths with multiple constraints , 1984, Networks.

[10]  Klara Nahrstedt,et al.  On finding multi-constrained paths , 1998, ICC '98. 1998 IEEE International Conference on Communications. Conference Record. Affiliated with SUPERCOMM'98 (Cat. No.98CH36220).

[11]  Yung-Chang Chen,et al.  Advances in Multimedia Information Processing — PCM 2002: Third IEEE Pacific Rim Conference on Multimedia Hsinchu, Taiwan, December 16–18, 2002 Proceedings , 2002, IEEE Pacific Rim Conference on Multimedia.

[12]  Xin Yuan.  Heuristic algorithms for multiconstrained quality-of-service routing , 2002, IEEE/ACM Trans. Netw..

[13]  Douglas S. Reeves,et al.  Multicast routing for real-time communication of high-speed networks , 1996 .

[14]  Douglas S. Reeves,et al.  Evaluation of multicast routing algorithms for real-time communication on high-speed networks , 1995 .

[15]  Hsueh-I Lu,et al.  Multicast routing with multiple QoS constraints in ATM networks , 2000, Inf. Sci..

[16]  Piet Van Mieghem,et al.  MAMCRA: a constrained-based multicast routing algorithm , 2002, Comput. Commun..

[17]  Jon Crowcroft,et al.  Quality-of-Service Routing for Supporting Multimedia Applications , 1996, IEEE J. Sel. Areas Commun..