Network traffic scheduling method for implementing non-continuous Segment Routing Domain

Abstract

The invention discloses a network traffic scheduling method for implementing a non-continuous Segment Routing Domain, which can solve the technical problems that the continuity of the existing controlplane and the forwarding plane limits the deployment and application range of the Segment Routing, and a smooth transition mode is lack. The method comprises the following step: forming an Overlay network by some device nodes that support Segment Routing and is selected by an Underlay network. SID-based label forwarding only needs to be done in the Overlay. An outer layer performs IP routing through a GRE tunnel to shield the Underlay Network. The nodes in the Overlay network implement a logical Point-to-Multipoint Fullmesh connection by MGRE. Between any two nodes are one-hop-reachable, so that a neighboring SID is no longer needed. The encapsulated address of the MGRE to a destination node is requested by the NHRP protocol. When the application requests a path that meets the requirements of a certain SLA, the controller calculates a path that meets the application link quality requirements for the source end injection and drainage according to the LSDB and TED reported by the BGP LS, and according to loose nodes in the Overlay. The traffic scheduling is finally implemented after the node SID enters the GRE tunnel.

Description

Technical field [0001] The invention relates to the technical field of flow path control of network communication equipment, in particular to a network flow scheduling method for realizing discontinuous segmented routing domains. Background technique [0002] Traditional communication equipment path control technology includes routing and policy routing. The routing basis is generally based on the shortest path, but the traffic in the network is bursty and uncertain. The shortest path is often not the optimal path, whether it is based on the shortest path. Routing is still based on path attributes or policy routing. The solidified traffic path cannot be dynamically adjusted according to changes in link load conditions. Applications cannot obtain SLA guarantees. Some links are congested and lost packets, while some links are idle. Symmetry causes a great waste of bandwidth. Correspondingly, many traffic scheduling solutions have been produced, such as MPLS traffic engineering, Op...

AI Technical Summary

Problems solved by technology

[0009] A network traffic scheduling method for implementing discontinuous segment routing domains proposed by the present invention can solve the problem that the continuity of the existing control plane and forwarding plane limits the deployment and application range of Segment Routing, and requires a large number of equipment replacement and upgrades in a unified manner. Technical issues with the lack of a way to make a smooth transition

Images