面向高吞吐量业务提供的频谱切片弹性光网络动态RMSA

Liang Zhang, W. Lu, Xiaoping Zhou, Zuqing Zhu
{"title":"面向高吞吐量业务提供的频谱切片弹性光网络动态RMSA","authors":"Liang Zhang, W. Lu, Xiaoping Zhou, Zuqing Zhu","doi":"10.1109/ICCNC.2013.6504113","DOIUrl":null,"url":null,"abstract":"We propose several novel dynamic routing, modulation and spectrum assignment (RMSA) algorithms for high-throughput service provisioning in spectrum-sliced elastic optical networks. The proposed algorithms can be applied to network provisioning, where a network operator needs to figure out an efficient way to serve each dynamic connection request based on current network status. The proposed algorithms can be categorized into two categories, dynamic RMSA using online path computation and dynamic RMSA using path-set updates. The former one updates link metrics based on their spectrum utilization status dynamically, and performs RMSA with online routing path computation for each request. The latter one pre-computes K shortest routing paths as the path-set for each source-destination pair in the network topology, performs RMSA based on different path-selection policies during dynamic provisioning, and updates a path-set by adding a new path in when a path in the set is not available for a request. We evaluate the proposed algorithms with simulations using the Poisson traffic model in a 14-node NSFNET topology. Simulation results indicate that the proposed algorithms outperform existing dynamic RMSA algorithm by providing lower bandwidth blocking probability, and reduce the blocking probability by one magnitude or more when the traffic load is light (≤ 700 Erlangs). The comparisons on network resource utilization also indicate that the proposed algorithms achieve larger resource utilization and hence provide higher throughput for network operations.","PeriodicalId":229123,"journal":{"name":"2013 International Conference on Computing, Networking and Communications (ICNC)","volume":"11 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2013-01-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"31","resultStr":"{\"title\":\"Dynamic RMSA in spectrum-sliced elastic optical networks for high-throughput service provisioning\",\"authors\":\"Liang Zhang, W. Lu, Xiaoping Zhou, Zuqing Zhu\",\"doi\":\"10.1109/ICCNC.2013.6504113\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"We propose several novel dynamic routing, modulation and spectrum assignment (RMSA) algorithms for high-throughput service provisioning in spectrum-sliced elastic optical networks. The proposed algorithms can be applied to network provisioning, where a network operator needs to figure out an efficient way to serve each dynamic connection request based on current network status. The proposed algorithms can be categorized into two categories, dynamic RMSA using online path computation and dynamic RMSA using path-set updates. The former one updates link metrics based on their spectrum utilization status dynamically, and performs RMSA with online routing path computation for each request. The latter one pre-computes K shortest routing paths as the path-set for each source-destination pair in the network topology, performs RMSA based on different path-selection policies during dynamic provisioning, and updates a path-set by adding a new path in when a path in the set is not available for a request. We evaluate the proposed algorithms with simulations using the Poisson traffic model in a 14-node NSFNET topology. Simulation results indicate that the proposed algorithms outperform existing dynamic RMSA algorithm by providing lower bandwidth blocking probability, and reduce the blocking probability by one magnitude or more when the traffic load is light (≤ 700 Erlangs). The comparisons on network resource utilization also indicate that the proposed algorithms achieve larger resource utilization and hence provide higher throughput for network operations.\",\"PeriodicalId\":229123,\"journal\":{\"name\":\"2013 International Conference on Computing, Networking and Communications (ICNC)\",\"volume\":\"11 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2013-01-28\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"31\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2013 International Conference on Computing, Networking and Communications (ICNC)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/ICCNC.2013.6504113\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2013 International Conference on Computing, Networking and Communications (ICNC)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ICCNC.2013.6504113","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 31

摘要

我们提出了几种新的动态路由、调制和频谱分配(RMSA)算法,用于频谱切片弹性光网络中的高吞吐量业务提供。本文提出的算法可以应用于网络配置,网络运营商需要根据当前网络状态找到一种有效的方法来满足每个动态连接请求。本文提出的算法可分为两类:基于在线路径计算的动态RMSA算法和基于路径集更新的动态RMSA算法。前者根据链路的频谱利用状态动态更新链路指标,对每个请求进行在线路由路径计算的RMSA。后者预先计算K条最短路由路径作为网络拓扑中每个源-目的对的路径集,在动态供应期间基于不同的路径选择策略执行RMSA,并在路径集中的路径不可用于请求时通过添加新路径来更新路径集。我们在一个14节点的NSFNET拓扑中使用泊松流量模型进行仿真,以评估所提出的算法。仿真结果表明,所提出的算法比现有的动态RMSA算法具有更低的带宽阻塞概率,并且在流量负载较轻(≤700 erlang)时,阻塞概率降低了一个数量级以上。对网络资源利用率的比较也表明,本文提出的算法实现了更大的资源利用率,从而为网络操作提供了更高的吞吐量。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
Dynamic RMSA in spectrum-sliced elastic optical networks for high-throughput service provisioning
We propose several novel dynamic routing, modulation and spectrum assignment (RMSA) algorithms for high-throughput service provisioning in spectrum-sliced elastic optical networks. The proposed algorithms can be applied to network provisioning, where a network operator needs to figure out an efficient way to serve each dynamic connection request based on current network status. The proposed algorithms can be categorized into two categories, dynamic RMSA using online path computation and dynamic RMSA using path-set updates. The former one updates link metrics based on their spectrum utilization status dynamically, and performs RMSA with online routing path computation for each request. The latter one pre-computes K shortest routing paths as the path-set for each source-destination pair in the network topology, performs RMSA based on different path-selection policies during dynamic provisioning, and updates a path-set by adding a new path in when a path in the set is not available for a request. We evaluate the proposed algorithms with simulations using the Poisson traffic model in a 14-node NSFNET topology. Simulation results indicate that the proposed algorithms outperform existing dynamic RMSA algorithm by providing lower bandwidth blocking probability, and reduce the blocking probability by one magnitude or more when the traffic load is light (≤ 700 Erlangs). The comparisons on network resource utilization also indicate that the proposed algorithms achieve larger resource utilization and hence provide higher throughput for network operations.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
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学术官方微信