A flexible ethernet hierarchical service protection path planning method and device

Abstract

This invention provides a flexible Ethernet hierarchical service protection path planning method and apparatus. The method includes: determining the priority of a service based on a preset maximum latency and a preset minimum reliability; determining a protection mode corresponding to the priority, wherein the priority and the protection mode are pre-associated; and planning a backup path in the protection mode based on a path planning algorithm according to the bandwidth corresponding to the service flow. This invention meets the different protection requirements of different services, improving network resource utilization while ensuring service transmission reliability.

Description

Technical Field

[0001] This invention relates to the field of computer network technology, and in particular to a flexible Ethernet hierarchical service protection path planning method and apparatus. Background Technology

[0002] Flexible Ethernet (FlexE) is a communication protocol whose basic idea is to decouple the MAC (Medium Access Control) layer from the PHY (Physical) layer by adding a time-division multiplexed FlexE Shim layer. This allows for flexible control of the interface rate to adapt to different network transmission structures. In a FlexE network, because data is transmitted directly through end-to-end tunnels, and the next hop is no longer determined by information obtained from the MAC layer, the implementation of a FlexE network requires additional security protection strategies to ensure the transmission of data streams.

[0003] Existing FlexE tunnel technology offers two protection modes: 1+1 protection and 1:1 protection. The 1+1 protection mode allows data to be transmitted simultaneously in two tunnels, and the data transmission quality of both tunnels is simultaneously monitored at the transmission destination. Customer service data is received from the tunnel with the higher transmission quality. The 1:1 protection mode uses two transport tunnels: a primary tunnel and a backup tunnel. During normal operation, customer service data is transmitted in the primary tunnel, while the backup tunnel is idle (or can transmit lower-priority customer service data as needed). When the primary tunnel fails, the sending and receiving ends negotiate and decide to switch the customer service data transmission from the primary tunnel to the backup tunnel.

[0004] Each of the two existing protection modes in FlexE networks has its advantages and disadvantages. In the 1+1 protection mode, mechanisms such as dedicated primary and backup channels and simultaneous transmission of service data streams greatly improve the fault tolerance of link transmission and provide sufficient reliability guarantees. However, this dual-channel characteristic generates significant resource consumption, increasing the network transmission burden. Dedicated access to both channels leads to more resource waste when the channels are idle.

[0005] In the 1:1 protection mode, the backup channel can be used to transmit low-priority customer service data streams when idle, providing a certain level of reliability for the service while also improving link resource utilization. However, this protection mechanism only involves the sending and receiving ends negotiating and deciding to switch the customer service from the primary channel to the backup channel for retransmission when the primary channel fails. Its reliability is lower than the 1+1 protection mode of dual-channel dual-stream simultaneous transmission. Moreover, this mechanism of renegotiation and transmission in the event of a failure, along with the complex recovery process, often results in significant latency.

[0006] Network operators typically use 1+1 or 1:1 protection modes. Since different customers have different service needs, applying only these two protection modes to all customer services would result in a significant waste of network bandwidth resources, causing some customer services to be unable to be served due to resource constraints. Summary of the Invention

[0007] This invention provides a flexible Ethernet hierarchical service protection path planning method and apparatus to address the shortcomings of existing technologies that use two protection modes uniformly for all customer services, which would make it difficult to meet the diverse needs of various customer services. It enables differentiated protection based on the priority of customer services to meet the needs of different customer services.

[0008] This invention provides a flexible Ethernet hierarchical service protection path planning method, comprising:

[0009] The priority of the service is determined based on the preset maximum latency and preset minimum reliability corresponding to the service.

[0010] Determine the protection mode corresponding to the priority, wherein the priority is pre-associated with the protection mode;

[0011] Based on the bandwidth corresponding to the service flow, a backup path in the protection mode is planned using a path planning algorithm.

[0012] According to a flexible Ethernet hierarchical service protection path planning method provided by the present invention, the step of determining the priority of the service based on the preset maximum latency and preset minimum reliability corresponding to the service includes:

[0013] If the preset maximum latency is less than a first preset threshold and the preset minimum reliability is greater than a second preset threshold, the priority of the service is determined to be the first priority.

[0014] If the preset maximum latency is less than the third preset threshold and the preset minimum reliability is greater than the fourth preset threshold, the priority of the service is determined to be the second priority.

[0015] If the preset maximum latency is less than the fifth preset threshold and the preset minimum reliability is greater than the sixth preset threshold, the priority of the service is determined to be the third priority.

[0016] Among them, the first preset threshold, the third preset threshold, and the fifth preset threshold increase sequentially;

[0017] The second preset threshold, the fourth preset threshold, and the sixth preset threshold decrease sequentially.

[0018] According to the flexible Ethernet hierarchical service protection path planning method provided by the present invention, the protection mode corresponding to the first priority is a 1+1 protection mode.

[0019] The protection mode corresponding to the second priority is to use the 1+1 protection mode when the main channel and backup channel corresponding to the service are not idle; and to use the 1:1 protection mode when the main channel and backup channel are idle.

[0020] The protection mode corresponding to the third priority is the 1:1 protection mode.

[0021] According to the flexible Ethernet hierarchical service protection path planning method provided by the present invention, the step of planning the backup path in the protection mode based on the bandwidth corresponding to the service flow of the service and using a path planning algorithm includes:

[0022] On the main routing graph of the physical topology of the FlexE network, remove the main route used by the main channel corresponding to the service and the edges associated with the nodes traversed by the main route to obtain a new physical topology;

[0023] Based on the K-link Shortest Path (KSP) routing algorithm, multiple shortest paths for the service flow are determined according to the new physical topology, and each shortest path is traversed.

[0024] Based on the FlexE physical nodes on the shortest path, the shortest path is divided into multiple segments;

[0025] If no FlexE Group (FlexE group refers to logical channel) exists in each segment, determine whether the available capacity of PHYs in each segment is greater than or equal to the bandwidth corresponding to the service flow. If so, create a new FlexE Group and bind the PHYs to the new FlexE Group according to the bandwidth. If not, mark the shortest path.

[0026] If the FlexE Group exists in each segment, determine whether the available capacity of the PHYs in the FlexE Group is greater than or equal to the bandwidth corresponding to the service flow. If yes, allocate the service flow to the FlexE Group. If no, determine the difference between the bandwidth and the available capacity, and determine whether the available capacity of the PHYs in each segment is greater than or equal to the difference. If yes, add the PHYs to the FlexE Group according to the difference. If no, mark the shortest path.

[0027] If the shortest path is not marked, it will be used as a backup path for the service.

[0028] According to a flexible Ethernet hierarchical service protection path planning method provided by the present invention, the step of determining the priority of the service based on the preset maximum latency and preset minimum reliability corresponding to the service further includes:

[0029] If the preset maximum latency is less than the seventh preset threshold and the preset minimum reliability is greater than the eighth preset threshold, the priority of the service is determined to be the fourth priority.

[0030] If the preset maximum latency is less than the ninth preset threshold and the preset minimum reliability is greater than the tenth preset threshold, the priority of the service is determined to be the fifth priority.

[0031] Among them, the fifth preset threshold, the seventh preset threshold, and the ninth preset threshold increase sequentially;

[0032] The sixth preset threshold, the eighth preset threshold, and the tenth preset threshold decrease sequentially.

[0033] According to the flexible Ethernet hierarchical service protection path planning method provided by the present invention, the protection mode corresponding to the fourth priority is the shared path protection mode;

[0034] The protection mode corresponding to the fifth priority is that the services of the fifth priority are not protected, and the services of the fifth priority are transmitted by the backup channels when the services of the second priority and the third priority are idle.

[0035] According to the flexible Ethernet hierarchical service protection path planning method provided by the present invention, the step of planning the backup path in the protection mode based on the bandwidth corresponding to the service flow of the service and using a path planning algorithm includes:

[0036] On the main routing graph of the physical topology of the FlexE network, remove the main route used by the main channel corresponding to the service and the edges associated with the nodes traversed by the main route to obtain a new physical topology;

[0037] Based on the new physical topology, the K-connection shortest path routing algorithm determines multiple shortest paths for the service flow and traverses each shortest path.

[0038] Based on the FlexE physical nodes on the shortest path, the shortest path is divided into multiple segments;

[0039] If no FlexE Group exists in each segment, determine whether the available capacity of the PHYs in each segment is greater than or equal to the bandwidth corresponding to the service flow. If so, create a new FlexE Group and bind the PHYs to the new FlexE Group according to the bandwidth. If not, mark the shortest path.

[0040] If the FlexE Group exists in each segment, determine whether the shareable capacity of the PHYs in the FlexE Group meets a preset condition; the preset condition is that the shareable capacity does not serve the main route and the backup routes corresponding to the services of the first priority, the second priority and the third priority, and the main paths corresponding to the services of the fourth priority that share the shareable capacity are different.

[0041] If the shareable capacity meets the preset conditions, then multiple backup channels of the service share the shareable capacity. If the shareable capacity is less than the bandwidth corresponding to the service flow, the difference between the bandwidth and the shareable capacity is determined, and it is determined whether the available capacity of PHYs in each segment is greater than or equal to the difference. If yes, a new FlexE Group is created, and the PHYs are bound to the new FlexE Group according to the difference. If no, the shortest path is marked.

[0042] If the shareable capacity does not meet the preset condition, then determine whether the available capacity of the PHYs in the FlexE Group is greater than or equal to the bandwidth corresponding to the service flow. If yes, then allocate the service flow to the FlexE Group. If no, then determine the difference between the bandwidth and the available capacity, and determine whether the available capacity of the PHYs in each segment is greater than or equal to the difference. If yes, then add the PHYs to the FlexE Group according to the difference. If no, then mark the shortest path.

[0043] If the shortest path is not marked, it will be used as a backup path for the service.

[0044] The present invention also provides a flexible Ethernet hierarchical service protection path planning device, comprising:

[0045] The hierarchical module is used to determine the priority of the service based on the preset maximum latency and preset minimum reliability corresponding to the service.

[0046] A determination module is used to determine the protection mode corresponding to the priority, wherein the priority is pre-associated with the protection mode;

[0047] The planning module is used to plan the backup path in the protection mode based on the bandwidth corresponding to the service flow of the service and the path planning algorithm.

[0048] The present invention also provides an electronic device, including a memory, a processor, and a computer program stored in the memory and executable on the processor, wherein the processor executes the program to implement the flexible Ethernet hierarchical service protection path planning method as described above.

[0049] The present invention also provides a non-transitory computer-readable storage medium having a computer program stored thereon, which, when executed by a processor, implements the flexible Ethernet hierarchical service protection path planning method as described above.

[0050] The flexible Ethernet hierarchical service protection path planning method and apparatus provided by this invention divides services into different priority levels according to the different latency and reliability requirements of different services, and adopts different protection modes for services with different priorities to carry out differentiated protection, thereby meeting the different protection requirements of different services. While ensuring the reliability of service transmission, it reduces the waste of network resources and improves the utilization rate of network resources. Based on the bandwidth required by the service flow, it plans the optimal backup path for the service and allocates network resources, thereby optimizing the resource utilization rate of the entire FlexE network. Attached Figure Description

[0051] To more clearly illustrate the technical solutions in this invention or the prior art, the drawings used in the description of the embodiments or the prior art will be briefly introduced below. Obviously, the drawings described below are some embodiments of this invention. For those skilled in the art, other drawings can be obtained from these drawings without creative effort.

[0052] Figure 1 This is a flowchart illustrating the flexible Ethernet hierarchical service protection path planning method provided by the present invention.

[0053] Figure 2 This is a schematic diagram of the path planning algorithm for the first, second, and third priority services in the flexible Ethernet hierarchical service protection path planning method provided by the present invention;

[0054] Figure 3This is a schematic diagram of the path planning algorithm for the fourth priority service in the flexible Ethernet hierarchical service protection path planning method provided by the present invention.

[0055] Figure 4 This is a schematic diagram of the flexible Ethernet hierarchical service protection path planning device provided by the present invention;

[0056] Figure 5 This is a schematic diagram of the structure of the electronic device provided by the present invention. Detailed Implementation

[0057] To make the objectives, technical solutions, and advantages of this invention clearer, the technical solutions of this invention will be clearly and completely described below with reference to the accompanying drawings. Obviously, the described embodiments are only some, not all, of the embodiments of this invention. All other embodiments obtained by those skilled in the art based on the embodiments of this invention without creative effort are within the scope of protection of this invention.

[0058] The following is combined with Figure 1 The present invention describes a flexible Ethernet hierarchical service protection path planning method, comprising:

[0059] Step 101: Determine the priority of the service based on the preset maximum latency and preset minimum reliability corresponding to the service;

[0060] The preset maximum latency for a service is determined based on the service's latency requirements, and the service's latency requirements are less than or equal to the preset maximum latency.

[0061] The preset minimum reliability for a service is determined based on the service's reliability requirements, and the service's reliability requirements are greater than or equal to the preset minimum reliability.

[0062] Based on the different latency and reliability requirements of different services, services are divided into different priority levels.

[0063] Step 102: Determine the protection mode corresponding to the priority, wherein the priority is pre-associated with the protection mode;

[0064] Different protection modes are used for services with different priorities to provide differentiated protection, thereby meeting the different protection needs of different services.

[0065] Step 103: Based on the bandwidth corresponding to the service flow of the service, plan the backup path in the protection mode using the path planning algorithm.

[0066] Path planning algorithms are used to support the implementation of protection modes, providing optimal backup path selection for services with different protection levels.

[0067] Considering that service paths are affected by the resource constraints of FlexE network devices, the main task of the path planning algorithm is to plan backup channels and allocate network resources in order to optimize the resource utilization of the entire FlexE network.

[0068] The bandwidth corresponding to a service flow is the bandwidth required to transmit that service flow. Based on the bandwidth required by the service flow, the optimal backup path is planned for the service.

[0069] This embodiment divides services into different priority levels based on their varying latency and reliability requirements, and employs different protection modes for services with different priorities to provide differentiated protection. This satisfies the diverse protection needs of different services, ensuring link transmission reliability while reducing the waste of network resources and improving the utilization rate of network resources. Furthermore, it plans the optimal backup path for tasks based on the bandwidth required by the service flow and allocates network resources, thereby optimizing the resource utilization rate of the entire FlexE network.

[0070] Based on the above embodiments, the step of determining the priority of a service according to the preset maximum latency and preset minimum reliability corresponding to the service in this embodiment includes:

[0071] If the preset maximum latency is less than a first preset threshold and the preset minimum reliability is greater than a second preset threshold, the priority of the service is determined to be the first priority.

[0072] If the preset maximum latency is less than the third preset threshold and the preset minimum reliability is greater than the fourth preset threshold, the priority of the service is determined to be the second priority.

[0073] If the preset maximum latency is less than the fifth preset threshold and the preset minimum reliability is greater than the sixth preset threshold, the priority of the service is determined to be the third priority.

[0074] Among them, the first preset threshold, the third preset threshold, and the fifth preset threshold increase sequentially;

[0075] The second preset threshold, the fourth preset threshold, and the sixth preset threshold decrease sequentially.

[0076] In this embodiment, different services are divided into first priority, second priority, and third priority based on their different requirements for latency and reliability, with the priority decreasing in that order.

[0077] Based on the above embodiments, the protection mode corresponding to the first priority in this embodiment is a 1+1 protection mode;

[0078] The 1+1 protection mode, also known as dedicated protection, is characterized by exclusive use of primary and backup channel resources.

[0079] In proprietary protection, each backup path reserves a certain amount of spare capacity, which means that backup resources are used for at most one path.

[0080] This protection mode allows data to be transmitted simultaneously in the primary and backup channels, and simultaneously detects the data transmission quality of both channels at the transmission destination, receiving customer service data from the channel with higher transmission quality.

[0081] The protection mode corresponding to the second priority is to use the 1+1 protection mode when the main channel and backup channel corresponding to the service are not idle; and to use the 1:1 protection mode when the main channel and backup channel are idle.

[0082] The second priority protection strategy combines the features of both 1+1 and 1:1 protection modes, with a protection level between the two.

[0083] In this protection mode, data can be transmitted simultaneously in two channels, i.e., parallel transmission in 1+1 protection mode. When the primary and backup channels are idle, low-priority (such as fifth priority) customer service data streams can be transmitted on the backup channel, i.e., resource reuse in 1:1 protection mode.

[0084] When a second-priority service flow and a fifth-priority service flow conflict in the backup channel, a priority queuing mechanism is used to place the fifth-priority service flow after the second-priority service flow for transmission. This avoids delays caused by interference from the fifth-priority service flow during the transmission of the second-priority service flow, thus ensuring that the transmission reliability of the second-priority service flow is not affected.

[0085] The protection mode corresponding to the third priority is the 1:1 protection mode.

[0086] For third-priority services, a 1:1 protection mode is used. During normal operation, customer services are transmitted on the primary channel, while the backup channel can transmit lower-priority services, such as fifth-priority customer services. When the primary channel fails, the sending and receiving ends negotiate and decide to switch the customer service from the primary channel to the backup channel.

[0087] Based on the above embodiments, such as Figure 2 As shown, in this embodiment, the step of planning the backup path in the protection mode based on the bandwidth corresponding to the service flow includes:

[0088] On the main routing graph of the physical topology of the FlexE network, remove the main route used by the main channel corresponding to the service and the edges associated with the nodes traversed by the main route to obtain a new physical topology;

[0089] Based on the new physical topology, the K-connection shortest path routing algorithm determines multiple shortest paths for the service flow and traverses each shortest path.

[0090] Based on the FlexE physical nodes on the shortest path, the shortest path is divided into multiple segments;

[0091] If no FlexE Group exists in each segment, determine whether the available capacity of the PHYs in each segment is greater than or equal to the bandwidth corresponding to the service flow. If so, create a new FlexE Group and bind the PHYs to the new FlexE Group according to the bandwidth. If not, mark the shortest path.

[0092] If the FlexE Group exists in each segment, determine whether the available capacity of the PHYs in the FlexE Group is greater than or equal to the bandwidth corresponding to the service flow. If yes, allocate the service flow to the FlexE Group. If no, determine the difference between the bandwidth and the available capacity, and determine whether the available capacity of the PHYs in each segment is greater than or equal to the difference. If yes, add the PHYs to the FlexE Group according to the difference. If no, mark the shortest path.

[0093] If the shortest path is not marked, it will be used as a backup path for the service.

[0094] For services of priority levels one, two, and three, each has its own dedicated backup channel for protection. The difference in protection modes for the three priorities lies in the transmission method on the backup channel. Therefore, the backup channel planning for all three services can use the same path planning algorithm. The core of the path planning algorithm is to allocate PHYs on the FlexEGroup in segments. The specific steps are as follows:

[0095] 1. Input service flow f(S,D), the bandwidth required by this service flow is γ. f Let S be the physical topology Γ(N,E) and the main route R; where S is the starting point of the service flow, D is the ending point of the service flow, N is the set of nodes in the physical topology, and E is the set of edges in the physical topology.

[0096] 2. On the physical topology Γ(N,E), remove all nodes (except end nodes) and associated edges of R from the main routing graph to obtain a new physical topology Γ used to calculate the alternative routes. r (N',E');

[0097] 3. Use the K-connection shortest path routing algorithm to calculate the set P of K available shortest paths for the service flow f(S,D). a ;

[0098] 4. Traverse the set of shortest paths P a For each shortest path p, the FlexE physical nodes on the shortest path are used as delimiters to divide path p into multiple segments Seg(m,n) in order; where m is the source node of the segment and n is the destination node of the segment, and each segment is traversed in order.

[0099] 5. Select the FlexE Group between nodes m and n. If no FlexE Group exists between nodes m and n, proceed to step 8. If a FlexE Group exists between nodes m and n, check the available capacity (cap) of the PHYs within the FlexE Group. g If cap g ≥γ f If yes, proceed to step 6; otherwise, proceed to step 7.

[0100] 6. (Jump to this step from the condition in step 5) Assign the business flow to the FlexE Group between nodes m and n, then jump to step 9;

[0101] 7. (Jump to this step from the condition in step 5) Determine the available capacity of PHYs that need to be increased. If there is enough available capacity of PHYs between nodes m and n, add it to the FlexE Group and jump to step 9.

[0102] 8. (Jump to this step from the condition in step 5) If there is no FlexE Group between nodes m and n, but there is enough available PHY capacity between nodes m and n, then create a new FlexE Group and bind the required available PHY capacity; if there is not enough available PHY capacity between nodes m and n, it means that the shortest path is not feasible, and continue to check the next shortest path.

[0103] 9. If the shortest path is not marked as infeasible, then the shortest path is considered feasible, and the path is returned as a backup path for the business; otherwise, continue to check the next shortest path.

[0104] Based on the above embodiments, the step of determining the priority of a service according to the preset maximum latency and preset minimum reliability corresponding to the service in this embodiment further includes:

[0105] If the preset maximum latency is less than the seventh preset threshold and the preset minimum reliability is greater than the eighth preset threshold, the priority of the service is determined to be the fourth priority.

[0106] If the preset maximum latency is less than the ninth preset threshold and the preset minimum reliability is greater than the tenth preset threshold, the priority of the service is determined to be the fifth priority.

[0107] Among them, the fifth preset threshold, the seventh preset threshold, and the ninth preset threshold increase sequentially;

[0108] The sixth preset threshold, the eighth preset threshold, and the tenth preset threshold decrease sequentially.

[0109] This embodiment also categorizes different services into fourth and fifth priorities based on their varying latency and reliability requirements. The priorities of the third, fourth, and fifth priorities decrease sequentially.

[0110] Based on the above embodiments, the protection mode corresponding to the fourth priority in this embodiment is the shared path protection mode;

[0111] The protection mode corresponding to the fifth priority is that the services of the fifth priority are not protected, and the services of the fifth priority are transmitted by the backup channels when the services of the second priority and the third priority are idle.

[0112] The path protection strategy has not only two protection modes, 1+1 and 1:1, but 1:1 can also be extended to 1:N, which means that N working paths are protected by a backup path.

[0113] This protection strategy can be further extended to the M:N protection mode, where N working paths are protected by M backup paths.

[0114] M:N protection mode is also known as Shared-Path Protection (SPP) mode. In shared-path protection, when the primary path fails at different times, the backup path can share a portion of the link capacity. Therefore, capacity is utilized more efficiently in shared-path protection.

[0115] Multiple backup paths can share bandwidth and resources in the following situations: (1) Node sharing, the node cannot be a node used by any primary route; (2) Bandwidth sharing, the primary routes corresponding to different backup paths cannot use the same link.

[0116] The protection strategy for the fifth priority service is to provide no protection for it. When there are no unused links with sufficient bandwidth in the network, the backup channel resources of the second and third priority services during off-peak hours can be used for service flow transmission. This level of service is characterized by very low reliability and latency requirements, such as browsing novels or news websites, where rapid recovery is not required when a link fails.

[0117] Based on the above embodiments, such as Figure 3 The step of planning the backup path in the protection mode based on the bandwidth corresponding to the service flow in this embodiment includes:

[0118] On the main routing graph of the physical topology of the FlexE network, remove the main route used by the main channel corresponding to the service and the edges associated with the nodes traversed by the main route to obtain a new physical topology;

[0119] Based on the new physical topology, the K-connection shortest path routing algorithm determines multiple shortest paths for the service flow and traverses each shortest path.

[0120] Based on the FlexE physical nodes on the shortest path, the shortest path is divided into multiple segments;

[0121] If no FlexE Group exists in each segment, determine whether the available capacity of the PHYs in each segment is greater than or equal to the bandwidth corresponding to the service flow. If so, create a new FlexE Group and bind the PHYs to the new FlexE Group according to the bandwidth. If not, mark the shortest path.

[0122] If the FlexE Group exists in each segment, determine whether the shareable capacity of the PHYs in the FlexE Group meets a preset condition; the preset condition is that the shareable capacity does not serve the main route and the backup routes corresponding to the services of the first priority, the second priority and the third priority, and the main paths corresponding to the services of the fourth priority that share the shareable capacity are different.

[0123] If the shareable capacity meets the preset conditions, then multiple backup channels of the service share the shareable capacity. If the shareable capacity is less than the bandwidth corresponding to the service flow, the difference between the bandwidth and the shareable capacity is determined, and it is determined whether the available capacity of PHYs in each segment is greater than or equal to the difference. If yes, a new FlexE Group is created, and the PHYs are bound to the new FlexE Group according to the difference. If no, the shortest path is marked.

[0124] If the shareable capacity does not meet the preset condition, then determine whether the available capacity of the PHYs in the FlexE Group is greater than or equal to the bandwidth corresponding to the service flow. If yes, then allocate the service flow to the FlexE Group. If no, then determine the difference between the bandwidth and the available capacity, and determine whether the available capacity of the PHYs in each segment is greater than or equal to the difference. If yes, then add the PHYs to the FlexE Group according to the difference. If no, then mark the shortest path.

[0125] If the shortest path is not marked, it will be used as a backup path for the service.

[0126] For fourth-priority services, when calculating multiple fourth-priority service protection routes, the PHY on the FlexEGroup is allocated in segments, and the resources on multiple service routes that meet the sharing requirements are optimized.

[0127] For a bandwidth requirement d of h, under shared protection, if the shareable capacity c of the spare channel already allocated to link segment e is at least h, the spare channel for requirement d on link segment e will not require additional capacity allocation; otherwise, in all other cases, additional capacity hc is required. The routing planning algorithm for fourth priority services is as follows:

[0128] 1. Input the service flow f(S,D), physical topology Γ(N,E), and main route R;

[0129] 2. On the physical topology Γ(N,E), remove all nodes (except end nodes) and associated edges from the main routing graph R to obtain a new physical topology Γ used to calculate the alternative routes. r (N',E');

[0130] 3. The K-connection shortest path routing algorithm calculates the set of available shortest paths P for the service flow f(S,D). a ;

[0131] 4. Traverse the set of shortest paths P a For each shortest path in the code, based on the FlexE nodes on the shortest path, divide the shortest path p into multiple segments Seg(m,n) in order, where m is the source node of the segment and n is the destination node of the segment, and traverse each segment in order.

[0132] 5. Select the FlexE Group between nodes m and n. If a FlexE Group exists between nodes m and n, check the shareable capacity (cap) of the PHYs in the FlexE Group. s ;

[0133] 6. If the shareable capacity is cap s If the capacity is not used for any primary route or backup routes for first, second, or third priority services, and the primary paths of the fourth priority service set sharing this capacity are different, proceed to step 7; otherwise, proceed to step 8.

[0134] 7. If cap s ≥γ f If the capacity is shared, proceed to step 5 and continue checking the next segment, Seg(m,n). If cap s <γ f Share this capacity, γ f =γ f -cap s And jump to step 10;

[0135] 8. Check the available capacity (cap) of PHYs in the FlexE Group. g If cap g >γ f Distribute the business flow to the FlexE Group between nodes m and n; if cap g <γ f Determine the available capacity of the PHYs that needs to be increased;

[0136] 9. If there is enough available PHY capacity between nodes m and n, add it to the FlexE Group; if there is not enough available PHY capacity between nodes m and n, mark the shortest path as infeasible and continue to check the next shortest path.

[0137] 10. If there is sufficient available PHY capacity between nodes m and n, create a new FlexE Group and bind the required PHYs. Otherwise, mark the shortest path as infeasible and continue checking for the next shortest path.

[0138] 11. If the entire path is not marked as infeasible and all segments (Seg) are feasible, return the shortest path as the backup path for the service; otherwise, continue to check the next shortest path.

[0139] This embodiment conducted simulation experiments on five FlexE simulated networks of different scales and topologies. In each group, hierarchical hybrid protection was performed on four different proportions of random traffic flow sets, and path planning for backup channels was performed for each traffic flow.

[0140] The experiment analyzed the bandwidth resource overhead of the protection channel, and designed comparative experiments of 1+1 protection only, 1+1 protection only and 1:1 mixed protection, as well as comparative experiments of different proportions of different levels of services.

[0141] Simulation analysis shows that the hierarchical protection strategy proposed in this embodiment improves bandwidth resource utilization efficiency by an average of 7.2% compared to 1+1 protection alone, and by an average of 5.6% compared to a hybrid 1+1 and 1:1 protection approach. The proposed solution in this embodiment achieves good optimization of bandwidth resource utilization while ensuring reliability.

[0142] To evaluate the performance of the proposed scheme in this embodiment, it is necessary to calculate the network bandwidth utilization for multiple sets of data streams from various service levels. A comparison was made between two protection schemes: 1+1 protection only, and a hybrid 1+1 and 1:1 protection scheme. The 1+1 and 1:1 hybrid protection scheme refers to 1+1 protection for first and second priority services, 1:1 protection for third and fourth priority services, and no protection required for fifth priority services, which can be transmitted using the idle backup channel.

[0143] For example, the experiment used 200, 400, and 600 traffic flows as the total traffic flow, respectively, and adjusted the proportion of traffic flows at each priority level to observe the relationship between the traffic volume ratio and bandwidth resource utilization. The proportions of the first, second, third, fourth, and fifth priorities were 1:1:1:1:1, 1:1:2:6:10, 1:1:6:12:20, and 1:1:8:15:25, respectively. The experiment showed that the larger the proportion of the fifth priority traffic flow, the more likely it is to utilize the spare channel resources of the second and third priority traffic flows, thereby improving bandwidth resource utilization.

[0144] It can also be inferred that as the total volume of fifth-priority traffic increases to a certain extent, enough to fill the available backup channels for second and third-priority traffic, bandwidth will not be saved further, and resource utilization will reach its maximum. Furthermore, the higher the proportion of fourth-priority traffic, the more likely it is to share bandwidth resources among peers, thereby improving bandwidth resource utilization.

[0145] Sharing efficiency refers to the capacity gain obtained through sharing, that is, the gain from using shared protection instead of dedicated protection. The sharing efficiency is calculated as the ratio of the difference between the shared backup capacity and the total dedicated backup capacity under the strategy implemented in this embodiment, to the dedicated backup capacity without sharing. The latter is calculated by disabling the capacity sharing strategy and reserving dedicated capacity on the configured backup path, as shown in the following formula:

[0146]

[0147] Where, ∑BW dedicated This indicates that all backups using dedicated protection methods are implemented, i.e., the sum of backup capacities for 1+1 protection; ∑BW shared This represents the sum of backup capacities shared by the hybrid method implemented in this embodiment.

[0148] The reason for comparing the hierarchical sharing method of this embodiment with the dedicated protection (1+1 protection) method is that the dedicated protection method is a redundancy method widely used in current FlexE channel technology. Furthermore, this comparison helps to demonstrate the improvements made in this embodiment based on the dedicated backup capacity method. The optimization scheme can improve sharing efficiency by 20% to 65% by utilizing backup paths.

[0149] Based on the above conditions, the comparative experiment was set up with a dedicated protection scheme (1+1 protection) for all levels of services, while a 1:1 hybrid protection scheme was used for the third and fourth priority services. This scheme resulted in a 20% to 40% reduction in bandwidth utilization, demonstrating a significant improvement in resource savings. The hierarchical protection method is indeed effective in saving bandwidth resources. The bandwidth utilization calculation method is as follows:

[0150]

[0151] Among them, BW service Refers to the bandwidth required for the service, N backup C refers to the number of links in the backup channel. max This refers to the maximum bandwidth of the link.

[0152] The flexible Ethernet hierarchical service protection path planning device provided by the present invention is described below. The flexible Ethernet hierarchical service protection path planning device described below can be referred to in correspondence with the flexible Ethernet hierarchical service protection path planning method described above.

[0153] like Figure 4 As shown, the device includes a grading module 401, a determination module 402, and a planning module 403, wherein:

[0154] The grading module 401 is used to determine the priority of the service based on the preset maximum latency and preset minimum reliability corresponding to the service;

[0155] The determining module 402 is used to determine the protection mode corresponding to the priority, wherein the priority is pre-associated with the protection mode;

[0156] The planning module 403 is used to plan the backup path in the protection mode based on the bandwidth corresponding to the service flow of the service and the path planning algorithm.

[0157] This embodiment divides services into different priority levels based on their varying latency and reliability requirements, and employs different protection modes for services with different priorities to provide differentiated protection. This satisfies the diverse protection needs of different services, ensuring reliable service transmission while reducing waste of network resources and improving network resource utilization. Furthermore, it plans the optimal backup path for tasks based on the bandwidth required by the service flow and allocates network resources, thereby optimizing the overall resource utilization of the FlexE network.

[0158] Figure 5 An example is a schematic diagram of the physical structure of an electronic device, such as... Figure 5 As shown, the electronic device may include a processor 510, a communications interface 520, a memory 530, and a communication bus 540. The processor 510, communications interface 520, and memory 530 communicate with each other via the communication bus 540. The processor 510 can call logical instructions in the memory 530 to execute a flexible Ethernet hierarchical service protection path planning method. This method includes: determining the priority of the service based on a preset maximum latency and a preset minimum reliability; determining the protection mode corresponding to the priority, wherein the priority is pre-associated with the protection mode; and planning a backup path in the protection mode based on a path planning algorithm according to the bandwidth corresponding to the service flow.

[0159] Furthermore, the logical instructions in the aforementioned memory 530 can be implemented as software functional units and, when sold or used as independent products, can be stored in a computer-readable storage medium. Based on this understanding, the technical solution of the present invention, essentially, or the part that contributes to the prior art, or a 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 the present invention. The aforementioned storage medium includes various media capable of storing program code, such as USB flash drives, portable hard drives, read-only memory (ROM), random access memory (RAM), magnetic disks, or optical disks.

[0160] On the other hand, the present invention also provides a computer program product, which includes a computer program that can be stored on a non-transitory computer-readable storage medium. When the computer program is executed by a processor, the computer can execute the flexible Ethernet hierarchical service protection path planning method provided by the above methods. The method includes: determining the priority of the service based on the preset maximum latency and preset minimum reliability corresponding to the service; determining the protection mode corresponding to the priority, wherein the priority is pre-associated with the protection mode; and planning a backup path in the protection mode based on the bandwidth corresponding to the service flow of the service using a path planning algorithm.

[0161] In another aspect, the present invention also provides a non-transitory computer-readable storage medium storing a computer program thereon, which, when executed by a processor, implements a flexible Ethernet hierarchical service protection path planning method provided by the above methods. The method includes: determining the priority of the service based on a preset maximum latency and a preset minimum reliability corresponding to the service; determining a protection mode corresponding to the priority, wherein the priority is pre-associated with the protection mode; and planning a backup path in the protection mode based on a path planning algorithm according to the bandwidth corresponding to the service flow of the service.

[0162] The device embodiments described above are merely illustrative. 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 network units. Some or all of the modules can be selected to achieve the purpose of this embodiment according to actual needs. Those skilled in the art can understand and implement this without any creative effort.

[0163] Through the above description of the embodiments, those skilled in the art can clearly understand that each embodiment can be implemented by means of software plus necessary general-purpose hardware platforms, and of course, it can also be implemented by hardware. Based on this understanding, the above technical solutions, in essence or the part that contributes to the prior art, can be embodied in the form of a software product. This computer software product can be stored in a computer-readable storage medium, such as ROM / RAM, magnetic disk, optical disk, etc., and includes several instructions to cause a computer device (which may be a personal computer, server, or network device, etc.) to execute the methods described in the various embodiments or some parts of the embodiments.

[0164] Finally, it should be noted that the above embodiments are only used to illustrate the technical solutions of the present invention, and not to limit them; although the present invention has been described in detail with reference to the foregoing embodiments, those skilled in the art should understand that modifications can still be made to the technical solutions described in the foregoing embodiments, or equivalent substitutions can be made to some of the technical features; and these modifications or substitutions do not cause the essence of the corresponding technical solutions to deviate from the spirit and scope of the technical solutions of the embodiments of the present invention.

Claims

1. A flexible Ethernet hierarchical service protection path planning method, characterized in that, include: The priority of the service is determined based on the preset maximum latency and preset minimum reliability corresponding to the service. Determine the protection mode corresponding to the priority, wherein the priority is pre-associated with the protection mode; Based on the bandwidth corresponding to the service flow of the service, a backup path in the protection mode is planned using a path planning algorithm; The step of planning the backup path in the protection mode based on the bandwidth corresponding to the service flow of the service, using a path planning algorithm, includes: On the main routing graph of the physical topology of the FlexE network, remove the main route used by the main channel corresponding to the service and the edges associated with the nodes traversed by the main route to obtain a new physical topology; Based on the new physical topology, the K-connection shortest path routing algorithm determines multiple shortest paths for the service flow and traverses each shortest path. Based on the FlexE physical nodes on the shortest path, the shortest path is divided into multiple segments; If no FlexE Group exists in each segment, determine whether the available capacity of the PHYs in each segment is greater than or equal to the bandwidth corresponding to the service flow. If so, create a new FlexE Group and bind the PHYs to the new FlexE Group according to the bandwidth. If not, mark the shortest path. If the FlexE Group exists in each segment, determine whether the available capacity of the PHYs in the FlexE Group is greater than or equal to the bandwidth corresponding to the service flow. If yes, allocate the service flow to the FlexE Group. If no, determine the difference between the bandwidth and the available capacity, and determine whether the available capacity of the PHYs in each segment is greater than or equal to the difference. If yes, add the PHYs to the FlexE Group according to the difference. If no, mark the shortest path. If the shortest path is not marked, it will be used as a backup path for the service.

2. The flexible Ethernet hierarchical service protection path planning method according to claim 1, characterized in that, The step of determining the priority of a service based on its preset maximum latency and preset minimum reliability includes: If the preset maximum latency is less than a first preset threshold and the preset minimum reliability is greater than a second preset threshold, the priority of the service is determined to be the first priority. If the preset maximum latency is less than the third preset threshold and the preset minimum reliability is greater than the fourth preset threshold, the priority of the service is determined to be the second priority. If the preset maximum latency is less than the fifth preset threshold and the preset minimum reliability is greater than the sixth preset threshold, the priority of the service is determined to be the third priority. Among them, the first preset threshold, the third preset threshold, and the fifth preset threshold increase sequentially; The second preset threshold, the fourth preset threshold, and the sixth preset threshold decrease sequentially.

3. The flexible Ethernet hierarchical service protection path planning method according to claim 2, characterized in that, The protection mode corresponding to the first priority is the 1+1 protection mode; The protection mode corresponding to the second priority is to use the 1+1 protection mode when the main channel and backup channel corresponding to the service are not idle; and to use the 1:1 protection mode when the main channel and backup channel are idle. The protection mode corresponding to the third priority is the 1:1 protection mode.

4. The flexible Ethernet hierarchical service protection path planning method according to claim 2, characterized in that, The step of determining the priority of a service based on its preset maximum latency and preset minimum reliability further includes: If the preset maximum latency is less than the seventh preset threshold and the preset minimum reliability is greater than the eighth preset threshold, the priority of the service is determined to be the fourth priority. If the preset maximum latency is less than the ninth preset threshold and the preset minimum reliability is greater than the tenth preset threshold, the priority of the service is determined to be the fifth priority. Among them, the fifth preset threshold, the seventh preset threshold, and the ninth preset threshold increase sequentially; The sixth preset threshold, the eighth preset threshold, and the tenth preset threshold decrease sequentially.

5. The flexible Ethernet hierarchical service protection path planning method according to claim 4, characterized in that, The protection mode corresponding to the fourth priority is the shared path protection mode; The protection mode corresponding to the fifth priority is that the services of the fifth priority are not protected, and the services of the fifth priority are transmitted by the backup channels when the services of the second priority and the third priority are idle.

6. The flexible Ethernet hierarchical service protection path planning method according to claim 4 or 5, characterized in that, The step of planning the backup path in the protection mode based on the bandwidth corresponding to the service flow of the service, using a path planning algorithm, includes: On the main routing graph of the physical topology of the FlexE network, remove the main route used by the main channel corresponding to the service and the edges associated with the nodes traversed by the main route to obtain a new physical topology; Based on the new physical topology, the K-connection shortest path routing algorithm determines multiple shortest paths for the service flow and traverses each shortest path. Based on the FlexE physical nodes on the shortest path, the shortest path is divided into multiple segments; If no FlexE Group exists in each segment, determine whether the available capacity of the PHYs in each segment is greater than or equal to the bandwidth corresponding to the service flow. If so, create a new FlexE Group and bind the PHYs to the new FlexE Group according to the bandwidth. If not, mark the shortest path. If the FlexE Group exists in each segment, determine whether the shareable capacity of the PHYs in the FlexE Group meets a preset condition; the preset condition is that the shareable capacity does not serve the main route and the backup routes corresponding to the services of the first priority, the second priority and the third priority, and the main paths corresponding to the services of the fourth priority that share the shareable capacity are different. If the shareable capacity meets the preset condition, then multiple backup channels of the service share the shareable capacity. If the shareable capacity is less than the bandwidth corresponding to the service flow, the difference between the bandwidth and the shareable capacity is determined, and it is determined whether the available capacity of PHYs in each segment is greater than or equal to the difference. If so, a new FlexE Group is created, and the PHYs are bound to the new FlexE Group according to the difference. If not, the shortest path is marked. If the shareable capacity does not meet the preset condition, then determine whether the available capacity of the PHYs in the FlexE Group is greater than or equal to the bandwidth corresponding to the service flow. If yes, then allocate the service flow to the FlexE Group. If no, then determine the difference between the bandwidth and the available capacity, and determine whether the available capacity of the PHYs in each segment is greater than or equal to the difference. If yes, then add the PHYs to the FlexE Group according to the difference. If no, then mark the shortest path. If the shortest path is not marked, it will be used as a backup path for the service.

7. A flexible Ethernet hierarchical service protection path planning device, characterized in that, include: The hierarchical module is used to determine the priority of the service based on the preset maximum latency and preset minimum reliability corresponding to the service. A determination module is used to determine the protection mode corresponding to the priority, wherein the priority is pre-associated with the protection mode; The planning module is used to plan the backup path in the protection mode based on the bandwidth corresponding to the service flow of the service and the path planning algorithm. The step of planning the backup path in the protection mode based on the bandwidth corresponding to the service flow of the service, using a path planning algorithm, includes: On the main routing graph of the physical topology of the FlexE network, remove the main route used by the main channel corresponding to the service and the edges associated with the nodes traversed by the main route to obtain a new physical topology; Based on the new physical topology, the K-connection shortest path routing algorithm determines multiple shortest paths for the service flow and traverses each shortest path. Based on the FlexE physical nodes on the shortest path, the shortest path is divided into multiple segments; If no FlexE Group exists in each segment, determine whether the available capacity of the PHYs in each segment is greater than or equal to the bandwidth corresponding to the service flow. If so, create a new FlexE Group and bind the PHYs to the new FlexE Group according to the bandwidth. If not, mark the shortest path. If the FlexE Group exists in each segment, determine whether the available capacity of the PHYs in the FlexE Group is greater than or equal to the bandwidth corresponding to the service flow. If yes, allocate the service flow to the FlexE Group. If no, determine the difference between the bandwidth and the available capacity, and determine whether the available capacity of the PHYs in each segment is greater than or equal to the difference. If yes, add the PHYs to the FlexE Group according to the difference. If no, mark the shortest path. If the shortest path is not marked, it will be used as a backup path for the service.

8. An electronic device comprising a memory, a processor, and a computer program stored in the memory and executable on the processor, characterized in that, When the processor executes the program, it implements the flexible Ethernet hierarchical service protection path planning method as described in any one of claims 1 to 6.

9. A non-transitory computer-readable storage medium having a computer program stored thereon, characterized in that, When the computer program is executed by the processor, it implements the flexible Ethernet hierarchical service protection path planning method as described in any one of claims 1 to 6.

Images