{"title":"分组交换网络中容量和流量分配联合优化的遗传算法","authors":"M.E. Mostafa, S. Eid","doi":"10.1109/NRSC.2000.838928","DOIUrl":null,"url":null,"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.","PeriodicalId":211510,"journal":{"name":"Proceedings of the Seventeenth National Radio Science Conference. 17th NRSC'2000 (IEEE Cat. No.00EX396)","volume":null,"pages":null},"PeriodicalIF":0.0000,"publicationDate":"2000-02-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"14","resultStr":"{\"title\":\"A genetic algorithm for joint optimization of capacity and flow assignment in packet switched networks\",\"authors\":\"M.E. Mostafa, S. Eid\",\"doi\":\"10.1109/NRSC.2000.838928\",\"DOIUrl\":null,\"url\":null,\"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.\",\"PeriodicalId\":211510,\"journal\":{\"name\":\"Proceedings of the Seventeenth National Radio Science Conference. 17th NRSC'2000 (IEEE Cat. No.00EX396)\",\"volume\":null,\"pages\":null},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2000-02-22\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"14\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Proceedings of the Seventeenth National Radio Science Conference. 17th NRSC'2000 (IEEE Cat. No.00EX396)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/NRSC.2000.838928\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Proceedings of the Seventeenth National Radio Science Conference. 17th NRSC'2000 (IEEE Cat. No.00EX396)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/NRSC.2000.838928","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
A genetic algorithm for joint optimization of capacity and flow assignment in packet switched networks
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.
京公网安备 11010802042870号
京ICP备2023020795号-1
分享
求助内容：
应助结果提醒方式：
扫码关注我们
