Regional dynamic topology path processing method and device and electronic equipment

Abstract

The invention discloses a path processing method and device for regional dynamic topology and electronic equipment. The method comprises the following steps: acquiring network topology information of all areas in a network, and acquiring path requirements of segmented routing; determining a network forwarding path according to the network topology information and the path requirement; path optimization is carried out on the sub-paths with topological information changes in the network forwarding path, configuration information of a new segment routing extension head SRH is issued to the sub-paths with path optimization, and each area through which the network forwarding path passes corresponds to one sub-path. According to the method and the device, the technical problem that the difficulty and the cost of network operation are increased due to frequent re-calculation and updating of the IPv6 segment routing path caused by frequent change of the network topology in different regions is solved.

Description

Technical Field

[0001] This application relates to the field of communication technology, and more specifically, to a path processing method, apparatus, and electronic device for regional dynamic topology. Background Technology

[0002] In today's highly interconnected world, network complexity is increasing, and the network topology changes due to various factors such as emergency response, aircraft trajectory adjustments, and satellite orbit changes. This dynamic change in multi-region topology causes changes in the forwarding path of network packets, leading to frequent dynamic calculations, distribution, and updates by the controller.

[0003] In traditional IPv6 segmented routing methods, whenever the network topology changes, the controller needs to recalculate the entire end-to-end path and distribute the updated segment list to the network's originating device so that all subsequent data packets can be forwarded using the latest path. This process involves significant computational resource consumption and frequent configuration updates to network devices. Especially in large-scale, multi-area networks, this recalculation and update activity significantly increases the difficulty and cost of network operation, placing high technical demands on IP network operation and maintenance.

[0004] There is currently no effective solution to the above problems. Summary of the Invention

[0005] This application provides a path processing method, apparatus, and electronic device for regional dynamic topology, which at least solves the technical problem of frequent recalculation and updating of IPv6 segmented routing paths caused by frequent changes in network topology in different regions, increasing the difficulty and cost of network operation.

[0006] According to one aspect of the embodiments of this application, a path processing method for regional dynamic topology is provided, including: obtaining network topology information of all regions in the network and obtaining path requirements for segmented routing; determining a network forwarding path based on the network topology information and path requirements; optimizing the sub-paths in the network forwarding path where the topology information has changed, and issuing new SRH configuration information to the optimized sub-paths, wherein each region traversed by the network forwarding path corresponds to a sub-path.

[0007] Optionally, before optimizing the sub-paths in the network forwarding path where topology information changes, the method further includes: obtaining network topology information of the target area, as well as a first identifier corresponding to the internal nodes of the target area and a second identifier corresponding to the boundary nodes of the target area, wherein the target area is any area traversed by the network forwarding path, the first identifier is valid within the target area, and the second identifier is valid globally; publishing the second identifier to the adjacent nodes of the boundary nodes, and using the second identifier to represent the IPv6 segment list in the adjacent areas of the target area.

[0008] Optionally, the method further includes: triggering intra-regional path optimization for sub-paths whose topology information has changed when the topology information changes within a region; not triggering intra-regional path optimization when the topology information has not changed within a region; and triggering end-to-end path re-optimization when the topology information changes between regions.

[0009] Optionally, path optimization is performed on sub-paths in the network forwarding path where topology information changes, including: obtaining a first segment list and a second segment list corresponding to the target sub-path in the network forwarding path before and after the topology information change, wherein the target sub-path is any sub-path in the network forwarding path where the topology information changes; comparing the first segment list and the second segment list to obtain a comparison result; if the comparison result indicates that the first segment list and the second segment list are inconsistent, obtaining the target segment list sent by the controller to the target sub-path, and sending the target segment list to the source node of the target sub-path.

[0010] Optionally, the network forwarding path consists of multiple sub-paths, each sub-path having a segment list and a second identifier. Based on the segment list and second identifier corresponding to each sub-path in the network forwarding path, the end-to-end segment list of the network forwarding path is determined. The segment list is an ordered sequence of first identifiers used to represent the list of nodes that the packet passes through in each sub-path.

[0011] Optionally, the method further includes: after optimizing the sub-paths in the network forwarding path where the topology information has changed, updating the end-to-end segment list of the network forwarding path to obtain the updated end-to-end segment list; and sending the updated end-to-end segment list to the head node of the network forwarding path.

[0012] Optionally, the method further includes: forwarding packets for IPv6 segmented routing to network element devices in the network with configuration information, wherein the network element device receives a first update identifier issued by the controller, the first update identifier including the update identifier of the starting boundary node, the update identifier of the ending boundary node, and the update identifier between the starting boundary node and the ending boundary node, and replaces the original SRH first identifier list in the network element device according to the first update identifier.

[0013] According to another aspect of the embodiments of this application, a path processing apparatus for regional dynamic topology is also provided, comprising: an acquisition module, configured to acquire network topology information of all regions in the network and acquire path requirements for segmented routes; a determination module, configured to determine a network forwarding path based on the network topology information and path requirements; and an optimization module, configured to optimize the sub-paths in the network forwarding path where the topology information has changed, and to issue new configuration information of the segmented route extension header (SRH) to the optimized sub-paths, wherein each region traversed by the network forwarding path corresponds to a sub-path.

[0014] According to another aspect of the embodiments of this application, an electronic device is also provided, including: a memory for storing program instructions; and a processor connected to the memory for executing program instructions to perform the following functions: obtaining network topology information of all areas in the network and obtaining path requirements for segmented routing; determining a network forwarding path based on the network topology information and path requirements; optimizing the sub-paths in the network forwarding path where the topology information has changed, and issuing new SRH configuration information to the optimized sub-paths, wherein each area traversed by the network forwarding path corresponds to a sub-path.

[0015] According to another aspect of the embodiments of this application, a non-volatile storage medium is also provided, the non-volatile storage medium including a stored computer program, wherein the device where the non-volatile storage medium is located executes the above-mentioned path processing method for dynamic topology of the region by running the computer program.

[0016] According to another aspect of the embodiments of this application, a computer program product is also provided, including computer instructions that, when executed by a processor, implement the above-described path processing method for dynamic regional topology.

[0017] In this embodiment, network topology information of all areas in the network and path requirements for segmented routing are obtained; based on the network topology information and path requirements, network forwarding paths are determined; sub-paths in the network forwarding path where topology information changes are optimized, and new SRH configuration information is sent to the optimized sub-paths. Each area traversed by the network forwarding path corresponds to a sub-path, achieving the purpose of local updates and reducing the latency of configuration updates. This achieves the technical effect of reducing computational costs and lowering the difficulty of operation and maintenance, thereby solving the technical problem of frequent recalculation and updates of IPv6 segmented routing paths caused by frequent changes in network topology in different areas, which increases the difficulty and cost of network operation. Attached Figure Description

[0018] The accompanying drawings, which are included to provide a further understanding of this application and form part of this application, illustrate exemplary embodiments and are used to explain this application, but do not constitute an undue limitation of this application. In the drawings:

[0019] Figure 1 This is a hardware structure block diagram of a computer terminal for implementing a path processing method for dynamic topology of a region, according to an embodiment of this application.

[0020] Figure 2 This is a flowchart of a path processing method for a dynamic topology of a region according to an embodiment of this application;

[0021] Figure 3 This is a system flowchart of a path processing method for regional dynamic topology according to an embodiment of this application;

[0022] Figure 4 This is a flowchart of an SRv6 multi-region dynamic topology path processing according to an embodiment of this application;

[0023] Figure 5 This is a schematic diagram of a multi-area networking forwarding network according to an embodiment of this application;

[0024] Figure 6 This is a schematic diagram of SID and BSID allocation on a PE1-PE2 path according to an embodiment of this application;

[0025] Figure 7 This is a schematic diagram of a PE1 node forwarding an SRH message using SRv6 according to an embodiment of this application;

[0026] Figure 8 This is a schematic diagram of a P21 node forwarding an SRH message using SRv6 according to an embodiment of this application;

[0027] Figure 9 This is a schematic diagram of a P31 node forwarding an SRH message using SRv6 according to an embodiment of this application;

[0028] Figure 10 This is a schematic diagram of SID and BSID after a path failure (P21-P22) according to an embodiment of this application.

[0029] Figure 11 This is a schematic diagram of an SRv6 forwarding message SRH of a P21 node after a P21-P22 path failure, according to an embodiment of this application.

[0030] Figure 12 This is a schematic diagram illustrating how, after a P21-P22 path failure, SRv6 forwarding packets are updated using extended SID information, according to an embodiment of this application.

[0031] Figure 13 This is a schematic diagram of a path processing device for a regional dynamic topology according to an embodiment of this application. Detailed Implementation

[0032] To enable those skilled in the art to better understand the present application, the technical solutions in the embodiments of the present application will be clearly and completely described below with reference to the accompanying drawings. Obviously, the described embodiments are only some embodiments of the present application, and not all embodiments. Based on the embodiments in the present application, all other embodiments obtained by those of ordinary skill in the art without creative effort should fall within the scope of protection of the present application.

[0033] It should be noted that the terms "first," "second," etc., in the specification, claims, and accompanying drawings of this application are used to distinguish similar objects and are not necessarily used to describe a specific order or sequence. It should be understood that such data can be interchanged where appropriate so that the embodiments of this application described herein can be implemented in orders other than those illustrated or described herein. Furthermore, the terms "comprising" and "having," and any variations thereof, are intended to cover non-exclusive inclusion; for example, a process, method, system, product, or apparatus that comprises a series of steps or units is not necessarily limited to those steps or units explicitly listed, but may include other steps or units not explicitly listed or inherent to such processes, methods, products, or apparatus.

[0034] To better understand the embodiments of this application, the following is a translation and explanation of some nouns or terms that appear in the description of the embodiments of this application:

[0035] SRv6 (Segment Routing v6) is an advanced network routing technology that allows data packets to follow a series of predefined segments or operations during forwarding, rather than relying on traditional IP routing tables for hop-by-hop decisions. This technology uses IPv6 addresses as forwarding instructions to explicitly specify paths, greatly enhancing the programmability and flexibility of the network.

[0036] SRH (Segment Routing Header): This is an extension header used in the Segment Routing architecture for IPv6 packets to guide packet forwarding along a predefined path. The SRH contains an ordered Segment List, which is a list of SIDs (Segment Identifiers). Each SID corresponds to a node or action in the network. Packets consume SIDs one by one during forwarding until they reach their destination.

[0037] SDN (Software Defined Network) is a network architecture concept that separates the control plane from the data plane of network devices. It enables programmable management of the network through a centralized controller, aiming to improve the flexibility, manageability, and programmability of the network, support dynamic optimization of network resources, simplify network operation and maintenance, and enable rapid deployment and adjustment of network functions.

[0038] IPv6 (Internet Protocol version 6): is the sixth version of the Internet Protocol, designed to replace IPv4. It solves the problem of insufficient IPv4 address space, providing a virtually unlimited number of addresses. Its 128-bit address length enhances security and network performance, and supports automatic configuration and plug-and-play.

[0039] MPLS (Multi-Protocol Label Switching) is a packet forwarding technology that adds fixed-length labels to network data streams, enabling fast and efficient routing and transmission. MPLS separates the decision-making process (IP address-based routing) from data forwarding, providing consistent quality of service across multiple protocols and supporting traffic engineering and virtual private network services.

[0040] BSID (Binding Segment ID): A special identifier in Segment Routing, used to bind a segment list to a specific network node or path, allowing for the abstract representation of multi-path topology at the network layer. As a globally unique identifier, BSID can be transmitted between boundary nodes, enabling efficient path switching and management, and simplifying path configuration and optimization for complex network structures in SRv6 environments.

[0041] An Autonomous System (AS) domain is a group of networks controlled by a single management authority. These networks communicate using the same internal routing protocols and appear as a unified routing entity to the outside world. AS domains are the basic building blocks of the Internet, and each AS has a unique AS number used for identification and routing decisions.

[0042] An IGP (Interior Gateway Protocol) domain refers to a network area within an autonomous system that uses the same type of IGP (such as OSPF or IS-IS) for route discovery and information exchange. Routers within an IGP domain share routing information through IGP protocols, enabling efficient forwarding of data packets within the domain.

[0043] BGP-LS (Border Gateway Protocol - Link State) is a network protocol extension that allows network devices (such as routers) to advertise their link-state information, including topology, interface status, and link attributes, to controllers or other devices via the BGP protocol. This information is used to build a global view of the network, supporting higher-level network control and optimization strategies, such as path calculation in Segment Routing.

[0044] SRv6 SID NLRI: This is a specific type in SRv6 (Segment Routing IPv6) used to represent IPv6 addresses and related Segment Routing information at the network layer. It allows SID information to be propagated via BGP (Border Gateway Protocol), enabling network devices to build and maintain SRv6 paths based on this information, achieving more flexible network traffic engineering.

[0045] Sub-TLV (Subtype Length Value): A field in a network protocol used to extend a specific TLV (Type Length Value) structure to carry more detailed configuration or status information.

[0046] In many scenarios, the topology of IP networks is constantly changing, such as emergency communication networks, low-altitude communication networks, and space-to-ground communication networks. These changes are actually regional; that is, within the overall network topology, some areas change frequently, some change periodically, and others remain largely unchanged. Current network technologies perform segmented routing calculations based on the network's topology and performance characteristics before overall processing and scheduling. This approach increases the difficulty and cost of network operation.

[0047] To address the problems existing in related technologies, embodiments of this application provide a path processing method for regional dynamic topology, which can be run in... Figure 1 The computer terminal shown is described below.

[0048] The path processing method for regional dynamic topology provided in this application can be executed on a mobile terminal, computer terminal, or similar computing device. Figure 1 A hardware block diagram of a computer terminal for implementing a path processing method for dynamic regional topology is shown. Figure 1 As shown, the computer terminal 10 may include one or more processors (shown as 102a, 102b, ..., 102n in the figure) (the processor may include, but is not limited to, a microprocessor MCU or a programmable logic device FPGA, etc.), a memory 104 for storing data, and a transmission module 106 for communication functions connected via wired and / or wireless networks. In addition, it may also include: a display, a keyboard, a cursor control device, an input / output interface (I / O interface), a universal serial bus (USB) port (which may be included as one of the ports of the I / O interface), a network interface, and a BUS bus. Those skilled in the art will understand that... Figure 1 The structure shown is for illustrative purposes only and does not limit the structure of the aforementioned electronic device. For example, computer terminal 10 may also include... Figure 1 The more or fewer components shown, or having the same Figure 1 The different configurations shown.

[0049] It should be noted that the aforementioned one or more processors and / or other data processing circuits are generally referred to herein as "data processing circuits". These data processing circuits may be embodied, in whole or in part, in software, hardware, firmware, or any other combination thereof. Furthermore, the data processing circuits may be a single, independent processing module, or may be integrated, in whole or in part, into any other element within the computer terminal 10. As involved in the embodiments of this application, the data processing circuits serve as a processor control mechanism (e.g., selection of a variable resistor termination path connected to an interface).

[0050] The memory 104 can be used to store software programs and modules of application software, such as the program instructions / data storage device corresponding to the path processing method of the regional dynamic topology in this embodiment of the application. The processor executes various functional applications and data processing by running the software programs and modules stored in the memory 104, thereby realizing the above-mentioned path processing method of the regional dynamic topology. The memory 104 may include high-speed random access memory, and may also include non-volatile memory, such as one or more magnetic storage devices, flash memory, or other non-volatile solid-state memory. In some instances, the memory 104 may further include memory remotely located relative to the processor, and these remote memories can be connected to the computer terminal 10 via a network. Examples of the above-mentioned networks include, but are not limited to, the Internet, corporate intranets, local area networks, mobile communication networks, and combinations thereof.

[0051] The transmission module 106 is used to receive or send data via a network. Specific examples of the network described above may include a wireless network provided by the communication provider of the computer terminal 10. In one example, the transmission module 106 includes a network interface controller (NIC), which can connect to other network devices via a base station to communicate with the Internet. In another example, the transmission module 106 may be a radio frequency (RF) module, used for wireless communication with the Internet.

[0052] The display can be, for example, a touchscreen liquid crystal display (LCD) that allows the user to interact with the user interface of the computer terminal 10.

[0053] It should be noted here that, in some optional embodiments, the above... Figure 1 The computer terminal shown may include hardware elements (including circuitry), software elements (including computer code stored on a computer-readable medium), or a combination of both hardware and software elements. It should be noted that... Figure 1 This is only one instance of a specific particular instance, and is intended to illustrate the types of components that may exist in the aforementioned computer terminal.

[0054] In the above operating environment, this application provides an embodiment of a path processing method for regional dynamic topology. It should be noted that the steps shown in the flowchart in the accompanying drawings can be executed in a computer system such as a set of computer-executable instructions. Also, although a logical order is shown in the flowchart, in some cases, the steps shown or described can be executed in a different order than that shown here.

[0055] Figure 2 This is a flowchart of a path processing method for a dynamic topology of a region according to an embodiment of this application, such as... Figure 2 As shown, the method includes the following steps:

[0056] Step S202: Obtain network topology information for all areas in the network, and obtain the path requirements for segmented routing;

[0057] Step S204: Determine the network forwarding path based on network topology information and path requirements;

[0058] Step S206: Optimize the sub-paths in the network forwarding path where the topology information has changed, and send the configuration information of the new segmented routing extension header SRH to the optimized sub-paths. Each area traversed by the network forwarding path corresponds to a sub-path.

[0059] Through steps S202 to S206, local path optimization can be achieved in segmented routing networks with changing topology information, while keeping most network paths unchanged. This reduces network-wide updates caused by local changes, making it particularly suitable for large, multi-regional networks. It reduces computational burden and control commands, lowering operating costs and equipment performance requirements. It achieves the goal of local updates and reduced configuration update latency, thereby reducing computational costs and operational complexity. Furthermore, it solves the technical problem of frequent recalculation and updates of IPv6 segmented routing paths due to frequent changes in network topology across different regions, increasing the difficulty and cost of network operation.

[0060] The following section explains each step of the path processing method for regional dynamic topology, using a specific implementation process as an example.

[0061] In the technical solution provided in step S202 above, the system can obtain network topology information of all areas in the network, as well as obtain path requirements for segmented routing. The segmented routing can be IPv6 segmented routing, i.e., SRv6. The network topology information includes detailed information of all nodes and links in the network, such as device identifier, device type, link interface status, link identifier, link status, connection relationship between nodes, network hierarchy, real-time bandwidth and performance indicators, etc.

[0062] In the technical solution provided in step S204 above, the system determines the network forwarding path based on network topology information and path requirements in the following way:

[0063] Step 1: Divide the network into multiple logical regions based on business requirements (such as bandwidth, latency, bit error rate, display path, etc.), geographical distribution, AS domain, IGP domain, and link characteristics.

[0064] Step 2: Within each region, assign a first identifier to the device to identify the node within the region. The first identifier can be represented as SID, for example. Assign a second identifier to the boundary nodes of the region to calculate cross-regional paths and connect the segment (routing segment) list of adjacent regions. The second identifier can be represented as BSID, for example.

[0065] The third step is to use the information from the source and destination nodes, combined with business and traffic requirements, to calculate the optimal solution and determine a network forwarding path.

[0066] In the technical solution provided in step S206 above, in a Segment Routing (especially SRv6) network, when a change in the topology information of a sub-path (e.g., a region or part of the network) in the network forwarding path is detected (e.g., link failure, bandwidth adjustment), the controller will initiate a local path optimization algorithm. This path optimization only targets the affected sub-path, not the entire network path, thus improving network adaptability and efficiency.

[0067] During the optimization process, the controller recalculates the optimal path for the affected sub-paths and generates a new SegmentRouting Header (SRH) containing the updated Segment List (a series of SIDs or BSIDs). The controller only sends the new SRH configuration information to those devices that need to update their paths (i.e., the starting points of the sub-paths).

[0068] The aforementioned partial update mechanism avoids unnecessary recalculation of unaffected areas, reduces overall network control plane traffic, and enhances network scalability, resilience, and performance. By dividing the network into multiple sub-paths (one for each region), the system can manage and optimize network resources more granularly, significantly reducing the operational costs associated with path updates in multi-region dynamic topology environments.

[0069] In the above-mentioned path processing method for dynamic topology in the region, before optimizing the sub-paths in the network forwarding path where the topology information changes, the method further includes: analyzing each region and node traversed by the network forwarding path, obtaining the network topology information of the target region, as well as the first identifier corresponding to the internal nodes of the target region and the second identifier corresponding to the boundary nodes of the target region, wherein the target region is any region traversed by the network forwarding path, the first identifier is valid within the target region, and the second identifier is valid globally; publishing the second identifier to the adjacent nodes of the boundary nodes, and using the second identifier to represent the IPv6 segment list in the adjacent regions of the target region.

[0070] In some embodiments of this application, the BSID (second identifier) ​​of the boundary node of the target area is published to the network nodes directly adjacent to that boundary node (i.e., the aforementioned neighboring nodes). In this way, the BSID not only becomes the identity identifier of the boundary node of the target area, but also maps to the SRv6 Segment List within the adjacent areas of the target area, which is a series of IPv6 address ranges used for path guidance. When a topology change is detected in any area, the system can accurately locate the changed area, recalculate the optimal path based on the new topology information, and update the corresponding SID and BSID configurations, thereby better performing path optimization.

[0071] Specifically, in a network forwarding path, changes in sub-path topology information may occur within or between regions. For an established end-to-end network forwarding path, the system monitors whether the topology information in the path has changed, and performs path optimization on sub-paths in the network forwarding path where the topology information has changed. This includes: if the topology information has not changed within a region, no intra-regional path optimization is triggered; if the topology information has changed within a region, intra-regional path optimization is triggered on the sub-paths where the topology information has changed; and if the topology information has changed between regions, end-to-end path re-optimization is triggered.

[0072] In some embodiments of this application, when network topology information changes within a specific area (e.g., link status, bandwidth adjustment, or node failure), the system will only perform local path optimization on the affected sub-paths within that area. That is, only the forwarding paths in that area need to be recalculated and updated, without affecting the path configurations in other areas. This minimizes the scope of path recalculation, reduces the burden on the network control plane, and improves response speed and efficiency.

[0073] Conversely, if changes to network topology information involve connections between different areas (i.e., area boundaries or cross-area links), the system will trigger end-to-end path re-optimization. Since the link status between areas directly affects the overall path reachability and performance, a comprehensive path reassessment and configuration update is required to ensure that the quality of network services is not affected.

[0074] When the system detects that the network topology information has not changed within a certain area, it will not trigger any path optimization operations for that area. This avoids unnecessary path recalculation, saves computing resources, reduces the need for network device configuration changes, and thus lowers operation and maintenance costs and the risk of potential network outages.

[0075] Therefore, in modern network environments with multi-regional dynamic topology, the above strategies can intelligently distinguish the impact range of network changes and take corresponding level of path optimization measures, which not only ensures the efficient operation of the network, but also reflects consideration for the rational use of resources and ease of operation and maintenance.

[0076] In step S206 of the above-mentioned path processing method for dynamic topology in the region, path optimization is performed on the sub-paths in the network forwarding path where the topology information has changed. This includes: obtaining the first segment list and the second segment list corresponding to the target sub-path in the network forwarding path before and after the topology information change, respectively, wherein the target sub-path is any sub-path in the network forwarding path where the topology information has changed; comparing the first segment list and the second segment list to obtain a comparison result; if the comparison result indicates that the first segment list and the second segment list are inconsistent, obtaining the target segment list sent by the controller to the target sub-path, and sending the target segment list to the source node of the target sub-path.

[0077] In some embodiments of this application, when a change in the topology information of a target sub-path in the network is detected (such as link state updates, node capability adjustments, etc.), two sets of Segment Lists for the target sub-path before and after the topology information change can be extracted from the controller: a first segment list (based on the topology information before the change) and a second segment list (based on the topology information after the change). By comparing the first segment list and the second segment list, a comparison result is obtained to determine whether the target sub-path needs to be optimized. If the first segment list and the second segment list are inconsistent, the controller generates a target segment list for the target sub-path, i.e., an optimized path component suitable for the new topology, and directly transmits this optimized target segment list to the source node of the target sub-path, thereby updating the forwarding rules according to the target segment list to reflect the new topology state.

[0078] The network forwarding path described above can be viewed as being composed of multiple sub-paths connected together. Each sub-path corresponds to a segment list and a second identifier. The segment list is an ordered sequence of first identifiers, used to represent the list of nodes that the packet passes through in each sub-path. Based on the segment list and second identifier corresponding to each sub-path in the network forwarding path, the end-to-end segment list of the network forwarding path is determined.

[0079] In some embodiments of this application, the network forwarding path is a holistic path composed of multiple sub-paths. In a segment routing (e.g., SRv6) network, each sub-path has a unique segment list and a globally valid second identifier (i.e., BSID, Binding Segment ID). The segment list is an ordered sequence of first identifiers (e.g., SID, Segment ID) used to describe the order in which a packet traverses each sub-path. The first identifier (SID) is valid within the local area of ​​the sub-path and is used to guide the hop-by-hop forwarding of packets within the sub-path. The second identifier (BSID) is used to connect different sub-paths, serving as the entry point for sub-path boundary nodes and pointing to the segment list of the next sub-path. The BSID is globally unique, enabling packets to seamlessly transition from the end of the current sub-path to the beginning of the next sub-path when traversing different sub-paths (or areas).

[0080] Therefore, determining the end-to-end segment list for network forwarding paths involves integrating the segment lists of all sub-paths and their corresponding BSIDs. This process starts from the source node and proceeds sequentially along the expected transmission direction of the packet, concatenating the segment lists of each sub-path and inserting the corresponding BSID at the end of each sub-path until the destination node is reached. The resulting end-to-end segment list not only contains all locally valid SID sequences but also binds these sequences together using BSIDs, forming a complete path guide spanning the entire network. This method significantly improves the efficiency of constructing and maintaining SRv6 paths in large, multi-area networks, while also enhancing path flexibility and network response speed.

[0081] In the above-mentioned path processing method for dynamic topology in the region, the method further includes: after optimizing the sub-paths in the network forwarding path where the topology information has changed, updating the end-to-end segment list of the network forwarding path to obtain the updated end-to-end segment list; and sending the updated end-to-end segment list to the head node of the network forwarding path.

[0082] In some embodiments of this application, the end-to-end segment list of the network forwarding path is reconstructed based on the optimized sub-path information. The updated end-to-end segment list is then sent to the head node of the network forwarding path (i.e., the first node in the path into which the packet enters). Upon receiving the update, the head node uses the new segment list to encapsulate the packet, ensuring that the packet can be efficiently forwarded along the optimized path until it reaches its destination.

[0083] In the above-mentioned path processing method for dynamic topology in the region, the method further includes: forwarding the packets for IPv6 segmented routing to network element devices in the network with configuration information, wherein the network element device receives a first update identifier issued by the controller, the first update identifier includes the update identifier of the starting boundary node, the update identifier of the ending boundary node, and the update identifier between the starting boundary node and the ending boundary node, and replaces the first identifier list of the original SRH in the network element device according to the first update identifier.

[0084] In some embodiments of this application, the controller sends a first update identifier to network elements in the network. This first update identifier includes the update identifier of the starting boundary node, the update identifier of the ending boundary node, and a series of update identifiers between these two boundary nodes. The first update identifier is used to notify the network elements that their SRH (Segment Routing Header) first identifier list (i.e., SID list) needs to be updated to reflect the latest network topology and path configuration. Upon receiving the first update identifier, the network element replaces the original SID list in its locally stored SRH based on this identifier information. This ensures that the network element can correctly identify the packet forwarding path and direct the packet to the correct next-hop node according to the updated SID list until the packet reaches its destination.

[0085] The path processing method for regional dynamic topology provided in this application embodiment is based on the controller processing SRv6 forwarding paths of multi-region dynamic topology. Specifically, through a system solution of IPSDN controller and network forwarding devices, it optimizes IP network deployment and operation, improves network system efficiency, and reduces network forwarding risks. Specifically, the controller performs multi-region division and dynamic processing of the network topology, and handles path calculation and management for multi-region topology based on SRv6 BSIDs. Based on the calculation of SRv6 forwarding paths in the dynamic topology network, the controller calculates the corresponding Segment List ID or BSID according to the network element attributes traversed by each path. According to the calculation and analysis results, the controller distributes the BSID or Segment List of the starting point of each segment of the same domain path as needed, forming a complete end-to-end SRv6 forwarding path. This achieves simplified distribution and deployment of end-to-end SRv6 paths, reduces the amount of forwarding path distribution, and improves the forwarding stability of end-to-end paths.

[0086] The following combination Figure 3 The above process will be explained. Figure 3 This is a system flowchart of a path processing method for a dynamic topology of a region according to an embodiment of this application, as shown below. Figure 3As shown, it includes a controller and a forwarding network. The controller is mainly used to implement the following functions: network element topology management, forwarding path calculation, forwarding SRH generation, and network acquisition and control. The forwarding network includes network elements in different areas, such as network elements in area A, area B, and area C. Among them, network elements in area A include SRH1 and SRH2, network elements in area B include SRH3 and SRH4, and network elements in area C include SRH5 and SRH6.

[0087] Specifically, topology management includes: centralized management of the topology of multiple areas of the entire network by the controller, and the division of areas, including the division of AS (Autonomous System) domains, the division of devices with different location relationships, the division of devices with different link media, or the division based on the SRv6 protocol capabilities supported by the devices, etc.

[0088] Within the complete network topology, the network is divided into regions based on the characteristics of each area. Factors considered may include different AS domains, different IGP domains, satellite communication constellations, high-altitude platform communication platforms, and virtual network node domains dynamically activated according to planning or service requirements. Within each region, the logical topology connections are relatively fixed, the transmission path bandwidth performance between nodes within the region is relatively stable, or changes according to the same pattern, and the transmission path medium characteristics are essentially consistent.

[0089] The controller first manages and allocates SIDs and BSIDs across the entire network in a unified manner. The specific steps are as follows:

[0090] (1) For devices within the same area, a locally valid SID is uniformly assigned according to the same algorithm.

[0091] (2) For the boundary nodes of the region, assign a globally valid BSID and publish it to the adjacent nodes corresponding to the boundary nodes.

[0092] (3) For example, device A in region 1 is an adjacent connected node with device B in adjacent region 2. The BSID published by B to A is the BSID used from A to B. This BSID is used to identify the SRv6 Segment List in region 2 starting from device B.

[0093] (4) The controller can also distribute the SID information of edge nodes by extending the SRv6 SID NLRI information of BGP-LS. The S-SID of the starting edge node or the E-SID of the ending edge node of a region can be extended in the Sub-TLV. For example, the extended SRv6 SID NLRI information may include: Type=1163 (SRv6 SID NLRI), length (2 bytes), endpoint behavior (2 bytes), Flags (1 byte), algorithm (1 byte), reservation (1 byte), SID (16 bytes), Sub-TLV (variable length).

[0094] The Sub-TLV following the SID (16 bytes) can be expanded to the start or end flags corresponding to the SID, to indicate the start and end of the region boundary respectively.

[0095] (5) The controller can also identify the SID of an edge node (to be replaced) by extending the Segment type. Two types can be extended: the starting edge node END.ST and the ending edge node END.EN for a region. The Segment type defines how to handle a specific SID (Segment ID) in Segment Routing. It instructs the forwarding device on how to resolve and act on the SID, such as handling the local SID, path termination, path forwarding, etc. Extended Segment types enhance the flexibility of SRv6, supporting more complex network operations and optimizations.

[0096] Network data acquisition and control includes: using network protocols to collect network topology, traffic, performance and status information, and collecting SRv6 path (Segment List ID, BSID) information; issuing SRv6 path configurations to the controller based on centralized calculations and obtaining configuration result information.

[0097] 1) For all network devices and interfaces, the controller uses network protocols (such as BGP, IGP, LLDP, SNMP, etc.) to collect network topology information and status information.

[0098] 2) For all interfaces and links in the network and SRv6, the controller collects network traffic and performance data according to network protocols (such as Telemetry, TWAMP, OAM, etc.).

[0099] 3) For the entire network of SRv6, the controller obtains the path information and status details of SRv6 according to the network protocol (such as BGP-LS, BFD, etc.).

[0100] 4) For all network devices, the controller distributes the corresponding device configurations, as well as SRv6 path configurations and information, through network protocols (such as Netconf / Yang, CLI, BGP, PCEP, etc.).

[0101] Forwarding path calculation includes: the controller calculates the network forwarding path based on the dynamic topology information of the entire network and the SRv6 Policy information. Based on the calculated SRv6 path, it analyzes the area segments traversed on the forwarding path, the start and end points of each forwarding path segment, and the SID and BSID of each path segment.

[0102] 1) For the initial routing calculation of a newly created SRv6 path, the controller calculates the optimal solution for the end-to-end SRv6 path based on the end-to-end network information of the source and destination nodes, as well as the service requirements of the SRv6 Policy (such as bandwidth, latency, bit error rate, display path, and other attributes). The calculated complete SRv6 path from the source node to the destination node is each logical path in the Candidate Path of the end-to-end SRv6 Policy. The path is a queue of each node and node port. ;

[0103] 2) For an established SRv6 network, a segmented optimization algorithm can be used for path calculation. This involves determining if information within each region of the network has changed. If not, the path information for that region does not need to be recalculated. However, for regions where network topology information (including topology connections, bandwidth, performance, etc.) has changed, path optimization calculations are performed within those regions. After the calculations are complete, the queue information of the logical path in the Candidate Path can be updated. ;

[0104] 3) If the topology information between regions changes, the end-to-end path of the SRv6 path will be recalculated for optimization. After the calculation is completed, the queue information of the logical path of the Candidate Path will be updated. .

[0105] The forwarding SRH generation includes: the controller centrally generates the SRH configuration for each SRv6 forwarding path based on the calculation and analysis results of the forwarding path, and distributes it to the corresponding forwarding devices as needed based on whether the SRH information of each path has changed.

[0106] 1) For each logical forwarding path in each region, divide it into corresponding forwarding paths. For each segmented path Each network element on the network, from the source node to the destination node (or sink node), uses the SRv6 SID assigned by the node device to form a forwarding path. Segment List;

[0107] 2) For nodes that cross regions, the Segment List supported by the device's own SRv6 version will no longer be used. Instead, the corresponding BSID assigned by the controller will be used to map the corresponding Segment List.

[0108] 3) For end-to-end paths, use each segment The Segment List and its corresponding BSID form an end-to-end connection. The Segment List, marked as ;

[0109] 4) The logical path of the controller to the SRv6 Policy's Candidate Path, i.e., end-to-end. The SegmentList is analyzed and compared. When only some regions / segments have changed SRH information, the controller only needs to send the relevant region's information. The Segment List is mapped to the source node of the corresponding regional segment path without the need for end-to-end routing. SegmentList;

[0110] 5) When only some areas and the boundary nodes of those areas change, the controller only needs to issue the relevant area's change order. The Segment List is mapped to the source node of the corresponding region segment path, and the updated end-to-end path is distributed. To the head node of SRv6Policy, without end-to-end connection. All Segment Lists will be redistributed.

[0111] 6) SRv6 path information, i.e., end-to-end, is only available when all required paths have changed, or when an existing path is broken, deleted, and then rebuilt. Only the Segment List needs to be completely redistributed;

[0112] 7) When using extended BGP-LS SRv6 SID NLRI information, or extending the Segment type to identify the SID of edge nodes, only the SID of the edge node and the new SID value between the two edge nodes need to be sent. The information sent in this case is essentially the same as sending information about the relevant region via BSID. The Segment List is mapped to the source node of the corresponding regional segment path without the need for end-to-end routing. The approach is the same as that for the Segment List.

[0113] exist Figure 3 In this process, network elements in the forwarding network receive SRv6 forwarding path configuration information from the controller and forward SRv6 packets at the start and end points of each path according to the configuration. This includes converting the corresponding BSID into a Segment List for the forwarding path at the start of each segment.

[0114] When using the extended BGP-LS SRv6 SID NLRI information, when the repeater receives the SID of the edge node and the new SID value between the two edge nodes, it replaces the original SRH SID List from the starting edge node S-SID to the ending edge node E-SID with the newly issued SID List to obtain a complete new SID List, thereby enabling the forwarding of the new SRv6 path.

[0115] When the SID of an edge node is identified using the extended Segment type, when the repeater receives the SID of the edge node and the new SID value between the two edge nodes, it replaces the original SRH SID List from the starting edge node END.ST to the ending edge node END.EN with the newly issued SID List to obtain a complete new SID List, thereby enabling the forwarding of the new SRv6 path.

[0116] Figure 4 This is a flowchart of an SRv6 multi-region dynamic topology path processing according to an embodiment of this application, such as... Figure 4 As shown, the specific steps include: acquiring network topology information for the entire network and dividing it into regions according to rules and manual methods; based on the multi-region division of the network, the controller uniformly allocates management BSIDs for each region boundary; calculating the end-to-end path of SRv6 based on the path requirements for SRv6; organizing the segment list for each segment based on the end-to-end SRv6 forwarding segment path information; distributing the information to the corresponding nodes as needed based on the changes in the end-to-end BSID and the segment list for each path; and forwarding devices forwarding packets based on the corresponding SRv6 SRH information.

[0117] The steps of organizing the Segment List for each segment based on the end-to-end SRv6 forwarding segment path information specifically include: sequentially obtaining the Segment List corresponding to each path segment and comparing whether there are any changes; obtaining the BSID of the boundary node of this path segment and determining whether the start and end points of the path have changed; when the BSID of the boundary node has changed, updating the end-to-end path information composed of the BSIDs.

[0118] Figure 5 This is a schematic diagram of a multi-area networking forwarding network according to an embodiment of this application. The following is in conjunction with... Figure 5 To explain, in Figure 5 In the forwarding network shown, the network is divided into three regions: A, B, and C. The connection and transmission characteristics (bandwidth, latency, etc.) of the inter-domain links between regions A and B are variable. The connection and transmission characteristics of the inter-domain links between regions B and C are variable. The connection and transmission characteristics of the links between nodes within region B, such as P21-P24 and P24-P22, are variable.

[0119] Customer service requests traffic from PE1 to PE2, meaning that within the corresponding network path, there is... Figure 5 The network path shown, PE1-P11-P21-P22-P31-PE2, needs to pass through network devices (i.e., network repeaters) in three areas. Repeaters PE1 and P11 belong to area A, repeaters P21 and P22 belong to area B, and repeaters P31 and PE2 belong to area C.

[0120] The controller will then calculate the forwarding path of the SRv6 Policy candidate path based on the network topology information, performance data, traffic information, status information, and the service requirements for path, performance, bandwidth, etc., such as path: PE1-P11-P21-P22-P31-PE2.

[0121] Using the scheme of this application embodiment, the controller will analyze and calculate the SRv6 SRH protocol support of the end-to-end path devices, and analyze the SID values ​​locally supported by all nodes from the source node PE1 to the destination node PE2, as well as the BSIDs of P11 to P21 across regions and P22 to P31 across regions.

[0122] For the SRH of a path of consecutive repeaters within each region, a segment list is used for encapsulation. For path nodes that cross regions, the global BSID assigned by the controller is used directly for encapsulation.

[0123] Figure 6 This is a schematic diagram of SID and BSID allocation on the PE1-PE2 path according to an embodiment of this application, as shown below. Figure 6 As shown, the SID values ​​supported by this device for the nodes in the path PE1-P11-P21-P22-P31-PE2 are SID1, SID2, SID3, SID4, SID5, and SID6, respectively. The BSID from P11 to P21 is BSID1, and the BSID from P22 to P31 is BSID2.

[0124] Then, in region A, the path information encapsulated by SRv6 at the head node PE1 is SID2, BSID1, and BSID2; the information is as follows: Figure 7 As shown. At this time, Segment Left=2, and forwarding is performed using SID2, which can be handled by the PE1 node.

[0125] At the boundary node P21 of region B, after receiving BSID1, the device performs SRH replacement processing on BSID1, that is, it replaces BSID1 with the processing of the segment list of this region supported by SRv6 by repeater P21. After the replacement, the path information encapsulated by SRH on repeater P21 is: SID4, BSID2; the information is as follows. Figure 8 As shown. At this time, Segment Left=1, and forwarding is performed using SID4, which can be handled by node P21.

[0126] At the boundary node P31 in region C, after receiving BSID2, the device performs SRH replacement processing on BSID2, that is, it replaces BSID2 with the segment list processing of this region supported by SRv6 by repeater P31. After replacement, the path information encapsulated by SRH on repeater P31 is: SID6; the information is as follows. Figure 9 As shown. At this time, Segment Left=0, and forwarding is performed using SID6, which can be handled by node P31.

[0127] Therefore, each node on the end-to-end SRv6 path will forward packets according to the Segment Left of the packet forwarding of each conversion node calculated and allocated by the controller, and according to the SID forwarding behavior supported by this node.

[0128] Each connection forwarding repeater within a region is considered a forwarding segment, such as PE1-P11, P21-P22, and P31-PE2. Except for the head node, other forwarding segments are identified using a network-wide unified BSID assigned by the controller.

[0129] After the controller calculates and organizes the Segment List for each conversion node and the BSID-related configurations for devices across regions, it sends Segment List entries to each conversion node device as needed (source node PE1, cross-region boundary nodes P21 and P31) through the network control protocol.

[0130] After obtaining this organized Segment List information, the forwarding device can forward local SRv6 packets according to the corresponding Segment List and the corresponding BSID.

[0131] When the network topology changes, such as the direct link between P21 and P22 being interrupted, congested, or experiencing latency exceeding limits, it is equivalent to a dynamic change in the network topology of region B. The diagram showing the SID and BSID after a P21-P22 path failure is as follows: Figure 10 As shown. At this point, the controller can perform path calculation based on the latest network topology. The calculated optimal path becomes: PE1-P11-P21-P24-P22-P31-PE2, with the corresponding SID as follows: Figure 11 As shown.

[0132] In this SRv6 candidate path forwarding path, the actual paths between areas A and C remain unchanged; only the path between area B changes. According to the scheme of this embodiment, there is no need to update the end-to-end Segment List forwarding information. Instead, the latest path information for area B is sent to the receiving P21. After configuring the latest Segment List path on P21, the forwarding resolution for BSID1 changes from the original SID4, BSID2 to the latest forwarding path information SID24, SID22, BSID2. At this time, the corresponding Segment Left on P21 is 2, which can support end-to-end SRv6 packet forwarding from PE1 to PE2.

[0133] For more complex network scenarios, there is no fundamental difference. For example, if there are multiple paths from P11 to area B, such as P11-P21 and P11-P23, and the link topology of P11-P21 changes, according to the method of this application embodiment, the forwarding path Segment List of the forwarding segment in area A and the forwarding segment in area B is calculated and sent to nodes PE1 and P23. As long as the end-to-end forwarding path is still forwarded from P22 to P31, the path in area C does not need to be sent or changed.

[0134] The solution in this application embodiment can minimize end-to-end path updates, requiring only the updating of the changed path segment. For multi-region dynamic topology networks, when some regions are changing in real time, the amount of data issued and updated for the entire network's SRv6 Policy Segment List will be greatly reduced under the controller's processing.

[0135] When using extended BGP-LS SRv6 SID NLRI information or an extended Segment type to identify the SID of edge nodes, the computational processing capabilities of the source node of the repeater are required. In this case, the source node receives the SID List of the changed region from the controller and needs to analyze and calculate the new path based on the original path.

[0136] As in the example above, the initial SRv6 path is PE1-P11-P21-P22-P31-PE2 nodes, corresponding to the SID values ​​supported by this device: SID1, SID2, SID3, SID4, SID5, SID6. After the path in area B changes, the controller only needs to send SID3(S-SID), SID24, SID4(E-SID), or SID3(END.ST), SID24, SID4(END.EN). Upon receiving the SID List of the changed segment from the controller, the head node PE1 analyzes and calculates, replacing the original SID3-SID4 segment with SID3(S-SID), SID24, SID4(E-SID), or SID3(END.ST), SID24, SID4(END.EN), to obtain the latest forwarding path SID1, SID2, SID3, SID24, SID4, SID5, SID6. Replacement of the corresponding SID List, such as Figure 12 As shown.

[0137] For multiple Candidate Paths in SRv6 Policy, the controller can also support path calculation and deployment for all Candidate Paths according to the scheme in the embodiments of this application. In this case, there is no special processing for the path calculation of the Candidate Path, but it is equivalent to multiple Segment Lists, and each Segment List can support path forwarding across multiple regional devices.

[0138] Since the embodiments of this application provide an end-to-end intensive deployment of SRv6 policy to support the full path calculation, distribution, and forwarding of SRv6 across multiple dynamic topologies, the system of this application can better deploy SRv6 forwarding paths throughout the entire lifecycle. This makes it easier to support the deployability of the SRv6 protocol, reduces the performance requirements for path updates at boundary nodes due to network topology changes, lowers network operation and maintenance costs, and promotes network evolution based on the SRv6 protocol.

[0139] The path processing method for regional dynamic topology provided in this application embodiment includes: the controller centrally processing multi-region topology to obtain segmented SRv6 SRHs, improving the deployment flexibility of SRv6; the controller separately distributing SRHs for each segment in multiple regions, improving the path update efficiency of SRv6; the controller concatenating SRv6 segmented paths based on BSIDs, improving end-to-end forwarding efficiency; and the controller and forwarder supporting independent distribution of segmented SRHs based on extended BGP-LS packets or new segment types, with the forwarder using extended segment replacement to improve SRv6 path update efficiency. The advantages are as follows: 1. By centrally calculating and analyzing data through the controller, an end-to-end SRv6 forwarding path composed of segmented SRv6 paths is obtained, maintaining the advantages of centralized SDN processing; 2. For multi-region topologies, the SRH of segmented paths is obtained based on controller calculation, and each path segment can be distributed independently, thereby increasing the flexibility and efficiency of path updates; 3. Forwarding based on SRv6 segmented SRHs makes the end-to-end forwarding efficiency of SRv6 policies higher than existing technologies; 4. By using BSID concatenation to handle segmented SRv6 forwarding, the flexibility of SRv6 deployment is improved; 5. The deployment capability of multi-region dynamic topology networks is improved, reducing the deployment cost of network forwarding paths; the flexibility of SRv6 end-to-end full path deployment is improved, reducing network operating costs; the end-to-end forwarding efficiency of SRv6 is improved, reducing network forwarding load; and the automated and flexible deployment of networks is promoted, thus promoting the evolution of SDN network systems.

[0140] Figure 13 This is a schematic diagram of a path processing device for a dynamic topology of a region according to an embodiment of this application. The path processing device for a dynamic topology of a region includes at least: an acquisition module 51, a determination module 52, and an optimization module 53, wherein:

[0141] The acquisition module is used to acquire network topology information for all areas in the network, as well as the path requirements for segmented routing.

[0142] The determination module is used to determine the network forwarding path based on network topology information and path requirements;

[0143] The optimization module is used to optimize the sub-paths in the network forwarding path where the topology information changes, and to send the configuration information of the new segmented routing extension header (SRH) to the optimized sub-paths. Each area traversed by the network forwarding path corresponds to a sub-path.

[0144] By using the acquisition module, determination module, and optimization module in the path processing device for the aforementioned regional dynamic topology, the goal of local updates and reduced configuration update latency is achieved. This results in reduced computational costs and lower operational complexity, thereby solving the technical problem of frequent recalculation and updates of IPv6 segmented routing paths caused by frequent changes in network topology in different regions, which increases the difficulty and cost of network operation.

[0145] In the optimization module of the path processing device for the aforementioned regional dynamic topology, the optimization module is also used to obtain network topology information of the target area, as well as a first identifier corresponding to the internal nodes of the target area and a second identifier corresponding to the boundary nodes of the target area. The target area is any area traversed by the network forwarding path. The first identifier is valid within the target area, and the second identifier is valid globally. The second identifier is published to the adjacent nodes of the boundary nodes, and the second identifier represents the IPv6 segmentation list in the adjacent areas of the target area.

[0146] In the optimization module of the aforementioned path processing device for dynamic topology in the region, the optimization module is also used to trigger intra-regional path optimization for sub-paths where the topology information changes within the region; not to trigger intra-regional path optimization when the topology information does not change within the region; and to trigger end-to-end path re-optimization when the topology information changes between regions.

[0147] In the optimization module of the path processing device for the dynamic topology of the aforementioned region, the optimization module is further used to obtain the first segment list and the second segment list corresponding to the target sub-path in the network forwarding path before and after the topology information change, respectively, wherein the target sub-path is any sub-path in the network forwarding path whose topology information has changed; compare the first segment list and the second segment list to obtain a comparison result; if the comparison result indicates that the first segment list and the second segment list are inconsistent, obtain the target segment list sent by the controller to the target sub-path, and send the target segment list to the source node of the target sub-path.

[0148] In the above-mentioned path processing device for dynamic topology of the region, the network forwarding path consists of multiple sub-paths, each sub-path having a segment list and a second identifier. The above-mentioned path processing device for dynamic topology of the region also includes a processing module 54, which is used to determine the end-to-end segment list of the network forwarding path based on the segment list and the second identifier corresponding to each sub-path in the network forwarding path. The segment list is an ordered sequence of first identifiers used to represent the list of nodes that the packet passes through in each sub-path.

[0149] In the processing module of the path processing device for the dynamic topology of the aforementioned region, the processing module is further used to update the end-to-end segment list of the network forwarding path after optimizing the sub-paths in the network forwarding path where the topology information has changed, to obtain the updated end-to-end segment list; and to send the updated end-to-end segment list to the head node of the network forwarding path.

[0150] In the processing module of the path processing device for the above-mentioned dynamic topology in the region, the processing module is also used to forward the packets for IPv6 segmented routing to network element devices in the network, wherein the network element device receives the first update identifier issued by the controller, the first update identifier includes the update identifier of the starting boundary node, the update identifier of the ending boundary node, and the update identifier between the starting boundary node and the ending boundary node, and replaces the first identifier list of the original SRH in the network element device according to the first update identifier.

[0151] It should be noted that the path processing device for the aforementioned regional dynamic topology is used to execute... Figure 2 The path processing method for the dynamic topology of the region shown above is also applicable to the path processing device for the dynamic topology of the region, and will not be repeated here.

[0152] This application also provides an electronic device, which includes a memory and a processor. The memory stores program instructions, and the processor is connected to the memory to execute program instructions that perform the following functions: obtaining network topology information of all areas in the network and obtaining path requirements for segmented routing; determining network forwarding paths based on network topology information and path requirements; optimizing sub-paths in the network forwarding path where topology information changes, and issuing new SRH configuration information to the optimized sub-paths, wherein each area traversed by the network forwarding path corresponds to a sub-path.

[0153] It should be noted that the aforementioned electronic equipment is used to perform Figure 2 The path processing method for the dynamic topology of the region shown above also applies to this electronic device, and will not be repeated here.

[0154] This application embodiment also provides a non-volatile storage medium, which includes a stored computer program. The device containing the non-volatile storage medium executes the following path processing method for dynamic regional topology by running the computer program: obtaining network topology information for all regions in the network and obtaining path requirements for segmented routes; determining network forwarding paths based on the network topology information and path requirements; optimizing sub-paths in the network forwarding path where topology information changes, and issuing new Segmented Route Extension Header (SRH) configuration information to the optimized sub-paths, wherein each region traversed by the network forwarding path corresponds to one sub-path.

[0155] This application also provides a computer program product, including computer instructions that, when executed by a processor, implement the steps of the path processing method for regional dynamic topology in various embodiments of this application.

[0156] This application also provides a computer program that, when executed by a processor, implements the steps of the path processing method for regional dynamic topology in various embodiments of this application.

[0157] The sequence numbers of the embodiments in this application are for descriptive purposes only and do not represent the superiority or inferiority of the embodiments.

[0158] In the above embodiments of this application, the descriptions of each embodiment have different focuses. For parts not described in detail in a certain embodiment, please refer to the relevant descriptions of other embodiments.

[0159] In the several embodiments provided in this application, it should be understood that the disclosed technical content can be implemented in other ways. The device embodiments described above are merely illustrative; for example, the division of units can be a logical functional division, and in actual implementation, there may be other division methods. For instance, multiple units or components may be combined or integrated into another system, or some features may be ignored or not executed. Furthermore, the displayed or discussed mutual coupling, direct coupling, or communication connection may be through some interfaces; the indirect coupling or communication connection between units or modules may be electrical or other forms.

[0160] The units described as separate components may or may not be physically separate. The components shown as units may or may not be physical units; that is, they may be located in one place or distributed across multiple units. Some or all of the units can be selected to achieve the purpose of this embodiment according to actual needs.

[0161] Furthermore, the functional units in the various embodiments of this application can be integrated into one processing unit, or each unit can exist physically separately, or two or more units can be integrated into one unit. The integrated unit can be implemented in hardware or as a software functional unit.

[0162] If the integrated unit is implemented as a software functional unit and sold or used as an independent product, it can be stored in a computer-readable storage medium. Based on this understanding, the technical solution of this application, in essence, or the part that contributes to the prior art, or all or part of the technical solution, can be embodied in the form of a software product. This computer software product is stored in a storage medium and includes several instructions to cause a computer device (which may be a personal computer, server, or network device, etc.) to execute all or part of the steps of the methods described in the various embodiments of this application. The aforementioned storage medium includes various media capable of storing program code, such as a USB flash drive, read-only memory (ROM), random access memory (RAM), portable hard drive, magnetic disk, or optical disk.

[0163] The above description is only a preferred embodiment of this application. It should be noted that for those skilled in the art, several improvements and modifications can be made without departing from the principle of this application, and these improvements and modifications should also be considered within the scope of protection of this application.

Claims

1. A method for path processing in a dynamic topology of areas, characterized by, The method comprises the following steps: obtaining network topology information of all areas in a network, and obtaining path requirements of segment routing; determining a network forwarding path according to the network topology information and the path requirements; performing path optimization on a sub-path of the network forwarding path in which topology information changes, and issuing new configuration information of a segment routing header (SRH) to the sub-path in which path optimization is performed, wherein each area passed through by the network forwarding path corresponds to a sub-path.

2. The method of claim 1, wherein, Before performing path optimization on the sub-path of the network forwarding path in which topology information changes, the method further comprises the following steps: obtaining network topology information of a target area, and a first identifier corresponding to an internal node of the target area and a second identifier corresponding to a boundary node of the target area, wherein the target area is any area passed through by the network forwarding path, the first identifier is valid in the target area, and the second identifier is valid globally; publishing the second identifier to adjacent nodes of the boundary node, and representing a segment list of IPv6 in an adjacent area of the target area through the second identifier.

3. The method of claim 1, wherein, The method further comprises the following steps: when topology information changes within an area, triggering intra-area path optimization on a sub-path in which topology information changes; when topology information does not change within an area, not triggering intra-area path optimization; when topology information changes between areas, triggering end-to-end path re-optimization.

4. The method of claim 2, wherein, The path optimization on the sub-path of the network forwarding path in which topology information changes comprises the following steps: obtaining a first segment list and a second segment list corresponding to a target sub-path in the network forwarding path before and after topology information changes, wherein the target sub-path is any sub-path in which topology information changes in the network forwarding path; comparing the first segment list and the second segment list to obtain a comparison result; in a case where the comparison result indicates that the first segment list and the second segment list are inconsistent, obtaining a target segment list issued by a controller to the target sub-path, and sending the target segment list to a source node of the target sub-path.

5. The method of claim 1, wherein, The network forwarding path is composed of a plurality of sub-paths, each sub-path corresponds to a segment list and a second identifier, and an end-to-end segment list of the network forwarding path is determined according to the segment list and the second identifier corresponding to each sub-path in the network forwarding path, wherein the segment list is an ordered first identifier sequence and is used to represent a node list passed through by a packet in each sub-path.

6. The method of claim 5, wherein, The method further comprises the following steps: after the path optimization on the sub-path of the network forwarding path in which topology information changes, updating an end-to-end segment list of the network forwarding path to obtain an updated end-to-end segment list; issuing the updated end-to-end segment list to a head node of the network forwarding path.

7. The method of claim 1, wherein, The method further comprises the following steps: The configuration information is sent to a network element device in the network for packet forwarding of IPv6 segment routing, wherein the network element device receives a first update identifier issued by a controller, the first update identifier includes an update identifier of a starting boundary node, an update identifier of a terminating boundary node, and update identifiers between the starting boundary node and the terminating boundary node, and a first identifier list of an original SRH in the network element device is replaced according to the first update identifier.

8. A path processing device for a zone dynamic topology, characterized by Comprise: An acquisition module is configured to acquire network topology information of all regions in a network and acquire path requirements of segment routing; A determination module is configured to determine a network forwarding path according to the network topology information and the path requirements; An optimization module is configured to perform path optimization on a sub-path in the network forwarding path in which topology information changes and issue configuration information of a new segment routing header (SRH) to the sub-path in which path optimization is performed, wherein each region passed through by the network forwarding path corresponds to a sub-path.

9. An electronic device, comprising: Comprise: A memory is configured to store program instructions; A processor connected with the memory is configured to execute the program instructions to implement the following functions: acquiring network topology information of all regions in a network and acquiring path requirements of segment routing; determining a network forwarding path according to the network topology information and the path requirements; performing path optimization on a sub-path in the network forwarding path in which topology information changes and issuing configuration information of a new segment routing header (SRH) to the sub-path in which path optimization is performed, wherein each region passed through by the network forwarding path corresponds to a sub-path.

10. A non-volatile storage medium, comprising: The non-volatile storage medium comprises a stored computer program, wherein a device in which the non-volatile storage medium is located performs the path processing method of the dynamic topology of the region according to any one of claims 1 to 7 by running the computer program.

11. A computer program product comprising computer instructions, characterized in that, The computer instructions are executed by the processor to implement the path processing method of the dynamic topology of the region according to any one of claims 1 to 7.

Images