CN114039937A

CN114039937A - Network resource management method and related equipment

Info

Publication number: CN114039937A
Application number: CN202111350800.2A
Authority: CN
Inventors: 张晗; 尹霞; 施新刚; 王之梁; 王继龙
Original assignee: Tsinghua University
Current assignee: Tsinghua University
Priority date: 2021-11-15
Filing date: 2021-11-15
Publication date: 2022-02-11

Abstract

The application discloses a network resource management method and related equipment. The method comprises the following steps: in the case of at least one first request to access a network, obtaining availability of the at least one first request; determining resource allocation information of a first network scene based on the availability of the at least one first request, wherein the first network scene is any one of a plurality of network scenes in a first preset time period; and allocating resources to each first request in the first network scene based on the resource allocation information of the first network scene. Therefore, resources can be allocated to the request according to the availability of the request for accessing the network, the waste of network resources is reduced, the network utilization rate is improved, and the high availability of the application is guaranteed.

Description

Network resource management method and related equipment

Technical Field

The present application belongs to the field of communications technologies, and in particular, to a network resource management method and a related device.

Background

Wide area networks are receiving more and more attention as an important infrastructure for connecting data centers in different regions and various sites. The availability of applications is an important indicator in optimizing the various goals of wide area network transmissions. On the one hand, applications require continuous, uninterrupted service. On the other hand, high availability may establish a good reputation and mark a good user experience for network providers. However, there is a lot of resource waste in the wide area network, and the existing resource allocation scheme has low network utilization rate and cannot guarantee high availability of the application.

Disclosure of Invention

In view of this, the network resource management method, apparatus, computer device, computer storage medium, and computer program product provided in the embodiments of the present application can allocate resources to a request according to availability of the request for accessing a network, reduce network resource waste, improve network utilization, and ensure high availability of applications.

In a first aspect, an embodiment of the present application provides a network resource management method, where the network resource management method may include:

in the case of at least one first request to access a network, obtaining availability of the at least one first request;

determining resource allocation information of a first network scene based on the availability of the at least one first request, wherein the first network scene is any one of a plurality of network scenes in a first preset time period;

and allocating resources to each first request in the first network scene based on the resource allocation information of the first network scene.

In a second aspect, an embodiment of the present application provides a network resource management device, where the network resource management device includes:

a first request obtaining module, configured to obtain availability of at least one first request when the at least one first request accesses a network;

the first information determining module is used for determining resource allocation information of a first network scene based on the availability of at least one first request, wherein the first network scene is any one of a plurality of network scenes in a first preset time period;

and the first allocation module is used for allocating resources to each first request in the first network scene based on the resource allocation information of the first network scene.

In a third aspect, an embodiment of the present application provides a computer device, including: a processor and a memory storing computer program instructions;

the processor, when executing the computer program instructions, implements a network resource management method as described in the first aspect.

In a fourth aspect, the present application provides a computer storage medium having computer program instructions stored thereon, where the computer program instructions, when executed by a processor, implement the network resource management method according to the first aspect.

According to the application availability management method, device, computer equipment, computer storage medium and computer program product provided by the embodiment of the application, the availability of at least one first request accessed to the network is obtained, the resource allocation information of all first requests in a first network scene is determined, and the resource allocation is carried out on all first requests based on the resource allocation information. Therefore, the resource allocation is carried out according to the availability requirement of each first request, so that the resource allocation result can meet the availability requirement of the first request, the high availability of the application can be ensured, the equal allocation of the resources to all the applications is avoided, the waste of network resources is reduced, and the network utilization rate is improved.

Drawings

In order to more clearly illustrate the technical solutions of the embodiments of the present application, the drawings needed to be used in the embodiments of the present application will be briefly described below, and for those skilled in the art, other drawings can be obtained according to the drawings without creative efforts.

Fig. 1 shows a schematic diagram of a network architecture provided by the prior art;

fig. 2 is a schematic diagram illustrating a network system architecture provided in an embodiment of the present application;

fig. 3 is a schematic flowchart illustrating a network resource management method according to an embodiment of the present application;

fig. 4 illustrates a network resource management device according to an embodiment of the present application;

fig. 5 shows a hardware structure diagram of a computer device provided in an embodiment of the present application.

Detailed Description

Features and exemplary embodiments of various aspects of the present application will be described in detail below, and in order to make objects, technical solutions and advantages of the present application more apparent, the present application will be further described in detail below with reference to the accompanying drawings and specific embodiments. It should be understood that the specific embodiments described herein are intended to be illustrative only and are not intended to be limiting. It will be apparent to one skilled in the art that the present application may be practiced without some of these specific details. The following description of the embodiments is merely intended to provide a better understanding of the present application by illustrating examples thereof.

Wide area networks are receiving more and more attention as an important infrastructure for connecting data centers in different regions and various sites. Fig. 1 is a schematic diagram illustrating a network architecture provided in the prior art, and as shown in fig. 1, a terminal application sends a resource request carrying resource request information to a data center through a wide area network, and the data center returns a request resource to the terminal application through the wide area network, so that the terminal application provides a service to a user.

In fact, even a Software Defined Wide Area Network (SD-WAN) has a lot of resources wasted, which results in that the Network cannot guarantee the performance of the application. In addition, the wide area network cannot provide high-availability service guarantee for the application, and when the network fails, the transmission performance of the application is greatly reduced.

The availability of applications is an important indicator that can measure the service of an application. On the one hand, applications require continuous, uninterrupted service. On the other hand, high availability may establish a good reputation and mark a good user experience for network providers. However, the network can fail at any time, and ensuring high availability of applications is a very challenging task. There are three problems that exist at present:

first, most resource allocation strategies are too conservative. Under these policies, the utilization of the network is low. To ensure that the application can still obtain sufficient bandwidth when the network fails, these strategies typically reduce the actual utilization of the link so that congestion does not occur when the network fails.

Second, existing resource allocation strategies do not account for differences in application availability requirements. Current guarantee mechanisms for network application availability treat all applications equally. In fact, in practice, different applications have different availability requirements, and treating all the applications equally results in the application with high availability obtaining resources which do not meet the requirements, and the application with low availability obtaining resources which are more than enough.

Third, when the network fails, its recovery mechanism does not take into account the demand difference in application availability, resulting in a large loss of revenue for the service provider.

In view of this, the network needs the ability to provide predictable, deterministic services to applications. Embodiments of the present application provide a network resource management method, an apparatus, a computer device, a computer storage medium, and a computer program product, which can perform resource allocation according to availability requirements of each first request, so that a resource allocation result can meet the availability requirements of the first request, thereby ensuring high availability of applications, avoiding equal allocation of resources to all applications, reducing network resource waste, and improving network utilization.

In the embodiment of the application, the network is composed of a plurality of nodes, and each node is connected through a communication link to form a network topology. A path between a pair of nodes may refer to a path that starts at a starting node, sequentially passes through a series of nodes and an arrow line in the direction of the arrow line, and finally reaches a destination node.

The "resource" in the embodiment of the present application may refer to a bandwidth in bits/second. The traffic is the sum of the amount of the terminal application receiving and transmitting in bytes.

It should be noted that the request in the embodiment of the present application may be a block acknowledgement request. The requested resource requirement may be a request for a desired broadband resource.

Before describing the network resource management method provided by the embodiment of the present application in detail, a network system architecture related to the present application is briefly introduced first.

Fig. 2 is a schematic diagram of a network system architecture provided in an embodiment of the present application, and as shown in fig. 2, the network system architecture may include a test (battery) system, a data center, and a user terminal. The user terminal transmits a Block Acknowledgement request (BA requests) to the battery system. The BATE system returns the result of either accepting (Adj) or rejecting (Reject) the request. The BATE system performs data interaction with the data center through a reliable connection, namely, a Transmission Control Protocol (TCP) session.

Here, the battery system includes: 1 controller 21 and a plurality of site managers 212. The controller 21 is a brain of the entire battery system, and is used for resource engineering and controlling the entire battery system. The controller 21 may run admission control algorithms, resource engineering algorithms, and fault recovery mechanisms. Specifically, when a new request arrives, the controller 21 will run the admission control algorithm to determine whether the newly arrived request can be accepted by the battery system. If the request is accepted by the BATE system, the BATE system pre-allocates resources (i.e., bandwidth) and notifies the site manager 22 to control the rate. And, for accepted requests, the controller 21 will execute the resource engineering algorithm at regular intervals. Meanwhile, the controller 21 first assumes that an error may occur in the link, performs a pre-error recovery mechanism on the assumption of an error condition, and stores the result in the site controller 22.

In some embodiments, the controller 21 may include an offline route calculation module 211, an admission control module 212, an online scheduling module 213, and a communication module 214.

Here, the offline route calculation module 211 may be configured to calculate all path conditions between stations according to the topology of the network, path finding between stations may be shortest with K, and the like.

The admission control module 212 may be configured to execute an admission control algorithm to determine whether a new request can be accepted by the BATE system.

The online scheduling module 213 may be configured to perform the execution of the online resource engineering algorithm and transmit the result of the execution to the communication module. Here, the online resource algorithm may be various resource scheduling methods.

The communication module 214 may be used for communication control. Here, the communication module 214 and the station management module 22 communicate with each other via a long connection of a Transmission Control Protocol (TCP).

In some embodiments, site manager 22 may include a network broker module 221, a resource enforcement module 222, and a communications module 223.

Here, in the bat system, the Network proxy module 221 is accessed into a Network through a Software Defined Network (SDN) commercial switch. The SDN switch is controlled by the controller 21 through openflow protocol in network technology.

Specifically, the bat system employs a tunnel-based isolation and bandwidth guarantee mechanism, wherein isolation between applications is via a Virtual eXtensible Local Area Network (VXLAN), wherein the first 12 bits of VXLAN represent bandwidth requirements of the applications and the last 12 bits of VXLAN are used to mark paths. When the data packet is transmitted in the BATE system, a VXLAN mark is marked on an entrance switch, a VXLAN head is stripped at an exit, and the middle switch only forwards the data packet.

The network agent module 221 is further configured to run a link detection algorithm to detect a link state.

The resource forcing module 222 is configured to limit the calculated reserved resource after the traffic engineering mechanism of the controller calculates the resource allocation.

The communication module 223 is used for linking with the controller 21 and receiving the command sent by the controller 21.

In the above embodiment, the bat system may determine whether a BA request can be received according to admission control, and may determine in advance whether a network can satisfy availability of a new access request, thereby avoiding a situation of network preemption. And the BATE system can allocate the bandwidth resources to the accepted requests at intervals through a resource engineering algorithm, so that the bandwidth resource allocation strategy can be adjusted in time based on the link state, and the utilization rate of the network is improved on the premise of meeting the availability of the received requests. In addition, the BATE system calculates a standby resource allocation mechanism in advance based on a failure recovery failure mechanism, and when a link error is detected, the designed mechanism is started quickly, so that the loss of revenue caused by failure is minimized. Thus, the resource availability requirement of the application can be guaranteed through the BATE system.

It should be noted that the resource related to the embodiment of the present application may be a bandwidth resource.

Fig. 3 is a schematic flowchart illustrating a network resource management method according to an embodiment of the present application, and as shown in fig. 3, the network resource management method may be applied to the battery system shown in fig. 2.

The network resource management method comprises the following steps:

s31, in case of at least one first request to access the network, obtaining availability of the at least one first request.

Here, the first request refers to a block acknowledgement request that has accessed the network. The first request may include first request parameters, which may include availability of the first request and bandwidth resources required by the first request.

For example, the first request is a block acknowledgement request d, the request

Can be expressed as a request d start time

To

Inner, bandwidth resource requirement b_dAt least a guarantee of beta is required_dTime of (d).

S32, determining resource allocation information for the first network scenario based on the availability of the at least one first request.

Here, the resource allocation information may include a set of bandwidth resource allocation results for each first request. The first network scenario may be any one of a plurality of network scenarios within a first preset time period. The first predetermined period of time may be any length of time, such as ten minutes, etc.

In the embodiment of the present application, the network may refer to a wide area network connected to a data center, and the network model is G (V, E), where V denotes a data center or a site set, and E denotes a set of all links. One network scenario may be described as z ═ { z ═ z₁,z₂… } wherein z is_iIndicating that the ith link is normal in the scenario (z)_i1) or fail (z)_i0). For example, there are 4 links in the network, then there are 16 network scenarios, which are {1,1,1,1}, {0,1,1,1}, {1,0,1,1}, {1,1,1,0}, {1,1,0,0}, {1,0,1,0}, {0,1,1,0}, {1,0,0,1}, {0,1,0,1}, {0,0,1,1}, {0,0,0,0}, {0,1, 0}, {0,0,0,1}, and {0,0,0,0 }.

In S32, the battery system may perform bandwidth resource allocation on the plurality of first requests that have accessed the network according to a resource engineering algorithm, to obtain resource allocation information of each first request. Wherein the resource engineering algorithm may be a resource scheduling algorithm related to the availability of the request.

S33, based on the resource allocation information of the first network scenario, allocating network resources to each first request in the first network scenario.

Here, the network resource may be a network bandwidth resource. In the first network scenario, the battery system performs bandwidth resource allocation on each first request through the resource allocation information determined in S32.

In the above embodiment, by obtaining the availability of at least one first request that has been accessed by the network, the resource allocation information of all first requests in the first network scenario is determined, and resource allocation is performed on all first requests based on the resource allocation information. Therefore, the resource allocation is carried out according to the availability requirement of each first request, so that the resource allocation result can meet the availability requirement of the first request, the high availability of the application can be ensured, the equal allocation of the resources to all the applications is avoided, the waste of network resources is reduced, and the network utilization rate is improved.

In some embodiments, the resource allocation problem may be converted into a linear programming problem, the relevant condition for meeting the availability of the first request may be taken as a constraint, and the network reservation for the first requested resource may be taken as a programming target. Thus, S32 may include the steps of:

and under a first constraint condition associated with the availability of at least one first request, taking the minimum network reserved resource of the first network scenario as an optimization target to obtain the resource allocation information of the first network scenario.

Here, the first constraint condition may include the following condition: a lower limit on the transmission return rate of the at least one first request, the resource allocation amount of the at least one first request not being negative, the network satisfying a condition of availability of the at least one first request, the resource occupancy on any link in the network being less than its transmission capability and the resource demand of the at least one first request being less than the resource allocation amount.

It should be noted that the minimum reserved resource of the network may be the minimum bandwidth resource reserved by the network for all the accessed requests (i.e. the first request) on the premise that the network satisfies the availability of all the accessed requests.

Optionally, the minimum reserved network resources of the first network scenario are an optimization goal, and may be expressed as:

where d represents a first request that the network has accessed, i.e. a first request.

Indicating that the network has accessed the first set of requests. k denotes a node pair in the network. K represents a set of node pairs in the network. T is_kRepresenting all paths between node pair k. t represents a path. minimize represents the minimization function.

Indicating a set of resource allocation results for the accessed request d by the network.

The first constraint may be expressed as:

where d denotes a request d that the network has accessed, i.e. the first request. D represents the set of network accessed requests. k denotes a node pair in the network. K represents a set of node pairs in the network. T is_kRepresenting all paths between node pair k. t represents a path. Z represents a set of network scenarios, Z represents a first network scenario.

Indicating the transmission return rate of request d in scene z. If it is not

Greater than 1 indicates that the network scenario z is a qualified scenario. If it is not

Not less than 1, it means that the network scenario z is not a qualified scenario, i.e. the resource allocation policy cannot meet the transmission requirement.

Indicating whether the path t is normal in the network scenario z.

Representing the sum of the resources of request d on all paths.

Indicating whether path t passes through link e. c. C_eIndicating the transmission capability of link e.

Indicating the bandwidth requirement of request d for the kth path node pair.

To represent

The lower limit of (3). Beta is a_dIndicating the availability of request d. z being a qualified scenario may refer to a network scenario z where the sum of the bandwidth of request d over all paths is greater than the resource requirement of request d. p is a radical of_zThe probability that the network scenario z is a qualified scenario can be expressed as:

here, equations (1-3) represent the limitation conditions of the link transmission capability. Equations (1-4) indicate that request d requires the total amount of resources allocated not to be negative. Equations (1-6) indicate that the availability of request d needs to be satisfied. Equations (1-7) represent the limits of the bandwidth resources that request the allocation of d.

In the above embodiment, the resource allocation problem is converted into a linear planning problem, and the resource allocation information of each first request in the first network scenario is obtained by taking the minimum network reserved resource of the first network scenario as a planning target under the first constraint condition associated with the availability of each first request, so that the network resource allocation information can be planned as a whole, and the resource allocation can be performed according to the availability demand difference of the first request, so that the high availability of the application can be ensured, and further, the network overhead is minimum and the network utilization rate is improved under the condition of meeting the availability of the first request.

In some embodiments, in order to enable the battery system to perform resource allocation rapidly every preset time period, resource allocation information under each network scenario may be calculated in advance, and then resource allocation information corresponding to the network scenario within the preset time period is determined. Therefore, before S32, the network resource management method further includes:

determining a plurality of network scenes in a first preset time period based on links in a network in the first preset time period.

Here, a link in a network refers to a communication link between a pair of nodes in the network. Different network scenarios are associated with different link states of links in the network. That is, one link state of a link corresponds to one network scenario. That is, the network scenario may contain the link status of each link in the network. The BATE system can determine the number of network scenes according to the number of links in the network, and determine a plurality of network scenes according to the link states of the links.

Meanwhile, S32 may include the steps of:

determining resource allocation information for each of a plurality of network scenarios based on the availability of the at least one first request;

obtaining a first network scene from a plurality of network scenes according to the link state of a link in a network in a first preset time period;

and determining the resource allocation information of the first network scene from the resource allocation information of each network scene based on the first network scene.

Here, the method for calculating the resource allocation information of each network scenario is similar to the method for calculating the resource allocation information of the first network scenario in the foregoing embodiment, and details are not repeated here. The BATE system can obtain a first network scene from a plurality of network scenes according to the link state of a link in a network within a preset time period, and determine resource allocation information of the first network scene from resource allocation information of each network scene.

In the above embodiment, under the condition that the network access request is not changed, the battery system calculates resource allocation information for each request in each network scenario in advance, and determines a link state of a network link at fixed time intervals, so as to determine the network scenario within a preset time period, and further determines resource allocation information matched with the current network scenario from the resource allocation information in each network scenario, so that the battery system performs resource allocation according to the resource allocation information within the preset time period. Therefore, the resource allocation information in the first preset time period can be quickly determined, and the resource allocation information can be flexibly adjusted according to the state of the network link.

In the above embodiments, solving the linear programming problem for a set of network scenarios is time consuming, since the number of network scenarios is dramatically increased when the topology of the network is large. The inventors have found that multiple link-out problems are unlikely to occur in a practical network scenario. Therefore, when the resource allocation information of each network scene is solved, the network scene with a plurality of problematic links can be cut.

In some embodiments, before determining resource allocation information for each of the plurality of network scenarios based on the availability of the at least one first request, the network resource management method further comprises:

acquiring the number of link faults of each network scene in a plurality of network scenes;

and determining a second network scene in which the number of the link faults is not less than the preset number in the plurality of network scenes.

Here, the preset number may be 3. The BATE system can determine the number of link faults in a plurality of network scenes in a preset time period and find out a second network scene with the number of link faults not less than 3 from the number of link faults.

For example, the number of links in the network is 4, the normal link status is marked as 1, the link status abnormality is marked as 0, and the faulty network scenario with the number of faulty links being 3 or more, i.e., {1,0,0,0}, {0,1,0,0}, {0,0,1,0}, {0,0, 1}, and {0,0,0,0}, is cut out from a plurality of network scenarios.

Meanwhile, determining resource allocation information of each network scenario of the plurality of network scenarios based on the availability of the at least one first request may include:

determining resource allocation information for network scenarios other than the second network scenario among the plurality of network scenarios based on the availability of the at least one first request.

Here, determining the resource allocation information of each of the plurality of network scenes may be specifically performed by cutting out the second network scene from the plurality of network scenes, and then determining the resource allocation information of the plurality of network scenes after cutting out.

It should be noted that determining the resource allocation information of the plurality of network scenes after being clipped is similar to determining the resource allocation information solving method of the first network scene in the foregoing embodiment, and details are not repeated here.

In the above embodiment, the second network scenes in which the number of link failures is not less than the preset number may be determined, and the second network scenes may be cut out from the multiple network scenes, so that the time for solving the resource allocation information in the multiple network scenes within the preset time period is shortened without affecting the accuracy of calculating the resource allocation information. And because the network scenes which cannot appear in the actual network are cut out, the calculated resource allocation information of each network scene can meet the application requirements of the actual network.

In some embodiments, in order to prevent the network from seizing, the bat system uses a first-come-first-serve policy for the requests, and performs admission control on the newly received requests by using an admission control policy, i.e., by determining whether the network satisfies the availability of all the requests. Therefore, after S33, the network resource management method further includes:

receiving a second request;

obtaining a network satisfaction availability result in a third network scenario based on the availability of the at least one first request and the availability of the second request;

in the case that the network satisfaction availability result indicates that the network satisfies the availability of at least one of the first request and the availability of the second request, the BATE system controls the access network of the second request and allocates resources to the second request;

the BATE system controls the access network rejecting the second request in case the network satisfaction availability result indicates that the network does not satisfy the availability of the at least one first request and the availability of the second request.

In an embodiment of the present application, the second request may be a block acknowledgement request newly received by the network. The second request includes request parameters including availability of the request and resources required by the request. The third network scenario is any one of a plurality of network scenarios within a second preset time period. And the second time interval is a preset time interval after the second request is received.

The "network satisfaction availability result" referred to in the embodiments of the present application may be used to indicate whether the network can satisfy the availability of all the first requests and the availability of the second requests at the same time.

Here, the bat system determines whether the network can simultaneously satisfy the availability of all the first requests and the availability of the second requests in a third network scenario according to the availability of all the first requests that have been accessed and the availability of the second request that has just been received, thereby obtaining a network satisfaction availability result.

In an embodiment of the present application, the network satisfaction availability result indicates the availability of the network to satisfy at least one first request and the availability of a second request, that is, the network may satisfy the availability of all first requests that have been accessed and the availability of the second request that has just been received. Therefore, after the network accesses the second request, the network can guarantee the availability of the second request and the preemption phenomenon can not occur.

Thus, in the event that the network satisfaction availability result indicates that the network satisfies the availability of at least one of the first request and the availability of the second request, the BATE system controls the access network of the second request and performs an initial resource allocation for the second request.

In an embodiment of the present application, the network satisfaction availability result indicates that the network does not satisfy the availability of the at least one first request and the availability of the second request, that is, the network may not satisfy the availability of all the first requests that have been accessed and the availability of the second request that has just been received. Therefore, after the network accesses the second request, the network cannot guarantee the availability of the second request, and a preemption phenomenon may occur to affect the availability of other applications.

Thus, in the event that the network satisfaction availability result indicates that the network does not satisfy the availability of the at least one first request and the availability of the second request, the BATE system controls the access network that rejects the second request.

In the above embodiments, the bat system implements admission control of the newly received request based on the determination of the control policy, that is, determines whether to allow the newly received request to access the network according to whether the network satisfies the availability of the accessed request and the availability of the newly received request. Therefore, the first-come-first-serve strategy and the admission control strategy are adopted for the requests, so that the availability of the requests can be guaranteed, and the phenomenon of network preemption can be prevented.

In some embodiments, the admission problem may be converted to a linear scheduling problem, with the maximum number of requests that the network can meet the availability being a scheduling goal. Thus, obtaining a network satisfaction availability result based on the availability of the at least one first request and the availability of the second request comprises:

determining a maximum number of requests for a third network scenario with a maximum number of requests for a third request in the network as an optimization objective under a second constraint associated with availability of the at least one first request and availability of the second request.

Obtaining a network satisfaction availability result indicating an availability of the network to satisfy the at least one first request and an availability of a second request, in case the maximum number of requests is not less than a total number of requests of the at least one first request and the second request;

in case the maximum number of requests is smaller than the total number of requests of the at least one first request and the second request, a network satisfaction availability result is obtained indicating that the network does not satisfy the availability of the at least one first request and the availability of the second request.

In an embodiment of the application, the third request is a request of the at least one first request and the second request, the availability of which is satisfied. The second constraint may be: a limitation on the transmission return rate of the third request, a limitation on the availability of the third request being met, the resource occupancy on any link in the network being less than its transmission capacity and the resource allocation of at least one third request not being negative.

Here, the battery system determines whether the network can satisfy the availability of the accessed first request and the availability of the newly received second request by comparing the maximum number of requests that can satisfy the availability of the network (i.e., the maximum number of requests for the third request in the network) with the total number of requests for the first request and the second request, thereby obtaining a network satisfaction availability result.

And, in the event that the maximum number of requests is less than the total number of requests, determining that the network is unable to satisfy the availability of the accessed first request and the availability of the newly received second request, thereby resulting in a network satisfied availability result indicating the availability of the network to satisfy at least one of the first request and the availability of the second request.

In the case that the maximum number of requests is less than the total number of requests, it may be determined that the network is unable to satisfy the availability of the accessed first request and the availability of the newly received second request, resulting in a network satisfaction availability result indicating that the network is unable to satisfy the availability of the at least one first request and the availability of the second request.

Optionally, with the maximum number of requests of the third request in the network as an optimization target, it may be expressed as:

maximiz∑_d∈Da_d (2-1)

here, the request set D includes a newly received request (i.e., the second request) and a request set D to which the network has accessed^～。a_dE {0,1}, which indicates whether the resource request of request d can be satisfied. At a_dAt 0, the resource request of request d cannot be satisfied. At a_dAt 1, the resource request of request d can be satisfied. maximizz represents a maximization function. Equation (3-1) can be described as maximizing the number of requests to satisfy availability, i.e., a for all requests in request set D_dThe sum of which is maximal.

Alternatively, the second constraint may be expressed as:

wherein M represents a large number. Equations (2-4) through (2-5) indicate that in network scenario z,

the network scenario z is only qualified when the requirement of the condition is met, i.e. the reserved resources between all node pairs are greater than their requirements. Equations (2-7) through (2-8) may represent constraints that can be satisfied by the availability of request d.

In the above embodiment, the admission control problem is converted into a linear programming problem, and the maximum number of requests whose availability is satisfied in the third network scenario is obtained with the maximum number of requests whose availability can be satisfied by the network as the optimization target under the second constraint condition associated with the availability of the first request and the availability of the second request. Thus, by solving the linear programming problem, the optimal situation, i.e., accepting as many requests as possible, can be obtained. And comparing the maximum request quantity with the total request quantity accepted and newly received in the network to determine whether to access the newly received request to the network, thereby quickly determining whether to receive the new request access and further avoiding the network from seizing after the new request access.

In some embodiments, to improve the processing efficiency of the admission control policy, obtaining a network satisfaction availability result in a third network scenario based on the availability of the at least one first request and the availability of the second request may include:

acquiring a first residual resource of the network except for the resource allocation amount of at least one first request;

in case the first remaining resource meets the availability requirement of the second request, a network satisfaction availability result is obtained indicating an availability of the network to satisfy the at least one first request and an availability of the second request.

Here, it can be assumed that the resource allocation amounts of all the first requests that have been accepted cannot be updated. And calculating the residual resource amount of the network except the resource allocation amount of the first request, and if the residual resource amount of the network can meet the availability requirement of the second request, accepting the second request and performing initial allocation on the second request.

In the above embodiment, based on the technical idea of processing the request in the first-come-first-serve manner, assuming that the amount of the allocated resources of the received request is unchanged, the second request is controlled to be accessed by judging the availability of the network remaining resource amount capable of meeting the second request, so that the admission control of the newly received request can be quickly judged without complex calculation, and the processing efficiency of the system admission control is improved.

In some embodiments, when the first-come-first-served policy determines that the network meets the availability requirements of the newly received request, additional methods may be employed to determine whether to accept the newly received request to access the network. After acquiring a first remaining resource of the network except for the resource allocation amount of the at least one first request, the network resource management method further includes:

when the first residual resource does not meet the availability requirement of the second request, sequencing at least one first request and the second request according to the size of the minimum resource available product of the requests to obtain a first request sequence;

in the Nth period, according to the sequence from small to large of the resource available product, the following steps are executed:

acquiring an Nth request in the first request sequence, wherein N is a positive integer;

calculating a second remaining resource of the network other than the allocated resource requested in the previous N-1 cycles, in case the availability provided by the network satisfies the availability of the Nth request;

under the condition that the second residual resource meets the resource requirement of the Nth request, calculating the distributed resource of the Nth request;

adding 1 to N, and executing the Nth cycle again;

in the event that N equals the number of requests of the at least one first request and the second request, and the second remaining resources satisfy the resource demand of the Nth request, the loop is stopped, resulting in a network satisfied availability result indicating an availability of the network to satisfy the at least one first request and an availability of the second request. .

In the embodiment of the present application, the resource availability product is a product of the broadband resource required by the request and the availability, and may be expressed as:

in this embodiment of the present application, the ordering at least one first request and one second request according to the size of the resource availability product of the requests to obtain a first request ordering may refer to that the bat system calculates the resource availability products of the first request and the second request, respectively, and orders the first request and the second request according to the size of the resource availability products to obtain an ordered first request ordering. Wherein the first request ordering may be a non-decreasing request ordering or a non-increasing request ordering based on the resource availability product.

In this embodiment of the present application, the nth request in the first request ordering is obtained in the nth cycle in an order from a smaller resource availability product to a larger resource availability product, which may be understood as that the resource availability product of the request obtained in the nth cycle is not smaller than the resource availability product of the request obtained in the previous cycle. For example, the resource availability product of the request acquired in the 2 nd cycle is smaller than the resource availability product of the request acquired in the 1 st cycle.

In this embodiment, N is equal to the number of requests of at least one first request and the second request, and the second remaining resource satisfies the resource requirement of the nth request, which may indicate that the network may satisfy the availability of the requests acquired in the first N-1 cycles, and allocate resources to the requests acquired in the first N-1 cycles. And the network may also satisfy the availability of the last request in the first ordered set of requests. That is, the network satisfies the availability of all requests in the first request ordering, such that a network satisfied availability result may be obtained that indicates the availability of the network to satisfy all first requests and the availability of the second request.

Here, it is first determined by a first come first served policy that the first remaining resource does not satisfy the availability requirement of the second request, and then an efficient guess is made as to whether there is an allocation such that the availability of all requests is satisfied. Specifically, whether the availability provided by the network meets the availability of the requests or not can be sequentially judged according to the sequence from the small to the large of the minimum resource availability product of the requests, and the resources are allocated to the requests under the condition that the availability meets the requirements, so that after the remaining resources of the network can meet the availability of all the requests, the availability that the network can meet all the first requests and the second requests can be judged, and then a network meeting availability result indicating the availability that the network meets at least one of the first requests and the availability of the second requests can be obtained.

It should be noted that, in this embodiment of the present application, in the 1 st cycle, when the above-mentioned two availability determinations are performed on the request with the smallest resource availability product in the first request ordering, the second remaining resource of the network is the original remaining resource of the network. In the 2 nd period, when the requests obtained from the first request sequence are subjected to the above two availability judgments, the second remaining resources of the network are the remaining resources in the network except for the allocated resources requested in the 1 st period. And by analogy, when the nth request is subjected to the above two availability judgments, the second remaining resources of the network are the remaining resources of the network except for the allocated resources of all the requests in the previous N-1 th period.

In the above embodiment, the first ordering requests are sequentially requested to determine whether the network is available according to the sequence of the resource availability products from small to large, so that the network can be determined to meet the availability request as much as possible, and the admission control processing efficiency is further improved.

Optionally, calculating the nth requested allocated resource in the event that the second remaining resources meet the nth requested resource requirement may include calculating the requested allocated resource between each pair of node pairs in terms of reliability of the link.

For the requested allocation of resources between each pair of node pairs, the following steps may be performed: determining a path t with the minimum product of transmission capacity and path reliability from a pair of node pairs; the allocated resources for request d on path t; updating the network residual resources; and taking the path t from the node pair out of all paths, and repeating the steps until the requested allocation resources are completely allocated.

In the embodiment, the remaining resources on the path are allocated according to the reliability of the link, so that the allocation of the resources of the request is more reasonable, and the network can gnaw the availability of all the requests.

In some embodiments, in an nth request having a small nth resource available product of N in the ordering of the first requests, N being a positive integer greater than 1, performing steps comprising:

and stopping the circulation to obtain a network satisfaction availability result indicating that the network does not satisfy the availability of at least one of the first request and the second request in case the availability provided by the network does not satisfy the availability of the Nth request or the second remaining resource does not satisfy the resource requirement of the Nth request.

Here, in the nth cycle, for the nth request in the first request ordering, the battery system may determine that the availability provided by the network does not satisfy the availability of the nth request, or that the second remaining resource does not satisfy the resource requirement of the nth request, and may determine that the network cannot satisfy the availability of all of the first requests and the availability of the second requests, and may obtain a network satisfaction availability result indicating that the network does not satisfy the availability of the at least one of the first request and the availability of the second request. And after the network satisfaction availability result is obtained, stopping the steps of adding 1 to N and then.

In one example, the BATE system calculates the resource availability product of all requests in set D (i.e., the set containing the first request and the second request), and performs the following steps for set D:

s41, the request d with the minimum resource availability product is taken out.

S42, judging the availability S provided by the network_dAvailability beta whether to satisfy the request d_d. If the condition is not satisfied, S43 is executed, and if so, S44 is executed.

And S43, confirming that the network does not meet the availability of the set D, and rejecting the second request for access.

And S44, judging whether the network residual resource meets the availability requirement of the request d. If not, the process proceeds to S45. If yes, the process proceeds to S46.

And S45, confirming that the network does not meet the availability of the set D, and rejecting the second request for access.

S46, the resource allocation of request d is calculated according to the link reliability.

Here, the method for allocating resources of the computation request d is similar to the method for allocating resources of the computation request described in the foregoing embodiment, and is not described here again.

And S47, updating the network residual resources, adding 1 to N, and re-executing S41. And stopping the re-execution of the step S41 until N is 1 greater than the number of requests in the request set, confirming that the network meets the availability of the set D, and accepting the second request to access the network.

Therefore, the step of judging whether the availability of the requests with the resource availability products from small to large is satisfied is carried out, so that the availability requirements of all the requests are satisfied by efficiently guessing whether an allocation mode exists or not, the availability result of whether the network satisfies all the requests is obtained, and the admission control processing efficiency is improved.

The inventors have discovered that when a network link fails, a Service Level Agreement (SLA) may be violated and a network Service provider may need to refund a user. However, existing recovery mechanisms do not take into account the demand difference in application availability, resulting in a substantial loss of revenue for the network service provider. Therefore, the inventor proposes a failure recovery mechanism for maximizing the yield, so that the backup resource allocation information can be started quickly when the network fails, the data packet loss can be reduced, and the SLA loss caused by the network failure can be reduced as much as possible.

In some embodiments, after S33, the network resource management method further includes: and under a third network scene that at least one first link fails, re-allocating resources to each first request under the third network scene based on the maximum residual income of at least one first request in the network.

In this embodiment, the third network scenario may be a network scenario in which a link fails. The maximum remaining revenue may be the maximum remaining revenue in the network in addition to SLA losses.

In the embodiment of the present application, the failure recovery mechanism is determined by the maximum remaining revenue of all the first requests in the network, that is, the battery system may obtain the backup resource allocation information in the third network scenario based on the maximum remaining revenue of all the first requests in the network. And the BATE reallocates resources to each first request in a third network scene based on the backup resource allocation information.

In the above embodiment, by maximizing the remaining profit, obtaining the backup resource allocation information, and reallocating the resources to each of the first requests in the third network scenario based on the backup resource allocation information, the requests can be restored quickly, and the SLA loss due to the network failure can be reduced as much as possible.

In some embodiments, to make the failure recovery mechanism more comprehensive and accurate, the failure recovery mechanism problem may be converted into a linear programming problem. The method for reallocating resources to each first request in a third network scenario based on the maximum remaining profit of at least one first request in the network may include the following steps:

under a third constraint condition associated with the transmission return rate of at least one first request, taking the maximum residual income under a third network scene as an optimization target to obtain standby resource allocation information of the third network scene;

and based on the standby resource allocation information, re-allocating resources to each first request in a third network scene.

In the embodiment of the present application, the third constraint condition may include: the transmission return rate of the at least one first request is greater than the second parameter and the resource occupancy on any link in the network is less than its transmission capacity. Wherein the second parameter is used to indicate whether the first request violates an SLA specification.

Here, by taking the maximum remaining profit in the third network scenario as the optimization goal,

optionally, the maximum remaining revenue of all first requests in the network is an optimization goal, which can be expressed as:

wherein r is_dRepresenting the remaining revenue for request d.

Alternatively, the third constraint may be expressed as:

wherein, M is a large number,

the representation indicates whether link e is valid in network scenario z. y is_d(i.e., a second parameter) may indicate whether request d violates its SLA requirements in a network scenario. g_dIndicating that a benefit of d is requested when there is no breach of the SLA regulations. Mu.s_dRepresenting the requested refund proportion in violation of the SLA regulations.

In the above embodiment, under the third constraint condition, the linear programming is performed with the maximum remaining revenue under the third network scenario as the optimization target, so that the backup resource allocation information under the maximum remaining revenue can be obtained. Therefore, the problem of the failure recovery mechanism is converted into the linear planning problem, the requested backup resource allocation strategy can be comprehensively planned, the economic loss caused by network failure is reduced to the maximum extent, the allocation resources requested on the failed link are reallocated to other normal links, and the loss of data packets can be avoided as far as possible.

In some embodiments, to increase the speed of reallocating resources, the loss of revenue is reduced. Reallocating resources to each first request in a third network scenario based on a maximum remaining revenue of at least one first request in the network, may include:

sequencing the at least one first request according to the ratio of the profit of the request to the resource demand to obtain a second sequencing request;

in the Mth period, the following steps are executed according to the sequence of the ratio from big to small:

obtaining the Mth request in the second request sequence, wherein M is a positive integer,

calculating a third remaining resource of the network under a third network scene except the allocation resource requested in the first M-1 periods;

under the condition that the third residual resource meets the resource requirement of the Mth request, calculating the allocation resource allocation of the Mth request, and adding the Mth request into a standby request set;

adding 1 to M, and executing the Mth cycle again;

in the first case, the resource is allocated to each first request under the third network scene again based on the resource allocation requested in the standby request set.

In the embodiment of the present application, the first case includes: and the third remaining resource does not meet the resource requirement of the Mth request, and the profit of all the requests in the standby request set is greater than that of the Mth request, or the sum of M and 1 is greater than the quantity of the first requests.

In this embodiment of the present application, the at least one first request and the at least one second request are sorted according to a ratio of revenue to resource demand of the requests to obtain a second sorted request, which may refer to that the bat system calculates a ratio of revenue to resource demand of each first request, and sorts each request according to the ratio to obtain a sorted second request sort. The second request ordering may be a non-descending ordering of requests or a non-ascending ordering of requests based on the ratio.

In the embodiment of the present application, the mth request in the second request ordering is obtained in the mth cycle in the order from small to large of the ratio, which can be understood as that the ratio of the requests obtained in the nth cycle is not less than the ratio of the requests obtained in the previous cycle.

In addition, in the Mth period, under the condition that the third residual resource does not meet the resource requirement of the Mth request and the profit of all the requests in the standby request set is not greater than the profit of the Mth request, emptying the standby request set and adding the Mth set into the standby request set;

updating the allocation resource requested in the Mth period to the allocation resource requested in the previous M periods in the network; and adding 1 to M, and executing the Mth cycle again.

In the above embodiment, the first requests are sorted according to the ratio of the profit to the resource demand, and whether resource allocation is performed on the requests in the request sorting is determined in sequence according to the sequence from large to small, and the allocable resources of the requests are calculated, so as to determine the backup allocation resources of the first requests in the third network scenario, so that the request profit is the largest in the network after the resources are reallocated.

In one example, the battery system sorts the ratio of the profit to the resource demand of each first request, sorts the sorted second requests, and executes the following steps:

s51, according to the sequence of the ratio from big to small, in the Mth period, obtaining the Mth request and the network residual resource (i.e. the third residual resource), wherein the ratio of the Mth request is not less than the ratio of the Mth-1 request in the M-1 period.

And S52, judging whether the network residual resource meets the resource requirement of the Mth request. If the result is satisfied, the process proceeds to step S53, and if the result is not satisfied, the process proceeds to step S56.

S53, calculating the resource allocation of the Mth request, adding the Mth request into the standby set, and updating the network residual resource.

S54, adding 1 to M, judging whether M plus 1 is larger than the number of the first request, if yes, the step is shifted to S56. If no, the process proceeds to step S55.

S55, the mth cycle is re-executed.

S56, stopping re-executing the mth cycle, and re-allocating resources to each first request in the third network scenario based on the allocation resources requested in the standby set.

S57, under the condition that the network residual resource does not meet the resource requirement of the Mth request, judging whether the profit of all the requests in the standby set is larger than the profit of the Mth request. If yes, the process proceeds to S58. If no, the process proceeds to S56.

S58, emptying the standby request set, adding the Mth set into the standby request set, updating the allocation resource requested in the Mth period into the allocation resource requested in the previous M periods in the network, and turning to S54.

Based on the same technical concept as the network resource management method, the embodiment of the application also provides a network resource management device. Fig. 4 shows a network resource management device provided in an embodiment of the present application, where the network resource management device 40 may include:

a first request obtaining module 41, configured to obtain availability of at least one first request in a case where the at least one first request accesses a network;

a first information determining module 42, configured to determine resource allocation information of a first network scenario based on availability of at least one first request, where the first network scenario is any network scenario in a plurality of network scenarios within a first preset time period;

the first allocating module 43 is configured to allocate resources to each first request in the first network scenario based on the resource allocation information of the first network scenario.

In some embodiments, the first information determining module 42 is specifically configured to, under a first constraint condition associated with the availability of the at least one first request, obtain the resource allocation information of the first network scenario with a minimum reserved resource of the network of the first network scenario as an optimization target, where the first constraint condition includes:

a lower limit of a transmission return rate of the at least one first request;

the resource allocation amount of the at least one first request is not negative;

the network satisfying a condition of availability of the at least one first request;

the resource occupation on any link in the network is less than the transmission capacity;

the resource requirement of the at least one first request is less than the resource allocation amount.

In some embodiments, the network resource management device 40 may further include:

a first scenario determination module, configured to determine, based on a link in the network within the first preset time period, a plurality of network scenarios in the first preset time period, where different network scenarios are associated with different link states of the link;

the first information determination module 42 may include:

a first information determination sub-module for determining resource allocation information for each of a plurality of network scenarios based on the availability of the at least one first request;

the scene obtaining submodule is used for obtaining a first network scene from the plurality of network scenes according to the link state of the link in the network within the first preset time period;

and the second information determining submodule is used for determining the resource allocation information of the first network scene from the resource allocation information of each network scene based on the first network scene.

the system comprises a fault number acquisition module, a fault detection module and a fault detection module, wherein the fault number acquisition module is used for acquiring the link fault number of each network scene in a plurality of network scenes;

the second scene determining module is used for determining second network scenes in which the number of link faults is not less than the preset number in a plurality of network scenes;

the first information determining sub-module may be specifically configured to determine resource allocation information of network scenarios other than the second network scenario among the plurality of network scenarios based on availability of the at least one first request.

a first receiving module, configured to receive a second request;

an availability result obtaining module, configured to obtain a network satisfaction availability result in a third network scenario based on availability of at least one first request and availability of the second request, where the third network scenario is any one of multiple network scenarios in a second preset time period;

a control module, configured to control access to the network for a second request and allocate resources for the second request, if the network satisfaction availability result indicates that the network satisfies the availability of at least one of the first request and the availability of the second request;

a denying module for denying the second requested access network if the network satisfaction availability result indicates that the network does not satisfy the availability of the at least one first request and the availability of the second request.

In some embodiments, the availability result obtaining module may include:

a maximum number determination sub-module, configured to determine, under a second constraint condition associated with availability of the at least one first request and availability of the second request, a maximum number of requests for a third network scenario with a maximum number of requests for a third request in the network as an optimization goal, the third request being a request of the at least one first request and the second request for which availability is satisfied, where the second constraint condition includes:

a third requested transmission rate of return limit condition; a constraint that availability of the third request is satisfied; the resource occupation on any link in the network is less than the transmission capacity; the resource allocation amount of the at least one third request is not negative;

a first result obtaining sub-module, configured to obtain a network satisfaction availability result indicating availability of the network to satisfy the at least one first request and availability of the second request, in case that the maximum number of requests is not less than a total number of requests of the at least one first request and the second request;

a second result obtaining sub-module for obtaining a network satisfaction availability result indicating that the network does not satisfy the availability of the at least one first request and the availability of the second request, in case the maximum number of requests is smaller than the total number of requests of the at least one first request and the second request.

In some embodiments, the availability result obtaining module may include:

a first remaining resource obtaining sub-module, configured to obtain a first remaining resource of the network except for the resource allocation amount of the at least one first request;

a third result obtaining sub-module for obtaining a network satisfaction availability result indicating an availability of the network to satisfy the at least one first request and an availability of the second request, in case the first remaining resource satisfies the availability requirement of the second request.

the first ordering module is used for ordering at least one first request and the second request according to the size of the resource available product of the requests under the condition that the first residual resources do not meet the availability requirement of the second request, so as to obtain a first request ordering;

a first cycle execution module, configured to execute the following steps in an nth cycle in an order from a small resource available product to a large resource available product:

adding 1 to N, and executing the Nth cycle again;

in the case where N is equal to the number of requests of the at least one first request and the second request, and the second remaining resources satisfy the resource requirement of the nth request, a network satisfaction availability result is obtained indicating an availability of the network to satisfy the at least one first request and an availability of the second request.

In some embodiments, the first periodic execution module may be further configured to obtain a network satisfaction availability result indicating that the network does not satisfy the availability of the at least one first request and the availability of the second request, if the availability provided by the network does not satisfy the availability of the nth request or the second remaining resource does not satisfy the resource requirement of the nth request.

and the reallocation module is used for reallocating resources to each first request in a third network scene based on the maximum residual income of the at least one first request in the network under the third network scene that at least one first link fails.

In some embodiments, the reassignment module may include:

a first backup obtaining sub-module, configured to obtain, under a third constraint condition associated with the transmission return rate of the at least one first request, backup resource allocation information of a third network scenario with a maximum remaining revenue in the third network scenario as an optimization target, where the third constraint condition includes:

the transmission return rate of the at least one first request is greater than a second parameter indicating whether the first request violates a service level agreement specification;

the resource occupation on any link in the network is less than the transmission capability thereof;

and the first redistribution module is used for redistributing the resources to the first requests under the third network scene based on the standby resource allocation information.

In some embodiments, the reassignment module may include:

the second sequencing submodule is used for sequencing the at least one first request according to the ratio of the profit of the request to the resource demand to obtain a second sequencing request;

the second cycle execution submodule is used for executing the following steps in the Mth cycle according to the sequence from small to large of the ratio:

obtaining the Mth request in the second request sequence, wherein M is a positive integer;

calculating a third remaining resource of the network under the third network scene except the allocation resource requested in the first M-1 periods;

adding 1 to the M, and executing the Mth cycle again;

under a first condition, re-allocating resources to each first request in a third network scenario based on the allocation resources requested in the backup request set, where the first condition includes one of the following conditions: the third remaining resource does not meet the resource requirement of the Mth request, and the profit of all requests in the standby request set is greater than that of the Mth request, or the M plus 1 is greater than the quantity of the first requests.

The computer device may comprise a processor 51 and a memory 52 in which computer program instructions are stored.

Specifically, the processor 51 may include a Central Processing Unit (CPU), or an Application Specific Integrated Circuit (ASIC), or may be configured to implement one or more Integrated circuits of the embodiments of the present Application.

Memory 52 may include mass storage for data or instructions. By way of example, and not limitation, memory 52 may include a Hard Disk Drive (HDD), a floppy Disk Drive, flash memory, an optical Disk, a magneto-optical Disk, tape, or a Universal Serial Bus (USB) Drive or a combination of two or more of these. Memory 52 may include removable or non-removable (or fixed) media, where appropriate. The memory 52 may be internal or external to the integrated gateway disaster recovery device, where appropriate. In a particular embodiment, the memory 52 is a non-volatile solid-state memory.

The memory 52 may include Read Only Memory (ROM), Random Access Memory (RAM), magnetic disk storage media devices, optical storage media devices, flash memory devices, electrical, optical, or other physical/tangible memory storage devices. Thus, in general, the memory includes one or more tangible (non-transitory) computer-readable storage media (e.g., memory devices) encoded with software comprising computer-executable instructions and when the software is executed (e.g., by one or more processors), it is operable to perform operations described with reference to the methods according to an aspect of the application.

The processor 51 implements any of the network resource management methods in the above embodiments by reading and executing computer program instructions stored in the memory 52.

In one example, the computer device may also include a communication interface 53 and a bus 54. As shown in fig. 5, the processor 51, the memory 52, and the communication interface 53 are connected via a bus 54 to complete mutual communication.

The communication interface 53 is mainly used for implementing communication between modules, apparatuses, units and/or devices in the embodiments of the present application.

The bus 54 comprises hardware, software, or both to couple the components of the electronic device to each other. By way of example, and not limitation, a bus may include an Accelerated Graphics Port (AGP) or other graphics bus, an Enhanced Industry Standard Architecture (EISA) bus, a Front Side Bus (FSB), a Hypertransport (HT) interconnect, an Industry Standard Architecture (ISA) bus, an infiniband interconnect, a Low Pin Count (LPC) bus, a memory bus, a Micro Channel Architecture (MCA) bus, a Peripheral Component Interconnect (PCI) bus, a PCI-Express (PCI-X) bus, a Serial Advanced Technology Attachment (SATA) bus, a video electronics standards association local (VLB) bus, or other suitable bus or a combination of two or more of these. The bus 54 may include one or more buses, where appropriate. Although specific buses are described and shown in the embodiments of the application, any suitable buses or interconnects are contemplated by the application.

The computer device may implement the network resource management method and the network resource management apparatus described in conjunction with fig. 3 to 4 based on executing the method in the embodiment of the present application.

In addition, in combination with the network resource management method in the foregoing embodiments, the embodiments of the present application may provide a computer storage medium to implement. The computer storage medium having computer program instructions stored thereon; the computer program instructions, when executed by a processor, implement any of the network resource management methods in the above embodiments.

In addition, in combination with the network resource management method in the foregoing embodiments, an embodiment of the present application provides a computer program product, which includes a computer program or instructions, and when the computer program or instructions are executed by a processor, the computer program or instructions implement any one of the network resource management methods in the foregoing embodiments.

It is to be understood that the present application is not limited to the particular arrangements and instrumentality described above and shown in the attached drawings. A detailed description of known methods is omitted herein for the sake of brevity. In the above embodiments, several specific steps are described and shown as examples. However, the method processes of the present application are not limited to the specific steps described and illustrated, and those skilled in the art can make various changes, modifications, and additions or change the order between the steps after comprehending the spirit of the present application.

The functional blocks shown in the above-described structural block diagrams may be implemented as hardware, software, firmware, or a combination thereof. When implemented in hardware, it may be, for example, an electronic circuit, an Application Specific Integrated Circuit (ASIC), suitable firmware, plug-in, function card, or the like. When implemented in software, the elements of the present application are the programs or code segments used to perform the required tasks. The program or code segments may be stored in a machine-readable medium or transmitted by a data signal carried in a carrier wave over a transmission medium or a communication link. A "machine-readable medium" may include any medium that can store or transfer information. Examples of a machine-readable medium include electronic circuits, semiconductor memory devices, ROM, flash memory, Erasable ROM (EROM), floppy disks, CD-ROMs, optical disks, hard disks, fiber optic media, Radio Frequency (RF) links, and so forth. The code segments may be downloaded via computer networks such as the internet, intranet, etc.

It should also be noted that the exemplary embodiments mentioned in this application describe some methods or systems based on a series of steps or devices. However, the present application is not limited to the order of the above-described steps, that is, the steps may be performed in the order mentioned in the embodiments, may be performed in an order different from the order in the embodiments, or may be performed simultaneously.

Aspects of the present application are described above with reference to flowchart illustrations and/or block diagrams of network resource management methods, apparatus, computer devices, computer storage media, and computer program products according to embodiments of the application. It will be understood that each block of the flowchart illustrations and/or block diagrams, and combinations of blocks in the flowchart illustrations and/or block diagrams, can be implemented by computer program instructions. These computer program instructions may be provided to a processor of a general purpose computer, special purpose computer, or other programmable data processing apparatus to produce a machine, such that the instructions, which execute via the processor of the computer or other programmable data processing apparatus, enable the implementation of the functions/acts specified in the flowchart and/or block diagram block or blocks. Such a processor may be, but is not limited to, a general purpose processor, a special purpose processor, an application specific processor, or a field programmable logic circuit. It will also be understood that each block of the block diagrams and/or flowchart illustration, and combinations of blocks in the block diagrams and/or flowchart illustration, can be implemented by special purpose hardware for performing the specified functions or acts, or combinations of special purpose hardware and computer instructions.

As described above, only the specific embodiments of the present application are provided, and it can be clearly understood by those skilled in the art that, for convenience and brevity of description, the specific working processes of the system, the module and the unit described above may refer to the corresponding processes in the foregoing method embodiments, and are not described herein again. It should be understood that the scope of the present application is not limited thereto, and any person skilled in the art can easily conceive various equivalent modifications or substitutions within the technical scope of the present application, and these modifications or substitutions should be covered within the scope of the present application.

Claims

1. A method for network resource management, the method comprising:

2. The method of claim 1, wherein determining resource allocation information for a first network scenario based on the availability of the at least one first request comprises:

obtaining resource allocation information of the first network scenario with a minimum reserved network resource of the first network scenario as an optimization goal under a first constraint condition associated with availability of at least one first request, wherein the first constraint condition comprises:

a lower limit of a transmission return rate of the at least one first request;

3. The method of claim 1, wherein prior to determining resource allocation information for a first network scenario based on the availability of the at least one first request, the method further comprises:

determining a plurality of network scenes in the first preset time period based on the links in the network in the first preset time period, wherein different network scenes are associated with different link states of the links;

said determining resource allocation information for a first network scenario based on the availability of the at least one first request comprises:

determining resource allocation information for each of the plurality of network scenarios based on the availability of the at least one first request;

obtaining a first network scene from the plurality of network scenes according to the link state of the link in the network within the first preset time period;

and determining the resource allocation information of the first network scene from the resource allocation information of the network scenes on the basis of the first network scene.

4. The method of claim 1, wherein prior to said determining resource allocation information for each of the plurality of network scenarios based on availability of the at least one first request, the method further comprises:

acquiring the number of link faults of each network scene in the plurality of network scenes;

determining a second network scene in which the number of link faults is not less than a preset number in the plurality of network scenes;

said determining resource allocation information for each of the plurality of network scenarios based on the availability of the at least one first request comprises:

5. The method of claim 1, wherein after allocating network resources to each of the first requests in the first network scenario based on the resource allocation information of the first network scenario, the method further comprises:

receiving a second request;

obtaining a network meeting availability result under a third network scenario based on the availability of the at least one first request and the availability of the second request, wherein the third network scenario is any one of a plurality of network scenarios within a second preset time period;

in the case that the network satisfaction availability result indicates that the network satisfies the availability of the at least one first request and the availability of the second request, controlling access to the network for the second request and allocating resources for the second request;

denying the second request access to the network if the network satisfaction availability result indicates that the network does not satisfy the availability of the at least one first request and the availability of the second request.

6. The method of claim 5, wherein obtaining a network satisfaction availability result based on the availability of the at least one first request and the availability of the second request comprises:

determining a maximum number of requests of a third network scenario with a maximum number of requests of a third request in the network as an optimization objective under a second constraint associated with the availability of the at least one first request and the availability of the second request, the third request being a request of the at least one first request and the second request for which the availability is satisfied, wherein the second constraint comprises:

a constraint on a transmission return rate of the third request;

a restriction condition that availability of the third request is satisfied;

the resource allocation amount of the at least one third request is not negative;

obtaining a network satisfaction availability result indicating an availability of the network to satisfy the at least one first request and an availability of the second request, if the maximum number of requests is not less than a total number of requests of the at least one first request and the second request;

obtaining a network satisfaction availability result indicating that the network does not satisfy the availability of the at least one first request and the availability of the second request, if the maximum number of requests is less than a total number of requests of the at least one first request and the second request.

7. The method of claim 5, wherein obtaining a network satisfaction availability result in a third network scenario based on the availability of the at least one first request and the availability of the second request comprises:

acquiring a first remaining resource of the network except the resource allocation amount of the at least one first request;

obtaining a network satisfaction availability result indicating an availability of the network to satisfy the at least one first request and an availability of the second request, where the first remaining resources satisfy the availability requirement of the second request.

8. The method of claim 7, wherein after the obtaining a first remaining resource of the network except for the at least one first requested resource allocation, the method further comprises:

when the first remaining resource does not meet the availability requirement of the second request, sequencing the at least one first request and the second request according to the size of the resource available product of the requests to obtain a first request sequence;

acquiring the Nth request in the first request sequence, wherein N is a positive integer;

calculating the allocated resource of the Nth request under the condition that the second residual resource meets the resource requirement of the Nth request;

adding 1 to the N, and executing the Nth cycle again;

obtaining a network satisfaction availability result indicating an availability of the network to satisfy the at least one first request and an availability of the second request, where N is equal to a request number of the at least one first request and the second request, and the second remaining resources satisfy a resource requirement of the Nth request.

9. The method of claim 8, wherein for an Nth request with a Nth smallest resource availability product in the first request ordering, N being a positive integer greater than 1, performing the following steps, including:

obtaining a network satisfaction availability result indicating that the network does not satisfy the availability of the at least one first request and the availability of the second request, in case the availability provided by the network does not satisfy the availability of the Nth request or the second remaining resources do not satisfy the resource requirement of the Nth request.

10. The method of claim 1, wherein after the allocating network resources to each of the first requests in the first network scenario based on the resource allocation information of the first network scenario, the method further comprises:

and under a third network scene that at least one first link fails, re-allocating resources to each first request under the third network scene based on the maximum residual income of the at least one first request in the network.

11. The method of claim 10, wherein the reallocating the fourth requested resource on the at least one first link based on the at least one first requested maximum remaining revenue in the network comprises:

under a third constraint condition associated with the transmission return rate of the at least one first request, obtaining standby resource allocation information of a third network scenario with a maximum remaining profit under the third network scenario as an optimization target, where the third constraint condition includes:

12. The method of claim 10, wherein said reallocating resources to each of the first requests in a third network scenario based on a maximum remaining revenue of the at least one first request in the network comprises:

in the Mth period, the following steps are executed according to the sequence of the ratio from small to large:

adding 1 to the M, and executing the Mth cycle again;

13. An apparatus for network resource management, the apparatus comprising:

a first request obtaining module, configured to obtain availability of at least one first request in a case where the at least one first request accesses a network;

a first information determining module, configured to determine resource allocation information of a first network scenario based on availability of the at least one first request, where the first network scenario is any one of multiple network scenarios within a first preset time period;

a first allocation module, configured to allocate resources to each first request in the first network scenario based on resource allocation information of the first network scenario.

14. A computer device, the device comprising: a processor and a memory storing computer program instructions;

the processor, when executing the computer program instructions, implements the network resource management method of any of claims 1-12.

15. A computer storage medium having computer program instructions stored thereon which, when executed by a processor, implement the network resource management method of any one of claims 1-12.