Enhancing consecutiveness in elastic optical networks

IF 1.8 4区 计算机科学 Q3 COMPUTER SCIENCE, INFORMATION SYSTEMS Photonic Network Communications Pub Date : 2024-03-04 DOI:10.1007/s11107-024-01014-7
{"title":"Enhancing consecutiveness in elastic optical networks","authors":"","doi":"10.1007/s11107-024-01014-7","DOIUrl":null,"url":null,"abstract":"<h3>Abstract</h3> <p>The Elastic Optical Network (EON) has brought several studies to improve optical spectrum efficiency. In the EONs, the bandwidth is divided into frequency slot units (FSUs). When a connection is requested for a service type, the network management system determines how many FSUs are required. As the number of service requests increases, the optical network goes into optical spectrum fragmentation, leaving non-contiguous FSUs over time in the optical spectrum, thus hampering new assignments and generating blocking probability (BP), which is the most significant performance metric for optical networks considering the network layer level, resulting from the unavailability of resources at the time of the request. In this article, the concept of the consecutiveness factor is presented and used to propose an improved heuristic technique to address the problem. The proposed algorithm uses a candidate spectral block with the same amount of FSUs as the requested service demand. This way, the BP is decreased, the resources’ utilization of the network is improved, the number of hops for the connections in the EON is reduced, and the consecutiveness of the services assigned in the network is increased. Some simulation scenarios on the two well-known benchmarks are provided to show the practical efficiency of our proposed technique compared to other available algorithms in the literature.</p>","PeriodicalId":20057,"journal":{"name":"Photonic Network Communications","volume":"255 1","pages":""},"PeriodicalIF":1.8000,"publicationDate":"2024-03-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Photonic Network Communications","FirstCategoryId":"94","ListUrlMain":"https://doi.org/10.1007/s11107-024-01014-7","RegionNum":4,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q3","JCRName":"COMPUTER SCIENCE, INFORMATION SYSTEMS","Score":null,"Total":0}
引用次数: 0

Abstract

The Elastic Optical Network (EON) has brought several studies to improve optical spectrum efficiency. In the EONs, the bandwidth is divided into frequency slot units (FSUs). When a connection is requested for a service type, the network management system determines how many FSUs are required. As the number of service requests increases, the optical network goes into optical spectrum fragmentation, leaving non-contiguous FSUs over time in the optical spectrum, thus hampering new assignments and generating blocking probability (BP), which is the most significant performance metric for optical networks considering the network layer level, resulting from the unavailability of resources at the time of the request. In this article, the concept of the consecutiveness factor is presented and used to propose an improved heuristic technique to address the problem. The proposed algorithm uses a candidate spectral block with the same amount of FSUs as the requested service demand. This way, the BP is decreased, the resources’ utilization of the network is improved, the number of hops for the connections in the EON is reduced, and the consecutiveness of the services assigned in the network is increased. Some simulation scenarios on the two well-known benchmarks are provided to show the practical efficiency of our proposed technique compared to other available algorithms in the literature.

查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
增强弹性光网络的连续性
摘要 弹性光网络(EON)为提高光频谱效率带来了多项研究。在 EON 中,带宽被划分为多个频隙单元(FSU)。当请求为某一服务类型提供连接时,网络管理系统会确定需要多少个 FSU。随着服务请求数量的增加,光网络会进入光频谱碎片化状态,在光频谱中会长期留下不连续的 FSU,从而阻碍新的分配,并产生阻塞概率(BP),这是考虑到网络层水平的光网络最重要的性能指标,其原因是请求时资源不可用。本文提出了连续性因子的概念,并利用这一概念提出了一种改进的启发式技术来解决这一问题。所提算法使用的候选频谱块具有与请求服务需求量相同的 FSU。通过这种方法,可以降低 BP,提高网络资源的利用率,减少 EON 中连接的跳数,并提高网络中分配服务的连续性。本文提供了两个著名基准的一些仿真场景,以说明与文献中的其他算法相比,我们提出的技术具有实际效率。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 去求助
来源期刊
Photonic Network Communications
Photonic Network Communications 工程技术-电信学
CiteScore
4.10
自引率
5.90%
发文量
33
审稿时长
12 months
期刊介绍: This journal publishes papers involving optical communication networks. Coverage includes network and system technologies; network and system architectures; network access and control; network design, planning, and operation; interworking; and application design for an optical infrastructure This journal publishes high-quality, peer-reviewed papers presenting research results, major achievements, and trends involving all aspects of optical network communications. Among the topics explored are transport, access, and customer premises networks; local, regional, and global networks; transoceanic and undersea networks; optical transparent networks; WDM, HWDM, and OTDM networks and more.
期刊最新文献
GSNR-aware resource re-provisioning for C to C+L-bands upgrade in optical backbone networks End-to-end slicing of RAN based on next-generation optical access network Routing, modulation, core and spectrum assignment techniques for crosstalk management in multi-core fiber based spatially multiplexed elastic optical networks Secret Information Sharing using Multipartite Entanglement in Monty Hall Game Performance evaluation of IRS-assisted one-bit control-based mixed FSO-RF communication system
×
引用
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