弹性光网络中碎片抑制RSA算法:一种定量方法

K. Singh, S. Prakash Singh, S. Sengar
{"title":"弹性光网络中碎片抑制RSA算法:一种定量方法","authors":"K. Singh, S. Prakash Singh, S. Sengar","doi":"10.1109/BICOP.2018.8658350","DOIUrl":null,"url":null,"abstract":"Fragmentation is a complicated issue during online resource allocation in Elastic optical network (EON). It becomes more complicated if the connection is assumed to be dynamic in nature. In this paper for the dynamic (increase) connection, the probability density function of unused and used optical band is calculated. The role of smaller unused frequency slots on the spectral utilization is extensively analyzed through simulation. We propose a quantitative metric to quantify the fragmentation in a link. On the basis of metric, we propose a routing and spectral algorithm called Fragmentation suppressed RSA (FS-RSA). Our proposed FS-RSA helps in accommodating more number of connection by decreasing the fragmentation as compared to the conventional First fit and Random fit. The proposed scheme takes lesser computational time as compared to MinEnt RSA.","PeriodicalId":145258,"journal":{"name":"2018 IEEE British and Irish Conference on Optics and Photonics (BICOP)","volume":"53 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2018-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"6","resultStr":"{\"title\":\"Fragmentation Suppressed RSA Algorithm for Elastic Optical Network: A Quantitative approach\",\"authors\":\"K. Singh, S. Prakash Singh, S. Sengar\",\"doi\":\"10.1109/BICOP.2018.8658350\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Fragmentation is a complicated issue during online resource allocation in Elastic optical network (EON). It becomes more complicated if the connection is assumed to be dynamic in nature. In this paper for the dynamic (increase) connection, the probability density function of unused and used optical band is calculated. The role of smaller unused frequency slots on the spectral utilization is extensively analyzed through simulation. We propose a quantitative metric to quantify the fragmentation in a link. On the basis of metric, we propose a routing and spectral algorithm called Fragmentation suppressed RSA (FS-RSA). Our proposed FS-RSA helps in accommodating more number of connection by decreasing the fragmentation as compared to the conventional First fit and Random fit. The proposed scheme takes lesser computational time as compared to MinEnt RSA.\",\"PeriodicalId\":145258,\"journal\":{\"name\":\"2018 IEEE British and Irish Conference on Optics and Photonics (BICOP)\",\"volume\":\"53 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2018-12-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"6\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2018 IEEE British and Irish Conference on Optics and Photonics (BICOP)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/BICOP.2018.8658350\",\"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 IEEE British and Irish Conference on Optics and Photonics (BICOP)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/BICOP.2018.8658350","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 6

摘要

碎片化是弹性光网络在线资源分配中的一个复杂问题。如果假设连接本质上是动态的,则会变得更加复杂。本文针对动态(增加)连接,计算了未使用和已使用光带的概率密度函数。通过仿真分析了较小的未使用频带对频谱利用率的影响。我们提出了一个定量度量来量化链路中的碎片。在度量的基础上,我们提出了一种路由和频谱算法,称为碎片抑制RSA (FS-RSA)。与传统的First fit和Random fit相比,我们提出的FS-RSA有助于通过减少碎片来容纳更多的连接数量。该方案的计算时间较RSA方案短。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
Fragmentation Suppressed RSA Algorithm for Elastic Optical Network: A Quantitative approach
Fragmentation is a complicated issue during online resource allocation in Elastic optical network (EON). It becomes more complicated if the connection is assumed to be dynamic in nature. In this paper for the dynamic (increase) connection, the probability density function of unused and used optical band is calculated. The role of smaller unused frequency slots on the spectral utilization is extensively analyzed through simulation. We propose a quantitative metric to quantify the fragmentation in a link. On the basis of metric, we propose a routing and spectral algorithm called Fragmentation suppressed RSA (FS-RSA). Our proposed FS-RSA helps in accommodating more number of connection by decreasing the fragmentation as compared to the conventional First fit and Random fit. The proposed scheme takes lesser computational time as compared to MinEnt RSA.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
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学术官方微信