Network resource allocation method and system, electronic equipment and storage medium

Abstract

The invention relates to a network resource allocation method and system, electronic equipment and a storage medium. The allocation method comprises the following steps: dividing a total time period of each resource allocation demand into a plurality of time slices; determining a priority processing demand; generating a plurality of time slice sets through the tolerance of the priority processing demand to the execution time; calculating the resource reduction rate of the first resource provided by each time slice in each time slice set compared with the resource demand; according to the resource reduction rate, screening in the time slice set to obtain a negotiation time slice set, and interacting with the user terminal; and when an acceptance instruction corresponding to the negotiation time slice set is received, distributing network resources according to a negotiation scheme corresponding to the negotiation time slice set. According to the invention, when the network resources cannot meet the configuration required by the user, more requirements which cannot be configured due to the lack of physical resources can be successfully allocated under a relatively small resource reduction degree, so that more resource configuration requirements can be met, and the service quality of the user can be improved.

Description

Technical Field

[0001] The present disclosure belongs to the field of network communication technology, and in particular, relates to a network resource allocation method, system, electronic device and storage medium. Background Art

[0002] As the research on the sixth generation mobile communication system (6G) deepens, network service scenarios become more diversified, and full-scenario on-demand services become the main challenge of 6G. "Self-intelligent network" provides on-demand services for vertical industries and consumers in various scenarios through fully automated network and communication technologies, based on large-scale network intelligence and autonomy of users.

[0003] In actual operation, due to the limited network resources and the diversity of user needs, resource shortages often occur. This may be due to the following reasons: Uneven resource allocation: Some users or services may occupy too many resources, resulting in other users or services not being able to get enough resources; Surge in resource demand: During certain specific time periods (such as holidays and large-scale events), users' demand for network resources may suddenly increase, and the existing resources cannot meet this demand; Resource aging or failure: Over time, some hardware devices may age or fail, resulting in reduced resource availability. When configuring network resources based on user needs, there may be a situation where the configuration cannot be performed due to a shortage of network resources, thus rejecting user needs. Summary of the invention

[0004] To solve the above problems, the present disclosure provides a network resource allocation method, system, electronic device and storage medium. When network resources cannot meet the configuration of user needs, more needs that cannot be configured due to lack of physical resources can be successfully allocated resources with a smaller degree of resource reduction, ensuring that more resource configuration needs can be met and improving user service quality.

[0005] In order to solve the above technical problem, the first aspect of the present invention proposes a network resource allocation method, the method comprising:

[0006] Acquire multiple resource configuration requirements, and divide the total time period of each resource configuration requirement into multiple time slices according to the intersection of the starting time point and the duration of each resource configuration requirement; and determine the resource configuration requirement whose priority meets the first preset requirement as the priority processing requirement;

[0007] According to the tolerance of the priority processing requirements to the execution time, time slices that are continuous in time are selected from the multiple time slices to form a time slice set, and multiple time slice sets are generated;

[0008] Based on the configuration priority and resource demand of each resource in the priority processing requirement, calculating the resource reduction rate of the first resource that can be provided by each time slice in each time slice set compared with the resource demand; the configuration priority of the first resource meets the second preset requirement;

[0009] According to the resource reduction rate, a negotiation time slice set is obtained by screening out from the time slice set, and interaction is performed with the user terminal based on the negotiation time slice set; upon receiving an acceptance instruction corresponding to the negotiation time slice set, network resources are allocated according to the negotiation scheme corresponding to the negotiation time slice set.

[0010] According to a preferred implementation manner of the present invention, determining the resource configuration requirements whose requirements priorities meet the first preset requirements as the priority processing requirements includes:

[0011] Get the urgency tag, required resource quantity and duration of each resource allocation requirement;

[0012] The resource occupancy is calculated by the resource quantity and the duration, and the negotiation weight is determined according to the emergency tag and the resource occupancy;

[0013] Determining the priority of each resource allocation requirement according to the negotiation weight;

[0014] The resource configuration requirements are sorted according to the requirement priorities, and the resource configuration requirements whose sorting results meet the first preset requirements are taken as priority processing requirements.

[0015] According to a preferred embodiment of the present invention, the tolerance of the priority processing requirements to the execution time is used to select time slices that are continuous in time from the multiple time slices to form a time slice set, and the multiple time slice sets are generated, including:

[0016] By combining the time slices respectively, a set of pending time slices consisting of a plurality of time slices that are continuous in time is generated;

[0017] According to the starting time point of the priority processing demand and the starting time point of each of the pending time slice sets, the starting time relative deviation is calculated respectively;

[0018] Calculating duration relative deviations respectively according to the duration of the priority processing demand and the duration of each of the pending time slice sets;

[0019] For each undetermined time slice set, weighted sum of the start time relative deviation and the duration relative deviation is performed to obtain a time deviation degree;

[0020] According to the order of the time deviation from small to large, a preset number of pending time slice sets corresponding to the time deviations are selected as the time slice sets.

[0021] According to a preferred implementation manner of the present invention, the second preset requirement includes: the first resource is a resource with the highest configuration priority among the priority processing requirements;

[0022] The calculating, based on the configuration priority and resource requirement of each resource in the priority processing requirement, a resource reduction rate of the first resource that can be provided by each time slice in each time slice set compared with the resource requirement, comprises:

[0023] For each of the time slice sets, obtaining a resource demand amount of a first resource in each of the time slices in the time slice set that is required to be processed with priority;

[0024] Obtaining a minimum provided amount of the first resource in each of the time slices in the time slice set;

[0025] A relative deviation is calculated according to the resource demand and the minimum provided amount of the first resource in each of the time slices as the resource reduction rate.

[0026] According to a preferred implementation manner of the present invention, the step of screening the time slice set to obtain the negotiation time slice set according to the resource reduction rate includes:

[0027] According to the resource reduction rate in each time slice in each time slice set, selecting the minimum value of the resource reduction rate in each time slice set as a reference value;

[0028] The reference values ​​are compared in size, and the time slice set corresponding to the largest reference value is determined as the negotiation time slice set.

[0029] According to a preferred implementation manner of the present invention, the interacting with the user terminal based on the negotiated time slice set includes:

[0030] The resource provision amount of various resources that can be provided by different topological paths corresponding to the negotiated time slice set;

[0031] For different topological paths, the relative deviation between the resource supply and resource demand of each resource is calculated; based on the configuration priority of each resource in the priority processing requirement, the relative deviation between the resource supply and resource demand of each resource is weighted and summed to obtain the network resource tolerance;

[0032] Generate a negotiation solution through the topological path corresponding to the network resource tolerance with the smallest value;

[0033] The negotiation solution is sent to the user terminal for display.

[0034] According to a preferred implementation manner of the present invention, the configuration priority of each resource in the priority processing requirement is based on the weighted sum of the relative deviations between the resource provision amount and the resource demand amount of each resource to obtain the network resource tolerance, including:

[0035] Comparing the configuration priorities of various resources in the priority processing requirements, and determining the weight value of each resource according to the comparison result;

[0036] The network resource tolerance is obtained by weighted summing the relative deviation between the resource provision amount and the resource demand amount of each resource and the weight value.

[0037] In order to solve the above technical problem, the second aspect of the present invention provides a network resource allocation system, the allocation system comprising:

[0038] Data acquisition module, used to obtain multiple resource configuration requirements;

[0039] A time slice division module, used to divide the total time period of each resource configuration requirement into multiple time slices according to the intersection of the starting time point and the duration of each resource configuration requirement;

[0040] A demand screening module, used to determine the resource allocation demand whose demand priority meets the first preset requirement as a priority processing demand;

[0041] A time slice reorganization module, used to select time slices that are continuous in time from the plurality of time slices to form a time slice set according to the tolerance of the priority processing requirements to the execution time, and generate a plurality of the time slice sets;

[0042] A resource reduction rate calculation module, configured to calculate a resource reduction rate of a first resource that can be provided by each of the time slices in each of the time slice sets compared with the resource demand based on the configuration priority and resource demand of each resource in the priority processing requirement; the configuration priority of the first resource meets the second preset requirement;

[0043] A time slice set screening module, configured to screen the time slice set to obtain a negotiation time slice set according to the resource reduction rate;

[0044] The negotiation scheme interaction module is used to interact with the user terminal based on the negotiation time slice set; when receiving an acceptance instruction corresponding to the negotiation time slice set, allocating network resources according to the negotiation scheme corresponding to the negotiation time slice set.

[0045] In order to solve the above technical problem, the third aspect of the present invention provides an electronic device, comprising:

[0046] Processor; and

[0047] A memory storing computer executable instructions, wherein when the computer executable instructions are executed, the processor executes the method described in any one of the above embodiments.

[0048] In order to solve the above technical problems, the fourth aspect of the present invention proposes a computer storage medium, wherein the computer storage medium stores one or more programs, and when the one or more programs are executed by a processor, the method described in any one of the above embodiments is implemented.

[0049] Compared with the prior art, the present disclosure has the following advantages: after obtaining the resource configuration requirements, the present disclosure divides the time period of each requirement into multiple time slices, and determines the priority processing requirements in the resource configuration requirements. Through the tolerance of the priority processing requirements to the execution time, multiple time slice sets are generated to determine the start time and duration of providing network resources for the priority processing requirements, and then the resource reduction rate compared with the first resource that can be provided in the time slice set and the resource demand is determined through the resource configuration priority. The negotiation time slice set is selected from each time slice set through the resource reduction rate, and the negotiation scheme of the priority processing requirements is interacted with the user terminal through the negotiation time slice set, and when the acceptance instruction is received, the network resources are allocated according to the negotiation scheme corresponding to the negotiation time slice set. When the network resources cannot meet the configuration of the user's requirements, the user is provided with demand degradation schemes of different dimensions, so that more requirements that cannot be configured due to lack of physical resources can be successfully allocated resources with a smaller degree of resource reduction, ensuring that more resource configuration requirements are met and improving the user service quality.

[0050] Other features and advantages of the present disclosure will be described in the following description, and partly become apparent from the description, or be understood by implementing the present disclosure. The purpose and other advantages of the present disclosure can be realized and obtained by the structures pointed out in the description, claims and drawings. BRIEF DESCRIPTION OF THE DRAWINGS

[0051] In order to more clearly illustrate the embodiments of the present disclosure or the technical solutions in the prior art, the drawings required for use in the embodiments or the description of the prior art will be briefly introduced below. Obviously, the drawings described below are some embodiments of the present disclosure. For ordinary technicians in this field, other drawings can be obtained based on these drawings without paying any creative work.

[0052] Figure 1 A first flowchart of a method for allocating network resources according to an embodiment of the present disclosure is shown;

[0053] Figure 2A schematic diagram of resource configuration requirements of requirements 1 and 2 according to an embodiment of the present disclosure is shown;

[0054] Figure 3 A schematic diagram of a method for performing resource negotiation with a user after obtaining user requirements according to an embodiment of the present disclosure is shown;

[0055] Figure 4 A second flow chart of a method for allocating network resources according to an embodiment of the present disclosure is shown;

[0056] Figure 5 A third flowchart of a method for allocating network resources according to an embodiment of the present disclosure is shown;

[0057] Figure 6 A fourth flowchart of a method for allocating network resources according to an embodiment of the present disclosure is shown;

[0058] Figure 7 A fifth flow chart of a method for allocating network resources according to an embodiment of the present disclosure is shown;

[0059] Figure 8 A block diagram of a network resource allocation system according to an embodiment of the present disclosure is shown;

[0060] Fig. 9 A schematic diagram of the structure of an electronic device according to an embodiment of the present disclosure is shown. DETAILED DESCRIPTION

[0061] In order to make the purpose, technical solution and advantages of the embodiments of the present disclosure clearer, the technical solution in the embodiments of the present disclosure will be clearly and completely described below in conjunction with the drawings in the embodiments of the present disclosure. Obviously, the described embodiments are part of the embodiments of the present disclosure, not all of the embodiments. Based on the embodiments in the present disclosure, all other embodiments obtained by ordinary technicians in this field without creative work are within the scope of protection of the present disclosure.

[0062] The same reference numerals in the drawings represent the same or similar elements, components or parts, and thus the repeated description of the same or similar elements, components or parts may be omitted below. It should also be understood that although the first, second, third and other attributives representing the numbers may be used herein to describe various devices, elements, components or parts, these devices, elements, components or parts should not be limited by these attributives. In other words, these attributives are only used to distinguish one from another. For example, the first device may also be called the second device, but it does not deviate from the essential technical solution of the present invention. In addition, the terms "and / or" and "and / or" refer to all combinations including any one or more of the listed items.

[0063] See also Figure 1 , Figure 1 This is a flow chart of a network resource allocation method provided by the present invention. Figure 1 As shown, the method includes:

[0064] S11. Acquire multiple resource configuration requirements, and divide the total time period of each resource configuration requirement into multiple time slices according to the intersection of the starting time point and the duration of each resource configuration requirement; and determine the resource configuration requirement whose priority meets the first preset requirement as the priority processing requirement.

[0065] In this embodiment, network resources include computing resources, storage resources, bandwidth resources and other resources.

[0066] In this embodiment, when the network resources cannot meet the configuration requirements of the user, the network resource configuration requirements submitted by each user are obtained. Since the network resources that the server can provide at this time are not sufficient to meet the user's needs, a downgraded resource plan can be provided to the user by allocating network resources, allowing the user to confirm whether to accept the resource plan.

[0067] In this embodiment, the required time period in each resource configuration requirement is determined by the starting time point and duration of each resource configuration requirement, and the intersection of the required time periods is divided into multiple time slices by the required time period. Specifically, two requirements require resource allocation:

[0068] In this embodiment, user demand is represented by a four-tuple, including {source node, destination node, urgency, network resource demand set}, where urgency is divided into two levels: U represents emergency, which requires quick processing and strict time requirements for demand execution; NU represents normal, which does not require special emergency processing. The network resource demand set is a set of resource demands that change with time. Each resource demand in the set is represented by a five-tuple with attributes: (computing resources: priority, storage resources: priority, bandwidth resources: priority, start time, duration). The configuration priority represents the degree of demand for resources, which is divided into three levels, represented by F, S, and T from high to low. Figure 2As shown in the figure, demand 1 {A, B, NU, [(2: S, 100: S, 100: F, 5:00am, 14 hours), (2: S, 100: S, 200: F, 7:00pm, 10 hours)]}, demand 1 is from 5:00am to 7:00pm, the demand from node A to node B is 2 computing resources, 100 storage resources, and 100 bandwidth resources; from 7:00pm to 5:00am, the demand from node A to node B is 2 computing resources, 100 storage resources, and 200 bandwidth resources. Demand 2 {C, D, NU, [(3: F, 10: S, 10: T, 1:00am, 16 hours)]}, demand 2 is from 1:00am to 5:00pm, the demand from node C to node D is 3 computing resources, 10 storage resources, and 10 bandwidth resources.

[0069] The time slices are divided based on the intersection of the start time point and duration of the above two requirements. That is, there are three time periods [5:00am, 7:00pm], [7:00pm, 5:00am], [1:00am, 5:00pm]. After the intersection of the start and end times of these three time periods, they are divided into four time slices, namely [1:00am, 5:00am], [5:00am, 5:00pm], [5:00pm, 7:00pm], [7:00pm, 1:00am].

[0070] In this embodiment, the priority processing demand is selected from various resource allocation demands. The selection can be made based on the resource occupancy of each resource allocation demand and the urgency of each resource allocation demand. For example, the larger the resource occupancy, the more difficult it is to meet the corresponding resource allocation demand and the lower the priority, that is, the priority of the resource allocation demand is inversely proportional to the resource occupancy; the higher the urgency of the demand, the more important the corresponding resource allocation demand is to the user and the higher the priority, that is, the priority of the resource allocation demand is proportional to the urgency; of course, different resources have different dimensions and importance. When calculating the resource quantity, this scheme can normalize the various resources in the demand and then perform statistics. The unified dimension allows direct comparison and calculation between different resource quantities.

[0071] In this embodiment, the first preset requirement may be the resource configuration requirement with the highest priority, or may be the top three resource configuration requirements after sorting the requirements from highest priority to lowest priority. This solution does not specifically limit this.

[0072] S12. By giving priority to the tolerance of the processing requirements to the execution time, time slices that are continuous in time are selected from multiple time slices to form a time slice set, thereby generating multiple time slice sets.

[0073] In this embodiment, the tolerance of the priority demand for execution time can be determined by the urgency of the priority demand. The higher the urgency, the less allowed the start time point is to be changed, that is, the lower the tolerance for execution time, and vice versa. The tolerance can also be determined by the total amount of resource requirements of the priority demand. The larger the total amount of resource requirements, the longer the duration is under a constant resource supply. At this time, the duration is less allowed to be shortened, that is, the lower the tolerance for execution time, and vice versa.

[0074] In this embodiment, a time slice set is obtained based on the time slice combination, and then the relative deviations between the starting time point and duration of the time slice set and the starting time point and duration of the priority processing demand are calculated respectively. The larger the relative deviation, the lower the possibility of being accepted by users and the lower the tolerance. By calculating the relative deviation, multiple time slice schemes are provided that have certain errors in time from the starting time point and duration of the priority processing demand.

[0075] S13. Based on the configuration priority and resource demand of each resource in the priority processing requirement, calculate the resource reduction rate of the first resource that can be provided by each time slice in each time slice set compared with the resource demand; the configuration priority of the first resource meets the second preset requirement.

[0076] In this embodiment, after generating a plan for multiple time slice sets, the first resource that can be provided by each time slice in each time slice set is first determined. The first resource is the resource with the highest configuration priority in the priority processing requirement. The resource with the highest configuration priority is the resource with the highest user demand in the priority processing requirement. For example, the resource with the highest configuration priority in requirement 1 is the bandwidth resource, and the resource with the highest configuration priority in requirement 2 is the computing resource. If the amount of the first resource provided can meet the resource configuration requirement, it is more important to the user, and the solution finally provided will be more acceptable to the user.

[0077] In this embodiment, after determining the first resource that can be provided by each time slice, the resource reduction rate of the first resource compared to the corresponding resource demand is determined, that is, the resource reduction rate is the first resource provision divided by the resource demand. The higher the resource reduction rate, the greater the first resource provision, and the easier it is for the resource provision plan corresponding to the corresponding time slice to meet user needs. Conversely, it is more difficult to meet user needs.

[0078] S14. According to the resource reduction rate, a negotiation time slice set is obtained from the time slice set, and interaction is performed with the user terminal based on the negotiation time slice set; upon receiving an acceptance instruction corresponding to the negotiation time slice set, network resources are allocated according to the negotiation scheme corresponding to the negotiation time slice set.

[0079] In this embodiment, after calculating the resource reduction rate of the first resource and the resource demand that can be provided by each time slice in each time slice set, the negotiation time slice set is selected according to the resource reduction rate; the minimum resource reduction rate in each time slice set can also be selected, and the negotiation time slice set is determined according to the minimum resource reduction rate. For example, the time slice set corresponding to the minimum resource reduction rate with the largest value is selected as the negotiation time slice set.

[0080] In this embodiment, a determined negotiation time slice set is sent to the user, and if the user accepts, the negotiation is completed. After the negotiation is completed, the computing resources, storage resources, and bandwidth resources of the network topology link are subtracted from the final negotiated computing resources, storage resources, and bandwidth resources, that is, after the priority processing requirements are completed, the remaining network resources are determined to continue to complete other resource configuration requirements.

[0081] After the negotiation time slice set is determined, the negotiation time slice set is deleted from the time slice set. If the end user does not accept it, the negotiation time slice set is returned and filtered out in the time slice set according to the resource reduction rate. The negotiation time slice set with the minimum resource reduction rate and the maximum resource reduction rate is selected as the negotiation time slice set.

[0082] In summary, if Figure 3 As shown, after obtaining the user's needs, this solution determines whether the current network resources meet the user's needs. If so, the network resources are directly allocated to the user; if not, a negotiation plan is generated based on the existing network resources to negotiate resources with the user, and it is determined whether the user accepts the plan. If the user accepts the plan, network resources are allocated to the user according to the negotiation plan; if the user does not accept the plan, a negotiation plan is regenerated to negotiate resources with the user.

[0083] Specifically, the interaction with the user terminal is based on the negotiation time slice set, including: determining the resource provision of each resource that can be provided by different topological paths corresponding to the negotiation time slice set; calculating the relative deviation between the resource provision and resource demand of each resource for different topological paths; taking a weighted sum of the relative deviation between the resource provision and resource demand of each resource based on the configuration priority of each resource in the priority processing requirement to obtain the network resource tolerance; generating a negotiation plan through the topological path corresponding to the network resource tolerance with the smallest numerical value; and sending the negotiation plan to the user terminal for display.

[0084] Specifically, among the topological paths in the selected negotiation time slice set, the available path with the minimum network resource tolerance is selected. The network resource tolerance is the ratio of the resource reduction amount to the required resources in the priority processing demand, including the calculation tolerance Storage Tolerance Bandwidth tolerance The network resource tolerance is finally expressed as Nri =a 1i C i +a 2i S T i +a 3i BW i .

[0085] Among them, CAr i To prioritize the computational tolerance of demand i, CAO i To prioritize the computing resource requirements of the requirements in the request, CA i The actual computing resource value for the negotiated time slice set. i To prioritize the storage tolerance of demand i, STO i To prioritize the storage resource requirements of the requirements, ST i The actual storage resource value for the negotiated time slice set. i To prioritize the bandwidth tolerance of demand i, BWO i To prioritize the bandwidth resource requirements of the requirements, BW i The actual bandwidth resource value of the negotiated time slice set.

[0086] The above-mentioned configuration priority of each resource in the priority processing demand is based on the weighted summation of the relative deviation between the resource supply and the resource demand of each resource to obtain the network resource tolerance, including: comparing the configuration priority of each resource in the priority processing demand, and determining the weight value of each resource according to the comparison result; according to the relative deviation and weight value between the resource supply and the resource demand of each resource, the network resource tolerance is obtained by weighted summation.

[0087] Weight a 1i 、a 2i 、a 3i According to the relative importance of the priority of the required resources, a judgment matrix is ​​constructed and the corresponding values ​​are calculated using the square root method. Priority F is slightly more important than S, F is obviously more important than T, and S is slightly more important than T. The relative importance is obtained by the 1-9 scaling method, as shown in the following table:

[0088] Scale meaning 1 Indicates that two elements have the same importance. 3 Indicates that compared with two elements, the former is slightly more important than the latter 5 Indicates that compared with two elements, the former is obviously more important than the latter 7 Indicates that compared with two elements, the former is extremely important than the latter 9 Indicates that compared with two elements, the former is more important than the latter 2，4，6，8 Indicates the middle value of the above adjacent judgments Count down from 1 to 9 Indicates the importance of comparing the corresponding two factors in the order of swapping

[0089] In this embodiment, after obtaining the resource configuration requirements, the present disclosure divides the time period of each requirement into multiple time slices, and determines the priority processing requirements in the resource configuration requirements. Through the tolerance of the priority processing requirements to the execution time, multiple time slice sets are generated to determine the start time and duration of providing network resources for the priority processing requirements, and then the resource reduction rate compared with the first resource and resource demand that can be provided in the time slice set is determined through the resource configuration priority. The negotiation time slice set is selected from each time slice set through the resource reduction rate, and the negotiation scheme of the priority processing requirements is interacted with the user terminal through the negotiation time slice set, and when the acceptance instruction is received, the network resources are allocated according to the negotiation scheme corresponding to the negotiation time slice set. When the network resources cannot meet the configuration of the user's requirements, the user is provided with demand degradation schemes of different dimensions, so that more requirements that cannot be configured due to lack of physical resources can be successfully allocated resources with a smaller degree of resource reduction, ensuring that more resource configuration requirements are met and improving the user service quality.

[0090] See also Figure 4 , Figure 4 This is a second flow chart of a network resource allocation method provided by the present invention. Figure 4 As shown, S11 includes the following steps:

[0091] S21. Obtain the urgency tag, required resource quantity and duration of each resource configuration requirement.

[0092] In this embodiment, referring to requirement 1 and requirement 2 in the above embodiment, the urgency tags of requirement 1 and requirement 2 are both NU. In this embodiment, the urgency tags of each resource configuration requirement are obtained, and the importance of the resource configuration requirement to the user can be determined through the urgency tags.

[0093] In this embodiment, demand 1 is between 5:00am and 7:00pm, and the demand from node A to node B is 2 computing resources, 100 storage resources, and 100 bandwidth resources; between 7:00pm and 5:00am, the demand from node A to node B is 2 computing resources, 100 storage resources, and 200 bandwidth resources. Demand 2 is between 1:00am and 5:00pm, and the demand from node C to node D is 3 computing resources, 10 storage resources, and 10 bandwidth resources.

[0094] In this embodiment, the resource occupancy of the resource configuration demand can be determined based on the resource quantity and duration required by the resource configuration demand. The larger the resource occupancy, the more difficult it is to meet the corresponding resource configuration demand. Conversely, the resource configuration demand is easier to meet.

[0095] S22. Calculate resource occupancy by using resource quantity and duration, and determine negotiation weight according to the emergency tag and resource occupancy.

[0096] In this embodiment, the resource occupancy is equal to the product of the sum of the demand values ​​for computing resources, storage resources, and bandwidth resources and the duration. The resource occupancy of multiple time periods is added together to obtain the resource occupancy R of the demand in the entire time period. i Of course, different resources have different dimensions and importance. When calculating the resource quantity, this solution can normalize the various resources in the demand and then perform statistics. The unified dimension allows direct comparison and calculation between different resource quantities; that is, the demand values ​​of computing resources, storage resources, and bandwidth resources can be normalized and summed, and the sum can be multiplied by the duration, and the resource occupancy of multiple time periods can be added up to obtain the resource occupancy corresponding to the demand.

[0097] In this embodiment, the negotiation weight is determined according to the degree of urgency and the amount of resource occupancy. The standard weight can be determined by the degree of urgency. For example, the standard weight of the resource configuration demand with an emergency label is urgent is greater than the standard weight of the resource configuration demand with an emergency label is regular. The negotiation weight of the corresponding resource configuration demand is calculated by the ratio of the standard weight to the amount of resource occupancy. The larger the negotiation weight, the greater the probability that the corresponding resource configuration demand will be met, and vice versa.

[0098] Specifically, the negotiation weight V i is the weight W of resource allocation requirement i i and the total resource occupancy R during the effective time of the demand i The ratio of

[0099] In this embodiment, the standard weight can also be determined by the urgency and the configuration priority of each resource in the resource configuration requirement. Specifically, as shown in the following table, the higher the urgency and the greater the configuration priority of each resource, the greater the corresponding standard weight.

[0100]

[0101] U and NU in the above table can refer to the description of urgency in the above embodiment, and F, S, and T correspond to configuration priorities, indicating the degree of demand for resources.

[0102] Resource configuration requirements can be divided more finely by urgency and configuration priority, and different standard weights can be assigned to determine resource configuration requirements that are easier to meet.

[0103] S23. Determine the priority of each resource allocation requirement based on the negotiation weight.

[0104] In this embodiment, the negotiation weight can be directly used as the demand priority of the resource configuration demand. The larger the negotiation weight, the higher the corresponding demand priority. Since the number of resource configuration demands is relatively large, the corresponding demand priority can be set by setting the priority interval according to the priority interval corresponding to the negotiation weight, so that different users can intuitively determine the priority of the resource configuration demand.

[0105] S24. Sort the resource allocation requirements according to the requirements priority, and take the resource allocation requirements whose sorting results meet the first preset requirements as the priority processing requirements.

[0106] In this embodiment, resource configuration requirements are sorted by requirement priority, thereby determining priority processing requirements. Specifically, the resource configuration requirement ranked first can be used as the priority processing requirement. In this case, the first preset requirement is ranked first.

[0107] See also Figure 5 , Figure 5 The third flowchart of a network resource allocation method provided by the present invention is as follows: Figure 5 As shown, S12 includes the following steps:

[0108] S31. Generate a pending time slice set consisting of a plurality of time slices that are continuous in time by combining the time slices respectively.

[0109] In this embodiment, the time slices in the pending time slice set are continuous in time, for example, [1:00am, 5:00am], [5:00am, 5:00pm] are two time slices that are continuous in time; in this scheme, since the number of resource configuration requirements will be large, the number of time slices ultimately obtained by segmentation will also be large, the number of pending time slice sets formed in this scheme will be relatively large, and the amount of subsequent data calculation will also be very large, so in this scheme, it is possible to appropriately establish a preset number of pending time slice sets and then stop creating them. Since this scheme is based on the tolerance of the execution time, the pending time slice sets can be screened, and the time slice closest to the starting time point of the priority processing requirement can be selected as the initial time slice, and then several time slices with a similar duration to the priority processing requirement can be selected after the initial time slice, and a combination of these time slices can be generated to form a pending time slice set, and multiple pending time slice sets can be generated multiple times.

[0110] In this embodiment, the pending time slice set can also be directly constructed, and the pending time slice set can be obtained by segmenting according to the resources and resource amounts that can be provided by the current service system in each time period and the fluctuation of the resource amount.

[0111] S32: Calculate the relative deviation of the starting time according to the starting time of the priority processing demand and the starting time of each set of pending time slices.

[0112] S33: Calculate the duration relative deviations according to the duration of the priority processing demand and the duration of each set of pending time slices.

[0113] In this embodiment, the start time relative deviation and the duration relative deviation are calculated respectively, and the relative deviation represents the difference between the two values ​​in the form of percentage, which makes the difference between the data more intuitive and easy to understand.

[0114] S34. For each set of pending time slices, weighted sum of the start time relative deviation and the duration relative deviation is performed to obtain a time deviation degree.

[0115] In this embodiment, the weight values ​​of the relative deviation of the start time and the relative deviation of the duration can be determined by the urgency of the resource allocation demand. For example, a resource allocation demand with an urgent urgency has a higher requirement for the start time and a lower requirement for the duration, while a resource allocation demand with a normal urgency has no obvious difference in the requirements for the start time and the duration. When the urgency of the priority processing demand is urgent, the weight of the relative deviation of the start time is greater than the weight of the relative deviation of the duration, and when the urgency of the priority processing demand is normal, the weight of the relative deviation of the start time can be equal to the weight of the relative deviation of the duration.

[0116] S35 . Select, according to the order of the time deviation from small to large, a set of pending time slices corresponding to a preset number of time deviations as a set of time slices.

[0117] In this embodiment, the smaller the time deviation, that is, the smaller the change in the start time and the duration, the greater the corresponding tolerance, and vice versa. At this time, a preset number of pending time slice sets with a smaller time deviation are selected as the time slice set.

[0118] Specifically, a set of z adjacent and continuous pending time slices with low time deviations for processing the requirements is calculated as the time slice set. The time deviation is composed of the time migration rate and the duration change rate added in a certain weight ratio.

[0119] Time transfer rate TT i is the ratio of the change in the start time of the demand execution to the original duration, that is,

[0120] Duration rate of change TLC i is the ratio of the change in duration to the original duration, that is,

[0121] Among them, TSO i is the original start time of the priority demand i, TSi is the actual start time of the pending time slice set, TLO i The original duration of the priority demand i, TL i The actual duration of the pending time slice set.

[0122] The time deviation is Tr i =w1TT i +w2TLC i The weights w1 and w2 are used to construct a judgment matrix based on the relative importance of the urgency of the requirements and the corresponding values ​​are calculated using the square root method.

[0123] When the urgency is NU, the judgment matrix is ​​constructed as follows:

[0124]

[0125] Use the square root method to calculate the 1 / mth power of the product of m elements in each row of the matrix to get the weight: time mobility Duration rate of change Normalized to get

[0126] When the urgency is U, the judgment matrix is ​​constructed as follows:

[0127]

[0128] Use the square root method to calculate the 1 / mth power of the product of m elements in each row of the matrix to get the weight: time mobility Duration rate of change Normalized to get

[0129] A smaller time migration rate indicates that the change in the start time relative to the required duration is negligible. A larger time migration rate indicates that the change in the start time relative to the effective duration of the requirement is larger, and the migration cost in time is higher. The smaller the duration change rate, the smaller the duration change, and the larger the change, the greater the change. When the time deviation is smaller, the user is more receptive to the negotiation of the time, and the greater the time tolerance, the less receptive the user is to the negotiation of the time.

[0130] See also Figure 6 , Figure 6 The fourth flowchart of a network resource allocation method provided by the present invention is as follows: Figure 6 As shown, S13 includes the following steps:

[0131] S41, for each time slice set, obtaining the resource demand of the first resource of the priority processing demand in each time slice of the time slice set. The first resource is the resource with the highest configuration priority among the priority processing demands.

[0132] In this embodiment, referring to requirement 1 in the above embodiment, requirement 1 {A, B, NU, [(2:S, 100:S, 100:F, 5:00am, 14hours), (2:S, 100:S, 200:F, 7:00pm, 10hours)]}, four time slices, namely [1:00am, 5:00am], [5:00am, 5:00pm], [5:00pm, 7:00pm], [7:00pm, 1:00am].

[0133] The resource demands of the first resource in the four time slices are: the bandwidth resource demand of [1:00am, 5:00am] is 200, the bandwidth resource demand of [5:00am, 5:00pm] is 100, the bandwidth resource demand of [5:00pm, 7:00pm] is 100, and the bandwidth resource demand of [7:00pm, 1:00am] is 200.

[0134] S42: Obtain the minimum provided amount of the first resource in each time slice in the time slice set.

[0135] S43: Calculate a relative deviation according to the resource demand and the minimum provided amount of the first resource in each time slice as the resource reduction rate.

[0136] In this embodiment, the relative deviation between the resource demand and the minimum provided amount of the first resource in each time slice is calculated to generate the resource reduction rate.

[0137] In this embodiment, the minimum supply of the first resource in each time slice is obtained, that is, the minimum supply of the first resource in the time period corresponding to the time slice. The minimum supply of resources may cause data loss, data jamming and data coverage of the resource demander, so it is necessary to try to avoid the situation where the minimum supply is too low to ensure normal data service.

[0138] See also Figure 7 , Figure 7 The fifth flowchart of a network resource allocation method provided by the present invention is as follows: Figure 7 As shown, S14 includes the following steps:

[0139] S51 . According to the resource reduction rate in each time slice in each time slice set, select the minimum value of the resource reduction rate in each time slice set as a reference value.

[0140] S52: Compare the reference values ​​and determine the time slice set corresponding to the largest reference value as the negotiation time slice set.

[0141] In this embodiment, the minimum value of the resource reduction rate of each time slice in the time slice set is used as the reference value representing the time slice set, that is, the minimum value of the resource reduction rate in the time slice set is obtained; the reference values ​​are compared in size, and the time slice set with the largest reference value is selected as the negotiated time slice set, that is, the relative deviation between the first resource supply and demand that can be provided by the negotiated time slice set is the smallest.

[0142] Taking requirement 1 in the above embodiment as an example, determining the negotiation time slice set according to the resource reduction rate can be implemented by the following embodiments:

[0143] After the time slice division, the number of time slices for demand 1 is 4, t1: [1:00am, 5:00am], computing resources 2, storage resources 100, bandwidth resources 200; t2: [5:00am, 5:00pm], computing resources 2, storage resources 100, bandwidth resources 100; t3: [5:00pm, 7:00pm], computing resources 2, storage resources 100, bandwidth resources 100; t4: [7:00pm, 1:00am], computing resources 2, storage resources 100, bandwidth resources 200. Demand 1 has the highest priority for bandwidth resources, so the minimum possible bandwidth reduction rate of each time slice in the time slice set is calculated.

[0144] By calculating the time deviation of requirement 1, we get two time slice sets with low time deviation. The minimum bandwidth provided by time slice set 1 is [T1:200, T2:110, T3:90, T4:100], and the minimum bandwidth provided by time slice set 2 is [T5:180, T6:80, T7:95, T8:160].

[0145] In time slice set 1, the valid parts of demand 1 at t1, t2, t3, and t4 are migrated to T1, T2, T3, and T4 respectively. When t1 is migrated to T1, the bandwidth reduction rate is 200 / 200=1, when t2 is migrated to T2, the bandwidth reduction rate is 110 / 100=1.1, when t3 is migrated to T3, the bandwidth reduction rate is 90 / 100=0.9, and when t4 is migrated to T4, the bandwidth reduction rate is 100 / 200=0.5. The minimum possible bandwidth reduction rate is 0.5.

[0146] In time slice set 2, the valid parts of demand 1 at t1, t2, t3, and t4 are migrated to T5, T6, T7, and T8 respectively. When t1 is migrated to T5, the bandwidth reduction rate is 180 / 200 = 0.9, when t2 is migrated to T6, the bandwidth reduction rate is 80 / 100 = 0.8, when t3 is migrated to T7, the bandwidth reduction rate is 95 / 100 = 0.95, and when t4 is migrated to T8, the bandwidth reduction rate is 160 / 200 = 0.8. The minimum possible bandwidth reduction rate is 0.8.

[0147] The order according to the minimum possible bandwidth reduction rate is (time slice set 2, time slice set 1), so the time slice set 2 with the largest minimum possible bandwidth reduction rate is selected as the negotiation time slice set of requirement 1.

[0148] See also Figure 8 , Figure 8 The invention provides a network resource allocation system, which includes: a data acquisition module 11, a time slice division module 12, a demand screening module 13, a time slice reorganization module 14, a resource reduction rate calculation module 15, a time slice set screening module 16, and a negotiation scheme interaction module 17.

[0149] In this embodiment, the data acquisition module 11 is used to acquire multiple resource configuration requirements.

[0150] In this embodiment, the time slice division module 12 is used to divide the total time period of each resource configuration requirement into multiple time slices according to the intersection of the starting time point and the duration of each resource configuration requirement.

[0151] In this embodiment, the demand screening module 13 is used to determine the resource configuration demand whose demand priority meets the first preset requirement as the priority processing demand.

[0152] In this embodiment, the time slice reorganization module 14 is used to select time slices that are continuous in time from multiple time slices to form a time slice set, thereby generating multiple time slice sets by giving priority to the tolerance of the processing requirements to the execution time.

[0153] In this embodiment, the resource reduction rate calculation module 15 is used to calculate the resource reduction rate of the first resource that can be provided by each time slice in each time slice set compared with the resource demand based on the configuration priority and resource demand of each resource in the priority processing requirement; the configuration priority of the first resource meets the second preset requirement.

[0154] In this embodiment, the time slice set screening module 16 is used to screen the time slice set to obtain the negotiation time slice set according to the resource reduction rate.

[0155] In this embodiment, the negotiation scheme interaction module 17 is used to interact with the user terminal based on the negotiation time slice set; when receiving an acceptance instruction corresponding to the negotiation time slice set, allocate network resources according to the negotiation scheme corresponding to the negotiation time slice set.

[0156] In this embodiment, the demand screening module 13 is specifically used to obtain the urgency tag, required resource quantity and duration of each resource configuration demand; calculate the resource occupancy by the resource quantity and duration, and determine the negotiation weight according to the urgency tag and the resource occupancy; determine the demand priority of each resource configuration demand according to the negotiation weight; sort the resource configuration demands according to the demand priority, and take the resource configuration demand whose sorting result meets the first preset requirement as the priority processing demand.

[0157] In this embodiment, the time slice reorganization module 14 is specifically used to combine the time slices respectively to generate a pending time slice set consisting of multiple time slices that are continuous in time; calculate the relative deviation of the start time according to the starting time point of the priority processing demand and the starting time point of each pending time slice set; calculate the relative deviation of the duration according to the duration of the priority processing demand and the duration of each pending time slice set; for each pending time slice set, weightedly sum the relative deviation of the start time and the relative deviation of the duration to obtain the time deviation degree; and select the pending time slice sets corresponding to a preset number of time deviation degrees as the time slice set according to the order of the time deviation degree from small to large.

[0158] In this embodiment, the second preset requirement includes: the first resource is a resource with the highest configuration priority in the priority processing requirement.

[0159] In this embodiment, the resource reduction rate calculation module 15 is specifically used to obtain, for each time slice set, the resource demand of the first resource in each time slice of the time slice set with priority processing demand; obtain the minimum supply of the first resource in each time slice in the time slice set; and calculate the relative deviation based on the resource demand and the minimum supply of the first resource in each time slice as the resource reduction rate.

[0160] In this embodiment, the time slice set screening module 16 is specifically used to select the minimum value of the resource reduction rate in each time slice set as a reference value according to the resource reduction rate in each time slice in each time slice set; compare the sizes of each reference value, and determine the time slice set corresponding to the largest reference value as the negotiated time slice set.

[0161] In this embodiment, the negotiation scheme interaction module 17 is specifically used to determine the resource provision of each resource that can be provided by different topological paths corresponding to the negotiation time slice set; for different topological paths, calculate the relative deviation between the resource provision and resource demand of each resource; based on the configuration priority of each resource in the priority processing requirement, weightedly sum the relative deviation between the resource provision and resource demand of each resource to obtain the network resource tolerance; generate a negotiation scheme through the topological path corresponding to the network resource tolerance with the smallest numerical value; and send the negotiation scheme to the user terminal for display.

[0162] In this embodiment, the negotiation scheme interaction module 17 is specifically used to compare the configuration priorities of various resources in the priority processing requirements, and determine the weight value of each resource according to the comparison result; according to the relative deviation and weight value of the resource supply and resource demand of each resource, the network resource tolerance is obtained by weighted summation.

[0163] like Fig. 9 As shown, an embodiment of the present invention provides an electronic device, including a processor 1110, a communication interface 1120, a memory 1130 and a communication bus 1140, wherein the processor 1110, the communication interface 1120, and the memory 1130 communicate with each other through the communication bus 1140;

[0164] Memory 1130, used for storing computer programs;

[0165] The processor 1110 is configured to implement any of the above allocation methods when executing a program stored in the memory 1130 .

[0166] In the electronic device provided by the embodiment of the present invention, the processor 1110 obtains multiple resource configuration requirements by executing the program stored in the memory 1130, and divides the total time period of each resource configuration requirement into multiple time slices according to the intersection of the starting time point and the duration of each resource configuration requirement; and determines the resource configuration requirement whose priority meets the first preset requirement as the priority processing requirement; through the tolerance of the priority processing requirement to the execution time, the time slices that are continuous in time are screened from multiple time slices to form a time slice set, and multiple time slice sets are generated; based on the configuration priority and resource demand of each resource in the priority processing requirement, the resource reduction rate of the first resource that can be provided by each time slice in each time slice set compared with the resource demand is calculated; the configuration priority of the first resource meets the second preset requirement; according to the resource reduction rate, a negotiation time slice set is screened in the time slice set, and interaction is performed with the user terminal based on the negotiation time slice set; when an acceptance instruction corresponding to the negotiation time slice set is received, network resources are allocated according to the negotiation scheme corresponding to the negotiation time slice set.

[0167] The communication bus 1140 mentioned in the above electronic device can be a Peripheral Component Interconnect (PCI) bus or an Extended Industry Standard Architecture (EISA) bus, etc. The communication bus 1140 can be divided into an address bus, a data bus, a control bus, etc. For ease of representation, only one thick line is used in the figure, but it does not mean that there is only one bus or one type of bus.

[0168] The communication interface 1120 is used for communication between the above electronic device and other devices.

[0169] The memory 1130 may include a random access memory 1130 (RAM), or may include a non-volatile memory 1130 (non-volatile memory), such as at least one disk memory 1130. Optionally, the memory 1130 may also be at least one storage device located away from the processor 1110.

[0170] The above-mentioned processor 1110 can be a general-purpose processor 1110, including a central processing unit 1110 (CPU), a network processor 1110 (NP), etc.; it can also be a digital signal processor 1110 (DSP), an application specific integrated circuit (ASIC), a field programmable gate array (FPGA) or other programmable logic devices, discrete gates or transistor logic devices, discrete hardware components.

[0171] An embodiment of the present invention provides a computer-readable storage medium, which stores one or more programs. The one or more programs can be executed by one or more processors 1110 to implement the allocation method of any of the above embodiments.

[0172] In the above embodiments, it can be implemented in whole or in part by software, hardware, firmware or any combination thereof. When implemented using software, it can be implemented in whole or in part in the form of a computer program product. The computer program product includes one or more computer instructions. When the computer program instructions are loaded and executed on a computer, the process or function according to the embodiment of the present invention is generated in whole or in part. The computer can be a general-purpose computer, a special-purpose computer, a computer network, or other programmable device. The computer instructions can be stored in a computer-readable storage medium, or transmitted from one computer-readable storage medium to another computer-readable storage medium. For example, the computer instructions can be transmitted from a website site, a computer, a server or a data center by wired (e.g., coaxial cable, optical fiber, digital subscriber line (DSL)) or wireless (e.g., infrared, wireless, microwave, etc.) mode to another website site, computer, server or data center. The computer-readable storage medium can be any available medium that a computer can access or a data storage device such as a server or a data center that includes one or more available media integrated. The available medium can be a magnetic medium (e.g., a floppy disk, a hard disk, a tape), an optical medium (e.g., a DVD), or a semiconductor medium (e.g., a solid-state hard disk SolidStateDisk (SSD)), etc.

[0173] Although the present disclosure has been described in detail with reference to the aforementioned embodiments, those skilled in the art should understand that they can still modify the technical solutions described in the aforementioned embodiments, or make equivalent replacements for some of the technical features therein; and these modifications or replacements do not make the essence of the corresponding technical solutions deviate from the spirit and scope of the technical solutions of the embodiments of the present disclosure.

Claims

1. A network resource allocation method, characterized in that: The allocation method includes: Acquire multiple resource configuration requirements, and divide the total time period of each resource configuration requirement into multiple time slices according to the intersection of the starting time point and the duration of each resource configuration requirement; and determine the resource configuration requirement whose priority meets the first preset requirement as the priority processing requirement; According to the tolerance of the priority processing requirement to the execution time, time slices that are continuous in time are selected from the multiple time slices to form a time slice set, and multiple time slice sets are generated; Based on the configuration priority and resource demand of each resource in the priority processing requirement, calculating the resource reduction rate of the first resource that can be provided by each time slice in each time slice set compared with the resource demand; the configuration priority of the first resource meets the second preset requirement; According to the resource reduction rate, a negotiation time slice set is obtained by screening out from the time slice set, and interaction is performed with the user terminal based on the negotiation time slice set; upon receiving an acceptance instruction corresponding to the negotiation time slice set, network resources are allocated according to the negotiation scheme corresponding to the negotiation time slice set.

2. The network resource allocation method according to claim 1, characterized in that: The step of determining the resource allocation requirement whose priority level meets the first preset requirement as a priority processing requirement includes: Get the urgency tag, required resource quantity and duration of each resource allocation requirement; The resource occupancy is calculated by the resource quantity and the duration, and the negotiation weight is determined according to the emergency tag and the resource occupancy; Determining the priority of each resource allocation requirement according to the negotiation weight; The resource configuration requirements are sorted according to the requirement priorities, and the resource configuration requirements whose sorting results meet the first preset requirements are taken as priority processing requirements.

3. The network resource allocation method according to claim 1, characterized in that: The step of selecting time slices that are continuous in time from the plurality of time slices to form a time slice set based on the tolerance of the priority processing requirements to the execution time, and generating the plurality of time slice sets, comprises: By combining the time slices respectively, a set of pending time slices consisting of a plurality of time slices that are continuous in time is generated; According to the starting time point of the priority processing demand and the starting time point of each of the pending time slice sets, the starting time relative deviation is calculated respectively; Calculating duration relative deviations respectively according to the duration of the priority processing demand and the duration of each of the pending time slice sets; For each undetermined time slice set, weighted sum of the start time relative deviation and the duration relative deviation is performed to obtain a time deviation degree; According to the order of the time deviation from small to large, a preset number of pending time slice sets corresponding to the time deviations are selected as the time slice sets.

4. The network resource allocation method according to claim 1, characterized in that: The second preset requirement includes: the first resource is a resource with the highest configuration priority among the priority processing requirements; The calculating, based on the configuration priority and resource requirement of each resource in the priority processing requirement, a resource reduction rate of the first resource that can be provided by each time slice in each time slice set compared with the resource requirement, comprises: For each of the time slice sets, obtaining a resource demand amount of a first resource in each of the time slices in the time slice set that is required to be processed with priority; Obtaining a minimum provided amount of the first resource in each of the time slices in the time slice set; A relative deviation is calculated according to the resource demand and the minimum provided amount of the first resource in each of the time slices as the resource reduction rate.

5. The network resource allocation method according to claim 4, characterized in that: The step of selecting, according to the resource reduction rate, the time slice set to obtain a negotiation time slice set includes: According to the resource reduction rate in each time slice in each time slice set, selecting the minimum value of the resource reduction rate in each time slice set as a reference value; The reference values ​​are compared in size, and the time slice set corresponding to the largest reference value is determined as the negotiation time slice set.

6. The network resource allocation method according to claim 5, characterized in that: The interacting with the user terminal based on the negotiated time slice set includes: The resource provision amount of various resources that can be provided by different topological paths corresponding to the negotiated time slice set; For different topological paths, the relative deviation between the resource supply and resource demand of each resource is calculated; based on the configuration priority of each resource in the priority processing requirement, the relative deviation between the resource supply and resource demand of each resource is weighted and summed to obtain the network resource tolerance; Generate a negotiation solution through the topological path corresponding to the network resource tolerance with the smallest value; The negotiation solution is sent to the user terminal for display.

7. The network resource allocation method according to claim 6, characterized in that: The configuration priority of each resource in the priority processing requirement is based on the weighted sum of the relative deviations between the resource provision amount and the resource demand amount of each resource to obtain the network resource tolerance, including: Comparing the configuration priorities of various resources in the priority processing requirements, and determining the weight value of each resource according to the comparison result; The network resource tolerance is obtained by weighted summing the relative deviation between the resource provision amount and the resource demand amount of each resource and the weight value.

8. A network resource allocation system, characterized in that: The dispensing system comprises: Data acquisition module, used to obtain multiple resource configuration requirements; A time slice division module, used to divide the total time period of each resource configuration requirement into multiple time slices according to the intersection of the starting time point and the duration of each resource configuration requirement; A demand screening module, used to determine the resource allocation demand whose demand priority meets the first preset requirement as a priority processing demand; A time slice reorganization module, used to select time slices that are continuous in time from the plurality of time slices to form a time slice set according to the tolerance of the priority processing requirements to the execution time, and generate a plurality of the time slice sets; A resource reduction rate calculation module, configured to calculate a resource reduction rate of a first resource that can be provided by each of the time slices in each of the time slice sets compared with the resource demand based on the configuration priority and resource demand of each resource in the priority processing requirement; the configuration priority of the first resource meets the second preset requirement; A time slice set screening module, configured to screen the time slice set to obtain a negotiation time slice set according to the resource reduction rate; The negotiation scheme interaction module is used to interact with the user terminal based on the negotiation time slice set; when receiving an acceptance instruction corresponding to the negotiation time slice set, allocating network resources according to the negotiation scheme corresponding to the negotiation time slice set.

9. An electronic device, characterized in that: include: processor; as well as A memory storing computer executable instructions which, when executed, cause the processor to perform the method according to any one of claims 1-7.

10. A computer storage medium, characterized in that: in, The computer storage medium stores one or more programs, and when the one or more programs are executed by a processor, the method of any one of claims 1 to 7 is implemented.

Images