Intelligent Segment Routing: Toward Load Balancing with Limited Control Overheads

作     者：Shu Yang Ruiyu Chen Laizhong Cui Xiaolei Chang 

作者机构：College of Computer Science and Software EngineeringShenzhen UniversityShenzhen 518000China Tsinghua Shenzhen International Graduate SchoolTsinghua UniversityShenzhen 518071China 

出 版 物：《Big Data Mining and Analytics》 (大数据挖掘与分析（英文）)

年 卷 期：2023年第6卷第1期

页      面：55-71页

核心收录：

学科分类：12[管理学] 02[经济学] 0202[经济学-应用经济学] 1201[管理学-管理科学与工程(可授管理学、工学学位)] 020204[经济学-金融学（含∶保险学）] 081104[工学-模式识别与智能系统] 08[工学] 0835[工学-软件工程] 0811[工学-控制科学与工程] 0812[工学-计算机科学与技术（可授工学、理学学位）] 

基　　金：supported in part by the National Natural Science Foundation of China(Nos.61772345 and 61902258) the Major Fundamental Research Project in the Science and Technology Plan of Shenzhen(Nos.JCYJ20190808142207420,GJHZ20190822095416463,and RCYX20200714114645048) the Natural Science Foundation of Guangdong Basic and Applied Basic Research(No.2021A1515011857) the Pearl River Young Scholars Funding of Shenzhen University 

主　　题：traffic engineering segment routing bandwidth load balancing ant colony optimization 

摘      要：Segment routing has been a novel architecture for traffic engineering in recent ***,segment routing brings control overheads,i.e.,additional packets headers should be *** overheads can greatly reduce the forwarding efficiency for a large network,when segment headers become too *** achieve the best of two targets,we propose the intelligent routing scheme for traffic engineering(IRTE),which can achieve load balancing with limited control *** achieve optimal performance,we first formulate the problem as a mapping problem that maps different flows to key diversion ***,we prove the problem is nondeterministic polynomial(NP)-hard by reducing it to a k-dense subgraph *** solve this problem,we develop an ant colony optimization algorithm as improved ant colony optimization(IACO),which is widely used in network optimization *** also design the load balancing algorithm with diversion routing(LBA-DR),and analyze its theoretical ***,we evaluate the IRTE in different real-world topologies,and the results show that the IRTE outperforms traditional algorithms,e.g.,the maximum bandwidth is 24.6% lower than that of traditional algorithms when evaluating on BellCanada topology.