WO2021031986A1

WO2021031986A1 - Method for fast slicing of carrier network

Info

Publication number: WO2021031986A1
Application number: PCT/CN2020/109048
Authority: WO
Inventors: 白泽刚; 汪俊芳
Original assignee: 烽火通信科技股份有限公司
Priority date: 2019-08-21
Filing date: 2020-08-14
Publication date: 2021-02-25
Also published as: BR112022001774A2

Abstract

The present invention relates to the technical field of network management, and disclosed is a method for the fast slicing of a carrier network, comprising the following steps: S1, planning a carrier slice service, entering a slice type and service UNI node pair information, and generating a service UNI node pair information list; S2, according to the slice type, generating a tunnel layer topology in a regional topology range; S3, according to the service UNI node pair information, cyclically performing multipath pathfinding between service UNI node pairs; and S4, comprehensively calculating a virtual node and a virtual link produced by multipath calculation so as to generate a recommended slice. The purpose of the present invention is to provide a method for quickly creating carrier network slices. The automated creation of carrier network slices may be achieved, and compared with the manual creation means in the prior art, operation and maintenance efficiency is greatly improved.

Description

A method for fast slicing bearing network

Technical field

The invention relates to the technical field of network management management, in particular to a method for fast slicing of a bearing network.

Background technique

The 5G bearer network is part of the 5G end-to-end service path and must meet different service requirements in multiple scenarios. At the same time, 5G is an open network that can provide application requirements for vertical industries and leasing services. In this scenario, bearer network support is required The service isolation and independent operation and maintenance requirements of the 5G fragmented network allocate different types of bearer network fragments for different types of services. In practical applications, if a dedicated network is established for each business service, the cost will be unimaginable. The network slicing technology allows operators to segment multiple virtual end-to-end networks in a hardware infrastructure. Each network slice is logically isolated on the forwarding plane, control plane, and management plane, and adapts to various types of services. And to meet the different needs of users.

With the rapid development of 5G network technology, in accordance with the standard requirements of the 3GPP organization, 5G networks need to provide end-to-end network slicing for vertical application industries. This requirement is specifically decomposed to 5G bearer networks that must provide 5G bearer network slicing functions. 5G bearer network slicing is a new function for bearer networks and has not been clearly stipulated in related protocols.

There are many ways to implement network slicing in existing solutions, such as SDN-based control plane slicing and FlexE-based forwarding plane slicing technology. However, the implementation of related network slicing methods in the prior art requires manual creation by technical personnel, and operation and maintenance The efficiency is low and practical application is difficult.

Summary of the invention

In view of the defects in the prior art, the purpose of the present invention is to provide a method for fast slicing of the bearer network, which can realize the automatic creation of bearer network slices, which greatly improves the operation and maintenance efficiency compared with the manual creation method in the prior art. .

In order to achieve the above objectives, the technical solution adopted by the present invention is:

A method for rapid slicing of a bearer network includes the following steps:

S1. Plan to carry slice service, enter slice type and service UNI node pair information, generate service UNI node pair information list; S2, generate tunnel layer topology in the area topology range according to slice type; S3, cycle according to service UNI node pair information Perform multipath path finding between business UNI node pairs; S4, comprehensively calculate the virtual nodes and virtual links generated by the multipath calculation, and generate recommended slices.

On the basis of the above technical solution, when planning to carry slice services, if the network scale is large, estimate the topology range of the slice to be carried, and specify a topology area larger than the estimated topology range of the slice in the network topology diagram; for example, network If the scale is smaller, the entire network managed by the network management system is taken as the regional network topology.

On the basis of the above technical solution, the slice types in step S1 include FlexE tunnel slices, SR tunnel slices, L2VPN slices, L3VPN slices, and enhanced VPN slices.

On the basis of the above technical solution, the service UNI node pair information in step S1 includes service UNI node pair information, source node, source UNI port, sink node, sink UNI port, bandwidth, maximum delay, and protection level.

On the basis of the above technical solution, step S3 specifically includes:

According to the service UNI node pair information list, use the path finding algorithm to find multiple paths that meet the bandwidth and delay requirements; select the reserved path according to the total number of paths; save all the node and link information on the reserved path into the MAP mapping table , The MAP mapping table records the keywords including the sequence numbers of the service UNI node pairs; the multi-path path finding is completed for all service UNI node pairs cyclically.

On the basis of the above technical solution, when the reserved paths are selected according to the total number of paths, for example, when the total number of paths> 3 and the protection level is lower than permanent protection, 3 optimal paths are reserved; if the protection level is permanent protection or path When the total number is ≤3, all paths are reserved.

On the basis of the above technical solution, step S3 specifically includes:

Perform cyclic comparison on the MAP mapping table generated in step S3 to remove duplicate virtual node and virtual link information, and generate a virtual link table with no duplicate information; refresh and calculate the bandwidth sum of duplicate virtual links; according to the no duplication information The virtual link table of and the bandwidth sum to generate a recommended bearer slice.

On the basis of the above technical solution, after step S4, it further includes: S5. Manually adjust the virtual node and the virtual link to complete the bearer slice creation.

On the basis of the above technical solution, the step S5 specifically includes:

S51. Determine whether a manual modification switch instruction is received, if yes, go to step S52, if not, go to step S53; S52, manually add or delete virtual nodes and virtual links; S53, generate virtual nodes and virtual links that bear slices Table and associate tenant information to complete the creation of bearer slices.

On the basis of the above technical solution, the step of manually adding virtual nodes and virtual links includes: providing all virtual nodes and virtual links in the regional topology; manually selecting virtual nodes in batches on the regional topology and adding the virtual links to step S4 In the generated virtual node and virtual link table;

The step of manually deleting virtual nodes and virtual links includes: displaying the virtual node and virtual link table generated in S4; manually removing the virtual nodes and virtual links from the slice.

Compared with the prior art, the advantages of the present invention are:

(1) The method for rapid slicing of the bearer network of the present invention provides a specific and implementable automatic and fast slicing method, which can specify the area network topology before calculation, avoiding large-scale irrelevant calculations, improving calculation efficiency, and realizing slicing of the bearer The information of virtual nodes and virtual links is fully automated, and the creation of bearer slices is quickly completed.

(2) The method for fast slicing of the bearer network of the present invention can support multiple constraints on quality requirements such as slicing type and bandwidth, delay, protection level, etc., to meet tenants' requirements for bearer slicing, and perform slicing services before creating bearer slices. Planning can avoid frequent adjustments after slice generation.

(3) The method for rapid slicing of the bearer network of the present invention provides an opportunity to automatically create slices and manually adjust virtual nodes and virtual links, which can meet more flexible user needs. At the same time, this step can be adjusted as an optional step in actual operation. It can meet the requirements of automatic creation efficiency of bearer slices and flexibility of users.

Description of the drawings

Fig. 1 is a flowchart of a method for fast slicing a bearer network in an embodiment of the present invention.

detailed description

The present invention will be further described in detail below in conjunction with the drawings and embodiments.

As shown in FIG. 1, an embodiment of the present invention provides a method for fast slicing a bearer network. The method includes the following steps:

S1. Plan to carry slice service, enter slice type and service UNI node pair information, and generate service UNI node pair information list;

S2. Generate a tunnel layer topology in the area topology according to the slice type;

S3. According to the service UNI node pair information, cyclically perform multipath path finding between the service UNI node pairs;

S4. Comprehensively calculate the virtual nodes and virtual links generated by the multi-path calculation to generate recommended slices.

The solution provides a specific and implementable automatic and fast slice creation method, which can specify the regional network topology before calculation, avoid large-scale irrelevant calculations, improve calculation efficiency, and realize fully automatic calculation of virtual nodes and virtual links that carry slices. , Quickly complete the creation of bearing slices.

In one embodiment, when planning the bearer slice service in step S1, the bearer slice range can be estimated according to the network scale to avoid large-scale irrelevant calculations and improve calculation efficiency; for example, the network scale is larger (in a specific embodiment, if the number of physical nodes is greater than If it is equal to 1000, or the number of physical connections is greater than or equal to 5000, the network is considered to be a large-scale network management scenario, otherwise it is a small-scale network scenario), then the topology range of the bearer slice is estimated and specified in the network topology diagram by manual delineation, etc. A topology area larger than the topology range of the estimated bearing slice; if the network scale is small, the entire network managed by the network management system is automatically taken as the area network topology.

In one embodiment, inputting slice type and service UNI node pair information, and generating the content of the service UNI node pair information list specifically includes:

The entered slice types include slice types including FlexE tunnel slices, SR tunnel slices, L2VPN slices, L3VPN slices and enhanced VPN slices, etc., which can be selected by the user according to their needs.

The entered service UNI node pair information includes service UNI node pair information, source node, source UNI port, sink node, sink UNI port, bandwidth, maximum delay, protection level and other quality requirements.

The specific entered business UNI node pair information is shown in the following table:

Subsequently, according to the information in the above table, a list of service UNI node pair information can be generated and stored.

In one embodiment, after the service UNI node pair information list is generated, the user can select a tenant from the existing tenant list of the network management system as the tenant manager that bears the slice, complete the tenant information setting and specify the slice tenant information.

In an embodiment, step S3 specifically includes:

According to the service UNI node pair information list, use the path finding algorithm to find multiple paths that meet the bandwidth and delay requirements; select the reserved path according to the total number of paths; save all the node and link information on the reserved path to the service UNI node In the MAP mapping table with the sequence number as the key, the multi-path path finding is completed for all service UNI nodes in a loop. The path finding algorithm used in the present invention can be specifically executed using algorithms such as the A-Star algorithm.

Specifically, when selecting reserved paths based on the total number of paths, for example, when the total number of paths is> 3 and the protection level is lower than permanent protection, 3 optimal paths are reserved; if the protection level is permanent protection or the total number of paths is ≤ 3, Keep all paths. In a preferred embodiment, when the protection level is permanent protection, but the total number of paths is greater than 10, a maximum of 10 paths are reserved.

In another embodiment, step S4 may specifically include:

Perform a cyclic comparison on the MAP mapping table generated in step S3 to remove duplicate virtual node and virtual link information, and generate a virtual link table without duplicate information; refresh and calculate the bandwidth sum of the repeated virtual link, regardless of the virtual link in this step. Whether the link is duplicated or not must be calculated. The main reason is that although the duplicated virtual nodes and link objects are removed, the bandwidth demand is still there. Therefore, these bandwidths must be added up to calculate the sum of the bandwidths; for example, in an embodiment The virtual link appears on the path of service UNI node sequence number 1 and also appears on the path of service UNI node sequence number 2. The bandwidth requirement of each service UNI node pair is 500M, and the total bandwidth of the virtual link after calculation is 1000M.

Finally, according to the virtual link table without duplicate information and the bandwidth sum, a recommended bearer slice is generated.

In another embodiment, after step S1, the user manually selects whether the automatically created slice needs to be manually modified. Specifically, an optional drop-down list can be provided to the user in the network management system, and the user can manually select whether the automatically created slice needs to be manually modified. Initially, the options "can be modified" and "not modified" can be set, and the default value is set to "Can be modified". When the slice selected to be automatically created in this step needs to be manually modified, after step S4, it also includes: S5. Manually adjust the virtual node and the virtual link to complete the bearer slice creation.

Specifically, the step S5 may include:

S51. Judge whether a manual modification switch instruction is received, if yes, go to step S52, if no, go to step S53;

S52. Manually add or delete virtual nodes and virtual links; wherein the steps of manually adding virtual nodes and virtual links include: providing all virtual nodes and virtual links in the regional topology; the user manually selects virtual nodes and virtual links in batches on the regional topology The path is added to the virtual node and virtual link table generated in step S4; the step of manually deleting the virtual node and virtual link includes: displaying the virtual node and virtual link table generated in S4; the user manually removes the virtual node and virtual link table from the slice. Nodes and virtual links.

S53. Generate a virtual node and virtual link table that bears the slice, and associate tenant information to complete the creation of the bearer slice.

The present invention is not limited to the above-mentioned embodiments. For those of ordinary skill in the art, without departing from the principle of the present invention, several improvements and modifications can be made, and these improvements and modifications are also regarded as the protection of the present invention. Within range. The content not described in detail in this specification belongs to the prior art known to those skilled in the art.

Claims

A method for rapid slicing of a bearer network is characterized in that it comprises the following steps:

S1. Plan to carry slice service, enter slice type and service UNI node pair information, and generate service UNI node pair information list;

S2. Generate a tunnel layer topology in the area topology according to the slice type;

S3. According to the business UNI node pair information, cyclically perform multipath path finding between the business UNI node pairs;

S4. Comprehensively calculate the virtual nodes and virtual links generated by the multi-path calculation to generate recommended slices.
The method for rapid slicing of a bearer network according to claim 1, characterized in that: when planning to bear sliced services, if the network scale is large, the topology range of the bearer slice is estimated, and the network topology map specifies that it is larger than the estimated bearer The topology area of the sliced topology range; if the network scale is small, the entire network managed by the network management system is taken as the area network topology.
The method for rapid slicing of the bearer network according to claim 1, wherein the slice types in step S1 include FlexE tunnel slices, SR tunnel slices, L2 VPN slices, L3 VPN slices, and enhanced VPN slices.
The method for fast slicing a bearer network according to claim 1, wherein the service UNI node pair information in step S1 includes service UNI node pair information, source node, source UNI port, sink node, sink UNI port, bandwidth , Maximum delay and protection level.
The method for rapid slicing of a bearer network according to claim 1, wherein step S3 specifically includes:

According to the service UNI node pair information list, use a path finding algorithm to find multiple paths that meet the bandwidth and delay requirements;

Select the reserved path according to the total number of paths;

Save all node and link information on the reserved path in a MAP mapping table, where the MAP mapping table records keywords including the sequence number of the service UNI node pair;

Complete multi-path path finding for all service UNI nodes in a loop.
The method for rapid slicing of the bearer network according to claim 5, wherein when the reserved paths are selected according to the total number of paths, for example, when the total number of paths is greater than 3, and the protection level is lower than permanent protection, 3 optimal paths are reserved. Path; if the protection level is permanent protection or the total number of paths is ≤3, all paths are reserved.
The method for fast slicing a bearer network according to claim 5, wherein step S3 specifically includes:

Perform a round-robin comparison on the MAP mapping table generated in step S3, remove duplicate virtual nodes and virtual link information, and generate a virtual link table without duplicate information;

Refresh and calculate the bandwidth sum of repeated virtual links;

According to the virtual link table without duplicate information and the bandwidth sum, a recommended bearer slice is generated.
The method for rapid slicing of a bearer network according to claim 1, characterized in that, after step S4, it further comprises: S5. Manually adjust the virtual node and the virtual link to complete the bearer slice creation.
The method for fast slicing a bearer network according to claim 8, wherein the step S5 specifically includes:

S51. Judge whether a manual modification switch instruction is received, if yes, go to step S52, if no, go to step S53;

S52. Manually add or delete virtual nodes and virtual links;

S53. Generate a virtual node and virtual link table that bears the slice, and associate tenant information to complete the creation of the bearer slice.
The method for rapid slicing of a bearer network according to claim 9, characterized in that:

The step of manually adding virtual nodes and virtual links includes: providing all virtual nodes and virtual links in the regional topology; manually selecting virtual nodes in batches on the regional topology and adding the virtual links to the virtual nodes and virtual links generated in step S4 In the table

The step of manually deleting virtual nodes and virtual links includes: displaying the virtual node and virtual link table generated in S4; manually removing the virtual nodes and virtual links from the slice.