基于贪婪突变遗传算法的网络拓扑优化与链路容量扩展

Xiaoqing Xu, Hong Tang, Juan Wu, Liuyihui Qian, Han Zeng
{"title":"基于贪婪突变遗传算法的网络拓扑优化与链路容量扩展","authors":"Xiaoqing Xu, Hong Tang, Juan Wu, Liuyihui Qian, Han Zeng","doi":"10.1109/ICECE54449.2021.9674574","DOIUrl":null,"url":null,"abstract":"The improvement of network performance needs to optimize network topology (that is adding network link) and expand link capacity. This paper comprehensively considers delay constraints, demand constraints and link capacity constraints and researches the joint optimization problem of network topology and link capacity under complex constraints. A new heuristic algorithm is proposed, called greedy-mutation genetic algorithm. Our method, based on a conventional genetic algorithm, conducts mutations on original solutions based on various constraints and the greedy algorithm, therefore, it can find better optimized solutions and fulfill all the constraints better. We applied the greedy-mutation genetic algorithm into two public backbone networks’ topology optimization and link expansion cases. Our results show that the proposed algorithm can effectively decrease the total cost of network optimization. The proposed method can also be applied in the network design and planning of wide area networks under complicated constraints, which is helpful to network operators.","PeriodicalId":166178,"journal":{"name":"2021 IEEE 4th International Conference on Electronics and Communication Engineering (ICECE)","volume":"85 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2021-12-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"Joint Optimization of Network Topology and Link Capacity Expansion Based on a Greedy-Mutation Genetic Algorithm\",\"authors\":\"Xiaoqing Xu, Hong Tang, Juan Wu, Liuyihui Qian, Han Zeng\",\"doi\":\"10.1109/ICECE54449.2021.9674574\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"The improvement of network performance needs to optimize network topology (that is adding network link) and expand link capacity. This paper comprehensively considers delay constraints, demand constraints and link capacity constraints and researches the joint optimization problem of network topology and link capacity under complex constraints. A new heuristic algorithm is proposed, called greedy-mutation genetic algorithm. Our method, based on a conventional genetic algorithm, conducts mutations on original solutions based on various constraints and the greedy algorithm, therefore, it can find better optimized solutions and fulfill all the constraints better. We applied the greedy-mutation genetic algorithm into two public backbone networks’ topology optimization and link expansion cases. Our results show that the proposed algorithm can effectively decrease the total cost of network optimization. The proposed method can also be applied in the network design and planning of wide area networks under complicated constraints, which is helpful to network operators.\",\"PeriodicalId\":166178,\"journal\":{\"name\":\"2021 IEEE 4th International Conference on Electronics and Communication Engineering (ICECE)\",\"volume\":\"85 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2021-12-17\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2021 IEEE 4th International Conference on Electronics and Communication Engineering (ICECE)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/ICECE54449.2021.9674574\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2021 IEEE 4th International Conference on Electronics and Communication Engineering (ICECE)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ICECE54449.2021.9674574","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0

摘要

网络性能的提升需要优化网络拓扑(即增加网络链路)和扩展链路容量。综合考虑时延约束、需求约束和链路容量约束,研究复杂约束下网络拓扑和链路容量的联合优化问题。提出了一种新的启发式算法——贪婪突变遗传算法。我们的方法是在传统遗传算法的基础上,根据各种约束条件和贪心算法对原解进行突变,从而可以找到更好的优化解,更好地满足所有约束条件。将贪婪突变遗传算法应用于两个公共骨干网的拓扑优化和链路扩展实例。实验结果表明,该算法可以有效地降低网络优化的总成本。该方法也可应用于复杂约束条件下广域网的网络设计和规划,对网络运营商有一定的帮助。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
Joint Optimization of Network Topology and Link Capacity Expansion Based on a Greedy-Mutation Genetic Algorithm
The improvement of network performance needs to optimize network topology (that is adding network link) and expand link capacity. This paper comprehensively considers delay constraints, demand constraints and link capacity constraints and researches the joint optimization problem of network topology and link capacity under complex constraints. A new heuristic algorithm is proposed, called greedy-mutation genetic algorithm. Our method, based on a conventional genetic algorithm, conducts mutations on original solutions based on various constraints and the greedy algorithm, therefore, it can find better optimized solutions and fulfill all the constraints better. We applied the greedy-mutation genetic algorithm into two public backbone networks’ topology optimization and link expansion cases. Our results show that the proposed algorithm can effectively decrease the total cost of network optimization. The proposed method can also be applied in the network design and planning of wide area networks under complicated constraints, which is helpful to network operators.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
0.00%
发文量
0
期刊最新文献
Design of Emergency Rescue Command Platform Based on Satellite Mobile Communication System Multi-Dimensional Spectrum Data Denoising Based on Tensor Theory Predicting COVID-19 Severe Patients and Evaluation Method of 3 Stages Severe Level by Machine Learning A Novel Stacking Framework Based On Hybrid of Gradient Boosting-Adaptive Boosting-Multilayer Perceptron for Crash Injury Severity Prediction and Analysis Key Techniques on Unified Identity Authentication in OpenMBEE Integration
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
0
微信
客服QQ
Book学术公众号 扫码关注我们
反馈
×
意见反馈
请填写您的意见或建议
请填写您的手机或邮箱
已复制链接
已复制链接
快去分享给好友吧!
我知道了
×
扫码分享
扫码分享
Book学术官方微信
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术
文献互助 智能选刊 最新文献 互助须知 联系我们:info@booksci.cn
Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。
Copyright © 2023 Book学术 All rights reserved.
ghs 京公网安备 11010802042870号 京ICP备2023020795号-1