Real-time distributed multimedia applications have special requirements in terms of bandwidth, delay, delay jitter, etc. The current network, essentially being a connection-less network, provides only un-reliable, best-effort service. The data packets may follow different paths to the destination. The network resources, viz., switch buffer and link bandwidth, are fairly shared by packets from different sessions. This type of network is best suitable for applications such as email, ftp, etc., but not suitable for real time multimedia applications such as video-on-demand, video conferencing, Internet telephony, etc., as these applications require 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 with multiple constraints is a NP-complete problem. Hence, various heuristics have been proposed to find a path that satisfies more than one constraint. All these heuristics do not consider the queuing situation at a given node. An alternate path with less queue occupancy may be more convenient to use than the optimum path when a long queue is present in nodes along the path. 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.This GA approach has been used in the existing Dynamic Multi Constraint Multi Path QoS Routing Algorithm (DMCMPRA) [23] for IP networks to find k feasible paths satisfying the multi constraint requirement of the multi media applications. Computer simulations show that GA-DMCMPRA takes less time for path computation when compared to Dynamic Multi Constraint Multi Path QoS Routing Algorithm (DMCMPRA). Further it is also proved that the performance of GA-DMCMPRA with respect to percentage of Packets received and average Delay experienced by packets is at par with DMCMPRA.
展开▼
