弹性光网络中路由与频谱分配的优化模型与算法

Jiading Wang, Hejun Xuan, Yuping Wang, Yuanchao Yang, Sen Liu
{"title":"弹性光网络中路由与频谱分配的优化模型与算法","authors":"Jiading Wang, Hejun Xuan, Yuping Wang, Yuanchao Yang, Sen Liu","doi":"10.1109/CIS2018.2018.00074","DOIUrl":null,"url":null,"abstract":"In this paper, the problem of routing and spectrum assignment for static connection requests in elastic optical networks (EONs) is studied. Two different ratios of blocking formations are adopted, and a global constraint optimization model is established to minimize the ratio of blocking in the network. First, we propose an availability index of the frequency slots in the path. Second, a strategy of routing is designed by considering the two indexes of path length and availability index to judge the quality of the path. Then, a greedy strategy, which can obtain the largest availability index in the path after the frequency slot allocated, is proposed for the sake of assigning the spectra effectively. Simulation experiments were carried out in two network topologies. The two different ratios of blocking are obtained for different sorting strategy for connection requests and the number of connection requests. The experimental results show that the routing and spectrum assignment scheme designed in this paper can get a small ratio of blocking.","PeriodicalId":185099,"journal":{"name":"2018 14th International Conference on Computational Intelligence and Security (CIS)","volume":"34 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2018-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"3","resultStr":"{\"title\":\"Optimization Model and Algorithm for Routing and Spectrum Assignment in Elastic Optical Networks\",\"authors\":\"Jiading Wang, Hejun Xuan, Yuping Wang, Yuanchao Yang, Sen Liu\",\"doi\":\"10.1109/CIS2018.2018.00074\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"In this paper, the problem of routing and spectrum assignment for static connection requests in elastic optical networks (EONs) is studied. Two different ratios of blocking formations are adopted, and a global constraint optimization model is established to minimize the ratio of blocking in the network. First, we propose an availability index of the frequency slots in the path. Second, a strategy of routing is designed by considering the two indexes of path length and availability index to judge the quality of the path. Then, a greedy strategy, which can obtain the largest availability index in the path after the frequency slot allocated, is proposed for the sake of assigning the spectra effectively. Simulation experiments were carried out in two network topologies. The two different ratios of blocking are obtained for different sorting strategy for connection requests and the number of connection requests. The experimental results show that the routing and spectrum assignment scheme designed in this paper can get a small ratio of blocking.\",\"PeriodicalId\":185099,\"journal\":{\"name\":\"2018 14th International Conference on Computational Intelligence and Security (CIS)\",\"volume\":\"34 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2018-11-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"3\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2018 14th International Conference on Computational Intelligence and Security (CIS)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/CIS2018.2018.00074\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2018 14th International Conference on Computational Intelligence and Security (CIS)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/CIS2018.2018.00074","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 3

摘要

研究了弹性光网络中静态连接请求的路由和频谱分配问题。采用两种不同比例的阻塞编队,建立全局约束优化模型,使网络中的阻塞比例最小。首先,我们提出了路径中频率槽的可用性指标。其次,通过考虑路径长度和可用性指标两个指标来判断路径质量,设计路由策略;然后,为了有效地分配频谱,提出了一种贪心策略,该策略在分配频率时隙后获取路径上最大的可用性指数。在两种网络拓扑下进行了仿真实验。根据不同的连接请求排序策略和连接请求数量,得到了两种不同的阻塞比率。实验结果表明,本文设计的路由和频谱分配方案可以获得较小的阻塞率。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
Optimization Model and Algorithm for Routing and Spectrum Assignment in Elastic Optical Networks
In this paper, the problem of routing and spectrum assignment for static connection requests in elastic optical networks (EONs) is studied. Two different ratios of blocking formations are adopted, and a global constraint optimization model is established to minimize the ratio of blocking in the network. First, we propose an availability index of the frequency slots in the path. Second, a strategy of routing is designed by considering the two indexes of path length and availability index to judge the quality of the path. Then, a greedy strategy, which can obtain the largest availability index in the path after the frequency slot allocated, is proposed for the sake of assigning the spectra effectively. Simulation experiments were carried out in two network topologies. The two different ratios of blocking are obtained for different sorting strategy for connection requests and the number of connection requests. The experimental results show that the routing and spectrum assignment scheme designed in this paper can get a small ratio of blocking.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
0.00%
发文量
0
期刊最新文献
A Real-Time Location Privacy Protection Method Based on Space Transformation Cryptanalysis of Kumar's Remote User Authentication Scheme with Smart Card Off-Topic Text Detection Based on Neural Networks Combined with Text Features Research of X Ray Image Recognition Based on Neural Network CFO Algorithm Using Niche and Opposition-Based Learning
×
引用
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