优化的 FlexEthernet 用于域间流量恢复

IF 4.7 2区 计算机科学 Q1 COMPUTER SCIENCE, INFORMATION SYSTEMS
Dahina Koulougli;Kim Khoa Nguyen;Mohamed Cheriet
{"title":"优化的 FlexEthernet 用于域间流量恢复","authors":"Dahina Koulougli;Kim Khoa Nguyen;Mohamed Cheriet","doi":"10.1109/TNSM.2024.3434955","DOIUrl":null,"url":null,"abstract":"Restoring traffic in multi-layer multi-domain networks (MLMD) can be inefficient and expensive due to the reconfiguration of both intra-domain and inter-domain paths under limited resources and information sharing. This often results in traffic loss and resource over-provisioning within the MLMD, leading to sub-optimal restoration throughput and high costs. In this study, we harness FlexEthernet (FlexE) on inter-domain links to maximize the restoration throughput at minimum cost. FlexE link aggregation is an effective technique to deal with the costly impact of alternative domain rerouting that allows diverting traffic over aggregated links parallel to the failed ones, without disrupting the intra-domain connections. Additionally, FlexE helps increase network reutilization by leveraging time division multiplexing (TDM) to flexibly shift affected traffic to underutilized aggregated links. However, scheduling traffic migration in FlexE is a challenging issue that has not been fully investigated in the literature. In this paper, we initially formulate the FlexE-based traffic restoration problem as a mixed integer non-linear program (MINLP) and then introduce an approximation algorithm to efficiently solve this problem in polynomial time. Furthermore, we propose a supervised learning approach to predict the optimal restoration policy for large-size instances. Experimental results show that our solution restores up to 14% more traffic than a state-of-the-art approach.","PeriodicalId":13423,"journal":{"name":"IEEE Transactions on Network and Service Management","volume":"21 5","pages":"5001-5017"},"PeriodicalIF":4.7000,"publicationDate":"2024-07-29","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"Optimized FlexEthernet for Inter-Domain Traffic Restoration\",\"authors\":\"Dahina Koulougli;Kim Khoa Nguyen;Mohamed Cheriet\",\"doi\":\"10.1109/TNSM.2024.3434955\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Restoring traffic in multi-layer multi-domain networks (MLMD) can be inefficient and expensive due to the reconfiguration of both intra-domain and inter-domain paths under limited resources and information sharing. This often results in traffic loss and resource over-provisioning within the MLMD, leading to sub-optimal restoration throughput and high costs. In this study, we harness FlexEthernet (FlexE) on inter-domain links to maximize the restoration throughput at minimum cost. FlexE link aggregation is an effective technique to deal with the costly impact of alternative domain rerouting that allows diverting traffic over aggregated links parallel to the failed ones, without disrupting the intra-domain connections. Additionally, FlexE helps increase network reutilization by leveraging time division multiplexing (TDM) to flexibly shift affected traffic to underutilized aggregated links. However, scheduling traffic migration in FlexE is a challenging issue that has not been fully investigated in the literature. In this paper, we initially formulate the FlexE-based traffic restoration problem as a mixed integer non-linear program (MINLP) and then introduce an approximation algorithm to efficiently solve this problem in polynomial time. Furthermore, we propose a supervised learning approach to predict the optimal restoration policy for large-size instances. Experimental results show that our solution restores up to 14% more traffic than a state-of-the-art approach.\",\"PeriodicalId\":13423,\"journal\":{\"name\":\"IEEE Transactions on Network and Service Management\",\"volume\":\"21 5\",\"pages\":\"5001-5017\"},\"PeriodicalIF\":4.7000,\"publicationDate\":\"2024-07-29\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"IEEE Transactions on Network and Service Management\",\"FirstCategoryId\":\"94\",\"ListUrlMain\":\"https://ieeexplore.ieee.org/document/10612999/\",\"RegionNum\":2,\"RegionCategory\":\"计算机科学\",\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"Q1\",\"JCRName\":\"COMPUTER SCIENCE, INFORMATION SYSTEMS\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"IEEE Transactions on Network and Service Management","FirstCategoryId":"94","ListUrlMain":"https://ieeexplore.ieee.org/document/10612999/","RegionNum":2,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q1","JCRName":"COMPUTER SCIENCE, INFORMATION SYSTEMS","Score":null,"Total":0}
引用次数: 0

摘要

由于要在有限的资源和信息共享条件下重新配置域内和域间路径,因此在多层多域网络(MLMD)中恢复流量可能效率低下且成本高昂。这往往会造成 MLMD 内的流量损失和资源过度配置,从而导致次优的恢复吞吐量和高昂的成本。在本研究中,我们利用域间链路上的 FlexEthernet(FlexE),以最小的成本获得最大的恢复吞吐量。FlexE 链路聚合是一种有效的技术,可在不中断域内连接的情况下,通过与故障链路平行的聚合链路分流流量,从而应对替代域重定向带来的高成本影响。此外,FlexE 还可利用时分复用(TDM)技术,将受影响的流量灵活转移到利用率较低的聚合链路上,从而有助于提高网络的再利用率。然而,在 FlexE 中调度流量迁移是一个具有挑战性的问题,文献中尚未对此进行充分研究。在本文中,我们首先将基于 FlexE 的流量恢复问题表述为混合整数非线性程序 (MINLP),然后引入了一种近似算法,以在多项式时间内高效解决该问题。此外,我们还提出了一种监督学习方法,用于预测大型实例的最优恢复策略。实验结果表明,与最先进的方法相比,我们的解决方案最多可多恢复 14% 的流量。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
Optimized FlexEthernet for Inter-Domain Traffic Restoration
Restoring traffic in multi-layer multi-domain networks (MLMD) can be inefficient and expensive due to the reconfiguration of both intra-domain and inter-domain paths under limited resources and information sharing. This often results in traffic loss and resource over-provisioning within the MLMD, leading to sub-optimal restoration throughput and high costs. In this study, we harness FlexEthernet (FlexE) on inter-domain links to maximize the restoration throughput at minimum cost. FlexE link aggregation is an effective technique to deal with the costly impact of alternative domain rerouting that allows diverting traffic over aggregated links parallel to the failed ones, without disrupting the intra-domain connections. Additionally, FlexE helps increase network reutilization by leveraging time division multiplexing (TDM) to flexibly shift affected traffic to underutilized aggregated links. However, scheduling traffic migration in FlexE is a challenging issue that has not been fully investigated in the literature. In this paper, we initially formulate the FlexE-based traffic restoration problem as a mixed integer non-linear program (MINLP) and then introduce an approximation algorithm to efficiently solve this problem in polynomial time. Furthermore, we propose a supervised learning approach to predict the optimal restoration policy for large-size instances. Experimental results show that our solution restores up to 14% more traffic than a state-of-the-art approach.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
IEEE Transactions on Network and Service Management
IEEE Transactions on Network and Service Management Computer Science-Computer Networks and Communications
CiteScore
9.30
自引率
15.10%
发文量
325
期刊介绍: IEEE Transactions on Network and Service Management will publish (online only) peerreviewed archival quality papers that advance the state-of-the-art and practical applications of network and service management. Theoretical research contributions (presenting new concepts and techniques) and applied contributions (reporting on experiences and experiments with actual systems) will be encouraged. These transactions will focus on the key technical issues related to: Management Models, Architectures and Frameworks; Service Provisioning, Reliability and Quality Assurance; Management Functions; Enabling Technologies; Information and Communication Models; Policies; Applications and Case Studies; Emerging Technologies and Standards.
×
引用
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学术官方微信