Method and apparatus for determining service assurance of power 5g network slice

Abstract

The embodiment of the present application provides a kind of electric power 5G network slice determinacy service guarantee method and device, belong to the distribution control technical field of electric power service.The method comprises: establishing electric power service model;According to the preset particle search method, particle for indicating server resource allocation scheme is generated;The overall cost and outer loop factor of particle are calculated;Judge the outer loop factor difference of outer loop factor under current iteration number and outer loop factor under previous iteration number whether all less than or equal to the preset outer loop factor threshold value;In the case where it is judged that the outer loop factor difference is all less than or equal to the preset outer loop factor threshold value, the particle is used as optimal server resource allocation scheme;In the case where it is judged that there is any outer loop factor difference greater than the preset outer loop factor threshold value, return to execute the step of generating particle for indicating server resource allocation scheme according to the preset particle search method.

Description

TECHNICAL FIELD

[0001] The present application relates to the technical field of distribution regulation of electric power services, in particular to a power 5G network slice deterministic service guarantee method and device. BACKGROUND

[0002] In recent years, carbon peak and carbon neutral have become an important means for the world to cope with climate warming. A large number of new energy such as photovoltaic and wind power are connected to the power grid, electric vehicles are gradually popularized, and the reversal of power supply and demand, the change of load characteristics and the optimization of power supply structure have multiplied the regulation pressure of the power grid. Renewable energy has the characteristics of intermittency and randomness, and needs to rely on user-side load regulation means to realize accurate source-grid-load coordination. In the transmission and distribution links, the traditional artificial inspection method is used to carry out operation and maintenance of transmission lines, towers and transformers. This method not only has low work efficiency, but also has high safety risk in high-voltage environment. With the popularity of unmanned aerial vehicles, robots, wearable devices and sensors, the intelligent operation and maintenance business of power grid equipment presents the characteristics of large bandwidth, high reliability and mobility, and it is necessary to consider introducing reliable wireless communication methods to solve business access. With the rapid development of large-scale distribution network automation, low-voltage collection, distributed energy access and user two-way interaction, the communication demand of various power grid equipment, power terminals and power customers has increased explosively. The construction cost of traditional optical fiber private network is high, and the business opening time is long, which cannot meet the rapid and flexible wide-area access demand.

[0003] 5G network slices can utilize SDN / NFV to flexibly manage and control heterogeneous resources, can provide independent running and mutually isolated special network services for power grid business data transmission, and can also reduce business deployment costs through sharing physical resources. 5G network slices formulate matching service level agreements for specific business needs, which are fully adapted to the communication needs of diversified application scenarios in power generation, transmission, transformation, distribution and power consumption links. The service level agreement includes key indicators of network-borne business, such as business bandwidth, delay, delay jitter, reliability and isolation, and realizes customized network services for diversified businesses. SUMMARY

[0004] The purpose of the embodiment of the present application is to provide a power 5G network slice deterministic service guarantee method and device, which can guarantee the stable operation of power services.

[0005] In order to achieve the above purpose, the embodiment of the present application provides a power 5G network slice deterministic service guarantee method, which comprises:

[0006] establishing a power service model;

[0007] generating particles for representing server resource allocation schemes according to a preset particle search method;

[0008] calculating a total cost of the particle and an outer loop factor;

[0009] judging whether the outer loop factor difference between the outer loop factor at the current iteration number and the outer loop factor at the previous iteration number is less than or equal to a preset outer loop factor threshold value;

[0010] in a case where it is judged that the outer loop factor difference is less than or equal to the preset outer loop factor threshold value, taking the particle as an optimal server resource allocation scheme;

[0011] in a case where it is judged that there is any outer loop factor difference greater than the preset outer loop factor threshold value, returning to execute the step of generating a particle for representing a server resource allocation scheme according to a preset particle search method.

[0012] Optionally, the establishing the power service model comprises:

[0013] establishing the power service model according to the formula (1) to the formula (7),

[0014]

[0015] wherein G is a set of service items, is a computing resource required for the gth service item to use the nth function on the kth server, is an indication vector for representing whether the gth service item uses the nth function on the kth server, represents affirmative, represents negative, represents the nth function on the kth server accumulatively consumed computing resource;

[0016]

[0017] wherein, is a storage resource required for the gth service item to use the nth function on the kth server, represents the nth function on the kth server accumulatively consumed storage resource;

[0018]

[0019] wherein N is the number of functions of the server, y k,n is an indication vector for representing whether the nth function is deployed on the kth server, y k,n =1 represents affirmative, y k,n =0 represents negative, C k is the total amount of computing resource of the kth server;

[0020]

[0021] wherein S k is the total amount of storage resources of the kth server;

[0022]

[0023] wherein delay g is the time delay of the gth service item, denotes the mth function serving the gth service item, is the time delay of the function f g (S g , D g ) is the gth service item, denotes the link between the mth function and the nth function used by the gth service item, is the time delay of the link DELAY g is the maximum time delay allowed for the gth service item;

[0024]

[0025] wherein band g is the bandwidth of the gth service item, is the bandwidth of the link BAND g is the minimum bandwidth allowed for the gth service item;

[0026]

[0027] wherein ploss g is the packet loss rate of the gth service item, is the packet loss rate of the link PLOSS g is the maximum packet loss rate allowed for the gth service item.

[0028] Optionally, generating the particle used for representing the server resource allocation scheme according to the preset particle search method comprises:

[0029] starting from the initial node, selecting the path of the particle according to formula (8),

[0030]

[0031]

[0032]

[0033]

[0034] wherein, is the probability of the zth particle in the mth function at the tth step to select the mth function, a, β are exponential weighted weights, is the cost between the mth function and the nth function, N z is a set of functions.

[0035] Optionally, calculating the overall cost of the particle and the outer loop factor comprises:

[0036] updating the outer loop factor according to the formula (12) and (13),

[0037] A=[A-θ[DELAY g -delay g ]] + , (12)

[0038] B=[B-θ[PLOSS g -ploss g ]] + , (13)

[0039] wherein, A, B are the outer loop factor, θ is the sub-gradient update step, DELAY g is the maximum delay allowed by the gth service item, delay g is the delay of the gth service item, PLOSS g is the maximum packet loss rate allowed by the gth service item, ploss g is the packet loss rate of the gth service item, + means taking the positive value.

[0040] Optionally, calculating the overall cost of the particle and the outer loop factor comprises:

[0041] calculating the overall cost according to the formula (14),

[0042]

[0043] wherein, cost(f g (S g ,D g )) is the overall cost, is the cost of the nth function on the gth server .

[0044] In another aspect, the present application also provides a power 5G network slice deterministic service guarantee device, the device comprises a processor, the processor is used for executing the method as described in any of the above.

[0045] In still another aspect, the present application also provides a computer readable storage medium storing instructions for being read by a machine to cause the machine to perform the method according to any one of the above.

[0046] Through the above technical solution, the power 5G network slice deterministic service guarantee method and device provided by the present application establish a power service model, generate particles through a particle search method, and obtain the optimal particle through iteration. Compared with the prior art, the power 5G network slice deterministic service guarantee method and device provided by the present application realize more efficient bandwidth allocation.

[0047] Other features and advantages of the embodiments of the present application will be described in detail in the following specific implementation part. BRIEF DESCRIPTION OF DRAWINGS

[0048] The accompanying drawings are included to provide a further understanding of the embodiments of the present application, and constitute a part of the specification, and are used together with the following specific implementation part to explain the embodiments of the present application, but do not constitute a limitation on the embodiments of the present application. In the drawings:

[0049] Figure 1 is a flow chart of a power 5G network slice deterministic service guarantee method according to an embodiment of the present application;

[0050] Figure 2 is a functional diagram of a network slice service according to an embodiment of the present application;

[0051] Figure 3 is a comparison chart of algorithm convergence effect according to an embodiment of the present application. DETAILED DESCRIPTION

[0052] The specific implementation of the embodiments of the present application will be described in detail below in combination with the drawings. It should be understood that the specific implementation described herein is only used to illustrate and explain the embodiments of the present application, and does not limit the embodiments of the present application.

[0053] As Figure 1 shown is a flow chart of a power 5G network slice deterministic service guarantee method according to the present application. In this Figure 1 , the method can include the following steps:

[0054] In step S10, a power service model is established;

[0055] In step S11, particles for representing a server resource allocation scheme are generated according to a preset particle search method;

[0056] In step S12, the total cost and the outer loop factor of each particle are calculated;

[0057] In step S13, it is judged whether the outer loop factor difference values of the outer loop factors in the current iteration number and the outer loop factors in the previous iteration number are all less than or equal to the preset outer loop factor threshold value;

[0058] In step S14, in the case that it is judged that the outer loop factor difference values are all less than or equal to the preset outer loop factor threshold value, the particle is taken as the optimal server resource allocation scheme.

[0059] In the case that it is judged that there is any outer loop factor difference value greater than the preset outer loop factor threshold value, the step of generating the particle for representing the server resource allocation scheme according to the preset particle search method is returned to be executed, that is, step S11 is returned to be executed.

[0060] In the method as shown in the embodiment, Figure 1 In the method as shown in the embodiment, Figure 2 In the power service model, different service items need to call functions from multiple servers (the link slice diagram of the server can be as shown in FIG. 2), and when the functions are called, the functions need to be called through links. Due to the difference of the service item content, the requirements for bandwidth, delay and packet loss rate are different when the functions are called. For example, for the service items such as accurate load control, distributed energy regulation, distribution network differential protection, real-time power information acquisition and intelligent patrol, the requirements for bandwidth, delay, packet loss rate (reliability) and security isolation can be as shown in Table 1:

[0061] Table 1

[0062]

[0063]

[0064] Therefore, in the embodiment, considering the above influencing factors, the power service model can be established according to the formulas (1) to (7),

[0065]

[0066] wherein G is a set of service items, is the computing resource required by the gth service item to use the nth function on the kth server, is an indication vector for representing whether the gth service item uses the nth function on the kth server, represents yes, represents no, denotes the accumulated consumed computing resource of the nth function on the kth server;

[0067]

[0068] wherein, denotes the storage resource required for the gth service item using the nth function on the kth server, denotes the accumulated consumed storage resource of the nth function on the kth server;

[0069]

[0070] wherein, N is the number of functions of the server, y k,n denotes the indication vector of whether the nth function is deployed on the kth server, y k,n = 1 means positive, y k,n = 0 means negative, C k denotes the total amount of computing resource of the kth server;

[0071]

[0072] wherein, S k denotes the total amount of storage resource of the kth server;

[0073]

[0074] wherein, delay g denotes the time delay of the gth service item, denotes the mth function serving the gth service item, denotes the time delay of the function , f g (S g , D g ) is the gth service item, denotes the link between the mth function and the nth function used for the gth service item, denotes the time delay of the link , DELAY g denotes the maximum time delay allowed for the gth service item;

[0075]

[0076] wherein, band g denotes the bandwidth of the gth service item, denotes the bandwidth of the link , BAND g denotes the minimum bandwidth allowed for the gth service item;

[0077]

[0078] wherein ploss g is the packet loss rate of the gth service item, is the packet loss rate of the link , PLOSS g is the maximum packet loss rate allowed for the gth service item.

[0079] After the model is established, the particle can be generated by a particle search method. The steps of the particle search algorithm can be first generating an empty particle, placing the particle at the initial position, and determining whether the particle will add the current position to the path of the particle in combination with the selection probability until the selection of all positions is completed, thereby completing the generation of a single particle. Finally, the pros and cons of the particle can be determined based on a preset target function, such as the overall cost of the lowest communication energy consumption and cost of the particle, and the optimal particle can be determined based on the comparison of the pros and cons, thereby generating an optimal server resource allocation scheme.

[0080] Specifically, the method for generating the particle in step S11 can be starting from the initial node, selecting the path of the particle according to formula (8),

[0081]

[0082]

[0083]

[0084]

[0085] wherein, is the probability of selecting the mth function for the zth particle located at the mth function in the tth step, and a and β are exponential weighting weights (greater than 0), is the cost between the mth function and the nth function, and N z is the set of functions.

[0086] Through the path selection method of the above formula (8) to formula (11), the convergence speed of the algorithm can be greatly improved. A schematic diagram of the convergence effect of the algorithm compared with the algorithm commonly used in the prior art can be as shown in Figure 3 .

[0087] Step S12 can be used to calculate the overall cost of the particle and the outer loop factor. The overall cost can be used to evaluate the pros and cons of each particle, and the outer loop factor can be used to judge whether the current particle converges. Specifically, the overall cost can be calculated according to formula (14),

[0088]

[0089] wherein, for the overall cost, for the nth function on the gth server .

[0090] The outer loop factor can be updated according to the formulas (12) and (13),

[0091] A = [A - θ [DELAY g -delay g ]] + , (12)

[0092] B = [B - θ [PLOSS g -ploss g ]] + , (13)

[0093] wherein A, B are outer loop factors, θ is a sub-gradient update step, DELAY g is the maximum delay allowed for the gth service item, delay g is the delay of the gth service item, PLOSS g is the maximum packet loss rate allowed for the gth service item, ploss g is the packet loss rate of the gth service item, + means taking the positive value.

[0094] On the other hand, the present application also provides a power 5G network slice deterministic service guarantee device, the device comprises a processor, the processor is used for executing the method as any one of the above.

[0095] In another aspect, the present application also provides a computer readable storage medium, the computer readable storage medium stores instructions, the instructions are used to be read by a machine to make the machine execute the method as any one of the above.

[0096] Through the above technical solutions, the power 5G network slice deterministic service guarantee method and device provided by the present application establish a power service model, generate particles through a particle search method, and obtain the optimal particle through iteration.Compared with the prior art, the power 5G network slice deterministic service guarantee method and device provided by the present application realize more efficient bandwidth allocation.

[0097] Those skilled in the art should understand that the embodiments of the present application can be provided as a method, a system, or a computer program product. Therefore, the present application can adopt a completely hardware embodiment, a completely software embodiment, or an embodiment combining software and hardware aspects. Moreover, the present application can adopt the form of a computer program product implemented on one or more computer usable storage media (including but not limited to magnetic disk storage, CD-ROM, optical storage, etc.) containing computer usable program code.

[0098] The computer program instructions can also be loaded onto a computer or other programmable data processing apparatus to cause a series of operational steps to be performed on the computer or other programmable apparatus to produce a computer-implemented process such that the instructions which execute on the computer or other programmable apparatus provide steps for implementing the functions specified in the flowchart block or blocks. Figure 1 one or more flowcharts and / or blocks Figure 1 means for functionally implementing the steps listed in the flowchart block or blocks.

[0099] These computer program instructions can also be stored in a computer readable memory that can direct a computer or other programmable data processing apparatus to function in a particular manner, such that the instructions stored in the computer readable memory produce an article of manufacture including instructions which implement the function specified in the flowchart block or blocks. Figure 1 one or more flowcharts and / or blocks Figure 1 means for functionally implementing the steps listed in the flowchart block or blocks.

[0100] The computer program instructions can also be loaded onto a computer or other programmable data processing apparatus to cause a series of operational steps to be performed on the computer or other programmable apparatus to produce a computer-implemented process such that the instructions which execute on the computer or other programmable apparatus provide steps for implementing the functions specified in the flowchart block or blocks. Figure 1 one or more flowcharts and / or blocks Figure 1 means for functionally implementing the steps listed in the flowchart block or blocks.

[0101] In a typical configuration, a computing device includes one or more processors (CPUs), input / output interfaces, network interfaces, and memory.

[0102] The memory can include non-persistent memory and / or volatile memory, such as a random access memory (RAM) including a cache area for the temporary storage of data. The memory can also include non-volatile memory, such as read only memory (ROM), electrically programmable read only memory (EPROM), or electrically erasable programmable read only memory (EEPROM), for the storage of software that is read during runtime. The memory is an example of computer readable media.

[0103] Computer-readable media includes permanent and non-permanent, movable and non-movable media that can implement information storage by any method or technology. The information can be computer-readable instructions, data structures, program modules or other data. Examples of computer storage media include, but are not limited to, phase-change memory (PRAM), static random access memory (SRAM), dynamic random access memory (DRAM), other types of random access memory (RAM), read-only memory (ROM), electrically erasable programmable read-only memory (EEPROM), flash memory or other memory technologies, compact disc read-only memory (CD-ROM), digital versatile disc (DVD) or other optical storage, magnetic cassette, magnetic tape, magnetic disk storage or other magnetic storage devices, or any other non-transmission medium that can be used to store information accessible to a computing device. According to the definition herein, computer-readable media does not include transitory media such as modulated data signals and carriers.

[0104] It should also be noted that the terms "comprising", "containing", or any other variant thereof are intended to cover a non-exclusive inclusion, such that a process, method, article or apparatus that comprises a list of elements does not only include those elements, but can also include other elements not expressly listed or inherent to such process, method, article or apparatus. Without more limitations, the element defined by the statement "comprising a" does not exclude the presence of additional identical elements in the process, method, article or apparatus that includes the element.

[0105] The above is only an embodiment of the present application and is not intended to limit the present application. For those skilled in the art, the present application can have various modifications and changes. Any modification, equivalent replacement, improvement, etc. within the spirit and principle of the present application shall be included in the scope of claims of the present application.

Claims

1. A method for determining a service assurance of an electric power 5G network slice, characterized in that, The method comprises: establishing a power service model; generating a particle representing a server resource allocation scheme according to a preset particle search method; calculating the overall cost and the outer loop factor of the particle; judging whether the outer loop factor difference between the outer loop factor at the current iteration number and the outer loop factor at the previous iteration number is less than or equal to a preset outer loop factor threshold value; in the case where it is judged that the outer loop factor difference is less than or equal to the preset outer loop factor threshold value, taking the particle as an optimal server resource allocation scheme; in the case where it is judged that there is any outer loop factor difference greater than the preset outer loop factor threshold value, returning to execute the step of generating a particle representing a server resource allocation scheme according to a preset particle search method; establishing a power service model comprises: establishing the power service model according to formulas (1) to (7), ，（1） wherein is a set of business items, is a first server, is a first function, is a first server, is a first function, is a first server, is a first function, is a first server, is a first function, = 1 means positive, = 0 means negative, is a first server, is a first function, is a first server, ，（2） wherein, is the th service item using the th function on the th server, represents the cumulative consumed storage resource of the th function on the th server; ，（3） wherein, is the number of functions of the server, is an indicator vector indicating whether the th function is deployed on the th server, represents positive, =0 represents negative, is the total amount of computing resources of the th server; ，（4） wherein, is the total amount of storage resources of the first server; ，（5） in, For the first The latency of individual business projects Represented as the first The first business project service One function, For function The time delay, For the first Each business project Represented as the first The first business project used the The first function and the first The links between functions For link The time delay, For the first The maximum allowable latency for each business project; ，（6） in, For the first Bandwidth for each business project For link bandwidth, For the first Minimum bandwidth allowed for each business item; ，（7） wherein, is the packet loss rate for the nth service item, is the packet loss rate for the nth service item, is the packet loss rate for the link, is the packet loss rate for the link, is the maximum packet loss rate allowed for the nth service item, is the maximum packet loss rate allowed for the nth service item.

2. The method of claim 1, wherein, generating a particle representing a server resource allocation scheme according to a preset particle search method comprises: starting from an initial node, selecting a path of the particle according to formula (8), ，（8） ，（9） ，（10） ，（11） wherein, is the first step is the first function of the first particle selects the first probability of the first , is an exponential weighting weight, is the cost between the first function and the first function, is a set of functions.

3. The method of claim 2, wherein, calculating the overall cost and the outer loop factor of the particle comprises: updating the outer loop factor according to formulas (12) and (13), ，（12） ，（13） wherein, , is the outer loop factor for the outer loop, is a sub-gradient update step size, is the maximum allowed latency for the i-th service item, is the latency of the i-th service item, is the maximum allowed packet loss rate for the i-th service item, is the packet loss rate of the i-th service item, is the maximum allowed latency for the i-th service item, is the latency of the i-th service item, is the maximum allowed packet loss rate for the i-th service item, is the packet loss rate of the i-th service item, denotes taking the positive value.

4. The method of claim 3, wherein, calculating the overall cost and the outer loop factor of the particle comprises: calculating the overall cost according to formula (14), ，（14） wherein, is the total cost, is the cost of the first function on the first server. function 5. A power 5G network slice deterministie service assurance apparatus, characterized in that, The device comprises a processor for executing the method as claimed in any one of claims 1 to 4.

6. A computer-readable storage medium, characterized in that, The computer readable storage medium stores instructions for being read by a machine to make the machine execute the method as claimed in any one of claims 1 to 4.

Images