多域光网络中启发式拓扑生成算法的设计

Lei Wang, Hua Feng, Li Lin, Li Du
{"title":"多域光网络中启发式拓扑生成算法的设计","authors":"Lei Wang, Hua Feng, Li Lin, Li Du","doi":"10.4236/CN.2018.103006","DOIUrl":null,"url":null,"abstract":"Designing an excellent original topology not only improves the accuracy of routing, but also improves the restoring rate of failure. In this paper, we propose a new heuristic topology generation algorithm—GA-PODCC (Genetic Algorithm based on the Pareoto Optimality of Delay, Configuration and Consumption), which utilizes a genetic algorithm to optimize the link delay and resource configuration/consumption. The novelty lies in designing the two stages of genetic operation: The first stage is to pick the best population by means of the crossover, mutation, and selection operation; The second stage is to select an excellent individual from the best population. The simulation results show that, using the same number of nodes, GA-PODCC algorithm improves the balance of all the three optimization objectives, maintaining a low level of distortion in topology aggregation.","PeriodicalId":91826,"journal":{"name":"... IEEE Conference on Communications and Network Security. IEEE Conference on Communications and Network Security","volume":"130 1","pages":"65-77"},"PeriodicalIF":0.0000,"publicationDate":"2018-07-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"2","resultStr":"{\"title\":\"Design of a Heuristic Topology Generation Algorithm in Multi-Domain Optical Networks\",\"authors\":\"Lei Wang, Hua Feng, Li Lin, Li Du\",\"doi\":\"10.4236/CN.2018.103006\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Designing an excellent original topology not only improves the accuracy of routing, but also improves the restoring rate of failure. In this paper, we propose a new heuristic topology generation algorithm—GA-PODCC (Genetic Algorithm based on the Pareoto Optimality of Delay, Configuration and Consumption), which utilizes a genetic algorithm to optimize the link delay and resource configuration/consumption. The novelty lies in designing the two stages of genetic operation: The first stage is to pick the best population by means of the crossover, mutation, and selection operation; The second stage is to select an excellent individual from the best population. The simulation results show that, using the same number of nodes, GA-PODCC algorithm improves the balance of all the three optimization objectives, maintaining a low level of distortion in topology aggregation.\",\"PeriodicalId\":91826,\"journal\":{\"name\":\"... IEEE Conference on Communications and Network Security. IEEE Conference on Communications and Network Security\",\"volume\":\"130 1\",\"pages\":\"65-77\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2018-07-13\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"2\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"... IEEE Conference on Communications and Network Security. IEEE Conference on Communications and Network Security\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.4236/CN.2018.103006\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"... IEEE Conference on Communications and Network Security. IEEE Conference on Communications and Network Security","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.4236/CN.2018.103006","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 2

摘要

设计一个优秀的原始拓扑不仅可以提高路由的精度,而且可以提高故障的恢复率。本文提出了一种新的启发式拓扑生成算法ga - podcc (Genetic Algorithm based on the Pareoto Optimality of Delay, Configuration and Consumption),该算法利用遗传算法对链路延迟和资源配置/消耗进行优化。其新颖之处在于设计了两个阶段的遗传操作:第一阶段是通过交叉、突变和选择操作来挑选最优群体;第二阶段是从最优群体中选择一个优秀的个体。仿真结果表明,在节点数相同的情况下,GA-PODCC算法提高了三个优化目标的均衡性,保持了较低的拓扑聚合失真水平。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
Design of a Heuristic Topology Generation Algorithm in Multi-Domain Optical Networks
Designing an excellent original topology not only improves the accuracy of routing, but also improves the restoring rate of failure. In this paper, we propose a new heuristic topology generation algorithm—GA-PODCC (Genetic Algorithm based on the Pareoto Optimality of Delay, Configuration and Consumption), which utilizes a genetic algorithm to optimize the link delay and resource configuration/consumption. The novelty lies in designing the two stages of genetic operation: The first stage is to pick the best population by means of the crossover, mutation, and selection operation; The second stage is to select an excellent individual from the best population. The simulation results show that, using the same number of nodes, GA-PODCC algorithm improves the balance of all the three optimization objectives, maintaining a low level of distortion in topology aggregation.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
0.00%
发文量
0
期刊最新文献
A Cooperative Cognitive Radio Spectrum Sensing Based on Correlation Sum Method with Linear Equalization ADS-B Reception Error Correction Based on the LSTM Neural-Network Model Why the Incoherent Paradigm is for the Future Wireless Networks? A Meta-Learning Approach for Aircraft Trajectory Prediction Analyses of Virtual MIMO Multi-User System Performance with Linear Precoding Schemes Using Indoor Measurements at 5 GHz
×
引用
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