Bandwidth allocation method and system for multi-mode service flow

Abstract

The invention discloses a bandwidth allocation method and system for a multi-mode service flow, and relates to the technical field of electric power Internet of Things. Based on a preset slice time delay model, slice time delay values of historical time slots and current time slots are calculated, and decision cost performance of multiple historical time slots in the past is analyzed, so that the bandwidth allocation efficiency of the multi-mode service flow is improved. According to the method, the time slot level dynamic allocation is carried out, historical slice data with the highest decision cost performance under a historical time slot is used as an allocation reference, when a target slice time delay value is larger than a historical slice time delay value associated with the allocation reference, a bandwidth allocation scheme is dynamically adjusted, and accurate adaptation of bandwidth resources is achieved. The bandwidth idleness caused by fixed reservation is reduced, and the technical problem of bandwidth waste in the existing fixed reserved bandwidth mode is solved.

Description

Technical Field

[0001] The present invention relates to the technical field of electric power Internet of Things, and in particular to a bandwidth allocation method and system for multimodal service flows. Background Art

[0002] With the accelerated construction of new power systems, power communication networks are facing unprecedented challenges in carrying services. Power communication networks must simultaneously support diverse scenarios, including massive terminal access, real-time control command transmission, high-definition video surveillance, and distributed energy coordination. These services exhibit significant heterogeneity in terms of latency sensitivity, reliability requirements, and data characteristics. For example, smart meter data collection is periodic and requires small packets; distribution automation services require millisecond-level latency guarantees; and patrol robot video surveillance is characterized by bursty and high-bandwidth requirements. Consequently, these services place higher demands on network bandwidth allocation.

[0003] Currently, existing bandwidth allocation methods usually use static reservation methods, which ensure service quality by pre-allocating fixed bandwidth resources for different services. However, the fixed reserved bandwidth method cannot adapt to the dynamic changes in service traffic, resulting in waste of resources during idle time. Summary of the Invention

[0004] The present invention provides a bandwidth allocation method and system for multimodal service flows, which solves the technical problem of bandwidth waste in the existing method of adopting fixed reserved bandwidth.

[0005] A first aspect of the present invention provides a bandwidth allocation method for a multimodal service flow, comprising:

[0006] Obtain historical slice data of a target power communication network under multiple historical time slots, as well as target slice data under a current time slot;

[0007] Using the plurality of historical slice data and the target slice data to input a preset slice delay model respectively, to obtain a plurality of historical slice delay values and a target slice delay value;

[0008] Performing a cost-performance decision using the plurality of historical slice data and the corresponding historical slice delay values to determine a target decision cost-performance;

[0009] Using the historical slice data associated with the target decision cost performance and the target slice data to perform bandwidth allocation and determine a bandwidth allocation plan;

[0010] When the target slice delay value is greater than the historical slice delay value associated with the target decision cost-effectiveness, the reserved allocated bandwidth within the reserved allocated bandwidth is adjusted according to a preset ratio until the target slice delay value is less than or equal to the historical slice delay value associated with the target decision cost-effectiveness.

[0011] Optionally, the adopting of the plurality of historical slice data and the target slice data to input a preset slice delay model respectively to obtain a plurality of historical slice delay values and a target slice delay value includes:

[0012] Using the historical slice data to input a preset slice delay model to obtain a historical slice delay value;

[0013] Traversing all the historical slice data to obtain multiple corresponding historical slice delay values;

[0014] The target slice data is input into the preset slice delay model to obtain a target slice delay value.

[0015] Optionally, the preset slice delay model includes a wireless access delay function, a wired aggregation delay function, a wired forwarding delay function, and a delay and objective function; the historical slice data includes a historical wireless delay time point, a historical wired delay time point, a historical slice total bandwidth, a historical slice delay weight, a historical slice data volume, and a historical slice importance; and the historical slice data is input into the preset slice delay model to obtain a historical slice delay value, including:

[0016] Using the historical wireless delay time point as input into the wireless access delay function to obtain the historical wireless access delay;

[0017] Using the historical wired delay time point to input the wired convergence delay function to obtain the historical wired convergence delay;

[0018] Using the total bandwidth of the historical slice, the delay weight of the historical slice, and the data volume of the historical slice to input the wired forwarding delay function to obtain the historical wired forwarding delay;

[0019] The historical wireless access delay, the historical wired convergence delay, the historical wired forwarding delay and the historical slice importance are input into the delay and objective function to obtain a historical slice delay value.

[0020] Optionally, the target slice data includes a target wireless delay time point, a target wired delay time point, a target slice total bandwidth, a target slice delay weight, a target slice data volume, and a target slice importance. The step of inputting the preset slice delay model with the target slice data to obtain the target slice delay value includes:

[0021] Using the target wireless delay time point as input into the wireless access delay function to obtain a target wireless access delay;

[0022] Using the target wired delay time point as input into the wired convergence delay function to obtain a target wired convergence delay;

[0023] Using the target slice total bandwidth, the target slice delay weight, and the target slice data volume to input the wired forwarding delay function to obtain a target wired forwarding delay;

[0024] The target wireless access delay, the target wired convergence delay, the target wired forwarding delay, and the target slice importance are input into the delay and objective function to obtain a target slice delay value.

[0025] Optionally, performing a cost-performance decision using the plurality of historical slice data and the corresponding historical slice delay values to determine a target decision cost-performance includes:

[0026] Determine the initial decision cost-effectiveness using the historical slice data and the corresponding historical slice delay value;

[0027] Traversing all the historical slice data to obtain multiple initial decision cost-effectiveness;

[0028] The maximum value is selected from the multiple initial decision cost-effectiveness ratios as the target decision cost-effectiveness ratio.

[0029] Optionally, the using the historical slice data and the corresponding historical slice delay value to determine the initial decision cost-effectiveness includes:

[0030] Performing a ratio operation on the total bandwidth of the historical slices and the amount of data in the historical slices to obtain a historical unit cost;

[0031] Performing a ratio operation on the historical slice data volume and the historical slice delay value to obtain a historical unit revenue;

[0032] The historical unit revenue and the historical unit cost are used to perform a ratio calculation to obtain an initial decision cost-effectiveness ratio.

[0033] Optionally, the using the historical slice data associated with the target decision cost-performance ratio and the target slice data to perform bandwidth allocation and determine a bandwidth allocation scheme includes:

[0034] Performing a ratio operation on the target slice data volume and the historical slice data volume to obtain a target ratio;

[0035] The target ratio is multiplied by the total bandwidth of the historical slice to obtain the reserved allocated bandwidth;

[0036] The reserved allocated bandwidth is multiplied by the target slice importance to obtain the target allocated bandwidth, which is used as the bandwidth allocation scheme.

[0037] Optionally, it also includes:

[0038] When the target slice delay value is less than or equal to the historical slice delay value associated with the target decision cost-effectiveness, the bandwidth allocation scheme is executed.

[0039] A second aspect of the present invention provides a bandwidth allocation system for multimodal service flows, comprising:

[0040] An acquisition module, configured to acquire historical slice data of a target power communication network under multiple historical time slots, and target slice data under a current time slot;

[0041] An input module, configured to input a preset slice delay model using the plurality of historical slice data and the target slice data, respectively, to obtain a plurality of historical slice delay values and a target slice delay value;

[0042] A decision module, configured to perform a cost-performance decision using the plurality of historical slice data and the corresponding historical slice delay values to determine a target decision cost-performance;

[0043] An output module, configured to allocate bandwidth using the historical slice data associated with the target decision cost performance and the target slice data, and determine a bandwidth allocation plan;

[0044] An allocation module is used to adjust the reserved allocated bandwidth within the reserved allocated bandwidth according to a preset ratio when the target slice delay value is greater than the historical slice delay value associated with the target decision cost-effectiveness, until the target slice delay value is less than or equal to the historical slice delay value associated with the target decision cost-effectiveness.

[0045] A third aspect of the present invention provides an electronic device, comprising a memory and a processor, wherein the memory stores a computer program, and when the computer program is executed by the processor, the processor executes the steps of the bandwidth allocation method for a multimodal service flow as described in any one of the above items.

[0046] It can be seen from the above technical solutions that the present invention has the following advantages:

[0047] The present invention is based on a preset slice delay model, calculates the slice delay values of historical and current time slots, and analyzes the decision cost-effectiveness of multiple historical time slots in the past. The decision cost-effectiveness of the historical time slot with the highest historical slice data is used as the allocation benchmark. When the target slice delay value is greater than the historical slice delay value associated with the allocation benchmark, the bandwidth allocation scheme is dynamically adjusted to achieve precise adaptation of bandwidth resources. The present invention reduces bandwidth idleness caused by fixed reservation through dynamic allocation at the time slot level, solving the technical problem of bandwidth waste in the existing method of using fixed reserved bandwidth. BRIEF DESCRIPTION OF THE DRAWINGS

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

[0049] Figure 1 A flowchart of a method for allocating bandwidth for a multimodal service flow provided in accordance with the first embodiment of the present invention;

[0050] Figure 2 A flowchart of a method for allocating bandwidth for a multimodal service flow provided in a second embodiment of the present invention;

[0051] Figure 3 A schematic diagram comparing the weighted delay sums of network slices initiated by the three algorithms provided in the second embodiment of the present invention in each time slot;

[0052] Figure 4 A schematic diagram comparing the cost-effectiveness of decisions made in each time slot of the three algorithms provided in the second embodiment of the present invention;

[0053] Figure 5 A structural block diagram of a bandwidth allocation system for multimodal service flows provided in Embodiment 3 of the present invention;

[0054] Figure 6 This is a structural block diagram of a computer device provided in Example 4 of the present invention. DETAILED DESCRIPTION

[0055] The embodiments of the present invention provide a bandwidth allocation method and system for multimodal service flows, which are used to solve the technical problem of bandwidth waste in the existing method of using fixed reserved bandwidth.

[0056] In order to make the purpose, features, and advantages of the present invention more obvious and easy to understand, the technical solutions in the embodiments of the present invention will be clearly and completely described below in conjunction with the drawings in the embodiments of the present invention. Obviously, the embodiments described below are only part of the embodiments of the present invention, not all of the embodiments. Based on the embodiments of the present invention, all other embodiments obtained by ordinary technicians in this field without making creative work are within the scope of protection of the present invention.

[0057] See also Figure 1 , Figure 1 This is a flowchart of the steps of a bandwidth allocation method for multimodal service flows provided in Example 1 of the present invention.

[0058] The present invention provides a bandwidth allocation method for a multimodal service flow, comprising:

[0059] Step 101: Acquire historical slice data of a target power communication network in multiple historical time slots and target slice data in a current time slot.

[0060] The target power communication network refers to a dedicated communication network designed for the power system, which is used to carry key services such as power dispatching and control, equipment monitoring, and data collection. It is the core infrastructure to ensure the safe and stable operation of the power grid.

[0061] Historical slice data refers to the set of network slice-related parameters recorded in the target power communication network over a period of time (multiple time slots) in the past.

[0062] Target slice data refers to the network slice related data collected or generated in real time in the current time slot in the target power communication network.

[0063] In an embodiment of the present invention, historical slice data of a target power communication network in a plurality of historical time slots and target slice data in a current time slot are acquired.

[0064] Step 102: Multiple historical slice data and target slice data are respectively input into a preset slice delay model to obtain multiple historical slice delay values and target slice delay values.

[0065] The preset slice delay model refers to a set of pre-built mathematical models used to quantify the end-to-end delay of each slice in the power communication network. Based on network transmission characteristics and service parameters, the model maps slice data to slice delay values through a combination of multiple functions.

[0066] The historical slice delay value refers to the historical time slot slice delay value calculated based on historical slice data using a preset slice delay model. This value reflects the end-to-end transmission delay of each slice under historical network conditions.

[0067] The target slice delay value refers to the real-time slice delay value calculated based on the target slice data of the current time slot through the preset slice delay model. This value reflects the end-to-end transmission delay of each slice under the current network status.

[0068] In an embodiment of the present invention, based on the historical slice data in multiple historical time slots and the target slice data in the current time slot, the historical slice delay values corresponding to the historical slice data in multiple historical time slots and the target slice delay values corresponding to the target slice data are calculated by a preset slice delay model.

[0069] Step 103: Use multiple historical slice data and corresponding historical slice delay values to make a cost-effectiveness decision and determine the target decision cost-effectiveness.

[0070] Cost-effectiveness decision-making refers to the process of evaluating the cost-effectiveness of different slice configuration solutions by quantitatively analyzing the unit cost and unit benefit of historical slice data, thereby providing a decision-making basis for resource allocation and scheduling strategies.

[0071] The target decision price / performance ratio (CB / P) is the optimal value selected from the initial decision price / performance ratios of multiple historical slices. It represents the highest resource utilization efficiency benchmark observed in historical data. The target decision price / performance ratio serves as a target reference for subsequent slice configuration or optimization, and is used to measure the performance ceiling of current or future slice solutions.

[0072] In an embodiment of the present invention, a cost-effectiveness decision is made using multiple historical slice data and corresponding historical slice delay values to obtain initial decision cost-effectiveness corresponding to the multiple historical slice data, and then the optimal value is screened out from the multiple initial decision cost-effectiveness as the target decision cost-effectiveness.

[0073] Step 104: Use the historical slice data and target slice data associated with the target decision cost performance to perform bandwidth allocation and determine a bandwidth allocation plan.

[0074] Bandwidth allocation refers to the process of scaling and weighting the historical slice data and target slice data associated with the target decision-making cost-effectiveness. The result of the scaling and weighting operation is used as the bandwidth allocation plan.

[0075] The bandwidth allocation plan refers to a strategic plan that dynamically calculates and determines the amount of transmission bandwidth resources required for the target network slice by analyzing the optimal resource utilization of historical slice data and the business needs of the current target network slice.

[0076] In the embodiment of the present invention, historical slice data and target slice data associated with target decision cost performance are used to perform scaling and importance weighting operations, and the results of the scaling and importance weighting operations are used as the bandwidth allocation solution.

[0077] Step 105: When the target slice delay value is greater than the historical slice delay value associated with the target decision cost-effectiveness, the reserved allocated bandwidth within the reserved allocated bandwidth is adjusted according to a preset ratio until the target slice delay value is less than or equal to the historical slice delay value associated with the target decision cost-effectiveness.

[0078] In an embodiment of the present invention, when the target slice delay value of the current time slot calculated by the preset slice delay model (reflecting the network delay performance under the current bandwidth allocation scheme) is greater than the slice delay value of the historical best cost-effectiveness time slot (i.e., the historical slice delay value associated with the target decision cost-effectiveness, representing the delay benchmark under the historical best resource utilization efficiency), it is necessary to dynamically adjust the currently reserved total bandwidth according to a pre-set adjustment ratio (such as increasing the reserved bandwidth by 5% each time) until the target slice delay value of the current time slot is reduced to no more than the historical best delay benchmark.

[0079] The present invention is based on a preset slice delay model, calculates the slice delay values of historical and current time slots, and analyzes the decision cost-effectiveness of multiple historical time slots in the past. The decision cost-effectiveness of the historical time slot with the highest historical slice data is used as the allocation benchmark. When the target slice delay value is greater than the historical slice delay value associated with the allocation benchmark, the bandwidth allocation scheme is dynamically adjusted to achieve precise adaptation of bandwidth resources. The present invention reduces bandwidth idleness caused by fixed reservation through dynamic allocation at the time slot level, solving the technical problem of bandwidth waste in the existing method of using fixed reserved bandwidth.

[0080] See also Figure 2 , Figure 2 This is a flowchart of the steps of a bandwidth allocation method for multimodal service flows provided in the second embodiment of the present invention.

[0081] The present invention provides a bandwidth allocation method for a multimodal service flow, comprising:

[0082] Step 201: Acquire historical slice data of a target power communication network in multiple historical time slots and target slice data in a current time slot.

[0083] It should be noted that the 5G power communication network can be represented by a directed graph N(u,b,r i ,E W ,E C ,E T ) is used to represent it. Among them: u, b and r i They are respectively the collection of network power terminals, wireless base stations and routers; E W 、E C and E T The power terminals u∈U (total number of power terminals) are connected via wireless access link e ub ∈E W Access to wireless base station b∈B (total number of wireless base stations) and send data. Wireless base station b transmits the received slice data through wired aggregation link e br1 ∈E CUpload to the connected router r1∈R (total number of routers). Finally, router r1 obtains a wired forwarding link e consisting of multiple forwarding links according to specific routing rules. r1rd ∈E T Wired forwarding link e r1rd The destination node is the business system master station router r d .

[0084] Use Si(u,r d ,w i ,d i ,B i ) represents the i-th network slice carrying a certain power business. d They are the power terminal that creates the slice and the master router of the business carried by the slice, w i d i and B i The slice importance level, data size, and minimum transmission bandwidth are respectively. i ∈|W| (total importance) represents the importance of the power business carried by the slice, and w i The bigger the number, the more important the business is.

[0085] In the embodiment of the present invention, the specific implementation process of step 201 is similar to that of step 101 and will not be repeated here.

[0086] Step 202: Multiple historical slice data and target slice data are respectively input into a preset slice delay model to obtain multiple historical slice delay values and target slice delay values.

[0087] Furthermore, step 202 may include the following sub-steps:

[0088] S11. Use historical slice data to input a preset slice delay model to obtain a historical slice delay value;

[0089] S12. Traverse all historical slice data to obtain multiple corresponding historical slice delay values;

[0090] S13. Use the target slice data to input the preset slice delay model to obtain the target slice delay value.

[0091] In an embodiment of the present invention, a single historical slice data is first input into a preset slice delay model to obtain a historical slice delay value of the single historical slice data, and then all historical slice data are traversed, that is, multiple historical slice data are respectively input into the preset slice delay model to obtain multiple historical slice delay values. It can be understood that each historical slice data corresponds to a historical slice delay value, and finally the target slice data is input into the preset slice delay model to obtain the target slice delay value corresponding to the target slice data.

[0092] Furthermore, the preset slice delay model includes a wireless access delay function, a wired aggregation delay function, a wired forwarding delay function, and a delay and target function. The historical slice data includes historical wireless delay time points, historical wired delay time points, historical slice total bandwidth, historical slice delay weight, historical slice data volume, and historical slice importance. S11 may include the following sub-steps:

[0093] S111. Using historical wireless delay time points as input into a wireless access delay function to obtain historical wireless access delay;

[0094] It should be noted that the historical wireless delay time points include the historical time points when the uplink data actually arrives at the base station and the historical time points when the uplink data is requested to be sent or is ready at the terminal;

[0095] In the historical slice data, the network slice is in the wireless access link e ub The delay on the wireless access is encapsulated into a function. The specific function of wireless access delay is:

[0096]

[0097] Where, Indicates the wireless access delay, which is the historical wireless access delay or the target wireless access delay. It specifically represents the waiting delay from the time when the power terminal creates a network slice to the time when the wireless base station allows the terminal to use the wireless access link to upload the slice data. Indicates the time point when the historical uplink data actually arrives at the base station. Indicates the time point at which the historical data was sent or ready at the terminal request. Indicates wireless, To reach, Indicates sending, represents the power terminal of the target power communication network, represents the wireless base station of the target electric power communication network, Indicates the uplink direction to the wireless base station.

[0098] S112. Use historical wired delay time points to input a wired convergence delay function to obtain historical wired convergence delay;

[0099] It should be noted that the historical wired delay time points include the time points when the historical slice service data actually arrives at the aggregation link and the time points when the historical slice service data is ready to be sent to the aggregation link at the base station.

[0100] In the historical slice data, the network slice is connected to the wired aggregation link e br1 The delay on the line is encapsulated into a function. The wired convergence delay function is:

[0101]

[0102] Where, Indicates the wired convergence delay, which is the historical wired convergence delay or the target wired convergence delay. It specifically represents the waiting delay from when the wireless base station receives the slice data to when the router allows it to upload the slice data using the wired convergence link. Indicates the time point when the historical slice service data actually arrives at the aggregation link. Indicates the time point when the base station is ready to send the historical slice service data to the aggregation link. Indicates the aggregation link from the wireless base station to the router.

[0103] S113. Input the historical slice total bandwidth, historical slice delay weight, and historical slice data volume into a wired forwarding delay function to obtain a historical wired forwarding delay.

[0104] The wired forwarding delay function is:

[0105]

[0106]

[0107]

[0108]

[0109] Where, Indicates the wired forwarding delay, which is the historical wired forwarding delay or the target wired forwarding delay. It specifically represents the time it takes for slice data to arrive at the router and be admitted to the limited forwarding path without being allocated the minimum remaining bandwidth and waiting delay. Indicates the forwarding waiting delay, which is the historical forwarding waiting delay or the target forwarding waiting delay. Indicates the forwarding transmission delay, which is the historical forwarding transmission delay or the target forwarding transmission delay. Indicates a preset first data volume, representing a preset fixed constant related to the slice service data volume, Indicates the amount of slice data, which is the amount of historical slice data or the amount of target slice data. Indicates the proportional bandwidth, which can be the historical proportional bandwidth or the target proportional bandwidth. Indicates the total bandwidth of the slice, which is the total bandwidth of the historical slice or the total bandwidth of the target slice. Indicates the slice delay weight, which is the historical slice delay weight or the target slice delay weight. Indicates the It should be noted that each slice data (historical slice data or target slice data) contains multiple network slices.

[0110] S114. Use historical wireless access delay, historical wired convergence delay, historical wired forwarding delay, and historical slice importance as input delay and objective function to obtain historical slice delay value.

[0111] The specific delay and objective function are:

[0112]

[0113]

[0114] Where, Indicates the slice delay value, which is the historical slice delay value Or target slice delay value ,in, It is 0 or 1, 0 means the historical time slot, 1 means the current time slot. Indicates the slice importance, which is the historical slice importance or the target slice importance. Indicates the The sum of the historical wireless access delay, historical wired aggregation delay, and historical wired forwarding delay of each network slice, Indicates the total number of network slices in the historical slice data.

[0115] In an embodiment of the present invention, based on historical wireless delay time points, historical wired delay time points, historical slice total bandwidth, historical slice delay weight, and historical slice data volume, the historical wireless access delay, historical wired convergence delay, and historical wired forwarding delay are determined using a wireless access delay function, a wired convergence delay function, and a wired forwarding delay function. Then, the historical wireless access delay, historical wired convergence delay, and historical wired forwarding delay are used in combination with the historical slice importance input delay and the objective function to obtain the historical slice delay value.

[0116] Furthermore, the target slice data includes a target wireless delay time point, a target wired delay time point, a target slice total bandwidth, a target slice delay weight, a target slice data volume, and a target slice importance. S13 may include the following sub-steps:

[0117] S131. Input a wireless access delay function using a target wireless delay time point to obtain a target wireless access delay.

[0118] S132. Use the target wired delay time point as input into the wired convergence delay function to obtain the target wired convergence delay;

[0119] S133: Input the target slice total bandwidth, target slice delay weight, and target slice data volume into a wired forwarding delay function to obtain a target wired forwarding delay.

[0120] S134. Use the target wireless access delay, the target wired convergence delay, the target wired forwarding delay, and the target slice importance as input delay and objective function to obtain a target slice delay value.

[0121] In the embodiment of the present invention, it is similar to step S111 to step S114 and will not be repeated here.

[0122] Step 203: Use multiple historical slice data and corresponding historical slice delay values to make a cost-effectiveness decision and determine the target decision cost-effectiveness.

[0123] Furthermore, step 203 may include the following sub-steps:

[0124] S21. Determine the initial decision cost-effectiveness using historical slice data and corresponding historical slice latency values;

[0125] S22. Traverse all historical slice data to obtain multiple initial decision cost-effectiveness;

[0126] S23. Select the maximum value from multiple initial decision cost-effectiveness ratios as the target decision cost-effectiveness ratio.

[0127] In an embodiment of the present invention, first, a single historical slice data and the corresponding historical slice delay value are used to make a cost-effectiveness decision to obtain the initial decision cost-effectiveness corresponding to the single historical slice data. All historical slice data are traversed to obtain multiple initial decision cost-effectivenesses. It can be understood that each historical slice data corresponds to an initial decision cost-effectiveness, and then the initial decision cost-effectiveness with the largest value is selected from the multiple initial decision cost-effectivenesses as the target decision cost-effectiveness.

[0128] Furthermore, S21 may include the following sub-steps:

[0129] S211. Perform a ratio calculation using the total bandwidth of the historical slices and the amount of data in the historical slices to obtain a historical unit cost.

[0130] It should be noted that the amount of bandwidth allocated by the network for a unit of historical slice data can be regarded as the unit cost of the decision. Specifically, the above process is converted into a formula encapsulation form, which is:

[0131]

[0132] Where, Represents historical unit cost.

[0133] S212. Perform a ratio calculation on the historical slice data volume and the historical slice latency value to obtain a historical unit revenue.

[0134] It should be noted that the unit weighted historical slice latency value and the amount of data served are regarded as the unit benefit of the decision-making process. Specifically, the above process is converted into a formula encapsulation form, which is specifically:

[0135]

[0136] Where, represents the historical unit return.

[0137] S213. Perform a ratio calculation using historical unit revenue and historical unit cost to obtain the initial decision cost-effectiveness.

[0138] It should be noted that a higher decision-making cost-effectiveness means that the network can serve more slice data with a smaller allocated bandwidth in any single decision, while obtaining a smaller slice weighted corresponding historical slice delay value. Specifically, the above process is converted into a formula encapsulation form as follows:

[0139]

[0140] Where, Represents the cost-effectiveness of the initial decision.

[0141] In an embodiment of the present invention, first, a ratio calculation is performed on the historical slice total bandwidth and the historical slice data volume to obtain the historical unit cost. Then, a ratio calculation is performed on the historical slice data volume and the historical slice delay value to obtain the historical unit benefit. Finally, a ratio calculation is performed on the historical unit benefit and the historical unit cost to obtain the initial decision cost-effectiveness.

[0142] Step 204: Use the historical slice data and target slice data associated with the target decision cost performance to perform bandwidth allocation and determine a bandwidth allocation plan.

[0143] Furthermore, step 204 may include the following sub-steps:

[0144] S31, performing a ratio operation on the target slice data volume and the historical slice data volume to obtain a target ratio;

[0145] S32. Multiply the target ratio by the total bandwidth of the historical slices to obtain the reserved allocated bandwidth.

[0146] Specifically, the above steps S31 and S32 are converted into a formula encapsulation form, specifically:

[0147]

[0148] Where, Indicates reserved allocated bandwidth. To facilitate understanding and distinction, the target slice data volume is expressed as , the amount of historical slice data is expressed as .

[0149] S33. Perform a multiplication operation on the reserved allocation bandwidth and the target slice importance to obtain the target allocation bandwidth, which is used as the bandwidth allocation solution.

[0150] It should be noted that since the target slice data contains multiple network slices, each network slice corresponds to a target slice importance. For ease of understanding, the importance of multiple target slices can be expressed as 、 ,..., , The total number of network slices contained in the target slice data.

[0151] Specifically, the above step S33 is converted into a formula encapsulation form, specifically:

[0152]

[0153] Where, represents the bandwidth allocation scheme, Respectively represent the target slice data The target bandwidth is allocated to each network slice.

[0154] Step 205: When the target slice delay value is greater than the historical slice delay value associated with the target decision cost-effectiveness, the reserved allocated bandwidth within the reserved allocated bandwidth is adjusted according to a preset ratio until the target slice delay value is less than or equal to the historical slice delay value associated with the target decision cost-effectiveness.

[0155] In this embodiment of the present invention, when the target slice delay value Greater than the historical slice latency associated with the target decision cost-effectiveness When, that is , the reserved allocated bandwidth within the reserved allocated bandwidth is adjusted according to a preset ratio. In a specific implementation, the preset ratio can be determined by the target slice delay value and the historical slice delay value. The specific method of adjusting the reserved allocated bandwidth within the reserved allocated bandwidth according to the preset ratio is as follows:

[0156]

[0157] Where, Indicates the adjusted reserved allocated bandwidth.

[0158] It is worth mentioning that the business traffic in the power communication network is dynamically changing, and the business needs and network conditions may vary at different times. By determining the preset ratio based on the target slice delay value and the historical slice delay value, the current business delay status can be perceived in real time and compared with the historical situation. The reserved allocated bandwidth can then be dynamically adjusted to reduce the target slice delay value to reach or approach the historical slice delay value associated with the target decision-making cost-effectiveness, thereby ensuring the normal transmission of the business and the stable performance of the communication network. For example, when a sudden high-priority business occurs at a certain moment, causing the target slice delay value to increase, the appropriate preset ratio is determined based on the comparison with the historical slice delay value, and the reserved allocated bandwidth can be increased in a timely manner to meet the business's low latency requirements; when the business traffic is small, the reserved bandwidth can be reduced accordingly to avoid wasting bandwidth resources.

[0159] Step 206: When the target slice delay value is less than or equal to the historical slice delay value associated with the target decision cost performance, the bandwidth allocation plan is executed.

[0160] In an embodiment of the present invention, when the target slice delay value is less than or equal to the historical slice delay value associated with the target decision cost-effectiveness, the bandwidth allocation scheme is maintained.

[0161] It should be noted that when the target slice latency value is less than or equal to the historical slice latency value associated with the target decision price / performance ratio, the bandwidth allocation plan is maintained. This indicates that the current network conditions are similar to or better than those that historically achieved the best price / performance ratio. In this case, the current bandwidth allocation plan can effectively meet the service's latency requirements and is also in a relatively ideal state in terms of resource utilization efficiency. Therefore, continuing with this bandwidth allocation plan can ensure stable network performance while avoiding the additional overhead caused by unnecessary bandwidth adjustments.

[0162] The present invention is based on a preset slice delay model, calculates the slice delay values of historical and current time slots, and analyzes the decision cost-effectiveness of multiple historical time slots in the past. The decision cost-effectiveness of the historical time slot with the highest historical slice data is used as the allocation benchmark. When the target slice delay value is greater than the historical slice delay value associated with the allocation benchmark, the bandwidth allocation scheme is dynamically adjusted to achieve precise adaptation of bandwidth resources. The present invention reduces bandwidth idleness caused by fixed reservation through dynamic allocation at the time slot level, solving the technical problem of bandwidth waste in the existing method of using fixed reserved bandwidth.

[0163] The following is a specific verification example:

[0164] In order to test the performance of the algorithm proposed in the present invention, the bandwidth resource allocation algorithm proposed in the present invention is simulated and compared with the existing heuristic algorithm and traversal optimal algorithm under the same network topology and parameter settings. In the simulation setting, the present invention sets the number of network layer nodes and the number of wireless base stations to 20 and 40 respectively, and each base station is connected to 60 power terminals. For simplicity, the present invention corresponds the power terminals to the slices they send one by one. In terms of network links, the present invention sets the bandwidth of the network's wired forwarding link and wired aggregation link to 1000MByte / s and 800MByte / s respectively. Any slice can enter the network at any time slot within 0~70, and the data size of each slice is randomly selected in the interval [100MByte, 200MByte].

[0165] The weighted delay sum of the network slices initiated by the three algorithms in each time slot (i.e., the slice delay value) is as follows: Figure 3 Compared to the heuristic comparison algorithm, the network bandwidth allocation algorithm proposed in this invention can effectively reduce the weighted sum delay of slices initiated in each time slot and achieve a global optimal solution in some time slots. Compared with the heuristic algorithm, the network bandwidth allocation algorithm proposed in this invention can reduce the weighted sum delay of slices by an average of 1075 seconds, which means that the bandwidth allocation algorithm proposed in this invention can achieve a 17.968% performance improvement in the weighted sum delay of services.

[0166] The cost-effectiveness of the decisions made in each time slot of the three algorithms are as follows: Figure 4 As shown. Compared with the heuristic comparison algorithm, the network bandwidth resource allocation algorithm based on machine learning proposed in the present invention can make the bandwidth reservation amount decided by the decision-making process of each time slot more reasonable. The reason is that: when deciding the amount of bandwidth to be reserved for each time slot, the bandwidth allocation algorithm designed by the present invention will find the bandwidth reservation decision with the best decision-making cost-effectiveness in the past time slot, thereby matching the reserved bandwidth amount for the slice data volume in the current time slot. Therefore, the bandwidth decision-making process of the 5G electric power communication network bandwidth resource allocation algorithm of the present invention in each time slot can be determined by presetting the slice delay model. Compared with the existing heuristic algorithm, the bandwidth allocation algorithm of the present invention can improve the decision-making cost-effectiveness by an average of 43.21%.

[0167] The present invention has the following characteristics:

[0168] Improved efficiency: By pre-setting the slice latency model and analyzing the cost-effectiveness of decisions over multiple time slots, bandwidth can be more effectively predicted and allocated, improving resource utilization efficiency.

[0169] Latency reduction: The bandwidth allocation algorithm of the present invention considers the importance of slices and gives priority to high-priority services, effectively reducing latency.

[0170] Dynamic adaptation: The algorithm can adapt to changes in network conditions, dynamically adjust bandwidth allocation, and maintain stable performance.

[0171] Solving NP-hard problems: This invention provides an efficient method for solving the network slicing delay optimization problem, which can quickly find a near-optimal solution even in complex network environments.

[0172] Reduced resource requirements: Compared with traditional deep learning models, the algorithm of the present invention does not require model training and significantly reduces the use of computing resources, thereby effectively reducing implementation costs.

[0173] See also Figure 5 , Figure 5 This is a structural block diagram of a bandwidth allocation system for multimodal service flows provided in Embodiment 3 of the present invention.

[0174] The present invention provides a bandwidth allocation system for multimodal service flows, comprising:

[0175] An acquisition module 301 is configured to acquire historical slice data of a target power communication network in multiple historical time slots and target slice data in a current time slot;

[0176] An input module 302 is configured to input a preset slice delay model using a plurality of historical slice data and a target slice data, respectively, to obtain a plurality of historical slice delay values and a target slice delay value;

[0177] A decision module 303 is configured to perform a cost-performance decision using multiple historical slice data and corresponding historical slice delay values to determine a target decision cost-performance;

[0178] Output module 304, configured to allocate bandwidth using historical slice data and target slice data associated with target decision cost performance, and determine a bandwidth allocation plan;

[0179] The allocation module 305 is used to adjust the reserved allocated bandwidth within the reserved allocated bandwidth according to a preset ratio when the target slice delay value is greater than the historical slice delay value associated with the target decision cost-effectiveness, until the target slice delay value is less than or equal to the historical slice delay value associated with the target decision cost-effectiveness.

[0180] Furthermore, the input module 302 includes:

[0181] The historical slice delay value submodule is used to input the preset slice delay model using historical slice data to obtain the historical slice delay value;

[0182] The first traversal submodule is used to traverse all historical slice data and obtain multiple corresponding historical slice delay values;

[0183] The target slice delay value submodule is used to input the preset slice delay model using the target slice data to obtain the target slice delay value.

[0184] Furthermore, the preset slice delay model includes a wireless access delay function, a wired aggregation delay function, a wired forwarding delay function, and a delay and target function. The historical slice data includes historical wireless delay time points, historical wired delay time points, historical slice total bandwidth, historical slice delay weight, historical slice data volume, and historical slice importance. The historical slice delay value submodule includes:

[0185] A historical wireless access delay unit is configured to input a wireless access delay function using a historical wireless delay time point to obtain a historical wireless access delay;

[0186] A historical wired convergence delay unit is used to input a wired convergence delay function using a historical wired delay time point to obtain a historical wired convergence delay;

[0187] A historical wired forwarding delay unit is configured to input a wired forwarding delay function using a historical slice total bandwidth, a historical slice delay weight, and a historical slice data volume to obtain a historical wired forwarding delay;

[0188] The historical slice delay value output unit is used to use the historical wireless access delay, the historical wired convergence delay, the historical wired forwarding delay and the historical slice importance to input the delay and the objective function to obtain the historical slice delay value.

[0189] Furthermore, the target slice data includes the target wireless delay time point, the target wired delay time point, the target slice total bandwidth, the target slice delay weight, the target slice data volume and the target slice importance. The target slice delay value submodule includes:

[0190] A target wireless access delay unit is configured to input a wireless access delay function using a target wireless delay time point to obtain a target wireless access delay;

[0191] A target wired convergence delay unit is configured to input a wired convergence delay function using a target wired delay time point to obtain a target wired convergence delay;

[0192] A target wired forwarding delay unit is configured to input a wired forwarding delay function using a target slice total bandwidth, a target slice delay weight, and a target slice data volume to obtain a target wired forwarding delay;

[0193] The target slice delay value output unit is used to use the target wireless access delay, the target wired aggregation delay, the target wired forwarding delay and the target slice importance to input the delay and the objective function to obtain the target slice delay value.

[0194] Furthermore, the decision module 303 includes:

[0195] The initial decision cost performance submodule is used to determine the initial decision cost performance using historical slice data and corresponding historical slice delay values;

[0196] The second traversal submodule is used to traverse all historical slice data and obtain multiple initial decision cost-effectiveness;

[0197] The target decision cost performance submodule is used to select the maximum value from multiple initial decision cost performances as the target decision cost performance.

[0198] Furthermore, the initial decision cost-effectiveness submodule includes:

[0199] The historical unit cost unit is used to perform a ratio calculation using the total bandwidth of the historical slice and the amount of data in the historical slice to obtain the historical unit cost;

[0200] The historical unit revenue unit is used to calculate the ratio of the historical slice data volume to the historical slice latency value to obtain the historical unit revenue;

[0201] The ratio calculation unit is used to perform ratio calculation using historical unit revenue and historical unit cost to obtain the initial decision cost performance.

[0202] Furthermore, the output module 304 includes:

[0203] The target ratio submodule is used to perform a ratio operation between the target slice data volume and the historical slice data volume to obtain a target ratio;

[0204] The reserved allocated bandwidth submodule is used to multiply the target ratio by the total bandwidth of the historical slice to obtain the reserved allocated bandwidth;

[0205] The bandwidth allocation scheme submodule is used to perform a multiplication operation on the reserved allocation bandwidth and the target slice importance to obtain the target allocation bandwidth as the bandwidth allocation scheme.

[0206] Furthermore, it also includes:

[0207] The adjustment module is used to execute the bandwidth allocation plan when the target slice delay value is less than or equal to the historical slice delay value associated with the target decision cost-effectiveness.

[0208] The present invention is based on a preset slice delay model, calculates the slice delay values of historical and current time slots, and analyzes the decision cost-effectiveness of multiple historical time slots in the past. The decision cost-effectiveness of the historical time slot with the highest historical slice data is used as the allocation benchmark. When the target slice delay value is greater than the historical slice delay value associated with the allocation benchmark, the bandwidth allocation scheme is dynamically adjusted to achieve precise adaptation of bandwidth resources. The present invention reduces bandwidth idleness caused by fixed reservation through dynamic allocation at the time slot level, solving the technical problem of bandwidth waste in the existing method of using fixed reserved bandwidth.

[0209] See also Figure 6 , Figure 6 This is a structural block diagram of a computer device provided in Example 4 of the present invention.

[0210] An electronic device according to an embodiment of the present invention includes: a memory 401 and a processor 402, wherein the memory 401 stores a computer program; when the computer program is executed by the processor 402, the processor 402 executes the bandwidth allocation method for the multimodal service flow as in any of the above embodiments.

[0211] Memory 401 may be an electronic memory such as flash memory, EEPROM (Electrically Erasable Programmable Read-Only Memory), EPROM, hard disk, or ROM. Memory 401 has storage space 403 for program code 413 for executing any of the method steps described above. For example, storage space 403 for program code may include individual program codes 413 for implementing various steps in the method described above. These program codes may be read from or written to one or more computer program products. These computer program products include program code carriers such as hard disks, compact disks (CDs), memory cards, or floppy disks. The program codes may be compressed, for example, in a suitable format. When executed by a processing device, these codes cause the processing device to execute the various steps in the method described above. These program codes may be read from or written to one or more computer program products. These computer program products include program code carriers such as hard disks, compact disks (CDs), memory cards, or floppy disks. The program codes may be compressed, for example, in a suitable format. When these codes are executed by a computing and processing device, they cause the computing and processing device to execute the various steps in the bandwidth allocation method for multimodal service flows described above.

[0212] Those skilled in the art will clearly understand that, for the convenience and brevity of description, the specific working processes of the systems, devices and units described above can refer to the corresponding processes in the aforementioned method embodiments and will not be repeated here.

[0213] In the several embodiments provided in this application, it should be understood that the disclosed systems, devices and methods can be implemented in other ways. For example, the device embodiments described above are merely schematic. For example, the division of units is only a logical function division. In actual implementation, there may be other division methods, such as multiple units or components can be combined or integrated into another system, or some features can be ignored or not executed. Another point is that the mutual coupling or direct coupling or communication connection shown or discussed can be an indirect coupling or communication connection through some interface, device or unit, which can be electrical, mechanical or other forms.

[0214] Units described as separate components may or may not be physically separate, and components shown as units may or may not be physical units, that is, they may be located in one place or distributed across multiple network units. Some or all of these units may be selected to achieve the purpose of this embodiment according to actual needs.

[0215] In addition, the functional units in the various embodiments of the present invention may be integrated into a single processing unit, each unit may exist physically separately, or two or more units may be integrated into a single unit. The aforementioned integrated units may be implemented in the form of hardware or software functional units.

[0216] If the integrated unit is implemented as a software functional unit and sold or used as an independent product, it can be stored in a computer-readable storage medium. Based on this understanding, the technical solution of the present invention, or the portion that contributes to the prior art, or all or part of the technical solution, can be embodied in the form of a software product. This computer software product is stored in a storage medium and includes several instructions for causing a computer device (which can be a personal computer, server, or network device, etc.) to execute all or part of the steps of the various embodiments of the method of the present invention. The aforementioned storage medium includes various media that can store program code, such as USB flash drives, mobile hard drives, read-only memories (ROMs), random access memories (RAMs), magnetic disks, or optical disks.

[0217] The above embodiments are only used to illustrate the technical solutions of the present invention, rather than to limit the same. Although the present invention has been described in detail with reference to the aforementioned embodiments, those skilled in the art should understand that they can still modify the technical solutions described in the aforementioned embodiments, or make equivalent replacements for some of the technical features therein. However, these modifications or replacements do not deviate the essence of the corresponding technical solutions from the spirit and scope of the technical solutions of the various embodiments of the present invention.

Claims

1. A bandwidth allocation method for multimodal service flows, characterized in that: include: Obtain historical slice data of a target power communication network under multiple historical time slots, as well as target slice data under a current time slot; Using the plurality of historical slice data and the target slice data to input a preset slice delay model respectively, to obtain a plurality of historical slice delay values and a target slice delay value; Performing a cost-performance decision using the plurality of historical slice data and the corresponding historical slice delay values to determine a target decision cost-performance; Using the historical slice data associated with the target decision cost performance and the target slice data to perform bandwidth allocation and determine a bandwidth allocation plan; When the target slice delay value is greater than the historical slice delay value associated with the target decision cost-effectiveness, the reserved allocated bandwidth within the reserved allocated bandwidth is adjusted according to a preset ratio until the target slice delay value is less than or equal to the historical slice delay value associated with the target decision cost-effectiveness.

2. The bandwidth allocation method for multimodal service flows according to claim 1, characterized in that: The adopting of the plurality of historical slice data and the target slice data to input the preset slice delay model respectively to obtain a plurality of historical slice delay values and a target slice delay value includes: Using the historical slice data to input a preset slice delay model to obtain a historical slice delay value; Traversing all the historical slice data to obtain multiple corresponding historical slice delay values; The target slice data is input into the preset slice delay model to obtain a target slice delay value.

3. The bandwidth allocation method for multimodal service flows according to claim 2, characterized in that: The preset slice delay model includes a wireless access delay function, a wired convergence delay function, a wired forwarding delay function, and a delay and objective function. The historical slice data includes historical wireless delay time points, historical wired delay time points, historical slice total bandwidth, historical slice delay weight, historical slice data volume, and historical slice importance. The historical slice data is input into the preset slice delay model to obtain the historical slice delay value, including: Using the historical wireless delay time point as input into the wireless access delay function to obtain the historical wireless access delay; Using the historical wired delay time point to input the wired convergence delay function to obtain the historical wired convergence delay; Using the total bandwidth of the historical slice, the delay weight of the historical slice, and the data volume of the historical slice to input the wired forwarding delay function to obtain the historical wired forwarding delay; The historical wireless access delay, the historical wired convergence delay, the historical wired forwarding delay and the historical slice importance are input into the delay and objective function to obtain a historical slice delay value.

4. The bandwidth allocation method for multimodal service flows according to claim 3, characterized in that: The target slice data includes a target wireless delay time point, a target wired delay time point, a target slice total bandwidth, a target slice delay weight, a target slice data volume, and a target slice importance. The target slice data is input into the preset slice delay model to obtain a target slice delay value, including: Using the target wireless delay time point as input into the wireless access delay function to obtain a target wireless access delay; Using the target wired delay time point as input into the wired convergence delay function to obtain a target wired convergence delay; Using the target slice total bandwidth, the target slice delay weight, and the target slice data volume to input the wired forwarding delay function to obtain a target wired forwarding delay; The target wireless access delay, the target wired convergence delay, the target wired forwarding delay, and the target slice importance are input into the delay and objective function to obtain a target slice delay value.

5. The bandwidth allocation method for multimodal service flows according to claim 3, characterized in that: The performing a cost-performance decision by using the plurality of historical slice data and the corresponding historical slice delay values to determine a target decision cost-performance includes: Determine the initial decision cost-effectiveness using the historical slice data and the corresponding historical slice delay value; Traversing all the historical slice data to obtain multiple initial decision cost-effectiveness; The maximum value is selected from the multiple initial decision cost-effectiveness ratios as the target decision cost-effectiveness ratio.

6. The bandwidth allocation method for multimodal service flows according to claim 5, characterized in that: The determining the initial decision cost-effectiveness by using the historical slice data and the corresponding historical slice delay value includes: Performing a ratio operation on the total bandwidth of the historical slices and the amount of data in the historical slices to obtain a historical unit cost; Performing a ratio operation on the historical slice data volume and the historical slice delay value to obtain a historical unit revenue; The historical unit revenue and the historical unit cost are used to perform a ratio calculation to obtain an initial decision cost-effectiveness ratio.

7. The bandwidth allocation method for multimodal service flows according to claim 4, characterized in that: The step of allocating bandwidth using the historical slice data associated with the target decision cost-performance ratio and the target slice data to determine a bandwidth allocation scheme includes: Performing a ratio operation on the target slice data volume and the historical slice data volume to obtain a target ratio; The target ratio is multiplied by the total bandwidth of the historical slice to obtain the reserved allocated bandwidth; The reserved allocated bandwidth is multiplied by the target slice importance to obtain the target allocated bandwidth, which is used as the bandwidth allocation scheme.

8. The bandwidth allocation method for multimodal service flows according to claim 1, wherein: Also includes: When the target slice delay value is less than or equal to the historical slice delay value associated with the target decision cost-effectiveness, the bandwidth allocation scheme is executed.

9. A bandwidth allocation system for multimodal service flows, characterized in that: include: An acquisition module, used to acquire historical slice data of a target power communication network under multiple historical time slots, and target slice data under a current time slot; An input module, configured to input a preset slice delay model using the plurality of historical slice data and the target slice data, respectively, to obtain a plurality of historical slice delay values and a target slice delay value; A decision module, configured to perform a cost-performance decision using the plurality of historical slice data and the corresponding historical slice delay values to determine a target decision cost-performance; An output module, configured to allocate bandwidth using the historical slice data associated with the target decision cost performance and the target slice data, and determine a bandwidth allocation plan; An allocation module is used to adjust the reserved allocated bandwidth within the reserved allocated bandwidth according to a preset ratio when the target slice delay value is greater than the historical slice delay value associated with the target decision cost-effectiveness, until the target slice delay value is less than or equal to the historical slice delay value associated with the target decision cost-effectiveness.

10. An electronic device, characterized in that: The system comprises a memory and a processor, wherein a computer program is stored in the memory, and when the computer program is executed by the processor, the processor executes the steps of the bandwidth allocation method for a multimodal service flow according to any one of claims 1 to 8.

Images