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.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
