Method for slicing WAPI (Wireless Local Authentication and Privacy Infrastructure) power local wireless network based on

Abstract

The invention provides a slicing method of a WAPI power local wireless network based on QoS requirements, and belongs to the technical field of power networks. Comprising the following steps: constructing a directed graph according to a network topology of a WAPI power local wireless network; constructing traffic matrixes and time delay matrixes of different application scenarios according to the QoS application scenarios; constructing a network slice model; sequentially selecting a target application scene and a traffic matrix and a time delay matrix of the target application scene according to the priority of the application scenes; and solving the network slicing model by using the traffic matrix and the time delay matrix of the target application scene, and carrying out network slicing on the target application scene. According to the method, the WAPI power local wireless network is sliced, the network is tailored in a customized manner according to service scene requirements, flexible network element networking is realized, the service process and the data routing are optimized, and the utilization of network resources is optimized.

Description

Technical Field

[0001] The present invention belongs to the technical field of electric power networks, and in particular relates to a slicing method for a WAPI electric power local wireless network based on QoS requirements. Background Art

[0002] WAPI (WLAN Authentication and Privacy Infrastructure) is a wireless LAN security standard. Different from the one-way encryption authentication of traditional Wi-Fi, WAPI adopts two-way encryption authentication, which can provide more reliable and comprehensive security protection than Wi-Fi. In recent years, it has been widely promoted and applied in the power industry.

[0003] In the WAPI power local wireless network, network slicing technology can be used to perform security control on the accessed terminals. In order to achieve hierarchical power communication service QoS (Quality of Service) optimization control, a network slicing technology based on QoS requirements is needed. Summary of the invention

[0004] In view of the deficiencies in the prior art, the present invention provides a slicing method for a WAPI power local wireless network based on QoS requirements.

[0005] In order to solve one, part or all of the above technical problems, the technical solution adopted by the present invention is: A slicing method for a WAPI power local wireless network based on QoS requirements comprises: constructing a directed graph according to the network topology of the WAPI power local wireless network; constructing a traffic matrix and a delay matrix of different application scenarios according to QoS application scenarios; constructing a network slicing model; selecting a target application scenario and the traffic matrix and the delay matrix of the target application scenario in turn according to the priority of the application scenarios; solving the network slicing model by using the traffic matrix and the delay matrix of the target application scenario, and performing network slicing for the target application scenario.

[0006] Furthermore, the directed graph is represented as , V is the node set, which represents the set of all forwarding nodes in the network topology; E is the edge set, which represents all links in the network topology. Each edge is a four-tuple, which includes the two endpoints of the link, the available bandwidth of the link, and the transmission delay.

[0007] Furthermore, the traffic matrix of the kth application scenario is expressed as , where n represents the number of sink nodes in the network topology, Represents the total bandwidth requirement of the aggregated traffic from edge aggregation source node i to edge aggregation destination node j in application scenario k.

[0008] Furthermore, the delay matrix of the kth application scenario is expressed as , where n represents the number of sink nodes in the network topology, Represents the total latency requirement of the aggregated traffic from edge aggregation source node i to edge aggregation destination node j in application scenario k.

[0009] Furthermore, the objective function of the network slicing model is expressed as , ; The constraints of the network slicing model include delay constraints, capacity constraints, flow conservation constraints and demand constraints; Represented as the edges of the directed graph, ; k is the number of converging flows, and converging flow i is expressed as ,in and is the source and sink of the converging flow i, is the amount of data; For the convergence flow i at the edge The flow rate on is the unit cost of traffic.

[0010] Furthermore, the delay constraint is expressed as , d is the delay threshold of application scenario q.

[0011] Furthermore, the capacity constraint is expressed as .

[0012] Furthermore, the flow conservation constraint is expressed as , .

[0013] Furthermore, the demand constraint is expressed as .

[0014] Compared with the prior art, the present invention has the following beneficial effects: The present invention performs network slicing on the WAPI power local wireless network, customizes the network according to business scenario requirements, implements flexible network element networking, optimizes business processes and data routing, and optimizes the utilization of network resources. Network slicing can meet the dynamic needs of users, enabling the network to dynamically allocate resources, thereby improving the utilization of network resources.

[0015] Network slicing can also achieve security control of terminals. When an abnormality occurs, other service slices are protected from being affected by blocking the corresponding slice. Different slices can deploy different network QoS, network functions and security services, isolate the resources of different terminals on the network, and better ensure the security of different services and terminal services through access rights control. DETAILED DESCRIPTION

[0016] In order to better understand the present invention, the content of the present invention is further clearly set forth in conjunction with the embodiments below, but the protection content of the present invention is not limited to the following embodiments. In the following description, a large number of specific details are provided in order to provide a more thorough understanding of the present invention. However, it is obvious to those skilled in the art that the present invention can be implemented without one or more of these details.

[0017] Embodiment 1: The purpose of this embodiment is to provide a slicing method for a WAPI power local wireless network based on QoS requirements.

[0018] S1. Construct a directed graph based on the network topology of the WAPI power local wireless network.

[0019] The directed graph representation of the network topology is , V is the node set, which represents the set of all forwarding nodes in the network topology; E is the edge set, which represents all links in the network topology. Each edge is a four-tuple, which includes the two endpoints of the link, the available bandwidth of the link, and the transmission delay.

[0020] S2. Construct traffic matrices and delay matrices for different application scenarios based on QoS application scenarios.

[0021] The traffic matrix of the kth application scenario is expressed as , where n represents the number of sink nodes in the network topology, Represents the total bandwidth requirement of the aggregated traffic from edge aggregation source node i to edge aggregation destination node j in application scenario k. Obtained through analysis of historical traffic.

[0022] The delay matrix of the kth application scenario is expressed as , where n represents the number of sink nodes in the network topology, Represents the total latency requirement of the aggregated traffic from edge aggregation source node i to edge aggregation destination node j in application scenario k. Obtained through analysis of historical traffic.

[0023] When defining the delay matrix, only the transmission delay of the link is considered and the forwarding delay of the network device is ignored. This is because the reserved resources can meet the bandwidth requirements of the aggregated traffic, and the messages do not need to be stored for a long time. Therefore, the forwarding delay can be ignored.

[0024] S3. Build a network slicing model.

[0025] Network slices in different scenarios represent virtual networks that can provide QoS guarantee services for the application scenario, and are composed of a series of specific paths and reserved bandwidth resources on path nodes.

[0026] The network slicing model is used to As well as the traffic matrix and delay matrix of each application scenario, N slices are constructed by calculating paths and reserving resources to meet the QoS requirements of all application scenarios.

[0027] For directed graphs , each of its edges has a non-negative real capacity ,for The edge, If there are k converging flows , ,in and is the source and sink of the converging flow i, is the amount of data. The flow rate on , the unit cost of traffic is expressed as .

[0028] The objective function of the network slicing model is constructed with the goal of minimizing the transmission cost. The objective function is expressed as , .

[0029] The constraints of the network slicing model include latency constraints, capacity constraints, flow conservation constraints, and demand constraints.

[0030] The delay constraint is expressed as , d is the delay threshold of application scenario q; The capacity constraint is expressed as ; The flow conservation constraint is expressed as , ; The demand constraint is expressed as .

[0031] S4. Select the target application scenario and the traffic matrix and delay matrix of the target application scenario in order of priority of the application scenario.

[0032] For n QoS application scenarios, the corresponding traffic matrices are , and the corresponding delay matrices are .

[0033] According to the priority of the application scenarios, select the application scenarios and the traffic matrix and delay matrix of the application scenarios in turn.

[0034] S5. Use the traffic matrix and delay matrix of the target application scenario to solve the network slicing model and perform network slicing for the target application scenario.

[0035] Substitute the traffic matrix and delay matrix of the target application scenario into the network slicing model, solve the network slicing model, and obtain , get the i-th convergence flow in the flow matrix on the path The bandwidth resources allocated on the corresponding nodes are finally formed according to the solutions corresponding to all the converged flows in the flow matrix and delay matrix.

[0036] After the target application scenario is sliced, the resources on each node are reduced accordingly, such as updating the edge The available flow is .

[0037] S6. When network slicing of all application scenarios is completed, the network slicing results of all application scenarios are output.

[0038] Finally, it should be noted that the above embodiments are only used to illustrate the technical solution of the present invention rather than to limit it. Other modifications or equivalent substitutions made to the technical solution of the present invention by ordinary technicians in the field should be included in the scope of the claims of the present invention as long as they do not depart from the spirit and scope of the technical solution of the present invention.

Claims

1. A slicing method for a WAPI power local wireless network based on QoS requirements, characterized in that: include: Construct a directed graph based on the network topology of the WAPI power local wireless network; Construct traffic matrices and delay matrices for different application scenarios based on QoS application scenarios; Build a network slicing model; Select the target application scenario and the traffic matrix and delay matrix of the target application scenario in order of priority of the application scenario; The network slicing model is solved using the traffic matrix and delay matrix of the target application scenario, and network slicing is performed for the target application scenario.

2. The slicing method of the WAPI power local wireless network based on QoS requirements according to claim 1 is characterized in that: The directed graph is represented as , V is the node set, which represents the set of all forwarding nodes in the network topology; E is the edge set, which represents all links in the network topology. Each edge is a four-tuple, which includes the two endpoints of the link, the available bandwidth of the link, and the transmission delay.

3. The slicing method of the WAPI power local wireless network based on QoS requirements according to claim 2 is characterized in that: The traffic matrix of the kth application scenario is expressed as , where n represents the number of sink nodes in the network topology, Represents the total bandwidth requirement of the aggregated traffic from edge aggregation source node i to edge aggregation destination node j in application scenario k.

4. The slicing method of the WAPI power local wireless network based on QoS requirements according to claim 3 is characterized in that: The delay matrix of the kth application scenario is expressed as , where n represents the number of sink nodes in the network topology, Represents the total latency requirement of the aggregated traffic from edge aggregation source node i to edge aggregation destination node j in application scenario k.

5. The slicing method of WAPI power local wireless network based on QoS requirements according to claim 4 is characterized in that: The objective function of the network slicing model is expressed as , ; The constraints of the network slicing model include delay constraints, capacity constraints, flow conservation constraints and demand constraints; Represented as the edges of the directed graph, ; k is the number of converging flows, and converging flow i is expressed as ,in and is the source and sink of the converging flow i, is the amount of data; For the convergence flow i at the edge The flow rate on is the unit cost of traffic.

6. The slicing method of the WAPI power local wireless network based on QoS requirements according to claim 5 is characterized in that: The delay constraint is expressed as , d is the delay threshold of application scenario q.

7. The slicing method of the WAPI power local wireless network based on QoS requirements according to claim 6 is characterized in that: The capacity constraint is expressed as .

8. The slicing method of the WAPI power local wireless network based on QoS requirements according to claim 7 is characterized in that: The flow conservation constraint is expressed as , .

9. The slicing method of the WAPI power local wireless network based on QoS requirements according to claim 8 is characterized in that: The demand constraint is expressed as .

Images