Title :
Route selection and capacity assignment in computer communication networks based on genetic algorithm
Author_Institution :
Dept. of Comput. Sci. & Technol., Guangdong Inst. of Technol., China
Abstract :
The joint problem of selecting a route for each communicating node pair and a capacity value for each link in a computer communication network is considered. The network topology and traffic characteristics are given; a set of candidate routes and a set of candidate capacities for each link are also available. The goal is to obtain the least costly feasible design, where the costs include both capacity and queuing components. Genetic algorithms are used in order to obtain verifiable good solutions to the problem. The method has been tested on the ARPA, OCT, USA and ring topologies. Extensive computational results indicate that our method is very effective
Keywords :
computer network management; genetic algorithms; network topology; queueing theory; telecommunication network routing; telecommunication traffic; ARPA topology; OCT topology; USA topology; capacity assignment; communicating node pair; computer communication networks; genetic algorithm; least costly feasible design; network topology; queuing components; ring topology; route selection; traffic characteristics; Biological cells; Communication networks; Computer networks; Cost function; Genetic algorithms; Genetic mutations; IEL; Intelligent networks; Joining materials; Search methods;
Conference_Titel :
Intelligent Processing Systems, 1997. ICIPS '97. 1997 IEEE International Conference on
Conference_Location :
Beijing
Print_ISBN :
0-7803-4253-4
DOI :
10.1109/ICIPS.1997.672843