Traffic Engineering(TE)enables management of traffic in a manner that optimizes utilization of network resources in an efficient and balanced manner.However,existing TE solutions face issues relating to scalability an...Traffic Engineering(TE)enables management of traffic in a manner that optimizes utilization of network resources in an efficient and balanced manner.However,existing TE solutions face issues relating to scalability and complexity.In recent years,Segment Routing(SR)has emerged as a promising source routing paradigm.As one of the most important applications of SR,Segment Routing Traffic Engineering(SR-TE),which enables a headend to steer traffic along specific paths represented as ordered lists of instructions called segment lists,has the capability to overcome the above challenges due to its flexibility and scalability.In this paper,we conduct a comprehensive survey on SR-TE.A thorough review of SR-TE architecture is provided in the first place,reviewing the core components and implementation of SR-TE such as SR Policy,Flexible Algorithm and SR-native algorithm.Strengths of SR-TE are also discussed,as well as its major challenges.Next,we dwell on the recent SR-TE researches on routing optimization with various intents,e.g.,optimization on link utilization,throughput,QoE(Quality of Experience)and energy consumption.Afterwards,node management for SR-TE are investigated,including SR node deployment and candidate node selection.Finally,we discuss the existing challenges of current research activities and propose several research directions worth of future exploration.展开更多
The emergence of Segment Routing(SR)provides a novel routing paradigm that uses a routing technique called source packet routing.In SR architecture,the paths that the packets choose to route on are indicated at the in...The emergence of Segment Routing(SR)provides a novel routing paradigm that uses a routing technique called source packet routing.In SR architecture,the paths that the packets choose to route on are indicated at the ingress router.Compared with shortest-path-based routing in traditional distributed routing protocols,SR can realize a flexible routing by implementing an arbitrary flow splitting at the ingress router.Despite the advantages of SR,it may be difficult to update the existing IP network to a full SR deployed network,for economical and technical reasons.Updating partial of the traditional IP network to the SR network,thus forming a hybrid SR network,is a preferable choice.For the traffic is dynamically changing in a daily time,in this paper,we propose a Weight Adjustment algorithm WASAR to optimize routing in a dynamic hybrid SR network.WASAR algorithm can be divided into three steps:firstly,representative Traffic Matrices(TMs)and the expected TM are obtained from the historical TMs through ultrascalable spectral clustering algorithm.Secondly,given the network topology,the initial network weight setting and the expected TM,we can realize the link weight optimization and SR node deployment optimization through a Deep Reinforcement Learning(DRL)algorithm.Thirdly,we optimize the flow splitting ratios of SR nodes in a centralized online manner under dynamic traffic demands,in order to improve the network performance.In the evaluation,we exploit historical TMs to test the performance of the obtained routing configuration in WASAR.The extensive experimental results validate that our proposed WASAR algorithm has superior performance in reducing Maximum Link Utilization(MLU)under the dynamic traffic.展开更多
Segment Routing(SR)is a new routing paradigm based on source routing and provide traffic engineering(TE)capabilities in IP network.By extending interior gateway protocol(IGP),SR can be easily applied to IP network.How...Segment Routing(SR)is a new routing paradigm based on source routing and provide traffic engineering(TE)capabilities in IP network.By extending interior gateway protocol(IGP),SR can be easily applied to IP network.However,upgrading current IP network to a full SR one can be costly and difficult.Hybrid IP/SR network will last for some time.Aiming at the low flexibility problem of static TE policies in the current SR networks,this paper proposes a Deep Reinforcement Learning(DRL)based TE scheme.The proposed scheme employs multi-path transmission and use DRL to dynamically adjust the traffic splitting ratio among different paths based on the network traffic distribution.As a result,the network congestion can be mitigated and the performance of the network is improved.Simulation results show that our proposed scheme can improve the throughput of the network by up to 9%than existing schemes.展开更多
With the expansion of satellite constellation,routing techniques for small-scale satellite networks have problems in routing overhead and forwarding efficiency.This paper proposes a vector segment routing method for l...With the expansion of satellite constellation,routing techniques for small-scale satellite networks have problems in routing overhead and forwarding efficiency.This paper proposes a vector segment routing method for large-scale multi layer satellite networks.A vector forwarding path is built based on the location between the source and the destination.Data packets are forwarded along this vector path,shielding the influence of satellite motion on routing forwarding.Then,a dynamic route maintenance strategy is suggested.In a multi layer satellite network,the low-orbit satellites are in charge of computing the routing tables for one area,and the routing paths are dynamically adjusted in the area in accordance with the network.The medium-orbit satellites maintain the connectivity of vector paths in multiple segmented areas.The forwarding mode based on the source and destination location improves the forwarding efficiency,and the segmented route maintenance mode decreases the routing overhead.The simulation results indicate that vector segment routing has significant performance advantages in end-to-end delay,packet loss rate,and throughput in a multi layer satellite network.We also simulate the impact of routing table update mechanism on network performance and overhead and give the performance of segmented vector routing in multi layer low-orbit satellite networks.展开更多
Segment routing has been a novel architecture for traffic engineering in recent years.However,segment routing brings control overheads,i.e.,additional packets headers should be inserted.The overheads can greatly reduc...Segment routing has been a novel architecture for traffic engineering in recent years.However,segment routing brings control overheads,i.e.,additional packets headers should be inserted.The overheads can greatly reduce the forwarding efficiency for a large network,when segment headers become too long.To achieve the best of two targets,we propose the intelligent routing scheme for traffic engineering(IRTE),which can achieve load balancing with limited control overheads.To achieve optimal performance,we first formulate the problem as a mapping problem that maps different flows to key diversion points.Second,we prove the problem is nondeterministic polynomial(NP)-hard by reducing it to a k-dense subgraph problem.To solve this problem,we develop an ant colony optimization algorithm as improved ant colony optimization(IACO),which is widely used in network optimization problems.We also design the load balancing algorithm with diversion routing(LBA-DR),and analyze its theoretical performance.Finally,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.展开更多
Aiming at the problem of failure recovery in current networks,a fast failure recovery method based on equivalent cooperative routing is proposed.Firstly,the transmission path between the source and destination nodes i...Aiming at the problem of failure recovery in current networks,a fast failure recovery method based on equivalent cooperative routing is proposed.Firstly,the transmission path between the source and destination nodes is divided into several non-overlapping path segments.Next,backup paths are deployed for each link in the path segment through segmented routing technology,which ensures fast routing recovery after failure.Additionally,in order to avoid damaging the QoS of the data stream through the failure recovery process,the transmission is guaranteed by the intersegment QoS complement.The experimental results show that the proposed method has a low failure recovery delay under a relatively small flow table cost.展开更多
Traditional Internet protocol networks cannot provide the service of selecting a secure path to transmit various types of data with specific security constraints.First,to solve the“secure path transmission”problem,t...Traditional Internet protocol networks cannot provide the service of selecting a secure path to transmit various types of data with specific security constraints.First,to solve the“secure path transmission”problem,this paper first proposes a search-transmit model for secure network path transmission,i.e.,to find a multi-attribute optimized path that meets the specific security requirements in the search phase,and then transmit the packets along the optimized path in the transmission phase.Second,we propose a solution to the search-transmit model.The idea of the solution is to use the particle swarm optimization algorithm to search for a secure path that meets the multi-attribute requirements and then set the source route on the router to control the packet transmission.Finally,a prototype system based on network function virtualization is developed to evaluate the feasibility and performance of the proposed solution.Experimental results show that the proposed solution outperforms existing algorithms in terms of performance.展开更多
基金partially supported by Chinese National Research Fund(NSFC)No.62172189 and 61772235Natural Science Foundation of Guangdong Province No.2020A1515010771Science and Technology Program of Guangzhou No.202002030372.
文摘Traffic Engineering(TE)enables management of traffic in a manner that optimizes utilization of network resources in an efficient and balanced manner.However,existing TE solutions face issues relating to scalability and complexity.In recent years,Segment Routing(SR)has emerged as a promising source routing paradigm.As one of the most important applications of SR,Segment Routing Traffic Engineering(SR-TE),which enables a headend to steer traffic along specific paths represented as ordered lists of instructions called segment lists,has the capability to overcome the above challenges due to its flexibility and scalability.In this paper,we conduct a comprehensive survey on SR-TE.A thorough review of SR-TE architecture is provided in the first place,reviewing the core components and implementation of SR-TE such as SR Policy,Flexible Algorithm and SR-native algorithm.Strengths of SR-TE are also discussed,as well as its major challenges.Next,we dwell on the recent SR-TE researches on routing optimization with various intents,e.g.,optimization on link utilization,throughput,QoE(Quality of Experience)and energy consumption.Afterwards,node management for SR-TE are investigated,including SR node deployment and candidate node selection.Finally,we discuss the existing challenges of current research activities and propose several research directions worth of future exploration.
基金supported by the MSIT(Ministry of Science,ICT),Korea,under the ITRC(Information Technology Research Center)support program(IITP-2020-2016-0-00465)supervised by the IITP(Institute for Information&Communications Technology Planning&Evaluation).
文摘The emergence of Segment Routing(SR)provides a novel routing paradigm that uses a routing technique called source packet routing.In SR architecture,the paths that the packets choose to route on are indicated at the ingress router.Compared with shortest-path-based routing in traditional distributed routing protocols,SR can realize a flexible routing by implementing an arbitrary flow splitting at the ingress router.Despite the advantages of SR,it may be difficult to update the existing IP network to a full SR deployed network,for economical and technical reasons.Updating partial of the traditional IP network to the SR network,thus forming a hybrid SR network,is a preferable choice.For the traffic is dynamically changing in a daily time,in this paper,we propose a Weight Adjustment algorithm WASAR to optimize routing in a dynamic hybrid SR network.WASAR algorithm can be divided into three steps:firstly,representative Traffic Matrices(TMs)and the expected TM are obtained from the historical TMs through ultrascalable spectral clustering algorithm.Secondly,given the network topology,the initial network weight setting and the expected TM,we can realize the link weight optimization and SR node deployment optimization through a Deep Reinforcement Learning(DRL)algorithm.Thirdly,we optimize the flow splitting ratios of SR nodes in a centralized online manner under dynamic traffic demands,in order to improve the network performance.In the evaluation,we exploit historical TMs to test the performance of the obtained routing configuration in WASAR.The extensive experimental results validate that our proposed WASAR algorithm has superior performance in reducing Maximum Link Utilization(MLU)under the dynamic traffic.
基金supported by the National Key R&D Project(No.2020YFB1804803)the Research and Development Program in Key Areas of Guangdong Province(No.2018B010113001)。
文摘Segment Routing(SR)is a new routing paradigm based on source routing and provide traffic engineering(TE)capabilities in IP network.By extending interior gateway protocol(IGP),SR can be easily applied to IP network.However,upgrading current IP network to a full SR one can be costly and difficult.Hybrid IP/SR network will last for some time.Aiming at the low flexibility problem of static TE policies in the current SR networks,this paper proposes a Deep Reinforcement Learning(DRL)based TE scheme.The proposed scheme employs multi-path transmission and use DRL to dynamically adjust the traffic splitting ratio among different paths based on the network traffic distribution.As a result,the network congestion can be mitigated and the performance of the network is improved.Simulation results show that our proposed scheme can improve the throughput of the network by up to 9%than existing schemes.
基金supported in part by the National Key R&D Program of China under Grant 2020YFB1806100in part by the Natural Science Foundation of China under Grant U19B2025 and Grant 62001347+1 种基金in part by the Key Research and Development Program of Shaanxi under Grants 2022ZDLGY05-02 and 2021KWZ-05in part by the Fundamental Research Funds for the Central Universities under Grant QTZX22161
文摘With the expansion of satellite constellation,routing techniques for small-scale satellite networks have problems in routing overhead and forwarding efficiency.This paper proposes a vector segment routing method for large-scale multi layer satellite networks.A vector forwarding path is built based on the location between the source and the destination.Data packets are forwarded along this vector path,shielding the influence of satellite motion on routing forwarding.Then,a dynamic route maintenance strategy is suggested.In a multi layer satellite network,the low-orbit satellites are in charge of computing the routing tables for one area,and the routing paths are dynamically adjusted in the area in accordance with the network.The medium-orbit satellites maintain the connectivity of vector paths in multiple segmented areas.The forwarding mode based on the source and destination location improves the forwarding efficiency,and the segmented route maintenance mode decreases the routing overhead.The simulation results indicate that vector segment routing has significant performance advantages in end-to-end delay,packet loss rate,and throughput in a multi layer satellite network.We also simulate the impact of routing table update mechanism on network performance and overhead and give the performance of segmented vector routing in multi layer low-orbit satellite networks.
基金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)+1 种基金the Natural Science Foundation of Guangdong Basic and Applied Basic Research(No.2021A1515011857)the Pearl River Young Scholars Funding of Shenzhen University.
文摘Segment routing has been a novel architecture for traffic engineering in recent years.However,segment routing brings control overheads,i.e.,additional packets headers should be inserted.The overheads can greatly reduce the forwarding efficiency for a large network,when segment headers become too long.To achieve the best of two targets,we propose the intelligent routing scheme for traffic engineering(IRTE),which can achieve load balancing with limited control overheads.To achieve optimal performance,we first formulate the problem as a mapping problem that maps different flows to key diversion points.Second,we prove the problem is nondeterministic polynomial(NP)-hard by reducing it to a k-dense subgraph problem.To solve this problem,we develop an ant colony optimization algorithm as improved ant colony optimization(IACO),which is widely used in network optimization problems.We also design the load balancing algorithm with diversion routing(LBA-DR),and analyze its theoretical performance.Finally,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.
基金supported by the National Basic Research Program of China("973"Program)(No.2013CB329104).
文摘Aiming at the problem of failure recovery in current networks,a fast failure recovery method based on equivalent cooperative routing is proposed.Firstly,the transmission path between the source and destination nodes is divided into several non-overlapping path segments.Next,backup paths are deployed for each link in the path segment through segmented routing technology,which ensures fast routing recovery after failure.Additionally,in order to avoid damaging the QoS of the data stream through the failure recovery process,the transmission is guaranteed by the intersegment QoS complement.The experimental results show that the proposed method has a low failure recovery delay under a relatively small flow table cost.
基金supported by the National Natural Science Foundation of China(No.61772271).
文摘Traditional Internet protocol networks cannot provide the service of selecting a secure path to transmit various types of data with specific security constraints.First,to solve the“secure path transmission”problem,this paper first proposes a search-transmit model for secure network path transmission,i.e.,to find a multi-attribute optimized path that meets the specific security requirements in the search phase,and then transmit the packets along the optimized path in the transmission phase.Second,we propose a solution to the search-transmit model.The idea of the solution is to use the particle swarm optimization algorithm to search for a secure path that meets the multi-attribute requirements and then set the source route on the router to control the packet transmission.Finally,a prototype system based on network function virtualization is developed to evaluate the feasibility and performance of the proposed solution.Experimental results show that the proposed solution outperforms existing algorithms in terms of performance.
