Please use this identifier to cite or link to this item: http://hdl.handle.net/10603/11696
Title: Performance comparison of multi objective evolutionary algorithms for QoS routing problems in computer networks
Researcher: Chitra C
Guide(s): Subbaraj, P
Keywords: Performance comparison, multi objective evolutionary algorithm, Quality of Service, Maximum Link Utilization, Execution Time, Route Optimality
Upload Date: 3-Oct-2013
University: Anna University
Completed Date: 
Abstract: A computer network is an interconnected group of computers with the ability to exchange data. Today, computer networks are the core of modern communication. Routing is one of the most important issues that have a significant impact on the network s performance. 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) requirement. This thesis is concerned with the investigation of Multi-Objective Evolutionary Algorithms (MOEAs) for QoS unicast and multicast routing problems. The routing problem is formulated as a multi-objective mathematical programming problem which attempts to minimize four QoS parameters simultaneously, while satisfying the flow conservation constraints. The four objectives considered are cost, delay, Maximum Link Utilization (MLU) and hop count. In this thesis, Evolutionary Algorithms (EAs) are used to solve multi-objective problems that have been motivated mainly because of their population based nature that allows the generation of several solutions in a single run. The experimental results of the three MOEAs, their performance in terms of Execution Time (ET), Route Optimality (RO) and maximum number of nondominated solutions, and the detailed analysis are presented. The results for the benchmark problems are compared with the other works reported in the literature. From the results obtained, it is observed that, when the size of the network was small, the three algorithms, NSGA, NSGA-II and SPEA performed equally well for both unicast and multicast routing problems. For larger size networks, NSGA-II had better performance in terms of execution time and route optimality and SPEA had better performance in terms of identifying the maximum number of non-dominated solutions. newline newline newline
Pagination: xxvi, 179
URI: http://hdl.handle.net/10603/11696
Appears in Departments:Faculty of Information and Communication Engineering

Files in This Item:
File Description SizeFormat 
01_title.pdfAttached File34.45 kBAdobe PDFView/Open
02_certificates.pdf974.23 kBAdobe PDFView/Open
03_abstract.pdf18.08 kBAdobe PDFView/Open
04_acknowledgement.pdf13.16 kBAdobe PDFView/Open
05_contents.pdf51.42 kBAdobe PDFView/Open
06_chapter 1.pdf111.56 kBAdobe PDFView/Open
07_chapter 2.pdf134.57 kBAdobe PDFView/Open
08_chapter 3.pdf199.7 kBAdobe PDFView/Open
09_chapter 4.pdf103.89 kBAdobe PDFView/Open
10_chapter 5.pdf98.67 kBAdobe PDFView/Open
11_chapter 6.pdf74.18 kBAdobe PDFView/Open
12_chapter 7.pdf26.85 kBAdobe PDFView/Open
13_references.pdf47.34 kBAdobe PDFView/Open
14_publications.pdf14.41 kBAdobe PDFView/Open
15_vitae.pdf12.9 kBAdobe PDFView/Open


Items in Shodhganga are protected by copyright, with all rights reserved, unless otherwise indicated.