Spectrum assignment technique with first-random fit in elastic optical networks

Neha Mahala, Jaisingh Thangaraj
{"title":"Spectrum assignment technique with first-random fit in elastic optical networks","authors":"Neha Mahala, Jaisingh Thangaraj","doi":"10.1109/RAIT.2018.8389089","DOIUrl":null,"url":null,"abstract":"Elastic Optical Networks (EON) have attracted plenty recognition in nowadays for its advanced features. EON can transmit separate data rates either by increasing or decreasing the number of slots per request in optical spectrum as per the demand, and provides high optical spectral efficiency. However, the process of establishing and desolating the connections results in dividing the optical spectrum into many small segments, which are tough to utilize for new requests. Routing and Spectrum Assignment (RSA) is another problem in elastic optical networks, which includes finding a suitable path and assigning contiguous aligned slots with the smallest available spectrum resources. In this paper, we proposed an RSA algorithm for minimizing the spectrum utilization in Elastic Optical Networks by using first-Random fit algorithm. Simulations results indicate that our proposed algorithm performs better than other conventional algorithms with regard to contiguously available slot ratio and blocking probability.","PeriodicalId":219972,"journal":{"name":"2018 4th International Conference on Recent Advances in Information Technology (RAIT)","volume":"24 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2018-03-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"2","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2018 4th International Conference on Recent Advances in Information Technology (RAIT)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/RAIT.2018.8389089","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 2

Abstract

Elastic Optical Networks (EON) have attracted plenty recognition in nowadays for its advanced features. EON can transmit separate data rates either by increasing or decreasing the number of slots per request in optical spectrum as per the demand, and provides high optical spectral efficiency. However, the process of establishing and desolating the connections results in dividing the optical spectrum into many small segments, which are tough to utilize for new requests. Routing and Spectrum Assignment (RSA) is another problem in elastic optical networks, which includes finding a suitable path and assigning contiguous aligned slots with the smallest available spectrum resources. In this paper, we proposed an RSA algorithm for minimizing the spectrum utilization in Elastic Optical Networks by using first-Random fit algorithm. Simulations results indicate that our proposed algorithm performs better than other conventional algorithms with regard to contiguously available slot ratio and blocking probability.
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
弹性光网络中一次随机拟合频谱分配技术
弹性光网络(EON)以其先进的特性引起了人们的广泛关注。EON可以根据需要通过增加或减少每个请求的频谱槽数来传输单独的数据速率,并提供高光谱效率。然而,在建立和拆除连接的过程中,将光谱分成许多小段,难以用于新的请求。路由和频谱分配(RSA)是弹性光网络中的另一个问题,它包括寻找合适的路径和分配具有最小可用频谱资源的连续对齐插槽。本文提出了一种利用首随机拟合算法最小化弹性光网络频谱利用率的RSA算法。仿真结果表明,该算法在连续可用时隙比和阻塞概率方面优于其他传统算法。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 去求助
来源期刊
自引率
0.00%
发文量
0
期刊最新文献
Analysis of slope stability and detection of critical failure surface using gravitational search algorithm Prioritization of human errors in EOT crane operations and its visualisation using virtual simulation Impact of land use dynamics on land surface temperature in Jharia coalfield Application of fractional calculus to distinguish left ventricular hypertrophy with normal ECG Miniaturization of Vivaldi antenna for different wireless communication applications
×
引用
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