The current Internet architecture supports best-effort data delivery by default, which has provided satisfactory services for various applications, such as the email and file transfer, to a great extent. On the other hand, the increase in real-time multimedia applications such as voice over IP, audio, and video streaming in the public Internet demand for a Quality of Service (QoS) routing that satisfies multiple constraints such as bandwidth, delay, delay jitter, packet loss, and cost. To find a feasible path satisfying multiple constraints is NP-complete. Hence the recent researches on QoS based routing have triggered the proposition of many heuristic QoS routing algorithms. Most of these heuristics find a path subject to relaxed constraints, which may result in some feasible paths being not retrieved. To search all feasible paths in less time, many researchers have used the concept of Genetic Algorithm (GA), which is a new computational strategy inspired by natural processes. The aim of these routing algorithms is to aid the fast selection of a route, which should be adaptive, flexible, and intelligent for efficient network management. But in all these algorithms only one constraint or single mixed constraint has been considered. The focus of this paper is to develop a GA based routing algorithm that satisfies multiple constraints of the multimedia applications. Hence, in this paper a heuristic called Multi-constraint QoS Unicast RoutingUsing Genetic Algorithm (MURUGA), which incorporates multiple constraints required by multimedia applications to find the feasible path satisfying the constraint requirement has been proposed, designed, and simulated. The performance analysis of MURUGA has also been carried out and compared with the existing algorithms. The results confirm that MURUGA performs better in terms of time taken to return feasible paths.
展开▼
