Joint Optimization Of Routing and Flexible Ethernet Assignment In Multi-layer Multi-domain Networks

Dahina Koulougli, K. Nguyen, M. Cheriet
{"title":"Joint Optimization Of Routing and Flexible Ethernet Assignment In Multi-layer Multi-domain Networks","authors":"Dahina Koulougli, K. Nguyen, M. Cheriet","doi":"10.1109/ICCCN49398.2020.9209665","DOIUrl":null,"url":null,"abstract":"Optimized routing in multi-layer multi-domain (MLMD) IP-optical networks is challenging due to different technologies and policies in different domains. In this paper, we investigate the problem of using the hierarchical path computation engine (PCE) to leverage the performance of FlexE—the new flexible Ethernet technology which is used to map traffic between different layers and different domains. Our proposed PCE can be implemented in MLMD orchestration platforms to optimize network utilization while meeting delay constraints. We formulate the optimization problems of traffic routing and physical slot assignment for both FlexE-Aware and FlexE-Unaware modes with respect to QoS requirements, intra-domain information privacy and FlexE constraints. To solve the problem, we propose new algorithms that jointly optimize the routing and FlexE client assignment in polynomial time. To deal with the issue of missing intra-domain information, we use a novel implicit routing strategy to collect the intra-domain information from the child PCEs. Simulation results show the proposed solution achieves 90.1% higher efficiency than the state-of-the-art solutions.","PeriodicalId":137835,"journal":{"name":"2020 29th International Conference on Computer Communications and Networks (ICCCN)","volume":"38 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2020-08-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"3","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2020 29th International Conference on Computer Communications and Networks (ICCCN)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ICCCN49398.2020.9209665","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 3

Abstract

Optimized routing in multi-layer multi-domain (MLMD) IP-optical networks is challenging due to different technologies and policies in different domains. In this paper, we investigate the problem of using the hierarchical path computation engine (PCE) to leverage the performance of FlexE—the new flexible Ethernet technology which is used to map traffic between different layers and different domains. Our proposed PCE can be implemented in MLMD orchestration platforms to optimize network utilization while meeting delay constraints. We formulate the optimization problems of traffic routing and physical slot assignment for both FlexE-Aware and FlexE-Unaware modes with respect to QoS requirements, intra-domain information privacy and FlexE constraints. To solve the problem, we propose new algorithms that jointly optimize the routing and FlexE client assignment in polynomial time. To deal with the issue of missing intra-domain information, we use a novel implicit routing strategy to collect the intra-domain information from the child PCEs. Simulation results show the proposed solution achieves 90.1% higher efficiency than the state-of-the-art solutions.
多层多域网络中路由与灵活以太网分配的联合优化
由于不同领域的技术和策略不同,MLMD ip光网络的路由优化具有一定的挑战性。在本文中,我们研究了使用分层路径计算引擎(PCE)来利用flex的性能问题,flex是一种新的灵活以太网技术,用于映射不同层和不同域之间的流量。我们提出的PCE可以在MLMD编排平台中实现,以优化网络利用率,同时满足延迟限制。针对QoS要求、域内信息隐私和FlexE约束,提出了FlexE- aware和FlexE- aware两种模式下的流量路由和物理插槽分配优化问题。为了解决这个问题,我们提出了在多项式时间内共同优化路由和FlexE客户端分配的新算法。为了解决域内信息缺失的问题,我们使用了一种新的隐式路由策略从子pce中收集域内信息。仿真结果表明,该方案的效率比现有方案提高了90.1%。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约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学术官方微信