Genetic algorithm approach to dynamic multiconstraint multipath QoS routing algorithm for IP networks

  • Authors:
  • R. Leela;S. Selvakumar

  • Affiliations:
  • Department of Computer Science and Engineering, National Institute of Technology, Tiruchirappalli, Tamil Nadu, India.;Department of Computer Science and Engineering, National Institute of Technology, Tiruchirappalli, Tamil Nadu, India

  • Venue:
  • International Journal of Communication Networks and Distributed Systems
  • Year:
  • 2010

Quantified Score

Hi-index 0.00

Visualization

Abstract

Real-time distributed multimedia applications have special requirements in terms of bandwidth, delay, jitter, etc. The current IP network is suitable for applications such as e-mail, ftp, etc., but not suitable for real time multimedia applications that demand different QoS requirements from the underlying network. In order to make the network suitable for such applications many QoS routing algorithms have been proposed. The problem of finding a path which satisfies multiple constraints is a NP-complete problem. Hence, various heuristics have been proposed to find a path that satisfies multiple constraints. To search all feasible paths in less time, many researchers have used the concept of genetic algorithm (GA). This GA approach has been used in this paper to improve the path search time of the existing dynamic multi constraint multi path QoS routing algorithm (DMCMPRA). The simulation results of the improved algorithm are discussed in this paper.