International Journal of Computer Theory and Engineering

Frequency: Quarterly
ISSN: 1793-8201 (Print), 2972-4511 (Online)
Publisher:IACSIT Press

OPEN ACCESS
4.0
CiteScore

IJCTE 2011 Vol.3(2): 211-216
doi: 10.7763/IJCTE.2011.V3.307

QoS Constraints Multicast Routing for Residual Bandwidth Optimization using Evolutionary Algorithm

Sushma Jain1 , J. D. Sharma2

  • 1Computer Science & Engineering Department, Thapar University, Patiala, India-147004
  • 2Electrical Engineering Department, Indian Institute of Technology, Roorkee, India-247667,.

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.

Keywords

  • Bandwidth ptimization
  • Evolutionary algorithm
  • Multicast routing
  • Routing algorithm
  • Steiner tree
307-G425

How to Cite

Copied

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. https://doi.org/10.7763/IJCTE.2011.V3.307

Copyright & License

Copyright © 2011 by the authors. This is an open access article distributed under the Creative Commons Attribution License which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited (CC BY 4.0).

Article Metrics in Dimensions

Menu