Multicast routing with multiple QoS constraints in ATM networks

Abstract Recently, more and more applications provide multiparty communication services, e.g., video conferencing, distance learning, etc. Therefore, the routing problem of multicast with multiple quality of service (QoS) constraints becomes more important. For example, in order to ensure smooth play back of audio and video data, a video conference requires guarantee on both end-to-end delay and loss probability. In this paper, we solve the multiple-constraint multicast problem by extending three single-constraint Steiner tree algorithms: (1) the constrained shortest path tree (CSPT), (2) the algorithm proposed by Kompella, Pasquale, and Polyzos (KPP), and (3) the bounded shortest multicast algorithm (BSMA). We also propose a novel multiple-constraint multicast routing algorithm based on genetic algorithms, called MCMGA. These four algorithms are evaluated via simulations on different sizes of random graphs. Our numerical results show that, in most cases, MCMGA yields solutions of the least cost. The costs of the solutions obtained by our extended BSMA are also very competitive.

[1]  Qing Zhu,et al.  A source-based algorithm for delay-constrained minimum-cost multicasting , 1995, Proceedings of INFOCOM'95.

[2]  Edsger W. Dijkstra,et al.  A note on two problems in connexion with graphs , 1959, Numerische Mathematik.

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

[4]  Ren-Hung Hwang,et al.  Adaptive multicast routing in broadband networks , 1998, Other Conferences.

[5]  Michael Randolph Garey,et al.  Johnson: "computers and intractability , 1979 .

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

[7]  S. Louis Hakimi,et al.  Steiner's problem in graphs and its implications , 1971, Networks.

[8]  George C. Polyzos,et al.  Multicast routing for multimedia communication , 1993, TNET.

[9]  K. Yamasaki,et al.  A dynamic routing control based on a genetic algorithm , 1993, IEEE International Conference on Neural Networks.

[10]  Hamid Ahmadi,et al.  Equivalent Capacity and Its Application to Bandwidth Allocation in High-Speed Networks , 1991, IEEE J. Sel. Areas Commun..

[11]  Sung-Pil Hong,et al.  A fast multicast routing algorithm for delay-sensitive applications , 1997, GLOBECOM 97. IEEE Global Telecommunications Conference. Conference Record.

[12]  Douglas R. Shier,et al.  On algorithms for finding the k shortest paths in a network , 1979, Networks.

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

[14]  Robert E. Tarjan,et al.  Finding optimum branchings , 1977, Networks.

[15]  R. Prim.  Shortest connection networks and some generalizations , 1957 .

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