Spectrum and Routing Allocation Method for Elastic Optical Networks Based on Posterior Blocking Probability Measurement

Qiang Sun, Haoran Li, Yang Zhou
{"title":"Spectrum and Routing Allocation Method for Elastic Optical Networks Based on Posterior Blocking Probability Measurement","authors":"Qiang Sun, Haoran Li, Yang Zhou","doi":"10.1109/OGC.2019.8925080","DOIUrl":null,"url":null,"abstract":"With the rapid growth of traffic in today's society, the original optical network based on wavelength division multiplexing is more and more difficult to meet the current traffic demand because of its large spectral granularity, so the elastic optical network came into being. In elastic optical networks, the most important research issue is the allocation of spectrum and routing. This paper proposes a joint allocation method of spectrum routing based on access blocking rate. The value of spectrum slot is measured by the access blocking rate of spectrum slot, and it is converted into the weight of the link. The weighted shortest path algorithm is used to find the appropriate allocation Path; and find the best allocated spectrum slot on the assigned path by a posteriori access blocking rate. Then considering the shortcomings of the above algorithm without considering the peripheral link, a spectrum routing joint allocation algorithm that considers the neighboring link a posteriori access blocking rate is proposed. Finally, the above two algorithms are compared through experiments. Compared with the classic first fit algorithm, more than 10% service blocking rate is reduced in both USNET and NSFNET network topologies.","PeriodicalId":381981,"journal":{"name":"2019 IEEE 4th Optoelectronics Global Conference (OGC)","volume":"75 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2019-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2019 IEEE 4th Optoelectronics Global Conference (OGC)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/OGC.2019.8925080","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0

Abstract

With the rapid growth of traffic in today's society, the original optical network based on wavelength division multiplexing is more and more difficult to meet the current traffic demand because of its large spectral granularity, so the elastic optical network came into being. In elastic optical networks, the most important research issue is the allocation of spectrum and routing. This paper proposes a joint allocation method of spectrum routing based on access blocking rate. The value of spectrum slot is measured by the access blocking rate of spectrum slot, and it is converted into the weight of the link. The weighted shortest path algorithm is used to find the appropriate allocation Path; and find the best allocated spectrum slot on the assigned path by a posteriori access blocking rate. Then considering the shortcomings of the above algorithm without considering the peripheral link, a spectrum routing joint allocation algorithm that considers the neighboring link a posteriori access blocking rate is proposed. Finally, the above two algorithms are compared through experiments. Compared with the classic first fit algorithm, more than 10% service blocking rate is reduced in both USNET and NSFNET network topologies.
基于后验阻塞概率测量的弹性光网络频谱和路由分配方法
随着当今社会流量的快速增长,原有的基于波分复用的光网络由于其频谱粒度大,越来越难以满足当前的流量需求,于是弹性光网络应运而生。在弹性光网络中,最重要的研究问题是频谱分配和路由问题。提出了一种基于接入阻塞率的频谱路由联合分配方法。频谱槽的值由频谱槽的接入阻断率来衡量,并将其转化为链路的权重。采用加权最短路径算法寻找合适的分配路径;并通过后验接入阻塞率在分配路径上找到最佳分配频谱槽。然后,针对上述算法未考虑外设链路的不足,提出了一种考虑相邻链路后验接入阻塞率的频谱路由联合分配算法。最后,通过实验对上述两种算法进行了比较。与经典的首次拟合算法相比,在USNET和NSFNET网络拓扑下,服务阻塞率都降低了10%以上。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 求助全文
来源期刊
自引率
0.00%
发文量
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术官方微信