Abstract—For the real time multimedia applications, the routing algorithms should be designed to avoid congestion and to ensure data delivery within specified bounds. This paper presents an approach based on an evolutionary algorithm to solve the QoS constraint multicast routing problem. The proposed approach maximizes residual bandwidth utilization while satisfying end-to-end delay and delay jitter bounds. In the proposed algorithm, the encoding for generation of multicast trees is done by employing the topological features which ensure faster and guaranteed convergence. The effectiveness of the proposed algorithm is tested through the simulated results on various weighted networks.
Index Terms—Bandwidth ptimization, Evolutionary algorithm, Multicast routing, Routing algorithm, Steiner tree.
Sushma Jain is with Computer Science & Engineering Department, Thapar University, Patiala, India-147004, (e-mail: sjain@thapar.edu)
J. D. Sharma is with Electrical Engineering Department, Indian Institute of Technology, Roorkee, India-247667, (e-mail: jaydsfee@iitr.ernet.in).
Cite: Sushma Jain and J. D. Sharma, "QoS Constraints Multicast Routing for Residual Bandwidth Optimization using Evolutionary Algorithm," International Journal of Computer Theory and Engineering vol. 3, no. 2, pp. 211-216, 2011.
Copyright © 2008-2024. International Association of Computer Science and Information Technology. All rights reserved.
