QoS multicast routing for multimedia group communications using intelligent computational methods

In this paper, we investigate the problem of quality-of-service (QoS) multicast routing for multimedia group communications. We first develop a unified framework for achieving QoS multicast trees using intelligent computational methods. The framework consists of the model for multimedia communication network, the formulation of QoS multicast routing problem, and three key components used in intelligent computational methods-based QoS multicast routing algorithms. Then we propose three QoS multicast algorithms based on three representative intelligent computational methods (i.e., genetic algorithm, simulated annealing, and Tabu search), separately. In these algorithms, both the network resource requirements and the end-to-end delay are considered as the QoS parameters. Various issues are analyzed and designed for applying these three intelligent computational methods to construct QoS multicast trees. By simulation, we evaluate the performance of these three algorithms on a small-scale real-world multimedia communication network and a randomly generated large-scale network. Simulation results show that our algorithms can find near-optimal QoS multicast trees with high success rate. We also compare the running time among them, which help explain the algorithmic structures.

[1]  Xiaohua Jia,et al.  A distributed algorithm of delay-bounded multicast routing for multimedia applications in wide area networks , 1998, TNET.

[2]  T. V. Levanova,et al.  Algorithms of Ant System and Simulated Annealing for the p-median Problem , 2004 .

[3]  Sadiq M. Sait,et al.  QoS-driven multicast tree generation using Tabu search , 2002, Comput. Commun..

[4]  Reuven Cohen,et al.  Restricted dynamic Steiner trees for scalable multicast in datagram networks , 1998, TNET.

[5]  Amitava Mukherjee,et al.  An Approach to Wide Area WDM Optical Network Design Using Genetic Algorithm , 1999, Comput. Commun..

[6]  Mitsuo Gen,et al.  Genetic Algorithms , 1999, Wiley Encyclopedia of Computer Science and Engineering.

[7]  Pi-Rong Sheu,et al.  A fast and efficient heuristic algorithm for the delay- and delay variation-bounded multicast tree problem , 2002, Comput. Commun..

[8]  Ke Xu,et al.  Multi-constrained routing based on simulated annealing , 2003, IEEE International Conference on Communications, 2003. ICC '03..

[9]  Qingfu Zhang,et al.  An orthogonal genetic algorithm for multimedia multicast routing , 1999, IEEE Trans. Evol. Comput..

[10]  Mohammed Atiquzzaman,et al.  Least cost heuristic for the delay-constrained capacitated minimum spanning tree problem , 2005, Comput. Commun..

[11]  Xipeng Xiao,et al.  Internet QoS: a big picture , 1999, IEEE Netw..

[12]  Dana S. Richards,et al.  Steiner tree problems , 1992, Networks.

[13]  Leonidas Georgiadis,et al.  Algorithms for precomputing constrained widest paths and multicast trees , 2005, IEEE/ACM Transactions on Networking.

[14]  Kai-Yeung Siu,et al.  New dynamic algorithms for shortest path tree computation , 2000, TNET.

[15]  L. Li,et al.  A QoS-guaranteed multicast routing protocol , 2004, Comput. Commun..

[16]  Ariel Orda,et al.  A scalable approach to the partition of QoS requirements in unicast and multicast , 2005, TNET.

[17]  Bin Wang,et al.  Many to Many Multicast Routing With Temporal Quality of Service Guarantees , 2003, IEEE Trans. Computers.

[18]  M. Gendreau,et al.  A tabu search heuristic for the Steiner Tree Problem , 1999, Networks.

[19]  Yee Leung,et al.  A genetic algorithm for the multiple destination routing problems , 1998, IEEE Trans. Evol. Comput..

[20]  Samir Khuller,et al.  Balancing minimum spanning and shortest path trees , 1993, SODA '93.

[21]  Yen-Ting Lin,et al.  MQ: an integrated mechanism for multimedia multicasting , 2001, IEEE Trans. Multim..

[22]  Idit Keidar,et al.  Group communication specifications: a comprehensive study , 2001, CSUR.

[23]  Anil Pahwa,et al.  Intelligent computational methods for power systems optimization problems , 2003, 2003 IEEE Power Engineering Society General Meeting (IEEE Cat. No.03CH37491).

[24]  Qing Zhu,et al.  An iterative algorithm for delay-constrained minimum-cost multicasting , 1998, TNET.

[25]  G. D. Smith,et al.  Solving the Graphical Steiner Tree Problem Using Genetic Algorithms , 1993 .

[26]  Alex Zelikovsky,et al.  Improved Steiner tree approximation in graphs , 2000, SODA '00.

[27]  Tomoya Enokido,et al.  Notification-based QoS control protocol for multimedia group communication in high-speed networks , 2004, 24th International Conference on Distributed Computing Systems, 2004. Proceedings..

[28]  Daniel Zappala.  Alternate path routing for multicast , 2004, IEEE/ACM Trans. Netw..

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

[30]  Chor Ping Low,et al.  Distributed multicast routing, with end-to-end delay and delay variation constraints , 2000, Comput. Commun..

[31]  Samir Khuller,et al.  Balancing Minimum Spanning and Shortest Path Trees , 1993, SODA.

[32]  Fred Glover,et al.  Tabu Search - Part II , 1989, INFORMS J. Comput..

[33]  Joseph Naor,et al.  Resource optimization in QoS multicast routing of real-time multimedia , 2004, IEEE/ACM Transactions on Networking.

[34]  Niki Pissinou,et al.  A real-time multicast routing algorithm for multimedia applications , 1997, Comput. Commun..

[35]  Bin Wang,et al.  Multicast routing and its QoS extension: problems, algorithms, and protocols , 2000 .

[36]  Mitsuo Gen,et al.  Genetic algorithms and engineering optimization , 1999 .

[37]  Kenneth Steiglitz,et al.  Combinatorial Optimization: Algorithms and Complexity , 1981 .

[38]  Henrik Esbensen,et al.  Computing near-optimal solutions to the steiner problem in a graph using a genetic algorithm , 1995, Networks.

[39]  A. Zelikovsky,et al.  An improved approximation scheme for the Group Steiner Problem , 2001 .

[40]  Guoliang Xue,et al.  Minimum-cost QoS multicast and unicast routing in communication networks , 2003, IEEE Trans. Commun..