Exploring Genetic Algorithms to solve QoS

Abstract

Today, there has been an increasing demand for real-time multimedia applications on Internet that can provide transmission of audio, video and tele-conferencing. Many of these applications have multiple quality-of-service (QoS) guarantees in terms of delay, bandwidth, transmission success ratio etc. To fulfil this demand, QoS-based network framework has been adopted. One of the key issues in the QoS framework is how to determine a feasible path that satisfies QoS requirements. In general, the problem of finding a path satisfying multiple constraints is NP-complete and finding an exact solution can be difficult. Various heuristics and approximation algorithms have been proposed in literature to solve this problem . However , the QoS path calculated by these algorithms may turn out to be invalid over the time because of dynamic nature of network conditions. Using Genetic algorithm to solve Multi constrained QoS problem, may be proved a better solution. Genetic approach makes the algorithm more robust in the case that the frequency of state information change in the network is higher than the rate of state information received at the node. In order to solve the QoS constrained routing efficiently, the scheme of routing based on a genetic algorithm (GA) has been discussed in this paper.