Genetic algorithm approach to dynamic multiconstraint multipath QoS routing algorithm for IP networks Online publication date: Thu, 30-Sep-2010
by R. Leela, S. Selvakumar
International Journal of Communication Networks and Distributed Systems (IJCNDS), Vol. 5, No. 4, 2010
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.
Existing subscribers:
Go to Inderscience Online Journals to access the Full Text of this article.
If you are not a subscriber and you just want to read the full contents of this article, buy online access here.Complimentary Subscribers, Editors or Members of the Editorial Board of the International Journal of Communication Networks and Distributed Systems (IJCNDS):
Login with your Inderscience username and password:
Want to subscribe?
A subscription gives you complete access to all articles in the current issue, as well as to all articles in the previous three years (where applicable). See our Orders page to subscribe.
If you still need assistance, please email subs@inderscience.com
Our Blog 
Follow us on Twitter 
Visit us on Facebook