Dspace @ IIM Kozhikode

Shortest path routing in multihop packet switching communication network

Show simple item record

dc.contributor.author Bhanja, Urmila*
dc.contributor.author Swain, Anjan Kumar
dc.contributor.author Panda, Abani Mohan*
dc.date.accessioned 2015-03-20T05:26:35Z
dc.date.available 2015-03-20T05:26:35Z
dc.date.issued 2007
dc.identifier.uri http://hdl.handle.net/2259/284
dc.description *External Authors en_US
dc.description.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 ... en_US
dc.language.iso en en_US
dc.publisher Indian Institute of Management Kozhikode en_US
dc.subject Communication networks en_US
dc.subject Genetic algorithm en_US
dc.subject Packet Switching en_US
dc.title Shortest path routing in multihop packet switching communication network en_US
dc.type Working Paper en_US

Files in this item

This item appears in the following Collection(s)

  • Working Papers [2]
    This section consists of working papers published by IIMK community.

Show simple item record

Search DSpace

Advanced Search


My Account