A network resource allocation method and system, electronic device and storage medium

By dividing time slices in the 6G network, reducing computing resource rates, and negotiating solutions, the resource shortage problem is solved, enabling demand satisfaction and improved service quality when resources are insufficient.

CN119893720BActive Publication Date: 2025-10-17FIBERHOME TELECOMMUNICATION TECHNOLOGIES CO LTD
View PDF 2 Cites 0 Cited by

Patent Information

Application Number
CN202510087308.2
Authority / Receiving Office
CN · China
Patent Type
Patents(China)
Current Assignee / Owner
Filing Date
2025-01-20
Publication Date
2025-10-17
Estimated Expiration
2045-01-20

AI Technical Summary

Technical Problem

In 6G networks, due to the limited network resources and the diversity of user needs, resource shortages often occur, leading to uneven resource allocation, a surge in resource demand, or resource aging and failures, which cannot meet user needs.

Method used

By acquiring resource allocation requirements, dividing them into multiple time slices, determining priority processing requirements, calculating resource reduction rates, filtering and negotiating a set of time slices, and interacting with user terminals, network resources are allocated according to the negotiated plan.

Benefits of technology

When resources are insufficient, provide a fallback solution to ensure that more needs are met and improve the quality of user service.

✦ Generated by Eureka AI based on patent content.

Smart Images

  • Figure CN119893720B_ABST
    Figure CN119893720B_ABST
Patent Text Reader

Abstract

The present disclosure relates to a network resource allocation method, system, electronic device and storage medium. The allocation method comprises: dividing a total time period of each resource configuration requirement into multiple time slices; determining a priority processing requirement; generating multiple time slice sets by the tolerance of the execution time of the priority processing requirement; calculating a resource reduction rate of each time slice in each time slice set, which is compared with the amount of resource demand that each time slice can provide; filtering a negotiation time slice set from the time slice set according to the resource reduction rate, and interacting with the user terminal; and when receiving an acceptance instruction corresponding to the negotiation time slice set, allocating network resources according to a negotiation scheme corresponding to the negotiation time slice set. When the network resources cannot meet the user's demand for configuration, 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 can be met, and improving the quality of user service.
Need to check novelty before this filing date? Find Prior Art

Description

TECHNICAL FIELD

[0001] The present disclosure belongs to the technical field of network communication, and particularly relates to a network resource allocation method and system, an electronic device, and a storage medium. BACKGROUND

[0002] With the gradual deepening of the research on the 6th generation mobile communication system (6G), network service scenarios are becoming more diversified, and on-demand services in all scenarios are becoming the main challenge of 6G. The "self-intelligent network" provides on-demand services for vertical industries and consumers in various scenarios based on large-scale network intelligence and self-automation of users through fully automated networks and communication technologies.

[0003] In actual operation, due to the finiteness of network resources and the diversity of user demand, resource shortage problems often occur. This may be caused by the following reasons: uneven resource allocation: some users or services may occupy too many resources, causing other users or services to be unable to obtain sufficient resources; resource demand surge: during certain time periods (such as holidays, large-scale events), user demand for network resources may suddenly increase, and existing resources cannot meet this demand; resource aging or failure: over time, some hardware devices may age or fail, resulting in a decrease in resource availability. When configuring network resources based on user demand, the situation of being unable to configure due to network resource shortage and rejecting user demand may occur. SUMMARY

[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 user demand configuration, more demands that cannot be configured due to lack of physical resources can be successfully allocated resources with less resource reduction, ensuring that more resource configuration demands can be met, and improving user service quality.

[0005] To solve the above technical problems, the first aspect of the present application provides a network resource allocation method, which comprises:

[0006] Obtaining a plurality of resource configuration demands, dividing the total time period of each resource configuration demand into a plurality of time slices according to the intersection of the start time point and the duration of each resource configuration demand, and determining the resource configuration demand whose demand priority meets the first preset requirement as a priority processing demand;

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

[0008] According to the resource reduction rate, a negotiation time slice set is screened from the time slice set, and the user terminal is interacted based on the negotiation time slice set; when receiving an acceptance instruction corresponding to the negotiation time slice set, network resources are allocated according to a negotiation scheme corresponding to the negotiation time slice set.

[0009] According to the resource reduction rate, a negotiation time slice set is screened from the time slice set, and the user terminal is interacted based on the negotiation time slice set; when receiving an acceptance instruction corresponding to the negotiation time slice set, network resources are allocated according to a negotiation scheme corresponding to the negotiation time slice set.

[0010] According to a preferred embodiment of the present application, the resource configuration demand whose determined demand priority meets the first preset requirement is taken as the priority processing demand, which comprises:

[0011] An emergency label, a required resource quantity and a duration of each resource configuration demand are obtained;

[0012] A resource occupation quantity is calculated according to the resource quantity and the duration, and a negotiation weight is determined according to the emergency label and the resource occupation quantity;

[0013] According to the negotiation weight, a demand priority of each resource configuration demand is determined;

[0014] The resource configuration demands are sorted according to the demand priority, and a resource configuration demand whose sorting result meets the first preset requirement is taken as the priority processing demand.

[0015] According to a preferred embodiment of the present application, the time slice set is screened from the multiple time slices according to the tolerance of the execution time to the priority processing demand, and multiple time slice sets are generated, which comprises:

[0016] The multiple time slice sets composed of multiple time slices which are continuous in time are generated by combining the time slices respectively;

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

[0018] According to a duration of the priority processing demand and a duration of each of the multiple time slice sets, a duration relative deviation is calculated respectively;

[0019] For each of the multiple time slice sets, the starting time relative deviation and the duration relative deviation are weighted and summed to obtain a time deviation degree;

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

[0021] According to a preferred embodiment of the present application, the second preset requirement comprises: the first resource is the resource with the highest configuration priority in the priority processing requirement;

[0022] The resource reduction rate of each time slice in each time slice set is calculated based on the configuration priority and resource demand of each resource in the priority processing requirement, and comprises:

[0023] For each time slice set, the resource demand of the first resource in each time slice of the time slice set is obtained;

[0024] The minimum provision amount of the first resource in each time slice of the time slice set is obtained;

[0025] The relative deviation is calculated according to the resource demand and the minimum provision amount of the first resource in each time slice, as the resource reduction rate.

[0026] According to a preferred embodiment of the present application, the negotiation time slice set is obtained by screening from the time slice set according to the resource reduction rate, which comprises:

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

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

[0029] According to a preferred embodiment of the present application, the interaction between the negotiation time slice set and the user terminal is based on:

[0030] The resource provision amount of each resource provided by different topology paths corresponding to the negotiation time slice set;

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

[0032] The topology path corresponding to the network resource tolerance with the smallest value is generated as a negotiation scheme;

[0033] Send the negotiation scheme to a user terminal for display.

[0034] According to a preferred embodiment of the present application, the network resource tolerance is obtained by weighting and summing the relative deviations between the resource supply and the resource demand of each resource based on the configuration priority of each resource in the priority processing demand.

[0035] The configuration priority of each resource in the priority processing demand is compared, and the weight value of each resource is determined according to the comparison result;

[0036] The network resource tolerance is obtained by weighting and summing the relative deviations between the resource supply and the resource demand of each resource and the weight value.

[0037] To solve the above technical problems, the second aspect of the present application provides a network resource allocation system, the allocation system comprising:

[0038] A data acquisition module is configured to acquire a plurality of resource configuration demands;

[0039] A time slice division module is configured to divide the total time period of each resource configuration demand into a plurality of time slices according to the intersection of the start time point and the duration of each resource configuration demand;

[0040] A demand screening module is configured to determine a resource configuration demand whose demand priority meets a first preset requirement as a priority processing demand;

[0041] A time slice reorganization module is configured to filter time slices that are continuous in time to form a time slice set from a plurality of time slices based on the tolerance of the execution time of the priority processing demand, and generate a plurality of time slice sets;

[0042] A resource reduction rate calculation module is configured to calculate the resource reduction rate of a first resource that each time slice in each time slice set can provide compared to the resource demand based on the configuration priority of each resource in the priority processing demand and the resource demand; the configuration priority of the first resource meets a second preset requirement;

[0043] A time slice set screening module is configured to filter a negotiation time slice set from the time slice sets according to the resource reduction rate;

[0044] A negotiation scheme interaction module is configured to interact with a 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.

[0045] To solve the above technical problems, the third aspect of the present application provides an electronic device, comprising:

[0046] a processor; and

[0047] a memory storing computer executable instructions that, when executed, cause the processor to perform the method of any of the above embodiments.

[0048] To solve the above technical problems, the fourth aspect of the present application provides a computer storage medium, wherein the computer storage medium stores one or more programs, when the one or more programs are executed by a processor, the method of any 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, determines the priority processing requirements in the resource configuration requirements, generates multiple time slice sets to determine the start time and duration of providing network resources for the priority processing requirements by the tolerance of the execution time of the priority processing requirements, and then determines the resource reduction rate of the first resource that can be provided in the time slice set compared with the resource requirement amount through the configuration priority of the resource, selects the negotiation time slice set in each time slice set through the resource reduction rate, interacts the negotiation scheme of the priority processing requirements with the user terminal through the negotiation time slice set, and allocates network resources according to the negotiation scheme corresponding to the negotiation time slice set when receiving the acceptance instruction. When the network resources cannot meet the configuration of the user requirements, different dimension requirement degradation schemes are provided to the user, so that more requirements that cannot be configured due to lack of physical resources can be successfully allocated resources with a smaller resource reduction degree, more resource configuration requirements can be met, and the service quality of the user is improved.

[0050] Other features and advantages of the present disclosure will be described in the following description, and some will become apparent from the description, or will be learned through implementation of the present disclosure. The purposes and other advantages of the present disclosure can be achieved and obtained through the structures indicated in the specification, claims, and drawings. BRIEF DESCRIPTION OF DRAWINGS

[0051] In order to more clearly illustrate the technical solutions in the embodiments of the present disclosure or the prior art, the following will briefly introduce the drawings needed to be used in the embodiment or prior art description. Obviously, the drawings in the following description are some embodiments of the present disclosure, and those skilled in the art can also obtain other drawings according to these drawings without creative labor.

[0052] Figure 1 A network resource allocation method flow chart according to an embodiment of the present disclosure is shown;

[0053] Figure 2Fig. 1 shows a resource configuration requirement diagram according to the embodiment of the present disclosure requirement 1 and requirement 2;

[0054] Figure 3 Fig. 1 shows a resource configuration requirement diagram according to the embodiment of the present disclosure requirement 1 and requirement 2;

[0055] Figure 4 Fig. 1 shows a resource configuration requirement diagram according to the embodiment of the present disclosure requirement 1 and requirement 2;

[0056] Figure 5 Fig. 1 shows a resource configuration requirement diagram according to the embodiment of the present disclosure requirement 1 and requirement 2;

[0057] Figure 6 Fig. 1 shows a resource configuration requirement diagram according to the embodiment of the present disclosure requirement 1 and requirement 2;

[0058] Figure 7 Fig. 1 shows a resource configuration requirement diagram according to the embodiment of the present disclosure requirement 1 and requirement 2;

[0059] Figure 8 Fig. 1 shows a resource configuration requirement diagram according to the embodiment of the present disclosure requirement 1 and requirement 2;

[0060] Figure 9 Fig. 1 shows a resource configuration requirement diagram according to the embodiment of the present disclosure requirement 1 and requirement 2. DETAILED DESCRIPTION

[0061] To make the objects, technical solutions and advantages of the embodiments of the present disclosure clearer, the following will combine the drawings in the embodiments of the present disclosure to make a clear and complete description of the technical solutions in the embodiments of the present disclosure. Obviously, the described embodiments are part of the embodiments of the present disclosure, rather than all the embodiments. Based on the embodiments in the present disclosure, all other embodiments obtained by those skilled in the art without creative labor fall within the scope of protection of the present disclosure.

[0062] The same reference numbers in different drawings represent the same or similar elements, components, or parts, so the repeated description of the same or similar elements, components, or parts can be omitted below. It should also be understood that although the first, second, third, etc. represent the numbered adjectives are used to describe various devices, elements, components, or parts, these devices, elements, components, or parts should not be limited by these adjectives. That is, these adjectives are only used to distinguish one from another. For example, the first device can also be called the second device without departing from the essential technical solutions of the present disclosure. In addition, the terms "and / or", "and / or" mean all combinations of one or more of the listed items.

[0063] Please refer to Figure 1 , Figure 1 is a network resource allocation method flow chart provided by the present application, as shown in Figure 1 the method comprises:

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

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

[0066] In this embodiment, when the network resources cannot meet the user's demand for configuration, obtain each user's submitted network resource configuration requirement, since the network resources that the server can provide at this time are not enough to meet the user's demand, the degraded resource scheme can be provided to the user by adjusting the network resources, and the user is asked to confirm whether to accept the resource scheme.

[0067] In this embodiment, the demand time period in each resource configuration requirement is determined through the starting time point and the duration of each resource configuration requirement, and the intersection of the demand time period is divided to obtain a plurality of time slices. Specifically, two requirements need to be allocated resources:

[0068] In this embodiment, the user's demand is represented by a four-tuple, including {source node, sink node, urgency, network resource demand set}, wherein the urgency is divided into two levels: U represents urgent and needs to be processed quickly, and the time requirement for demand execution is strict; NU represents normal and does not need to be processed urgently. The network resource demand set is a set of resource demands that change over time, and each resource demand in the set is represented by a five-tuple with attributes: (computing resource: priority, storage resource: priority, bandwidth resource: priority, start time, duration). The configuration priority represents the demand degree of the resource, which is divided into three levels, represented by F, S and T from high to low. For example, Figure 2As shown, requirement 1 {A, B, NU, [(2:S, 100:S, 100:F, 5:00am, 14hours), (2:S, 100:S, 200:F, 7:00pm, 10hours)]}, requirement 1 is from 5:00am to 7:00pm, the requirement from node A to node B is 2 computing resources, 100 storage resources, and 100 bandwidth resources; from 7:00pm to 5:00am, the requirement from node A to node B is 2 computing resources, 100 storage resources, and 200 bandwidth resources. Requirement 2 {C, D, NU, [(3:F, 10:S, 10:T, 1:00am, 16hours)]}, requirement 2 is from 1:00am to 5:00pm, the requirement 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 points and the durations of the above two requirements. That is, there are three time periods [5:00am, 7:00pm], [7:00pm, 5:00am], and [1:00am, 5:00pm]. After taking the intersection of the start and end times of the three time periods, four time slices are divided, that is, [1:00am, 5:00am], [5:00am, 5:00pm], [5:00pm, 7:00pm], and [7:00pm, 1:00am].

[0070] In this embodiment, the priority processing requirement is selected in each resource configuration requirement, which can be selected by the resource occupation amount of each resource configuration requirement and the urgency of each resource configuration requirement. For example, the greater the resource occupation amount, the less likely the corresponding resource configuration requirement is satisfied, and the lower the priority, that is, the priority of the resource configuration requirement is inversely proportional to the resource occupation amount; the higher the urgency of the requirement, the more important the corresponding resource configuration requirement to the user, and the higher the priority, that is, the priority of the resource configuration requirement is proportional to the urgency; of course, different resources have different dimensions and importance, and in this scheme, the resources in the requirement can be normalized before being counted, and the unified dimension enables direct comparison and calculation between different resource amounts.

[0071] In this embodiment, the first preset requirement can be the resource configuration requirement with the largest requirement priority, or the top three resource configuration requirements after sorting the requirement priorities from large to small, and the present scheme does not particularly limit this.

[0072] S12, by the tolerance of the execution time of the priority processing requirement, filtering the time slices that are continuous in time from the multiple time slices to form a time slice set, and generating multiple time slice sets.

[0073] In the embodiment, the tolerance of the priority processing demand to the execution time can be determined by prioritizing the urgency of the demand, the higher the urgency, the less the starting time point can be changed, that is, the lower the tolerance of the execution time, and vice versa, the higher the tolerance.

[0074] In the embodiment, the time slice set is obtained according to the time slice combination, and then the relative deviation of the starting time point and the duration of the time slice set from the starting time point and the duration of the priority processing demand is calculated. The greater the relative deviation, the lower the possibility of being accepted by the user, and the lower the tolerance. The multiple time slice schemes with a certain error in the starting time point and the duration of the priority processing demand are provided by calculating the relative deviation.

[0075] S13, based on the configuration priority and resource demand of each resource in the priority processing demand, calculate the resource reduction rate of the first resource 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 the embodiment, after generating the multiple time slice set schemes, the first resource provided by each time slice in each time slice set is determined first. The first resource is the resource with the highest configuration priority in the priority processing demand, that is, the resource with the highest user demand in the priority processing demand. For example, the resource with the highest configuration priority in demand 1 is bandwidth resource, and the resource with the highest configuration priority in demand 2 is computing resource. If the first resource provision can meet the resource configuration demand, it is more important to the user, and the final provided scheme is more acceptable to the user.

[0077] In the embodiment, after determining the first resource provided by each time slice, the resource reduction rate of the first resource compared with 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 the corresponding time slice to meet the user demand, and vice versa.

[0078] S14, according to the resource reduction rate, the negotiation time slice set is screened from the time slice set, and the user terminal is interacted based on the negotiation time slice set; when the acceptance instruction corresponding to the negotiation time slice set is received, the network resource is allocated according to the negotiation scheme corresponding to the negotiation time slice set.

[0079] In the embodiment, after the first resource provided by each time slice in each time slice set and the resource reduction rate of the resource demand are calculated, 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 maximum value is selected as the negotiation time slice set.

[0080] In the embodiment, the 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 resource, the storage resource and the bandwidth resource of the network topology link are reduced by the final negotiation computing resource, the storage resource and the bandwidth resource, that is, after the priority processing demand is completed, the remaining network resources are determined, and other resource configuration demands are continued to be completed.

[0081] After the negotiation time slice set is determined, the negotiation time slice set is deleted from the time slice set, and if the final user does not accept, the negotiation time slice set is selected from the time slice set according to the resource reduction rate, and the negotiation time slice set with the maximum minimum resource reduction rate in the time slice set is selected.

[0082] In summary, as shown in Figure 3 After the user demand is obtained, it is determined whether the current network resource meets the user demand, if yes, the network resource is directly allocated to the user; if not, the negotiation scheme is generated according to the existing network resource and the user is negotiated, and it is determined whether the user accepts the scheme, if yes, the network resource is allocated to the user according to the negotiation scheme; if not, the negotiation scheme is re-generated and the user is negotiated.

[0083] Specifically, the negotiation time slice set is interacted with the user terminal, including: the resource provision amount of each item of resource provided by the different topology paths corresponding to the negotiation time slice set; the relative deviation of the resource provision amount and the resource demand amount of each item of resource is calculated for different topology paths; the relative deviation of the resource provision amount and the resource demand amount of each item of resource is weighted and summed to obtain the network resource tolerance based on the configuration priority of each item of resource in the priority processing demand; the negotiation scheme is generated through the topology path corresponding to the network resource tolerance with the minimum value; and the negotiation scheme is sent to the user terminal for display.

[0084] Specifically, in the topology path in the selected negotiation time slice set, the available path that makes the network resource tolerance minimum is selected. The network resource tolerance is the ratio of the resource reduction amount to the demand resource in the priority processing demand, including the calculation tolerance storage tolerance bandwidth tolerance The network resource tolerance is finally represented as Nri = a 1i CAr i + a 2i STr i + a 3i BWr i .

[0085] wherein CAr i is the computing tolerance of the priority processing demand i, CAO i is the computing resource demand value of the demand in the priority processing demand, CA i is the actual computing resource value of the negotiation time slice set. STr i is the storage tolerance of the priority processing demand i, STO i is the storage resource demand value of the demand in the priority processing demand, ST i is the actual storage resource value of the negotiation time slice set. BWr i is the bandwidth tolerance of the priority processing demand i, BWO i is the bandwidth resource demand value of the demand in the priority processing demand, BW i is the actual bandwidth resource value of the negotiation time slice set.

[0086] The above based on the configuration priority of each resource in the priority processing demand, the relative deviation of the resource providing amount and the resource demand amount of each resource is weighted and summed to obtain the network resource tolerance, comprising: comparing the configuration priority of each resource in the priority processing demand, determining the weight value of each resource according to the comparison result; according to the relative deviation of the resource providing amount and the resource demand amount of each resource and the weight value, weighted sum to obtain the network resource tolerance.

[0087] The weight a 1i , a 2i , a 3i According to the relative importance of demand resource priority, the judgment matrix is constructed, and the corresponding value is calculated by using square root method. The priority F is slightly more important than S, F is obviously important than T, and S is slightly more important than T. The relative importance 1-9 scale method is obtained, 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 judgment Countdown from 1 to 9 Indicates the importance of comparing the corresponding two factors in exchange order

[0089] In the embodiment, after obtaining the resource configuration requirements, the disclosure divides the time period of each requirement into multiple time slices, determines the priority processing requirement in the resource configuration requirement, generates multiple time slice sets by the tolerance of the execution time of the priority processing requirement, determines the start time and duration of the network resource provided for the priority processing requirement, and then determines the resource reduction rate of the first resource provided by the time slice set compared with the resource requirement amount through the configuration priority of the resource, selects the negotiation time slice set in each time slice set through the resource reduction rate, interacts the negotiation scheme of the priority processing requirement with the user terminal through the negotiation time slice set, and allocates the network resource according to the negotiation scheme corresponding to the negotiation time slice set when receiving the acceptance instruction. When the network resource cannot meet the configuration of the user requirement, different dimension requirement degradation schemes are provided for the user, so that more requirements that cannot be configured due to lack of physical resources can be successfully allocated resources with a smaller resource reduction degree, more resource configuration requirements can be ensured to be met, and the service quality of the user is improved.

[0090] Please refer to Figure 4 , Figure 4 is a network resource allocation method flowchart provided by the present application, and as shown in Figure 4 , S11 includes the following steps:

[0091] S21, obtaining the emergency label, the required resource amount and the duration of each resource configuration requirement.

[0092] In the embodiment, referring to the requirement 1 and the requirement 2 in the above embodiment, the emergency labels of the requirement 1 and the requirement 2 are both NU. In the embodiment, the emergency label of each resource configuration requirement can be obtained to determine the importance of the resource configuration requirement to the user.

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

[0094] In the embodiment, according to the resource amount and the duration required by the resource configuration requirement, the resource occupation amount of the resource configuration requirement can be determined. The greater the resource occupation amount, the more difficult the corresponding resource configuration requirement is to be met, and vice versa.

[0095] S22, calculating the resource occupation amount through the resource amount and the duration, and determining the negotiation weight according to the emergency label and the resource occupation amount.

[0096] In this embodiment, the resource occupancy is equal to the product of the sum of the demand values of the computing resource, the storage resource and the bandwidth resource and the duration, and the resource occupancy of multiple time periods is added, i.e. the resource occupancy R of the demand in the entire time period i . Of course, different resources have different dimensions and importance, and when the resource amount is calculated in the scheme, each resource in the demand can be normalized and then counted, and the unified dimension enables direct comparison and calculation between different resource amounts; i.e. the demand values of the computing resource, the storage resource and the bandwidth resource are normalized and summed, the product of the sum and the duration is calculated, and the resource occupancy of multiple time periods is added, i.e. the resource occupancy corresponding to the demand is obtained.

[0097] In this embodiment, the negotiation weight is determined according to the urgency degree and the resource occupancy, and the standard weight can be determined by the urgency degree, for example, the standard weight of the resource configuration demand with the emergency label is greater than the standard weight of the resource configuration demand with the regular label; the negotiation weight of the corresponding resource configuration demand is calculated by the ratio of the standard weight and the resource occupancy, and the greater the negotiation weight, the greater the probability that the corresponding resource configuration demand is satisfied, and vice versa.

[0098] Specifically, the negotiation weight V i is the ratio of the weight W i of the resource configuration demand i and the total resource occupancy R i in the valid time of the demand, i.e.

[0099] In this embodiment, the standard weight can also be determined by the urgency degree and the configuration priority of each resource in the resource configuration demand, and specifically, as shown in the following table, the higher the urgency degree 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 the urgency degree in the above embodiment, and F, S and T correspond to the configuration priority, which identifies the demand degree for the resource.

[0102] The resource configuration demand is divided more finely by the urgency degree and the configuration priority, and different standard weights are allocated, and then the resource configuration demand that is more easily satisfied is determined.

[0103] S23, determine the demand priority of each resource configuration demand according to the negotiation weight.

[0104] In the embodiment, the negotiation weight can be directly taken as the demand priority of the resource configuration demand, and the greater the negotiation weight, the higher the corresponding demand priority. Since the number of resource configuration demands is relatively large, the priority interval can be set, and the corresponding demand priority can be set 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, the resource configuration demands are sorted according to the demand priority, and the resource configuration demand whose sorting result meets the first preset requirement is taken as a priority processing demand.

[0106] In the embodiment, the resource configuration demands are sorted according to the demand priority, thereby determining the priority processing demand. Specifically, the resource configuration demand with the first sorting result can be taken as the priority processing demand, and at this time, the first preset requirement is the first sorting result.

[0107] Please refer to Figure 5 , Figure 5 is a network resource allocation method flowchart provided by the application, and as shown in Figure 5 , S12 includes the following steps:

[0108] S31, the time slices are combined respectively by time slices to generate a to-be-determined time slice set composed of multiple time slices that are continuous in time.

[0109] In the embodiment, the time slices in the to-be-determined time slice set are continuous in time, for example, [1:00am, 5:00am] and [5:00am, 5:00pm] are two time slices that are continuous in time. In the scheme, since the number of resource configuration demands is relatively large, the time slices finally obtained are also relatively large, and in the scheme, the number of to-be-determined time slice sets obtained is relatively large, and the subsequent data calculation amount is also very large. Therefore, in the scheme, the creation of to-be-determined time slice sets can be stopped after a preset number of to-be-determined time slice sets are established. Since the scheme is based on the tolerance of execution time, the to-be-determined time slice set is filtered, the time slice closest to the starting time point of the priority processing demand can be selected as the initial time slice, and then a plurality of time slices similar to the duration of the priority processing demand are selected after the initial time slice to combine a to-be-determined time slice set, and multiple to-be-determined time slice sets are generated.

[0110] In the embodiment, the to-be-determined time slice set can also be directly constructed, and the to-be-determined time slice set can be obtained by dividing according to the fluctuation of the resource amount based on the resource that can be provided by the current service system in each time period and the resource amount.

[0111] S32, the starting time relative deviation is calculated according to the starting time point of the priority processing demand and the starting time point of each to-be-determined time slice set.

[0112] S33、According to the duration of the priority processing requirement and the duration of each pending time slice set, the duration relative deviation is calculated respectively.

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

[0114] S34, for each pending time slice set, the start time relative deviation and the duration relative deviation are weighted and summed to obtain the time deviation degree.

[0115] In the embodiment, the weight value of the start time relative deviation and the duration relative deviation can be determined by the emergency degree of the resource configuration requirement, for example, the resource configuration requirement with emergency degree of emergency has higher requirement for start time and lower requirement for duration, and the resource configuration requirement with emergency degree of regular has no obvious difference in requirement for start time and duration, when the emergency degree of the priority processing requirement is emergency, the weight of the start time relative deviation is greater than the weight of the duration relative deviation, and when the emergency degree of the priority processing requirement is regular, the weight of the start time relative deviation can be equal to the weight of the duration relative deviation.

[0116] S35, according to the order from small to large of the time deviation degree, the pending time slice set corresponding to the preset number of time deviation degrees is selected as the time slice set.

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

[0118] Specifically, z adjacent continuous pending time slice sets with low time deviation degree of the priority processing requirement are calculated as the time slice set. The time deviation degree is composed of time migration rate and duration change rate in a certain weight ratio.

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

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

[0121] Where, TSO i is the original start time of the priority processing requirement i, and TSi TLO is the actual start time of the pending time slice set i TL is the original duration of the priority processing demand i i TLD is the actual duration of the pending time slice set.

[0122] Then the time deviation degree is Tr i = w1TT i + w2TLC i The weights w1, w2 are constructed according to the relative importance of the urgency of the demand, and the corresponding values are calculated by using the square root method.

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

[0124]

[0125] The product of the m elements in each row of the matrix is calculated by using the square root method, and the weight is obtained by taking the 1 / m power: time migration rate Duration change rate After normalization, the weight is obtained

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

[0127]

[0128] The product of the m elements in each row of the matrix is calculated by using the square root method, and the weight is obtained by taking the 1 / m power: time migration rate Duration change rate After normalization, the weight is obtained

[0129] The smaller the time migration rate is, the smaller the change in the start time relative to the duration of the demand, and the higher the cost of time migration. The smaller the duration change rate is, the smaller the change in the duration, and the larger the change rate is, the larger the change. When the time deviation degree is small, the user's acceptance of negotiation on the time is high, and the time tolerance is large, and when the time deviation degree is large, the user's acceptance of negotiation on the time is low.

[0130] Please refer to Figure 6 , Figure 6 is a network resource allocation method flowchart provided by the present application, and four, as shown in Figure 6 , S13 includes the following steps:

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

[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 requirement amount of the first resource in each of the four time slices is as follows: the bandwidth resource requirement amount of [1:00am, 5:00am] is 200, the bandwidth resource requirement amount of [5:00am, 5:00pm] is 100, the bandwidth resource requirement amount of [5:00pm, 7:00pm] is 100, and the bandwidth resource requirement amount of [7:00pm, 1:00am] is 200.

[0134] S42, obtaining the minimum provision amount of the first resource in each time slice in the time slice set.

[0135] S43, calculating the relative deviation of the resource requirement amount and the minimum provision amount of the first resource in each time slice as a resource reduction rate.

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

[0137] In this embodiment, the minimum provision amount of the first resource in each time slice, that is, the minimum supply amount of the first resource in the time period corresponding to the time slice, is obtained. The minimum provision amount of the resource may cause data loss, data lag and data coverage of the resource demand side, so it is necessary to avoid the case that the minimum provision amount is too low to ensure normal data service.

[0138] Please refer to Figure 7 , Figure 7 is a network resource allocation method flowchart provided by the present application, and five, as shown in Figure 7 , S14 includes the following steps:

[0139] S51, 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.

[0140] S52, comparing each reference value to determine the time slice set corresponding to the maximum 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 various 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 embodiment:

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

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

[0145] In time slice set 1, the valid portions 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. 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 portions 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. 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 sorting according to the minimum possible bandwidth reduction rate is (time slice set 2, time slice set 1), so that the time slice set 2 with the maximum possible bandwidth reduction rate is selected as the negotiation time slice set of the demand 1.

[0148] Please refer to Figure 8 , Figure 8 The network resource allocation system provided by the application comprises 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 the embodiment, the data acquisition module 11 is configured to acquire a plurality of resource configuration demands.

[0150] In the embodiment, the time slice division module 12 is configured to divide the total time period of each resource configuration demand into a plurality of time slices according to the intersection of the starting time point and the duration of each resource configuration demand.

[0151] In the embodiment, the demand screening module 13 is configured to determine the resource configuration demand with the demand priority meeting the first preset requirement as a priority processing demand.

[0152] In the embodiment, the time slice reorganization module 14 is configured to screen the 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 execution time of the priority processing demand, and generate a plurality of time slice sets.

[0153] In the embodiment, the resource reduction rate calculation module 15 is configured to calculate the resource reduction rate of each time slice in each time slice set based on the configuration priority of each resource in the priority processing demand and the resource demand amount, and the configuration priority of the first resource meets the second preset requirement.

[0154] In the embodiment, the time slice set screening module 16 is configured to screen the negotiation time slice set from the time slice sets according to the resource reduction rate.

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

[0156] In the embodiment, the demand screening module 13 is specifically configured to acquire an emergency label, a required resource quantity and a duration of each resource configuration demand; to calculate a resource occupancy by the resource quantity and the duration, and to determine a negotiation weight according to the emergency label and the resource occupancy; to determine a demand priority of each resource configuration demand according to the negotiation weight; and to sort the resource configuration demands according to the demand priority, and to take a resource configuration demand meeting a first preset requirement in the sorting result as a priority processing demand.

[0157] In the embodiment, the time slice reorganization module 14 is specifically configured to combine time slices respectively to generate a plurality of pending time slice sets composed of time slices that are continuous in time; to calculate a starting time relative deviation respectively according to a starting time point of the priority processing demand and a starting time point of each pending time slice set; to calculate a duration relative deviation respectively according to a duration of the priority processing demand and a duration of each pending time slice set; and to obtain a time deviation degree by weighted summing the starting time relative deviation and the duration relative deviation for each pending time slice set, and to select a preset number of pending time slice sets corresponding to the time deviation degrees in ascending order of the time deviation degrees as time slice sets.

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

[0159] In the embodiment, the resource reduction rate calculation module 15 is specifically configured to acquire a resource demand quantity of the first resource in each time slice of a time slice set for the priority processing demand; to acquire a minimum provision quantity of the first resource in each time slice of the time slice set; and to calculate a relative deviation as a resource reduction rate according to the resource demand quantity and the minimum provision quantity of the first resource in each time slice.

[0160] In the embodiment, the time slice set screening module 16 is specifically configured to select a minimum value of the resource reduction rates in each time slice set as a reference value according to the resource reduction rates in each time slice of each time slice set; and to determine a time slice set corresponding to a maximum reference value as a negotiation time slice set by comparing the reference values.

[0161] In the embodiment, the negotiation scheme interaction module 17 is specifically configured to acquire resource provision quantities of resources provided by different topology paths corresponding to the negotiation time slice set; to calculate relative deviations of the resource provision quantities and resource demand quantities of the resources for different topology paths; to obtain a network resource tolerance by weighted summing the relative deviations of the resource provision quantities and resource demand quantities of the resources based on configuration priorities of the resources in the priority processing demand; to generate a negotiation scheme by a topology path corresponding to a minimum network resource tolerance; and to send the negotiation scheme to a user terminal for display.

[0162] In the embodiment, the negotiation scheme interaction module 17 is specifically configured to compare the configuration priorities of the resources in the priority processing demand, determine the weight values of the resources according to the comparison result, and obtain the network resource tolerance by weighted summation according to the relative deviation of the resource providing amount and the resource demand amount of each resource and the weight value.

[0163] As shown in Figure 9 The embodiment of the present application provides an electronic device, which comprises 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 complete mutual communication through the communication bus 1140.

[0164] The memory 1130 is used for storing a computer program.

[0165] The processor 1110 is used for executing the program stored in the memory 1130, and realizes any of the above allocation methods.

[0166] The electronic device provided by the embodiment of the present application is used for obtaining a plurality of resource configuration demands by executing the program stored in the memory 1130, dividing a total time period of each resource configuration demand into a plurality of time slices according to the intersection of the starting time point and the duration of each resource configuration demand, determining a resource configuration demand with a demand priority meeting a first preset requirement as a priority processing demand, screening time slices that are continuous in time to form a time slice set in the plurality of time slices according to the tolerance of the execution time of the priority processing demand, generating a plurality of time slice sets, calculating a resource reduction rate of a first resource that each time slice in each time slice set can provide compared with the resource demand amount based on the configuration priority of each resource in the priority processing demand and the resource demand amount, determining that the configuration priority of the first resource meets a second preset requirement, screening a negotiation time slice set from the time slice set according to the resource reduction rate, and interacting with a user terminal based on the negotiation time slice set, and allocating network resources according to a negotiation scheme corresponding to the negotiation time slice set when receiving an acceptance instruction 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 the convenience of representation, only one thick line is shown in the figure, but it does not mean that there is only one bus or only one type of bus.

[0168] The communication interface 1120 is configured to communicate between the electronic device and other devices.

[0169] The memory 1130 can include a random access memory 1130 (RAM) and can further include a non-volatile memory, such as at least one disk memory 1130. Optionally, the memory 1130 can be at least one storage device located remotely from the aforementioned processor 1110.

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

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

[0172] In the above embodiments, all or part of the embodiments can be implemented by software, hardware, firmware, or any combination thereof. When implemented using software, all or part of the embodiments can be implemented 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, all or part of the processes or functions according to the embodiments of the present invention are generated. 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 one website, computer, server, or data center to another website, computer, server, or data center via a wired (e.g., coaxial cable, optical fiber, digital subscriber line (DSL)) or wireless (e.g., infrared, wireless, microwave, etc.) method. The computer-readable storage medium can be any available medium that can be accessed by a computer or a data storage device such as a server or data center that includes one or more available media. 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 drive (SSD)).

[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 cause the essence of the corresponding technical solutions to deviate from the spirit and scope of the technical solutions of the embodiments of the present disclosure.

Claims

1. A network resource allocation method, characterized in that: The allocation method includes: Acquire multiple resource allocation requirements, divide the total time period of each resource allocation requirement into multiple time slices according to the intersection of the starting time point and the duration of each resource allocation requirement; and determine the resource allocation requirement whose priority meets the first preset requirement as the priority requirement; Based on the tolerance of the priority processing requirement to the execution time, selecting time slices that are temporally continuous from the plurality of time slices to form a time slice set, thereby generating a plurality of the time slice sets; 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 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.

2. The network resource allocation method according to claim 1, wherein: The step of determining the resource allocation requirement whose priority meets the first preset requirement as a priority processing requirement includes: Obtain the urgency tag, required resource quantity, and duration of each resource allocation requirement; Calculating resource occupancy by the resource quantity and duration, and determining a negotiation weight according to the urgency 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, wherein: The step of screening temporally continuous time slices from the plurality of time slices to form a time slice set based on the tolerance of the priority processing requirement to the execution time, and generating the plurality of time slice sets, comprises: By combining the time slices respectively, a pending time slice set consisting of a plurality of temporally continuous time slices is generated; Calculating the start time relative deviations according to the start time of the priority processing demand and the start time of each of the pending time slice sets; Calculating duration relative deviations 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 the start time relative deviation and duration relative deviation to obtain a time deviation degree; According to the order of the time deviation degrees from small to large, a preset number of pending time slice sets corresponding to the time deviation degrees are selected as the time slice sets.

4. The network resource allocation method according to claim 1, wherein: The second preset requirement includes: the first resource being 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, includes: For each of the time slice sets, obtaining a resource demand for a first resource in each of the time slices in the time slice set that is required for priority processing; 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, wherein: The filtering, according to the resource reduction rate, from the time slice set to obtain a negotiated time slice set includes: According to the resource reduction rate in each time slice in each time slice set, selecting a minimum value of the resource reduction rate in each time slice set as a reference value; The reference values ​​are compared 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 provided and required resources of each resource is calculated; based on the configuration priority of each resource in the priority processing requirement, the relative deviation between the provided and required resources 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 plan 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 summation of the relative deviations between the resource provision and resource demand 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 performing weighted summation based on 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 distribution system comprises: Data acquisition module, used to obtain multiple resource configuration requirements; A time slice division module, configured to divide the total time period of each resource configuration requirement into a plurality of time slices according to the intersection of the starting time point and the duration of each resource configuration requirement; A demand screening module is used to determine resource allocation demands whose demand priorities meet the first preset requirements as priority demands; a time slice reorganization module, configured to select temporally continuous time slices 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, thereby generating 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 to 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 negotiated 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, allocate 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 to 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 according to any one of claims 1 to 7 is implemented.

Citation Information

Patent Citations

  • Isolation method and device for dynamic network topology resources

    CN117749631A

  • ITSS operation and maintenance resource configuration optimization method and system

    CN119204356A