Design of an Efficient Resource Management Model in Elastic Optical Networks

Chingfang Hsu, S. Sie, Hsuan-Fang Fu, Jin-Jun Zheng, Shi-Xuan Chen
{"title":"Design of an Efficient Resource Management Model in Elastic Optical Networks","authors":"Chingfang Hsu, S. Sie, Hsuan-Fang Fu, Jin-Jun Zheng, Shi-Xuan Chen","doi":"10.1109/ICCNC.2019.8685613","DOIUrl":null,"url":null,"abstract":"The advent of elastic optical networks (EONs) has drawn much attention in recent years and this new paradigm is identified as the most promising solution to the next generation optical networks. In EONs, routing and spectrum assignment (RSA) problem plays a role very similar to the routing and wavelength assignment (RWA) problem in wavelength-routed networks. As the RSA problem has been proved to be NP-hard, how to design an efficient resource management model to improve execution efficiency of RSA heuristics would become a practical and critical issue. In this work, we address a whole new resource management unit named cluster to simplify the spectrum assignment step. Because of the trade-off between computation efficiency and blocking performance, it is expectable that the cluster-based RSA algorithm would suffer from the problem of low spectral utilization. To effectively alleviate the inevitable intra-and inter-cluster fragmentation, we also propose some additional processing options as possible solutions. Numerical results show that the proposed scheme is a highly competitive dynamic RSA algorithm because of its acceptable blocking performance and significantly improved execution efficiency as compared with near-optimal algorithm. It reveals that cluster-based resource management model can not only achieve the goal of good time efficiency but also maintain satisfactory blocking performance.","PeriodicalId":161815,"journal":{"name":"2019 International Conference on Computing, Networking and Communications (ICNC)","volume":"92 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2019-04-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2019 International Conference on Computing, Networking and Communications (ICNC)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ICCNC.2019.8685613","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0

Abstract

The advent of elastic optical networks (EONs) has drawn much attention in recent years and this new paradigm is identified as the most promising solution to the next generation optical networks. In EONs, routing and spectrum assignment (RSA) problem plays a role very similar to the routing and wavelength assignment (RWA) problem in wavelength-routed networks. As the RSA problem has been proved to be NP-hard, how to design an efficient resource management model to improve execution efficiency of RSA heuristics would become a practical and critical issue. In this work, we address a whole new resource management unit named cluster to simplify the spectrum assignment step. Because of the trade-off between computation efficiency and blocking performance, it is expectable that the cluster-based RSA algorithm would suffer from the problem of low spectral utilization. To effectively alleviate the inevitable intra-and inter-cluster fragmentation, we also propose some additional processing options as possible solutions. Numerical results show that the proposed scheme is a highly competitive dynamic RSA algorithm because of its acceptable blocking performance and significantly improved execution efficiency as compared with near-optimal algorithm. It reveals that cluster-based resource management model can not only achieve the goal of good time efficiency but also maintain satisfactory blocking performance.
弹性光网络中高效资源管理模型的设计
近年来,弹性光网络的出现引起了人们的广泛关注,这种新模式被认为是下一代光网络最有前途的解决方案。在EONs中,路由和频谱分配(RSA)问题的作用与波长路由网络中的路由和波长分配(RWA)问题非常相似。由于RSA问题已被证明是np困难的,如何设计一个有效的资源管理模型来提高RSA启发式算法的执行效率将成为一个现实而关键的问题。在这项工作中,我们解决了一个全新的资源管理单元,称为集群,以简化频谱分配步骤。由于计算效率和分组性能之间的权衡,基于簇的RSA算法存在频谱利用率低的问题是可以预见的。为了有效地缓解不可避免的集群内部和集群之间的碎片化,我们还提出了一些额外的处理选项作为可能的解决方案。数值计算结果表明,该方案具有良好的分组性能,与近最优算法相比,执行效率显著提高,是一种具有高度竞争性的动态RSA算法。研究表明,基于集群的资源管理模型既能达到良好的时间效率,又能保持良好的阻塞性能。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约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学术文献互助群
群 号:604180095
Book学术官方微信