A genetic algorithm for joint optimization of capacity and flow assignment in packet switched networks

Author

Mostafa, Mohamed E. ; Eid, Saad M A

Author_Institution

Cairo Univ., Fayoum, Egypt

fYear

2000

fDate

2000

Abstract

One of the design problems concerning packet switched computer communication networks is the joint optimization of capacity and flow assignment (CFA). In this problem the topology of the network and the traffic requirements between node pairs are given, and the objective is to find the flows on the different links and their capacities that minimize the total network cost and keep its average delay below a certain upper limit. This paper proposes an algorithm based on hybridization of genetic algorithms (GA) and the shortest path routing. The proposed algorithm has shown simplification in implementation and improvement in performance. Computational results indicated a 3.17% reduction in network cost when compared with a previous method

Keywords

channel capacity; computer networks; delays; genetic algorithms; network topology; packet switching; telecommunication links; telecommunication network routing; telecommunication traffic; average delay; capacity optimization; design problems; flow assignment optimization; genetic algorithm; genetic algorithms; joint optimization; link capacity; network nodes; network topology; packet switched computer communication networks; shortest path routing; total network cost minimisation; traffic requirements; Communication networks; Communication switching; Computer networks; Costs; Design optimization; Genetic algorithms; Network topology; Packet switching; Routing; Telecommunication traffic;

fLanguage

English

Publisher

ieee

Conference_Titel

Radio Science Conference, 2000. 17th NRSC '2000. Seventeenth National

Conference_Location

Minufiya

Print_ISBN

977-5031-64-8

Type

conf

DOI

10.1109/NRSC.2000.838928

Filename

838928