Multi-Objective Routing by Using Non -Dominated Sorting Genetic Algorithm in Computer Networks

Download Now
Provided by: International Journal of Computer Science and Network Solutions (IJCSNS)
Topic: Networking
Format: PDF
The routing problem is a multi-objective optimization problem with a set of constraints. An ideal routing algorithm should strive to find an optimum path for packet transmission within a specified time so as to satisfy the Quality of Service (QoS). This paper presents a method based on Non-dominated Sorting Genetic Algorithm-II (NSGA-II) for solving routing problem in computer networks that consider simultaneously three criteria: cost, delay and delay jitter. This method based on the current network conditions, instead of finding one optimal path for transmitting data packets to a destination, finds several optimal paths; so the proposed method fulfills the QoS requirements and uses effectively of network resources.
Download Now

Find By Topic