WO2024001633A1

WO2024001633A1 - Network management method and device, network element, and computer readable storage medium

Info

Publication number: WO2024001633A1
Application number: PCT/CN2023/096777
Authority: WO
Inventors: 霍伟娜; 舒晔
Original assignee: 中兴通讯股份有限公司
Priority date: 2022-06-27
Filing date: 2023-05-29
Publication date: 2024-01-04
Also published as: CN117354155A

Abstract

The present invention provides a network management method, comprising: respectively detecting links of a plurality of slices; and switching, according to a preset corresponding relationship, a service borne by a target slice, the preset corresponding relationship representing a corresponding relationship between slice identifiers of the plurality of slices and target network element addresses, and the target slice being a slice of which a link is detected to be abnormal. The present invention further provides a network management device, a network element, and a computer readable storage medium.

Description

Network management method and device, network element, computer-readable storage medium

Cross-references to related applications

This application claims priority from Chinese patent application No. 202210737195.2 filed on June 27, 2022. The content of this Chinese patent application is incorporated herein by reference in its entirety.

Technical field

The present disclosure relates to the field of communication technology, and in particular to network management methods, network management devices, network elements, and computer-readable storage media.

Background technique

In the 5G era, different industries have obvious differentiated needs, there are many types of services, and different services have different needs. Different services need to be effectively isolated in the same physical network to meet the needs of different users. Operators hope to define the calculation rules of Interior Gateway Protocol (IGP, Interior Gateway Protocol) paths according to their own needs, such as forwarding according to the minimum delay path, maximum bandwidth path, etc. The related algorithm of IGP can only calculate the shortest path to the destination address. When all packets choose the shortest path, traffic balancing cannot be performed, which may cause network congestion.

Flexible Algorithm (FA or Flex-Algo, Flexible Algotithm) is a soft isolation technology. Different requirements correspond to different algorithms, forming different logical topologies. Flex-Algo technology allows IGP to calculate network paths based on constraints, making utilization of network resources simpler and more flexible. Through the extension of IGP, each node advertises its own Flex-Algo capability in IGP. A single node can be associated with multiple FA algorithms, and the same IGP prefix (prefix) can be associated with multiple Prefix-SIDs.

Bidirectional Forwarding Detection (BFD) is a network protocol used to detect link or equipment failures between two network elements. However, BFD in Flex-Algo technology can easily cause network instability.

public content

In a first aspect, an embodiment of the present disclosure provides a network management method, including:

Detect the links of multiple slices separately; and

Switch the services carried by the target slice according to the preset correspondence. The preset correspondence represents the correspondence between the slice identifiers of multiple slices and the address of the target network element. The target slice is a link abnormality detected. of slices.

In a second aspect, an embodiment of the present disclosure provides a network management device, including:

A detection module configured to detect links of multiple slices respectively;

A switching module configured to switch the services carried by the target slice according to a preset correspondence relationship. The preset correspondence relationship represents the correspondence relationship between the slice identifiers of a plurality of the slices and the target network element address. The target slice is Slice where link abnormality is detected.

In a third aspect, an embodiment of the present disclosure provides a network element, including:

at least one processor; and

The memory has at least one computer program stored thereon, and when the at least one computer program is executed by the at least one processor, the at least one processor implements the network management method described in the first aspect of the embodiment of the present disclosure.

In a fourth aspect, an embodiment of the present disclosure provides a computer-readable storage medium on which a computer program is stored. When the computer program is executed by a processor, the network management method described in the first aspect of the embodiment of the present disclosure is implemented.

Description of drawings

Figure 1A is a schematic diagram of a network topology provided by an embodiment of the present disclosure;

Figure 1B is a schematic principle diagram of a flexible algorithm based on the network topology shown in Figure 1A provided by an embodiment of the present disclosure;

Figure 2 is a schematic diagram of the principle of a flexible algorithm provided by an embodiment of the present disclosure;

Figure 3 is a flow chart of a network management method in an embodiment of the present disclosure;

Figure 4 is a flow chart of some steps in a network management method in an embodiment of the present disclosure;

Figure 5 is a flow chart of some steps in a network management method in an embodiment of the present disclosure;

Figure 6 is a flow chart of some steps in a network management method in an embodiment of the present disclosure;

Figure 7 is a flow chart of some steps in a network management method in an embodiment of the present disclosure;

Figure 8 is a block diagram of a network management device in an embodiment of the present disclosure;

Figure 9 is a block diagram of a network element in an embodiment of the present disclosure;

Figure 10 is a block diagram of a computer-readable storage medium in an embodiment of the present disclosure;

as well as

Figure 11 is a schematic diagram of a network architecture in an embodiment of the present disclosure.

Detailed ways

In order to enable those skilled in the art to better understand the technical solutions of the present disclosure, the network management method, network management device, network element, and computer-readable storage medium provided by the present disclosure will be described in detail below with reference to the accompanying drawings.

Example embodiments will be described more fully below with reference to the accompanying drawings, although they may be embodied in different forms and the disclosure should not be construed as limited to the embodiments set forth herein. These embodiments are provided so that this disclosure will be thorough and complete, and will fully understand the scope of the disclosure to those skilled in the art.

The embodiments of the present disclosure and the features in the embodiments may be combined with each other without conflict.

As used herein, the term "and/or" includes any and all combinations of one or more of the associated listed items.

The terminology used herein is used to describe particular embodiments only and is not intended to limit the disclosure. As used herein, the singular forms "a," "an" and "the" are intended to include the plural forms as well, unless the context clearly indicates otherwise. It will also be understood that when the terms "comprising" and/or "made of" are used in this specification, the presence of particular features, integers, steps, operations, elements and/or components is specified but does not exclude the presence or addition of One or more other features, integers, steps, operations, elements, components and/or groups thereof.

Unless otherwise defined, all terms (including technical and scientific terms) used herein have the same meaning as commonly understood by one of ordinary skill in the art. It will also be understood that terms such as those defined in commonly used dictionaries should be construed to have meanings consistent with their meanings in the context of the relevant art and the present disclosure, and will not be construed as having idealized or excessive formal meanings unless This article is expressly so qualified.

The principle of Flex-Algo is shown in Figure 1A, Figure 1B and Figure 2. There are six nodes N1, N2, N3, N4, N5, and N6 in the network topology shown in Figure 1A. Each node deploys the IGP protocol and enables segment routing (SR, Segment Routing) and Flex-Algo capabilities. As shown in Figure 1B, FA128 calculates the optimal path as 1-3-5-4-6 based on the minimum delay algorithm, and FA129 calculates the optimal path as 1-2-3-5-6 based on the maximum bandwidth algorithm. The optimal path calculated by FA130 based on the IGP metric shortest path algorithm is 1-2-4-6.

In Figure 2, the segment routing global block (SRGB, SR Global Block) of each device is 16000, configure FAID and SID for each FA on each node, and advertise FAID and the corresponding SID in the IGP; in The next hop of the FA128 slice from the N1 node to N6 is N2. Calculate the FA128 slice corresponding to the prefix (6.6.6.6/32) of N6. The outgoing label is the SRGB of N2 plus the SID of the FA128 slice, that is, 16000+806; the same for FA129 The calculated outgoing label to prefix (6.6.6.6/32) is 16000+906, and the next hop is N3; FA130 calculates the outgoing label to prefix (6.6.6.6/32) to be 16000+306, and the next hop is N2 . Three algorithms, FA128, FA129 and FA130, respectively correspond to different paths and forwarding labels, to implement FA slice forwarding.

Research has found that in related networks, BFD technology uses the next hop address of a Virtual Private Network (VPN) route as the destination address for detection. When the path to the next hop fails and the next hop is unreachable, If the BFD session detects an exception (down), all VPN services passing through the next hop will be switched to the backup path. Therefore, when different slices reach the same next hop through different paths, as long as the BFD session of one slice detects down, the VPN services carried by all slices will be switched to the backup path, which will cause the VPN services carried by the slices of other paths to be down. Error-aware switching of services can easily cause network instability and non-optimal path forwarding. In view of this, in the first aspect, referring to FIG. 3 , an embodiment of the present disclosure provides a network management method, including steps S1 and S2.

S1. Detect the links of multiple slices respectively.

S2. Switch the services carried by the target slice according to the preset correspondence. The preset correspondence represents the correspondence between the slice identifiers of multiple slices and the address of the target network element. The target slice is the detected link. Unusual slice of road.

The embodiments of this disclosure do not place any special limitations on how to detect sliced links. exist In some embodiments, the slices are subjected to BFD detection.

In the network management method provided by the present disclosure, when switching the services carried by the target slice according to the preset correspondence relationship, only the services carried by the slice with abnormal link detection are switched, and the services carried by the slice with normal link detection are switched. The services carried will not be switched. For example, if the service carried by a slice is a VPN service, perform BFD detection on the slice, and switch the VPN service carried by the target slice according to the preset corresponding relationship, only the VPN service carried by the slice whose BFD session is detected to be down will be switched. If the BFD session detects that the VPN service carried by the normal (up) slice is not switched, the switch will not be performed.

It should be noted that in this disclosure, switching the services carried by the slice refers to switching the services carried by the slice from the main path to the backup path.

In the network management method provided by the present disclosure, the preset corresponding relationship between the slice identifiers of multiple slices and the target network element address is prefabricated. When a link abnormality is detected in a slice, the preset corresponding relationship can be specifically determined based on the preset corresponding relationship. Target slices that require service switching are then switched only to the services carried by the target slice where abnormalities are detected, and services carried by slices with normal links detected are not switched, which is conducive to maintaining network stability and ensuring the optimal path. Forwarding ensures effective isolation of different services.

In this embodiment of the present disclosure, the destination address may be the next hop IP address or the IP address of the destination network element. The embodiments of the present disclosure do not impose special limitations on this.

The embodiment of the present disclosure does not place any special limitations on how to switch the services carried by the target slice according to the preset correspondence relationship.

In some embodiments, when detecting the links of multiple slices respectively, the slice identifier and the destination address of the slice are used to detect the links of the slices. When a link abnormality is detected, the target slice that requires service switching can be determined through the preset correspondence based on the slice identifier and destination address used during detection, and the services carried by the target slice can be further switched. For example, if the service carried by a slice is a VPN service, perform BFD detection on the slice, and create a BFD corresponding to each slice based on the slice ID and destination address of each slice, that is, each BFD has information such as the slice ID and destination address; in the BFD session detection When down, the target slice that requires VPN service switching can be determined through the preset correspondence based on the BFD slice identifier and destination address, and the VPN service can be further switched.

Accordingly, in some embodiments, referring to FIG. 4 , switching the services carried by the target slice according to the preset correspondence relationship includes steps S21 and S22.

S21. Based on the slice identifier and destination address used when detecting the link corresponding to the target slice, determine the slice identifier of the target slice prefabricated in the preset correspondence relationship and the target network corresponding to the target slice. Meta address.

S22. Switch the service carried by the target slice according to the slice identifier of the target slice and the target network element address corresponding to the target slice.

The embodiments of this disclosure do not place special limitations on how to switch the services carried by the target slice based on the slice identifier of the target slice and the target network element address corresponding to the target slice.

In some embodiments, referring to FIG. 5 , switching the service carried by the target slice according to the slice identifier of the target slice and the target network element address corresponding to the target slice includes steps S221 to S223.

S221. Set an invalidation identifier for the slice identifier of the target slice and the target network element address corresponding to the target slice in the preset correspondence relationship.

S222. Determine the service carried by the target slice according to the failure identifier in the preset correspondence relationship.

S223. Trigger switching of services carried by the target slice.

In this embodiment, after determining the slice identifier of the target slice and the target network element address corresponding to the target slice, an invalidation identifier is set for the slice identifier of the target slice and the target network element address corresponding to the target slice in the preset correspondence relationship. It indicates that the slice identifier of the target slice and the target network element address corresponding to the target slice are invalid, so that the services carried by the target slice that need to be switched can be sensed, and then the switching of the services carried by the target slice can be triggered.

In some implementations, the preset correspondence is stored in the form of a forwarding table. In the preset correspondence, an invalidation flag is set for the slice identifier of the target slice and the target network element address corresponding to the target slice, that is, adding Failure identification.

Correspondingly, in some implementations, detecting links of multiple slices respectively includes:

According to the slice identifier and destination address of each slice, a bidirectional forwarding detection (BFD) corresponding to each slice is created to detect the link of each slice. Measurement.

The embodiment of the present disclosure does not specifically limit the form of the preset correspondence relationship.

In some embodiments, referring to Figure 6, before detecting the links of multiple slices respectively, the network management method further includes step S3.

S3. Pre-prepare the preset corresponding relationship in the forwarding table. That is, the corresponding relationship between the slice identifiers of multiple slices and the target network element addresses is stored in the forwarding table.

In some embodiments, prefabricating the preset correspondence relationship in the forwarding table means pre-stored in the forwarding table the slice identifier and the target network element address of the slice, and using "slice identifier + target network element address" as the forwarding index.

In some implementations, the target network element address is the next hop IP address, the service carried by the slice is VPN service, BFD detection is performed on the slice, and "slice identifier + target network element address" is used as the forwarding index, that is, "slice identifier" + next-hop IP address" as the forwarding index, instead of just the next-hop prefix (i.e. next-hop IP address) as the forwarding index. When the BFD session detects down, the need can be determined based on the BFD destination address and slice identifier. The target slice for VPN service switching, and only switches the VPN services carried by the target slice, but does not switch the VPN services carried by the slice whose BFD session detects up.

The embodiment of the present disclosure does not place special limitations on how to pre-prepare the corresponding relationship between the slice identifier of the slice and the target network element address in the forwarding table.

In some embodiments, referring to FIG. 7 , pre-preparing the corresponding relationship between the slice identifiers of multiple slices and the next-hop Internet Protocol (IP) address in the forwarding table includes steps S31 to S33.

S31. Receive service routing information, where the service routing information carries the target network element address and the identifier of the service instance.

S32. According to the mapping relationship between the identifier of the service instance and the slice identifier of the slice that carries the service corresponding to the service instance, determine the corresponding relationship between the slice identifier of the slice that carries the service corresponding to the service instance and the target network element address.

S33. Store the corresponding relationship between the slice identifier of the slice carrying the service corresponding to the service instance and the target network element address in the forwarding table.

The embodiments of this disclosure do not place special limitations on the services carried by the slices.

In some implementations, the service carried by the slice is a VPN service, and the service instance is a Virtual Routing Forwarding (VRF) instance.

Accordingly, in some implementations, steps S31 to S33 may be performed as: receiving a VPN route of the VRF instance, the VPN route carrying the next hop IP address and the color of the VRF instance; according to the VRF instance The mapping relationship between the color and the slice ID of the slice carrying the VRF instance, determining the corresponding relationship between the slice ID of the slice carrying the VRF instance and the next hop IP address; and assigning the slice ID of the slice carrying the VRF instance The corresponding relationship with the next hop IP address is stored in the forwarding table.

In this embodiment of the present disclosure, different VRF instances correspond to different VPN services. When the next-hop network element advertises VPN routes, it carries color. Color is used to identify the VRF instance, that is, to identify the VPN service. In this embodiment of the present disclosure, the color of the VRF instance is mapped to the slice carrying the VPN service of the VRF instance, and a mapping relationship between the color of the VRF instance and the slice identifier of the slice carrying the VRF instance is obtained.

In this disclosed embodiment, after the local network element receives the VPN route published by the next-hop network element, it can obtain the next-hop IP address and the color of the VRF instance, and according to the mapping relationship between the color and the slice identifier, the next-hop The IP address corresponds to the slice, and the corresponding relationship between the slice identifier and the next hop IP address is obtained and stored in the forwarding table.

In some implementations, the network management method further includes:

Enable fast reroute (FRR, Fast Reroute).

In the embodiment of the present disclosure, enabling FRR in the local network element enables the VPN routes corresponding to each VRF instance in the local network element to form VPN FRR respectively, so that the slice can be BFD associated with VPN FRR fast switching.

In some embodiments, the slices are Flexible Algorithm (FA) slices.

In embodiments of the present disclosure, different FA slices calculate optimal paths based on different FA algorithms. For example, calculate the optimal path based on the minimum delay algorithm, calculate the optimal path based on the maximum bandwidth algorithm, or calculate the optimal path based on the IGP metric shortest path algorithm, etc. The embodiments of the present disclosure do not impose special limitations on this.

In the second aspect, referring to FIG. 8 , an embodiment of the present disclosure provides a network management device, including a detection module 101 and a switching module 102 .

The detection module 101 is configured to detect links of multiple slices respectively.

The switching module 102 is configured to switch the services carried by the target slice according to a preset corresponding relationship, which represents the corresponding relationship between the slice identifiers of the plurality of slices and the target network element address, and the target slice is Slice where link abnormality is detected.

In the third aspect, referring to Figure 9, an embodiment of the present disclosure provides a network element, including:

at least one processor 201;

The memory 202 has at least one computer program stored thereon, and when the at least one computer program is executed by at least one processor, the at least one or more processors implement the network management method described in the first aspect of the embodiment of the present disclosure; and

At least one I/O interface 203 is connected between the processor and the memory, and is configured to realize information exchange between the processor and the memory.

The processor 201 is a device with data processing capabilities, including but not limited to a central processing unit (CPU), etc.; the memory 202 is a device with data storage capabilities, including but not limited to random access memory (RAM, more specifically such as SDRAM, DDR etc.), read-only memory (ROM), electrically erasable programmable read-only memory (EEPROM), flash memory (FLASH); the I/O interface (read-write interface) 203 is connected between the processor 201 and the memory 202, and can realize processing The information exchange between the device 201 and the memory 202 includes but is not limited to the data bus (Bus) 204 and so on.

In some implementations, processor 201, memory 202, and I/O interface 203 are connected to each other and, in turn, to other components of the computing device via bus 204.

In the fourth aspect, referring to FIG. 10 , an embodiment of the present disclosure provides a computer-readable storage medium on which a computer program is stored. When the computer program is executed by a processor, the network management described in the first aspect of the embodiment of the present disclosure is implemented. method.

In order to enable those skilled in the art to more clearly understand the technical solutions provided by the embodiments of the present disclosure, the technical solutions provided by the embodiments of the present disclosure are described in detail below through two specific examples:

Example 1

In this example, as shown in Figure 11, BFD-associated VPN FRR fast switching in the FA slice network includes (1) to (11).

(1) On the operator edge equipment (PE, Provider Edge) nodes PE1 and PE2 Start the Intermediate System to Intermediate System (ISIS) protocol with PE3, notify the loopback interface address of each node to ISIS, enable the SR capability, and enable FA1 (FAID is 128) and FA2 (FAID is 129) algorithm.

(2) For the FA1 (FAID is 128) slice, assign a SID to the prefix of each PE node, and all SIDs are unique in the entire network; similarly, for the FA2 (FAID is 129) slice, assign a SID to the prefix of each PE node, and all SIDs Unique in the entire network; and notifies the Prefix-SID to ISIS.

(3) The slice of FA1 (FAID 128) from PE1 to PE2 and PE3 calculates the optimal path based on the minimum delay algorithm. The outbound interface between PE1 and PE2 is int1, and the outbound interface between PE1 and PE3 is int3. The outbound interface between PE2 and PE3 is int5; the slice of FA2 (FAID is 129) calculates the optimal path based on the maximum bandwidth algorithm. The outbound interface between PE1 and PE2 is int2, and the outbound interface between PE1 and PE3 is int4. The outbound interface between PE2 and PE3 is int6.

(4) Use loopback interfaces to deploy Multi-Protocol Label Switching (MPLS, Multi-Protocol Label Switching) Layer 3 VPN (L3VPN, Layer 3 VPN) between PE1, PE2 and PE3. PE2 and PE3 are dual-homed to the user network edge device ( CE, Customer Edge) nodes CE2 and PE1 are single-homed to CE1, and optionA is used to access the CE node and PE node.

(5) There are two VRF instances VRF128 and VRF129 on PE1, PE2 and PE3 respectively. PE2 and PE3 publish the VPN route corresponding to VRF128 and carry color 128; publish the VPN route corresponding to VRF129 and carry color 129.

(6) Map the slices with color 128 and FAID 128, and map the slices with color 129 and FAID 129.

(7) PE1 receives the VPN route of VRF128, and the next hops are PE2 and PE3; the next hop of the VPN route of VRF129 received on PE1 is also the loopback interface IP addresses of PE2 and PE3, and FRR is enabled on PE1. , the VPN routes corresponding to VRF128 and VRF129 form VPN FRR respectively. Based on the mapping relationship between color and FAID in (6), the VPN route corresponding to VRF128 and the VPN route corresponding to VRF129 are carried on the slice with FAID of 128 and the slice with FAID of 129 respectively.

(8) The next hop forwarding table of VPN routes carried in different FA slices stores the corresponding FAID and next hop IP.

(9) Create BFD detection of the corresponding slice between PE1 and PE2, that is, create BFD detection of the corresponding slice based on the next hop IP address of the FAID and VPN route.

(10) When both int1 and int5 of the links from PE2 to PE1 fail, and the slice BFD with FAID of 128 between PE1 and PE2 is down, use the FAID and destination IP of the BFD to find the corresponding FAID and next hop in the forwarding table. IP performs forwarding switching, triggering fast switching of all VPN services carried on the slice with FAID of 128; while VPN services carried on the slice of FAID of 129 will not undergo fast switching and are still forwarded on the VPN main path.

(11) When both int2 and int6 of the links from PE2 to PE1 fail, the FAID between PE1 and PE2 is 129 and the slice BFD is down. Find the corresponding FAID and next hop IP in the forwarding table through the FAID and destination IP of the BFD. Perform forwarding switching to trigger fast switching of all VPN services carried on the slice with FAID 129.

Example 2

In this example, as shown in Figure 11, ISIS SR is deployed between PE1, PE2 and PE3. At the same time, FA128 and FA129 algorithms are enabled to calculate different network topologies; the SRGB of each node is 16000, and each PE slice FA128 and FA129 deploy different SIDs for the same prefix and publish them to ISIS for flooding. MPLS L3VPN is deployed between PEs, with two VPN instances VRF128 and VRF129. The services corresponding to VRF128 are carried on slice FA128, and the services corresponding to VRF129 are carried on slice FA129.

BFD associated VPN FRR fast switching in the FA slice network includes (1) to (9).

(1) Start the ISIS protocol between PE1, PE2 and PE3. The loopback interface address of the PE1 node is 1.1.1.1/32, the loopback interface address of the PE2 node is 2.2.2.2/32, and the loopback interface address of the PE3 node is 3.3.3.3/32, all are advertised to the corresponding ISIS instance 100, and the SR capability is enabled, as well as the FA128 and FA129 algorithms.

(2) For the FA128 slice, assign the SID 801 to the loopback interface address 1.1.1.1/32 of the PE1 node. Similarly, assign the SID 802 to the loopback interface address 2.2.2.2/32 of the PE2 node, and assign the SID 802 to the loopback interface address of the PE3 node. The interface address 3.3.3.3/32 is assigned a SID of 803; the FA129 slice is assigned a SID of 901 for the loopback interface address 1.1.1.1/32 of the PE1 node. Similarly, the loopback interface address 2.2.2.2/32 is assigned for the PE2 node. SID is 902. Assign SID 903 to the loopback interface address 3.3.3.3/32 of the PE3 node. All SIDs are unique in the entire network; and notify the Prefix-SID to ISIS instance 100.

(3) The FA128 slice calculates the optimal path based on the minimum delay algorithm. The outbound interface between PE1 and PE2 is int1, the outbound interface between PE1 and PE3 is int3, and the outbound interface between PE2 and PE3 is int5; FA129 slice The optimal path is calculated based on the maximum bandwidth algorithm. The outbound interface between PE1 and PE2 is int2, the outbound interface between PE1 and PE3 is int4, and the outbound interface between PE2 and PE3 is int6. PE1 calculates the optimal path based on the FA128 algorithm to PE2. The outgoing label of prefix 2.2.2.2/32 is 16802, and the outgoing label of prefix 3.3.3.3/32 to PE3 is 16803. Similarly, based on the FA129 algorithm on PE1, the outgoing label of PE2 prefix 2.2.2.2/32 is calculated to be 16902, and the outgoing label to PE3 is 16902. The outgoing label of prefix 3.3.3.3/32 is 16903.

(4) MPLS L3VPN is deployed between PE1, PE2 and PE3, and 2 VPN instances VRF128 and VRF129 are deployed. PE2 and PE3 are dual-homed to CE2, PE1 is single-homed to CE1, and optionA is used to connect between CE and PE; PE2 and PE3 Publish the VPN route (22.22.22.22/32) corresponding to VRF128 and carry color; publish the VPN route (33.33.33.33/32) corresponding to VRF129 and carry color; the color carried by the VPN route of VRF128 is set to 128, and the VPN route of VRF129 The carried color is set to 129.

(5) Map color 128 to the FAID (128) of the slice FA128, and map color 129 to the FAID (129) of the slice FA129.

(6) PE1 receives the VPN route of VRF128 (22.22.22.22/32), and the next hop is PE2 (2.2.2.2) and PE3 (3.3.3.3); PE1 receives the VPN route of VRF129 (33.33.33.33 /32), the next hops are also PE2 (2.2.2.2) and PE3 (3.3.3.3), and the VPN routes (22.22.22.22/32) corresponding to VRF128 and VRF129 form VPN FRR respectively. From the mapping relationship between color 128 and FAID (128) in (5), through color 128 + next hop (2.2.2.2), we can know that the VPN route (22.22.22.22/32) corresponding to VRF128 is carried on slice FA128, the main VPN route The next hop of the backup VPN route is 2.2.2.2, the public network outgoing label is 16802, and the outgoing interface is int1; the next hop of the backup VPN route is 3.3.3.3, the public network outgoing label is 16803, and the outgoing interface is int3. Similarly, the VPN route (22.22.22.22/32) corresponding to VRF129 is carried on slice FA129. The next hop of the main VPN route is 2.2.2.2, the public network outgoing label is 16902, and the outgoing interface is int2; the next hop of the backup VPN route is 3.3.3.3, the public network outgoing label is 16903, and the outgoing interface is int4.

(7) Perform BFD detection on the FA slice with FAID 128 and destination IP 2.2.2.2 on PE1; similarly, perform BFD detection on the FA slice with FAID 129 and destination IP 2.2.2.2.

(8) When both int1 and int5 of the links from PE2 to PE1 fail, the BFD of the FA128 slice between PE1 and PE2 is down, and the corresponding value in the forwarding table is found through the FAID (128) and destination IP (2.2.2.2) of the BFD. FAID + next hop (128+2.2.2.2) performs forwarding switching, triggering fast switching of all VPN services carried on slice FA128; no switching is performed on the service route (33.33.33.33/32) carried on slice FA129.

(9) When both int2 and int6 of the links from PE2 to PE1 fail, the BFD of the FA129 slice between PE1 and PE2 is down, and the corresponding value in the forwarding table is found through the FAID (129) and destination IP (2.2.2.2) of the BFD. FAID+next hop (129+2.2.2.2) performs forwarding switching, triggering fast switching of all VPN services carried on slice FA129.

Those of ordinary skill in the art can understand that all or some steps, systems, and functional modules/units in the devices disclosed above can be implemented as software, firmware, hardware, and appropriate combinations thereof. In hardware implementations, the division between functional modules/units mentioned in the above description does not necessarily correspond to the division of physical components; for example, one physical component may have multiple functions, or one function or step may consist of several physical components. Components execute cooperatively. Some or all of the physical components may be implemented as software executed by a processor, such as a central processing unit, a digital signal processor, or a microprocessor, or as hardware, or as an integrated circuit, such as an application specific integrated circuit. circuit. Such software may be distributed on computer-readable media, which may include computer storage media (or non-transitory media) and communication media (or transitory media). As is known to those of ordinary skill in the art, the term computer storage media includes volatile and nonvolatile media implemented in any method or technology for storage of information such as computer readable instructions, data structures, program modules or other data. removable, removable and non-removable media. Computer storage media includes, but is not limited to, RAM, ROM, EEPROM, flash memory or other memory technology, CD-ROM, Digital Versatile Disk (DVD) or other optical disk storage, magnetic cassettes, tapes, disk storage or other magnetic storage devices, or may Any other medium used to store desired information and that can be accessed by a computer. Additionally, it is well known to those of ordinary skill in the art that communication media typically embodies computer readable instructions, data structures, program modules, or devices such as carrier waves or other A transport mechanism such as a modulated data signal that modulates other data in a data signal and may include any information delivery medium.

Example embodiments have been disclosed herein, and although specific terms are employed, they are used and should be interpreted in a general illustrative sense only and not for purpose of limitation. In some instances, it will be apparent to those skilled in the art that, unless expressly stated otherwise, features, characteristics, and/or elements described in connection with a particular embodiment may be used alone, or may be combined with features, characteristics, and/or elements described in connection with other embodiments. and/or used in combination with components. Accordingly, it will be understood by those skilled in the art that various changes in form and details may be made without departing from the scope of the present disclosure as set forth in the appended claims.

Claims

A network management method including:

Detect the links of multiple slices separately; and

The services carried by the target slice are switched according to the preset correspondence relationship, wherein the preset correspondence relationship represents the correspondence relationship between the slice identifiers of the multiple slices and the address of the target network element, and the target slice is the detected link. Unusual slice of road.
The network management method according to claim 1, wherein switching the services carried by the target slice according to the preset corresponding relationship includes:

According to the slice identifier and destination address used when detecting the link corresponding to the target slice, determine the slice identifier of the target slice pre-prepared in the preset correspondence relationship and the target network element address corresponding to the target slice. ;as well as

Switch the service carried by the target slice according to the slice identifier of the target slice and the target network element address corresponding to the target slice.
The network management method according to claim 2, wherein switching the service carried by the target slice according to the slice identifier of the target slice and the target network element address corresponding to the target slice includes:

Set an invalidation identifier for the slice identifier of the target slice and the target network element address corresponding to the target slice in the preset correspondence relationship;

Determine the service carried by the target slice according to the failure identification in the preset correspondence relationship; and

Trigger switching of services carried by the target slice.
The network management method according to claim 2, wherein the detecting the links of multiple slices respectively includes:

According to the slice identifier and destination address of each slice, a bidirectional forwarding detection (BFD) corresponding to each slice is created to detect the link of each slice.
The network management method according to any one of claims 1 to 4, further comprising:

Before detecting the links of multiple slices respectively, the preset corresponding relationship is pre-prepared in the forwarding table.
The network management method according to claim 5, wherein prefabricating the preset corresponding relationship in the forwarding table includes:

Receive service routing information, wherein the service routing information carries the target network element address and the identifier of the service instance;

According to the mapping relationship between the identifier of the service instance and the slice identifier of the slice that carries the service corresponding to the service instance, determine the corresponding relationship between the slice identifier of the slice that carries the service corresponding to the service instance and the target network element address; and

The corresponding relationship between the slice identifier of the slice carrying the service corresponding to the service instance and the target network element address is stored in the forwarding table.
The network management method according to claim 6, wherein the service carried by the slice is a virtual private network (VPN) service, and the service instance is a virtual routing and forwarding (VRF) instance.
The network management method according to any one of claims 1 to 4, wherein the target network element address is a next-hop Internet Protocol (IP) address.
A network management device, including:

a detection module configured to detect links of multiple slices respectively; and

A switching module configured to switch services carried by the target slice according to a preset correspondence relationship, wherein the preset correspondence relationship represents the correspondence relationship between the slice identifiers of a plurality of the slices and the target network element address, and the target network element address is The slice is the slice where the link abnormality is detected.
A network element includes:

at least one processor; and

A memory having at least one computer program stored thereon, which, when executed by the at least one processor, causes the at least one processor to implement the network according to any one of claims 1 to 8 management methods.
A computer-readable storage medium on which a computer program is stored. When the computer program is executed by a processor, the network management method according to any one of claims 1 to 8 is implemented.