DSpace
 

DSpace at Indian Institute of Management Kozhikode >
Computer/ Information Technology >
Working Papers >

Please use this identifier to cite or link to this item: http://hdl.handle.net/2259/300

Title: Shortest path routing in multihop packet switching communication network
Authors: Bhanja, Urmila*
Swain, Anjan Kumar
Panda, Abani Mohan*
Keywords: Communication networks
Genetic algorithm
Packet Switching
Issue Date: 2007
Publisher: Indian Institute of Mangement Kozhikode
Abstract: This paper considers uni cast routing problems for networks where transmission requests are established by point to point connection.In this paper,the static routing problem of a given network has been formulated as a single objective optimization problem,and solved using a variant of genetic algorithms which minimizes the cost of existing links.Variable length chromosomes and their genes are used to encode the problem.The cost of existing links between differnt source and destination paths have been used to evaluate the fitness of chromosome.The crossover operator exchanges partial chromosomes at positionally independent crossing sites.The mutation provides the diversity of the population in the solution space by flipping of one of the genes of the candidate chromosomee,thereby keeping away from local optima.This algorithm has been tested on a known network of twenty nodes where the cost functions are known.It has also been calculated the average of best scores and the mean scores of ...
Description: *External Authors
URI: http://hdl.handle.net/2259/300
Appears in Collections:Working Papers
Working Papers

Files in This Item:

File Description SizeFormat
urmila.pdf2066KbAdobe PDFView/Open

All items in DSpace are protected by copyright, with all rights reserved.

 

© Indian Institute of Management, Kozhikode, 2005-2006