Bandwidth resource redundancy self-adaptive allocation method and system for multi-node link

Abstract

The invention provides a bandwidth resource redundancy adaptive allocation method and system oriented to a multi-node link. The method comprises the following steps: constructing a node bandwidth allocation income calculation model based on service delay redundancy according to node information of a preset link; according to the node bandwidth allocation income calculation model, the optimal solution of bandwidth resource allocation is obtained through analysis by taking maximization of the node bandwidth income as a target; and verifying the satisfaction condition of each service transmission delay through the optimal solution, and carrying out bandwidth resource allocation according to the verification result. Therefore, through three-level linkage of the time delay redundancy income model, the KKT optimization solution and the water level water injection feedback mechanism, the balance problem of resource allocation and service time delay in a multi-node link is solved, the bandwidth utilization rate and the time delay standard-reaching rate are remarkably improved, and the method is particularly suitable for a cross-domain key service communication scene.

Description

Technical Field

[0001] This application relates to the field of communication network resource management technology, and in particular to a method and system for adaptive allocation of bandwidth resource redundancy for multi-node links. Background Technology

[0002] In multi-node links (such as paths consisting of source node-intermediate node-sink node), traditional bandwidth allocation methods have the following problems:

[0003] Static allocation leads to resource waste: fixed bandwidth allocation cannot adapt to dynamic changes in business traffic, resulting in idle resources on low-load nodes and potential congestion on high-load nodes.

[0004] Insufficient latency protection: Existing methods are unable to accurately quantify service latency redundancy (such as power differential protection, real-time video and other services have large differences in latency sensitivity), which can easily cause high-priority services to time out.

[0005] Low optimization efficiency: Centralized resource allocation has high computational complexity and cannot quickly respond to dynamic fluctuations in the available bandwidth of nodes (such as link failures or sudden traffic).

[0006] Therefore, there is an urgent need for a dynamic optimization scheme that can adaptively adjust bandwidth allocation while taking into account latency constraints and resource utilization. Summary of the Invention

[0007] The purpose of this application is to provide a method and system for adaptive allocation of bandwidth resource redundancy for multi-node links, which maximizes resource utilization while ensuring service latency requirements by dynamically optimizing node bandwidth allocation.

[0008] To achieve the above objectives, this application provides a bandwidth resource redundancy adaptive allocation method for multi-node links. The method includes: constructing a node bandwidth allocation benefit calculation model based on service delay redundancy according to the node information of a preset link; analyzing and obtaining the optimal solution for bandwidth resource allocation based on the node bandwidth allocation benefit calculation model with the goal of maximizing node bandwidth benefit; verifying the satisfaction of the transmission delay of each service through the optimal solution; and allocating bandwidth resources based on the verification results.

[0009] In the above-mentioned bandwidth resource redundancy adaptive allocation method, optionally, the node information includes source nodes and aggregation nodes, and the source nodes and aggregation nodes correspond to business master stations located in different cities.

[0010] In the aforementioned bandwidth resource redundancy adaptive allocation method, optionally, the optimal solution for bandwidth resource allocation is obtained by analyzing the node bandwidth allocation benefit calculation model with the goal of maximizing node bandwidth benefit. This includes: determining the minimum allocatable bandwidth of each node based on the node information of the preset link; constructing a node bandwidth allocation benefit calculation model based on service latency redundancy using the minimum allocatable bandwidth; establishing a linear programming model with the goal of maximizing node bandwidth benefit through the node bandwidth allocation benefit calculation model; and obtaining the optimal solution for bandwidth resource allocation based on the current allocatable bandwidth of each node and the linear programming model.

[0011] In the above-mentioned bandwidth resource redundancy adaptive allocation method, optionally, the node bandwidth allocation benefit calculation model based on the minimum allocable bandwidth and service delay redundancy includes: constructing a delay redundancy model for each service based on the transmission delay requirements of each service and the time taken for the last unit of data in the service data packet to be generated and sent to the target node; and constructing a node bandwidth allocation benefit calculation model based on the delay redundancy model of each service and the set of services to be transmitted.

[0012] In the above-described adaptive bandwidth resource redundancy allocation method, optionally, the linear programming model includes:

[0013]

[0014]

[0015] Among them, Ω i It is the bandwidth allocation benefit of node i, Ξ i Let b represent the set of services to be transmitted at node i. i,k B is the bandwidth allocation of node i to service k. i This represents the amount of allocable bandwidth for node i. C1 indicates that the bandwidth allocation for service k should be between 0 and the node's allocable bandwidth, and C2 indicates that the sum of the bandwidth allocations for all services to be transmitted on the node does not exceed the node's allocable bandwidth.

[0016] In the above-mentioned bandwidth resource redundancy adaptive allocation method, optionally, obtaining the optimal solution for bandwidth resource allocation based on the current allocable bandwidth of each node and the linear programming model includes: obtaining the optimal solution for bandwidth resource allocation by analyzing the linear programming model using the Lagrange multiplier method based on the current allocable bandwidth of each node.

[0017] In the aforementioned bandwidth resource redundancy adaptive allocation method, optionally, the linear programming model is analyzed using the Lagrange multiplier method based on the current allocable bandwidth of each node, including: obtaining the optimal solution for bandwidth resource allocation by solving the linear programming model based on KKT conditions; wherein the Lagrange function includes:

[0018]

[0019] KKT conditions include:

[0020]

[0021] In the above equation, f(b) represents its Lagrangian function. In the KKT conditions, the Lagrangian function combines the objective function of the original optimization problem with each constraint into a unified function, so as to simultaneously consider the influence of the objective and constraints on the optimal solution, and obtain the necessary conditions that the optimal solution must satisfy. α, β, and χ correspond to the Lagrangian multipliers of constraints C1 and C2, respectively, and Ω' i (b i,k ) is Ω i The first derivative, It is the optimal solution for the bandwidth resources allocated to each service, α. * β * and χ * Ξ represents the optimal solution corresponding to α, β, and χ. i B represents the set of services to be transmitted at node i. i This represents the amount of allocatable bandwidth for node i.

[0022] In the above-mentioned bandwidth resource redundancy adaptive allocation method, optionally, verifying the satisfaction of the transmission delay of each service through the optimal solution includes: calculating the transmission delay of each service through the optimal solution, comparing the transmission delay with the delay requirements of the corresponding node, and obtaining the satisfaction of the transmission delay of each service.

[0023] In the above-described bandwidth resource redundancy adaptive allocation method, optionally, calculating the transmission delay of each service using the optimal solution includes: calculating the transmission delay of each service based on the optimal solution using a delay model; the delay model includes:

[0024]

[0025] In the above formula, ζ k Let D be the transmission delay of service k. k b is the data packet size for service k. i,k V represents the bandwidth allocation of node i to service k, and V represents the set of node numbers.

[0026] In the above-mentioned bandwidth resource redundancy adaptive allocation method, optionally, bandwidth resource allocation based on verification results includes: when the latency of any service in the verification results exceeds the preset requirement, adjusting the bandwidth of each node based on the water level model to obtain a bandwidth resource allocation scheme; and allocating bandwidth resources through the bandwidth resource allocation scheme.

[0027] This application also provides a bandwidth resource redundancy adaptive allocation system for multi-node links. The system includes a benefit module, a construction module, a calculation module, and a comparison module. The benefit module is used to determine the minimum allocable bandwidth for each node based on the node information of a preset link, and to construct a node bandwidth allocation benefit calculation model based on service delay redundancy according to the minimum allocable bandwidth. The construction module is used to construct a linear programming model with the goal of maximizing node bandwidth benefit through the node bandwidth allocation benefit calculation model. The calculation module is used to obtain the optimal solution for bandwidth resource allocation based on the current allocable bandwidth of each node and the linear programming model. The comparison module is used to verify the satisfaction of the transmission delay of each service through the optimal solution, and to allocate bandwidth resources according to the verification results.

[0028] This application also provides an electronic device, including a memory, a processor, and a computer program stored in the memory and executable on the processor, wherein the processor executes the computer program to implement the above-described method.

[0029] This application also provides a computer-readable storage medium storing a computer program that performs the above-described methods.

[0030] This application also provides a computer program product, including a computer program / instructions that, when executed by a processor, implement the steps of the above-described method.

[0031] The beneficial technical effects of this application are as follows: By quantifying service priority through latency redundancy, the urgency of services is transformed into a revenue weight: the more stringent the latency requirements and the higher the current accumulated latency, the greater the revenue weight of bandwidth allocation, prioritizing critical services. The actual latency is calculated based on the allocation results and compared with a threshold, triggering a dynamic adjustment mechanism to ensure compliance of all services. With the goal of maximizing node bandwidth revenue, the solution is obtained under constraints to ensure that bandwidth allocation is in line with business value. The Lagrange multiplier method is used to analyze the convex optimization problem, and the optimal solution is quickly approximated through iterative values, reducing computational overhead. When service latency exceeds the limit, the node level is increased by a preset increment, and the available bandwidth is replenished to a uniform level, triggering a reallocation. The minimum bandwidth amount is used as a safety net to avoid complete blocking of low-priority services. The replenishment mechanism automatically adapts to node bandwidth fluctuations (such as link expansion / failure) without manual intervention. Therefore, by linking the latency redundancy benefit model, KKT optimization solution and water level injection feedback mechanism, the problem of balancing resource allocation and service latency in multi-node links is solved, significantly improving bandwidth utilization and latency compliance rate, and is especially suitable for cross-domain critical business communication scenarios. Attached Figure Description

[0032] The accompanying drawings, which are included to provide a further understanding of this application and form part of this application, do not constitute a limitation thereof. In the drawings:

[0033] Figure 1 This is a flowchart illustrating a bandwidth resource redundancy adaptive allocation method for multi-node links provided in an embodiment of this application.

[0034] Figure 2 This is a schematic diagram of the process for obtaining the optimal solution provided in an embodiment of this application;

[0035] Figure 3 This is a schematic diagram of a line bandwidth resource adjustment process provided in an embodiment of this application;

[0036] Figure 4 This is a schematic diagram of the structure of a bandwidth resource redundancy adaptive allocation system for multi-node links provided in an embodiment of this application;

[0037] Figure 5 This is a schematic diagram of the structure of an electronic device provided in an embodiment of this application. Detailed Implementation

[0038] The following will describe in detail the implementation methods of this application with reference to the accompanying drawings and embodiments, so as to fully understand how this application uses technical means to solve technical problems and achieve technical effects, and to implement it accordingly. It should be noted that, as long as there is no conflict, the various embodiments and features in each embodiment of this application can be combined with each other, and the resulting technical solutions are all within the protection scope of this application.

[0039] Furthermore, the steps shown in the flowchart in the accompanying drawings can be executed in a computer system such as a set of computer-executable instructions, and although a logical order is shown in the flowchart, in some cases the steps shown or described may be executed in a different order than that shown here.

[0040] Please refer to Figure 1 As shown, this application provides a bandwidth resource redundancy adaptive allocation method for multi-node links, the method comprising:

[0041] S101 determines the minimum allocable bandwidth for each node based on the node information of the preset link, and constructs a node bandwidth allocation benefit calculation model based on the minimum allocable bandwidth and service delay redundancy.

[0042] S102 Based on the node bandwidth allocation revenue calculation model, the optimal solution for bandwidth resource allocation is obtained by analyzing and maximizing node bandwidth revenue.

[0043] S103 verifies the satisfaction of the transmission delay of each service through the optimal solution, and allocates bandwidth resources based on the verification results.

[0044] The node information includes source nodes and aggregation nodes, which correspond to business master stations located in different cities. Therefore, this application solves the problem of balancing resource allocation and service latency in multi-node links through the above embodiments, significantly improving bandwidth utilization and latency compliance, and is particularly suitable for cross-domain critical business communication scenarios. The specific implementation process of each step in this embodiment will be described one by one in subsequent embodiments, and will not be detailed here.

[0045] Please refer to Figure 2 As shown, in some embodiments of this application, step S102 above, which analyzes and obtains the optimal solution for bandwidth resource allocation based on the node bandwidth allocation revenue calculation model with the goal of maximizing node bandwidth revenue, may include:

[0046] S201 determines the minimum allocable bandwidth for each node based on the node information of the preset link, and constructs a node bandwidth allocation benefit calculation model based on the minimum allocable bandwidth and service delay redundancy.

[0047] S202 establishes a linear programming model with the goal of maximizing node bandwidth revenue through the node bandwidth allocation revenue calculation model.

[0048] S203 obtains the optimal solution for bandwidth resource allocation based on the current allocable bandwidth of each node and the linear programming model.

[0049] The minimum allocable bandwidth refers to the minimum bandwidth resource that can be allocated to the corresponding node. Its purpose is to determine the lower limit of the bandwidth allocation for each node, and then to construct the node bandwidth allocation revenue calculation model. The construction logic of this model is as follows: construct the latency redundancy model of each service based on the transmission latency requirements of each service and the time taken for the last unit of data in the service data packet to be generated and sent to the target node; construct the node bandwidth allocation revenue calculation model based on the latency redundancy model of each service and the set of services to be transmitted.

[0050] Specifically, the node bandwidth allocation revenue calculation model constructed through the above logic may include:

[0051]

[0052] The time delay redundancy model may include:

[0053] τ i,k =ω k -Γ i,k ;

[0054] In the above formula, Ωi It is the bandwidth allocation revenue of node i for all concurrent services, Ξ i Let b represent the set of services to be transmitted at node i. i,k τ is the bandwidth allocation of node i to service k. i,k ω represents the latency redundancy of service k. k For the transmission delay requirement of service k, Γ i,k This represents the time taken from the generation of the last unit of data in the service data packet to its transmission to node i.

[0055] In some embodiments of this application, the linear programming model is constructed primarily with the aim of maximizing node bandwidth gains. Specifically, the linear programming model may include:

[0056]

[0057]

[0058] In the above formula, Ω i It is the bandwidth allocation benefit of node i, Ξ i Let b represent the set of services to be transmitted at node i. i,k B is the bandwidth allocation of node i to service k. i This represents the amount of allocable bandwidth for node i. C1 indicates that the bandwidth allocation for service k should be between 0 and the node's allocable bandwidth, and C2 indicates that the sum of the bandwidth allocations for all services to be transmitted on the node does not exceed the node's allocable bandwidth.

[0059] In another embodiment of this application, obtaining the optimal solution for bandwidth resource allocation based on the current allocable bandwidth of each node and the linear programming model includes: analyzing the linear programming model using the Lagrange multiplier method based on the current allocable bandwidth of each node to obtain the optimal solution for bandwidth resource allocation. Specifically, the optimal solution for bandwidth resource allocation can be obtained by solving the linear programming model based on the KKT conditions; wherein, the Lagrange function includes:

[0060]

[0061] KKT conditions include:

[0062]

[0063] In the above equation, α, β, and χ correspond to the Lagrange multipliers constraining C1 and C2, respectively, and Ω' i (b i,k ) is Ω i The first derivative, It is the optimal solution for the bandwidth resources allocated to each service, α. * β * and χ* It is the optimal solution corresponding to α, β, and χ.

[0064] Correspondingly, the properties of the optimal solution are summarized as follows:

[0065] 1): When α * When β > 0, then β * =0, and

[0066] 2): When α * =0 and β * When = 0, then and

[0067] 3): When β * When α > 0, then α * =0, and

[0068] Based on the above properties, it can be found that... and There is a correlation between them, Ω' i (b i,k ) will follow The value decreases monotonically with the increase of χ. * Perform iterations based on χ * With Ω' i (b i,k The optimal solution can be calculated from the relationship between the two. Specifically, when χ * <Ω' i (b i,k When ), property 1) is satisfied, at this time When χ * >Ω' i (b i,k When ), property 3) is satisfied, at this time The remaining cases satisfy property 2). Through iteration χ... * until Approaching B i The optimal bandwidth resource allocation scheme can be obtained in time.

[0069] In some embodiments of this application, verifying the satisfaction of the transmission delay of each service through the optimal solution includes: calculating the transmission delay of each service through the optimal solution, comparing the transmission delay with the delay requirements of the corresponding node, and obtaining the satisfaction of the transmission delay of each service.

[0070] In calculating the transmission latency of each service, a latency model can be used for analysis. This latency model is mainly calculated based on the data size of the data packets corresponding to the service and the bandwidth allocated by the node to the service; specifically,

[0071] The time delay model may include:

[0072]

[0073] In the above formula, ζ k Let D be the transmission delay of service k. k b is the data packet size for service k. i,k V represents the bandwidth allocation of node i to service k, and V represents the set of node numbers.

[0074] Taking service k as an example, the service transmission delay calculated in step S4 is compared with its own delay requirement:

[0075] ζ k ≤ω k , k∈Φ;

[0076] Where, ζ k Let ω be the transmission delay of service k. k Let Φ represent the transmission delay requirement of service k, and let Φ represent the set of all services. If any service does not meet the above conditions, proceed to step S6; otherwise, output the current bandwidth allocation scheme as the optimal result.

[0077] Please refer to Figure 3 As shown, in some embodiments of this application, bandwidth resource allocation based on verification results includes:

[0078] S301 When the latency of any service in the verification result exceeds the preset requirement, the bandwidth of each node is adjusted by water level model to obtain a bandwidth resource allocation scheme.

[0079] S302 allocates bandwidth resources using the bandwidth resource allocation scheme.

[0080] Specifically, in this embodiment, step S301 mainly adopts a bandwidth water injection adjustment mechanism based on the water level model for dynamic adjustment of each node. The specific setting process is as follows: 1. Set a unified horizontal water level benchmark value;

[0081] 2. Gradually raise the water level at the preset injection increment;

[0082] 3. Calculate the difference between the current allocable bandwidth of each node and the water level: If the allocable bandwidth of a node is lower than the water level benchmark, calculate the bandwidth gap; or, if the allocable bandwidth of a node has reached the water level benchmark, maintain the current state.

[0083] 4. Allocate bandwidth and water injection volume to each node based on the water level difference;

[0084] 5. Update the allocatable bandwidth of each node based on the water injection volume;

[0085] The water level model in this process sets the bandwidth resource amount of each node according to the logic of water level balance. Those skilled in the art can adjust the allocation logic based on actual needs to ensure that the bandwidth resources meet the requirements. This application does not make any further limitations here.

[0086] In step S302 above, the implementation logic for bandwidth resource allocation through the bandwidth resource allocation scheme is as follows:

[0087] 1. Use the updated node allocable bandwidth after water injection adjustment as input;

[0088] 2. Resolve the linear programming problem with the objective of maximizing node bandwidth gains;

[0089] 3. Generate a new service bandwidth allocation scheme;

[0090] 4. Implement bandwidth resource allocation according to the updated allocation scheme.

[0091] Alternatively, bandwidth resources may be allocated directly according to the adjusted bandwidth resource allocation scheme, and this application does not impose further limitations here.

[0092] Specifically, in practice, a bandwidth adjustment mechanism based on a water level model is used for each node to fill the available bandwidth of each node to the same level. Taking node i as an example, its allocable bandwidth is filled to the horizontal water level:

[0093]

[0094] Where Ψ represents the horizontal water level, V represents the set of node numbers, and B i μ represents the allocatable bandwidth of node i, and μ represents the preset water injection increment for each water level rise.

[0095] ΔB i =max{0,Ψ-B i};

[0096] Where Ψ is the horizontal water level, and ΔB i B is the bandwidth required for node i. i This represents the amount of allocatable bandwidth for node i.

[0097]

[0098] in, The amount of allocatable bandwidth for node i after the update.

[0099] Please refer to Figure 4 As shown, this application also provides a bandwidth resource redundancy adaptive allocation system for multi-node links. The system includes a benefit module, a calculation module, and a comparison module. The benefit module is used to construct a node bandwidth allocation benefit calculation model based on service delay redundancy according to the node information of the preset link. The calculation module is used to analyze and obtain the optimal solution for bandwidth resource allocation based on the node bandwidth allocation benefit calculation model with the goal of maximizing node bandwidth benefit. The comparison module is used to verify the satisfaction of the transmission delay of each service through the optimal solution and to allocate bandwidth resources according to the verification results.

[0100] The implementation logic of the bandwidth resource redundancy adaptive allocation system for multi-node links provided in this application is similar to that of the bandwidth resource redundancy adaptive allocation method for multi-node links, and will not be described in detail here. The specific implementation methods of each step can be referred to the foregoing embodiments.

[0101] The beneficial technical effects of this application are as follows: By quantifying service priority through latency redundancy, the urgency of services is transformed into a revenue weight: the more stringent the latency requirements and the higher the current accumulated latency, the greater the revenue weight of bandwidth allocation, prioritizing critical services. The actual latency is calculated based on the allocation results and compared with a threshold, triggering a dynamic adjustment mechanism to ensure compliance of all services. With the goal of maximizing node bandwidth revenue, the solution is obtained under constraints to ensure that bandwidth allocation is in line with business value. The Lagrange multiplier method is used to analyze the convex optimization problem, and the optimal solution is quickly approximated through iterative values, reducing computational overhead. When service latency exceeds the limit, the node water level is increased by a preset increment, and the available bandwidth is replenished to a uniform level, triggering a reallocation. This ensures a minimum amount of bandwidth to guarantee service availability and avoids complete blocking of low-priority services. The replenishment mechanism automatically adapts to node bandwidth fluctuations (such as link expansion / failure) without manual intervention.

[0102] This application also provides an electronic device, including a memory, a processor, and a computer program stored in the memory and executable on the processor, wherein the processor executes the computer program to implement the above-described method.

[0103] This application also provides a computer-readable storage medium storing a computer program that performs the above-described methods.

[0104] This application also provides a computer program product, including a computer program / instructions that, when executed by a processor, implement the steps of the above-described method.

[0105] like Figure 5As shown, the electronic device 600 may also include: a communication module 110, an input unit 120, an audio processing unit 130, a display 160, and a power supply 170. It is worth noting that the electronic device 600 does not necessarily need to include these components. Figure 5 All components shown; in addition, the electronic device 600 may also include Figure 5 For components not shown, please refer to existing technologies.

[0106] like Figure 5 As shown, the central processing unit 100, sometimes also referred to as a controller or operating control, may include a microprocessor or other processor device and / or logic device. The central processing unit 100 receives inputs and controls the operation of various components of the electronic device 600.

[0107] The memory 140 may be, for example, one or more of a cache, flash memory, hard drive, removable media, volatile memory, non-volatile memory, or other suitable devices. It may store the aforementioned failure-related information, and also store a program for executing that information. The central processing unit 100 may execute the program stored in the memory 140 to perform information storage or processing, etc.

[0108] Input unit 120 provides input to central processing unit 100. Input unit 120 may be, for example, a keypad or touch input device. Power supply 170 provides power to electronic device 600. Display 160 displays images and text. Display may be, for example, an LCD display, but is not limited thereto.

[0109] The memory 140 can be a solid-state memory, such as a read-only memory (ROM), random access memory (RAM), a SIM card, etc. It can also be a memory that retains information even when power is off, can be selectively erased, and contains more data; examples of this type of memory are sometimes referred to as EPROMs. The memory 140 can also be some other type of device. The memory 140 includes a buffer memory 141 (sometimes referred to as a buffer). The memory 140 may include an application / function storage unit 142 for storing application programs and function programs or processes for executing the operation of the electronic device 600 via the central processing unit 100.

[0110] The memory 140 may also include a data storage unit 143 for storing data, such as contacts, digital data, pictures, sounds, and / or any other data used by the electronic device. The driver storage unit 144 of the memory 140 may include various drivers for the electronic device's communication functions and / or for performing other functions of the electronic device (such as messaging applications, address book applications, etc.).

[0111] The communication module 110 is a transmitter / receiver 110 that transmits and receives signals via antenna 111. The communication module (transmitter / receiver) 110 is coupled to the central processing unit 100 to provide input signals and receive output signals, which can be the same as in a conventional mobile communication terminal.

[0112] Based on different communication technologies, multiple communication modules 110 can be configured in the same electronic device, such as cellular network modules, Bluetooth modules, and / or wireless LAN modules. The communication module (transmitter / receiver) 110 is also coupled to a speaker 131 and a microphone 132 via an audio processor 130 to provide audio output via the speaker 131 and receive audio input from the microphone 132, thereby enabling typical telecommunications functions. The audio processor 130 may include any suitable buffer, decoder, amplifier, etc. Additionally, the audio processor 130 is coupled to a central processing unit 100, enabling on-device recording via the microphone 132 and on-device playback of stored audio via the speaker 131.

[0113] Those skilled in the art will understand that embodiments of this application can be provided as methods, systems, or computer program products. Therefore, this application can take the form of a completely hardware embodiment, a completely software embodiment, or an embodiment combining software and hardware aspects. Furthermore, this application can take the form of a computer program product embodied on one or more computer-usable storage media (including but not limited to disk storage, CD-ROM, optical storage, etc.) containing computer-usable program code.

[0114] This application is described with reference to flowchart illustrations and / or block diagrams of methods, apparatus (systems), and computer program products according to embodiments of this 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 can be provided to a processor of a general-purpose computer, special-purpose computer, embedded processor, 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, generate instructions for implementing the flowchart... Figure 1 One or more processes and / or boxes Figure 1 A device that provides the functions specified in one or more boxes.

[0115] These computer program instructions may also be stored in a computer-readable storage medium that can direct a computer or other programmable data processing device to function in a particular manner, such that the instructions stored in the computer-readable storage medium produce an article of manufacture including instruction means, which are implemented in a process Figure 1 One or more processes and / or boxes Figure 1 The function specified in one or more boxes.

[0116] These computer program instructions may also be loaded onto a computer or other programmable data processing equipment to cause a series of operational steps to be performed on the computer or other programmable equipment to produce a computer-implemented process, thereby providing instructions that execute on the computer or other programmable equipment for implementing the process. Figure 1 One or more processes and / or boxes Figure 1 The steps of the function specified in one or more boxes.

[0117] The specific embodiments described above further illustrate the purpose, technical solution, and beneficial effects of this application. It should be understood that the above descriptions are merely specific embodiments of this application and are not intended to limit the scope of protection of this application. Any modifications, equivalent substitutions, improvements, etc., made within the spirit and principles of this application should be included within the scope of protection of this application.

Claims

1. A method for adaptive allocation of bandwidth resources with redundancy for multi-node links, characterized in that, The method comprises: constructing a node bandwidth allocation benefit calculation model based on service time delay redundancy according to node information of a preset link; obtaining an optimal solution of bandwidth resource allocation by analyzing the node bandwidth allocation benefit calculation model with the goal of maximizing node bandwidth benefit; verifying satisfaction of each service transmission time delay through the optimal solution, and performing bandwidth resource allocation according to a verification result.

2. The method of claim 1, wherein, The node information comprises a source node and a sink node, and the source node and the sink node correspond to service main stations located in different cities respectively.

3. The method of claim 1, wherein, The node bandwidth allocation benefit calculation model is constructed based on service time delay redundancy according to the minimum allocable bandwidth amount of each node determined according to node information of a preset link. A linear programming model with the goal of maximizing node bandwidth benefit is established through the node bandwidth allocation benefit calculation model. The optimal solution of bandwidth resource allocation is obtained according to the current allocable bandwidth amount of each node and the linear programming model. The node bandwidth allocation benefit calculation model is constructed based on service time delay redundancy according to the minimum allocable bandwidth amount.

4. The method of adaptive allocation of bandwidth resource redundancy according to claim 3, characterized in that, A time delay redundancy model of each service is constructed according to transmission time delay requirements of each service and time taken for the last unit of data of a service data packet to be generated and sent to a target node. The node bandwidth allocation benefit calculation model is constructed according to the time delay redundancy model of each service and set data of services to be transmitted. The linear programming model comprises:

5. The method of claim 3, wherein, The optimal solution of bandwidth resource allocation is obtained according to the current allocable bandwidth amount of each node and the linear programming model. wherein Ω i is the bandwidth allocation benefit of node i, Ξ i represents the set of services to be transmitted by node i, b i,k is the bandwidth allocation amount of node i for service k, B i represents the allocable bandwidth amount of node i, C1 represents that the bandwidth allocation amount of service k should be between 0 and the allocable bandwidth amount of the node, and C2 represents that the sum of the bandwidth allocation amounts of all services to be transmitted by the node should not exceed the allocable bandwidth amount of the node.

6. The method of adaptive allocation of bandwidth resource redundancy according to claim 3, characterized in that, The optimal solution of bandwidth resource allocation is obtained by analyzing the linear programming model through the Lagrange multiplier method according to the current allocable bandwidth amount of each node. The linear programming model is analyzed through the Lagrange multiplier method according to the current allocable bandwidth amount of each node.

7. The method of adaptive allocation of bandwidth resource redundancy according to claim 6, characterized in that, The optimal solution of bandwidth resource allocation is obtained by solving the linear programming model based on KKT conditions; The Lagrange function comprises: The KKT conditions comprise: The satisfaction of each service transmission time delay is verified through the optimal solution. In the above formula, f(b) is a Lagrange function, a, β and χ respectively correspond to Lagrange multipliers of constraints C1 and C2, Ω i (b i,k ) is a first derivative of Ω i , is an optimal solution of the bandwidth resource allocated to each service, a * , β * and χ * are optimal solutions corresponding to a, β and χ, Ξ i represents a set of services to be transmitted at node i, B i represents an allocable bandwidth amount at node i.

8. The method of adaptive allocation of bandwidth resource redundancy according to claim 1, wherein, The transmission time delay of each service is calculated through the optimal solution, and the transmission time delay is compared with time delay requirements of a corresponding node to obtain the satisfaction of each service transmission time delay. The transmission time delay of each service is calculated through the optimal solution.

9. The method of adaptive allocation of bandwidth resource redundancy according to claim 8, characterized in that, The transmission time delay of each service is calculated through a time delay model according to the optimal solution. The time delay model comprises: When any service time delay in the verification result exceeds a preset requirement, bandwidth water injection adjustment is performed on each node based on a water level model to obtain a bandwidth resource allocation scheme. In the above formula, ζ k is the transmission delay of service k, D k is the packet size of service k, b i,k represents the bandwidth allocation amount of node i facing service k, and V represents the node number set.

10. The method of adaptive allocation of bandwidth resource redundancy according to claim 1, wherein, Bandwidth resource allocation is performed through the bandwidth resource allocation scheme. The system comprises a benefit module, a calculation module, and a comparison module. The benefit module is configured to construct a node bandwidth allocation benefit calculation model based on service time delay redundancy according to node information of a preset link.

11. A bandwidth resource redundancy adaptive allocation system for multi-node link, characterized in that, The calculation module is configured to obtain an optimal solution of bandwidth resource allocation by analyzing the node bandwidth allocation benefit calculation model with the goal of maximizing node bandwidth benefit. The comparison module is configured to verify satisfaction of each service transmission time delay through the optimal solution, and perform bandwidth resource allocation according to a verification result. ​ The comparison module is configured to verify whether each service transmission delay satisfies the condition by using the optimal solution, and allocate bandwidth resources according to the verification result.

12. An electronic device comprising a memory, a processor, and a computer program stored on the memory and executable on the processor, characterized in that, The processor implements the method of any one of claims 1-10 when executing the computer program.

13. A computer-readable storage medium, characterized in that, The computer readable storage medium stores a computer program for implementing the method of any one of claims 1-10.

14. A computer program product comprising computer programs / instructions, characterized in that, The computer program / instruction implements the steps of the method of any one of claims 1-10 when executed by the processor.

Images