Learning Automata-Based Scalable PCE for Load-Balancing in Multi-carrier Domain Sequences

E. Fernández
{"title":"Learning Automata-Based Scalable PCE for Load-Balancing in Multi-carrier Domain Sequences","authors":"E. Fernández","doi":"10.1109/ICCC47050.2019.9064273","DOIUrl":null,"url":null,"abstract":"The prior selection of a domain sequence is a key issue for an optimal establishing of inter-domain paths. The architecture based on the path computation element (PCE) for selecting the domain sequence was proposed. Inter-domain PCEs were established that could have TE information about the link status of the multi-domain network. Confidentiality fails in the case of multi-carrier domain sequences because the inter-domain PCEs are not controlled by certain network operators. The inter-domain PCEs are also exposed to overload due to the calculation of the domain sequences. Confidentiality and scalability problems are avoided by proposing the per-domain technique based on PCE, where the PCE of the source domain has learning automata (LA) for the selection of multi-carrier domain sequences. The selection of the inter-domain path is made with a low complexity from a set of paths belonging to different multi-carrier disjoint-domain sequences. The incorporation of an LA-PCE in the source domain of the connection between domains allows decreasing the blocking probability with respect to BGP. Scenarios have been used for uniform traffic load between pairs of domains as well as links exposed to congestion.","PeriodicalId":6739,"journal":{"name":"2019 IEEE 5th International Conference on Computer and Communications (ICCC)","volume":"28 1","pages":"382-388"},"PeriodicalIF":0.0000,"publicationDate":"2019-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2019 IEEE 5th International Conference on Computer and Communications (ICCC)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ICCC47050.2019.9064273","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0

Abstract

The prior selection of a domain sequence is a key issue for an optimal establishing of inter-domain paths. The architecture based on the path computation element (PCE) for selecting the domain sequence was proposed. Inter-domain PCEs were established that could have TE information about the link status of the multi-domain network. Confidentiality fails in the case of multi-carrier domain sequences because the inter-domain PCEs are not controlled by certain network operators. The inter-domain PCEs are also exposed to overload due to the calculation of the domain sequences. Confidentiality and scalability problems are avoided by proposing the per-domain technique based on PCE, where the PCE of the source domain has learning automata (LA) for the selection of multi-carrier domain sequences. The selection of the inter-domain path is made with a low complexity from a set of paths belonging to different multi-carrier disjoint-domain sequences. The incorporation of an LA-PCE in the source domain of the connection between domains allows decreasing the blocking probability with respect to BGP. Scenarios have been used for uniform traffic load between pairs of domains as well as links exposed to congestion.
基于学习自动机的可扩展PCE多载波域序列负载平衡
域序列的先验选择是域间路径优化建立的关键问题。提出了基于路径计算元素(PCE)的区域序列选择体系结构。建立具有多域网络链路状态TE信息的域间pce。在多载波域序列的情况下,由于域间pce不受某些网络运营商的控制,因此无法保密。由于域序列的计算,域间pce也容易过载。通过提出基于PCE的每域技术,避免了保密性和可扩展性问题,其中源域的PCE具有用于选择多载波域序列的学习自动机(LA)。从属于不同多载波分离域序列的一组路径中以较低的复杂度选择域间路径。在域间连接的源域中加入LA-PCE可以降低BGP的阻塞概率。场景已用于对域之间的均匀流量负载以及暴露于拥塞的链路。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约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学术文献互助群
群 号:481959085
Book学术官方微信