Bandwidth allocation method and device and related equipment

Abstract

The invention provides a bandwidth allocation method and related equipment, and relates to the technical field of communication networks, and the method is a method which can meet delay and priority requirements of protocol data unit sets of different priority types from the perspective of network overall bandwidth resource allocation and meet the maximum utilization rate of network overall bandwidth resources.

Description

Background Art

[0002] PDUSET (which can be understood as a set of related protocol data units that together form a complete application layer message or transaction) is used to characterize the delay and packet loss metrics of consecutive multiple data packets for the complete transmission of an application layer information unit. These metrics no longer correspond to a single data packet or a certain type of traffic flow, but rather the overall delay requirement and packet loss requirement from the start to the end of transmission of a specific set of consecutive data packets.

[0003] PDUSET corresponds to the new data packet transmission characteristics of new services such as Extended Reality (XR). It poses higher requirements for the bandwidth allocation and scheduling of communication networks. On the one hand, from the perspective of a single PDUSET, all consecutive data packets of a certain PDUSET need to be transmitted within a limited time delay range. Priority transmission needs to be done for the data packets of some PDUSETs, etc. For corresponding service requirement scenarios, for example, in the high-definition scenario of XR service, transmitting a picture requires hundreds of data packets and needs to be completely transmitted within a limited time to be correctly unpacked and presented; for example, the I-frame of XR service should be given priority to ensure complete transmission, while the B-frame and P-frame have relatively lower priorities. Therefore, the data packets of the PDUSET corresponding to the I-frame should be transmitted first; for example, if the data packets of a certain frame have not been completely transmitted before exceeding the maximum allowed delay, then the subsequent data of this frame should no longer be transmitted to avoid wasting network bandwidth resources, etc. On the other hand, from the perspective of the overall network bandwidth resource allocation, the best balance point should be sought between meeting the delay and priority requirements of different priority types of PDUSETs and maximizing the utilization rate of the overall network bandwidth resources.

[0004] In addition, the network infrastructure corresponding to PDUSET can be a Passive Optical Network (PON), a WiFi network, a PON network and a WiFi network, or a 5th Generation Mobile Communication Technology (5G) network, etc. For example, in a PON network, an application service server (such as an XR server) is connected to an Optical Line Terminal (OLT) device. The Optical Network Unit (ONU) device in the PON network is connected to the OLT device upstream, the OLT device is connected to the service server upstream, the ONU device is connected to the service terminal downstream, and the XR client is on the service terminal.

[0005] However, currently in the industry, there is still a lack of research on methods that can meet the latency and priority requirements of different types of PDU SETs from the perspective of overall network bandwidth resource allocation and maximize the utilization rate of the overall network bandwidth resources.

[0006] It should be noted that the information disclosed in the above background art section is only used to enhance the understanding of the background of the present disclosure, and thus may include information that does not constitute the prior art known to those of ordinary skill in the art. Summary of the Invention

[0007] The present disclosure provides a bandwidth allocation method, apparatus, and related devices, which at least to some extent overcome the problem of low utilization rate of bandwidth resources in the related art.

[0008] Other features and advantages of the present disclosure will become apparent through the following detailed description, or will be learned in part through the practice of the present disclosure.

[0009] According to one aspect of the present disclosure, a bandwidth allocation method is provided, including: globally optimizing the allocation of bandwidth for the protocol data unit sets based on the latency budget requirements, priority requirements of different types of protocol data unit sets, and the utilization rate of the overall network bandwidth resources; wherein, the protocol data unit sets with higher priorities are preferentially allocated bandwidth resources, and the latency for sending all data packets of the protocol data unit sets is completed within the latency budget time range; setting a benefit coefficient that can be obtained for each unit length of data sent by the protocol data unit sets, the benefit coefficient being related to the priority of the protocol data unit sets and the latency budget factors of the protocol data unit sets, and calculating the maximization of the overall benefit of the network bandwidth resources based on the benefit coefficient.

[0010] In some exemplary embodiments of the present disclosure, based on the foregoing solution, when the bandwidth is scheduled according to a scheduling period and allocated according to time slots, at the beginning of each scheduling period, the global optimization allocation is used to calculate the number of time slots that can be obtained by all protocol data unit sets in the current scheduling period, and an optimal solution that simultaneously satisfies the following conditions is calculated: the protocol data unit sets with higher priorities are preferentially allocated bandwidth resources, and the latency for sending all data packets of the protocol data unit sets is completed within the latency budget time range; setting a benefit coefficient that can be obtained for each unit length of data sent by the protocol data unit sets, the benefit coefficient being related to the priority of the protocol data unit sets and the latency budget factors of the protocol data unit sets, and calculating the maximization of the overall benefit of the network bandwidth resources based on the benefit coefficient.

[0011] In some exemplary embodiments of the present disclosure, based on the foregoing solution, the method is applicable to various network scenarios. The method is applicable not only to GPON networks but also to other types of PON networks. The method is applicable not only to PON networks but also to other types of networks such as WiFi networks, PON + WiFi networks, and 5G networks.

[0012] In some exemplary embodiments of the present disclosure, based on the foregoing solution, for other types of networks, the method is not limited to scenarios where bandwidth is allocated in fixed cycles. The method is applicable to fixed scheduling cycle scenarios, non-fixed scheduling cycle scenarios, and scenarios without periodic scheduling. For scenarios with non-fixed length periodic scheduling, the method performs scheduling according to a non-fixed length cycle. At the start of each cycle, scheduling is performed according to the calculation method of each scheduling cycle in the method. In scenarios without periodic scheduling, the method takes the arrival of each new protocol data unit set or each batch of new protocol data unit sets as the starting point of the bandwidth scheduling operation step. At the start of each operation step, scheduling is performed according to the calculation method of each scheduling cycle in the method.

[0013] In some exemplary embodiments of the present disclosure, based on the foregoing solution, in each scheduling cycle, the protocol data unit sets are divided into preset batches according to the type of priority; and bandwidth allocation scheduling is performed on different batches of protocol data unit sets in sequence according to the algorithm formula.

[0014] In some exemplary embodiments of the present disclosure, based on the foregoing solution, in each scheduling cycle, according to the classification of high, medium, and low priorities, first, bandwidth allocation scheduling is performed on the protocol data unit sets with high priority. For protocol data unit sets with the same high priority, allocation is performed in sequence according to the priority order of the urgency coefficients from high to low; calculate the remaining allocable time slots after the allocation of the high-priority protocol data unit sets; perform scheduling on the protocol data unit sets with medium priority. For protocol data unit sets with the same medium priority, allocation is performed in sequence according to the priority order of the urgency coefficients from high to low; calculate the remaining allocable time slots after the allocation of the high-priority and medium-priority protocol data unit sets; perform scheduling on the protocol data unit sets with low priority. For protocol data unit sets with the same low priority, allocation is performed in sequence according to the priority order of the urgency coefficients from high to low.

[0015] In some exemplary embodiments of the present disclosure, based on the foregoing solution, in each scheduling cycle, when scheduling the protocol data unit set according to the global optimization allocation, if in a certain scheduling cycle, a certain protocol data unit set fails to obtain the total length time slot of the data packet to be sent, a proportional allocation strategy is adopted, and a part of the total length time slot of the data packet to be sent is allocated. Partially meeting the transmission requirements, the data that fails to be transmitted after the time slot is allocated is cached to the next cycle to participate in the allocation of the next cycle.

[0016] In some exemplary embodiments of the present disclosure, based on the foregoing solution, from the perspective of the overall network bandwidth resource allocation, the method can meet the delay and priority requirements of different priority types of protocol data unit sets, and maximize the utilization rate of the overall network bandwidth resources.

[0017] In some exemplary embodiments of the present disclosure, based on the foregoing solution, in each scheduling cycle τ start time, calculate whether the boundary conditions such as the delay budget of each protocol data unit set PDUSET j are met through the following algorithm formula (1). For the protocol data unit set PDUSET j whose conditions are met, continue to perform bandwidth allocation calculation on the data packets according to the following algorithm formula (2):

[0018]

[0019] Through the following algorithm formula (2), in each scheduling cycle τ calculate the bandwidth allocation ratio x j of each protocol data unit set PDUSET jτ :

[0020]

[0021] where τ current is the scheduling cycle in which the protocol data unit set PDUSET j is currently located; τ0 is the scheduling cycle in which the protocol data unit set PDUSET j starts from the sending of the first data packet; d j,τ is the consumed delay of the protocol data unit set PDUSET j ; PSDBspent PDUSETj is the total length of the consumed delay from the sending of the first data packet to the current moment for the protocol data unit set PDUSET j ; PSDB PDUSETj is the delay budget of the protocol data unit set PDUSET j ; n τDefined as the number of protocol data unit sets of all to-be-allocated time slots within the current scheduling cycle τ ; c j,τ Defined as the protocol data unit set PDUSET τ within the current scheduling cycle j The revenue coefficient obtained for each unit length of data sent; x j,τ Defined as the protocol data unit set PDUSET τ within the current scheduling cycle j The bandwidth allocation ratio coefficient of; a j,τ Defined as the protocol data unit set PDUSET τ within the current scheduling cycle j The total length of the data packets to be sent of; b τ Defined as the protocol data unit set PDUSET τ of all to-be-allocated time slots within the current scheduling cycle j The total number of available bandwidth time slots of.

[0022] In some exemplary embodiments of the present disclosure, based on the foregoing solution, in the global optimal allocation, the revenue coefficient c j,τ Adopts multiple definition methods. Among them, one definition of the revenue coefficient includes: setting a revenue coefficient related to the priority of the protocol data unit set; setting a revenue weighting ratio coefficient related to the current urgency of sending of the protocol data unit set; setting the revenue weighting ratio coefficient to be measured by the ratio of the remaining delay budget to the total delay budget, the ratio of the remaining length of the data packets to be sent to the total data packet length, and the ratio of the remaining budget of the delay data packets to the total budget; setting the revenue coefficient obtained for each unit length of data sent by the protocol data unit set to be related to the priority of the data unit set, the revenue coefficient related to the priority of the protocol data unit set, the priority of the protocol data unit set, and the revenue weighting ratio coefficient related to the current urgency of sending of the protocol data unit set.

[0023] In some exemplary embodiments of the present disclosure, based on the foregoing solution, in the global optimal allocation, the revenue coefficient c j,τ Adopts multiple definition methods. Among them, one definition of the revenue coefficient includes: defining as the revenue coefficient associated with the priority j of PDUSET which is defined according to the requirements of the service scenario; defining as related to the current scheduling cycle schedulingcycleτ Internal PDUSET j Transmission urgency level Related revenue weighting ratio coefficient; defined As the PDUSET within this scheduling cycle τ Internal PDUSET j The packet transmission urgency level of Measured in multiple ways such as the ratio of the remaining delay budget to the total delay budget, the ratio of the remaining length of packets to be sent to the total packet length, and the ratio of the remaining budget considering delay packets to the total budget; defined Calculated from the perspective of the ratio of the remaining delay budget to the total delay budget Defined Calculated from the perspective of the ratio of the remaining length of packets to be sent to the total packet length Defined As PDUSET j The total length of the packets that have been sent Statistically accumulated and calculated by the system device; defined Calculated from the perspective of the ratio of the remaining budget considering delay packets to the total budget

[0024] In some exemplary embodiments of the present disclosure, based on the foregoing solution, the revenue coefficient c j,τ Is obtained through the following formula:

[0025]

[0026] Or the revenue coefficient c j,τ Is obtained through the following formula:

[0027]

[0028] Or the revenue coefficient c j,τ Is obtained through the following formula:

[0029]

[0030]

[0031] In some exemplary embodiments of the present disclosure, based on the foregoing solution, define x j,τ As the bandwidth allocation ratio coefficient of the PDUSET within this scheduling cycle τ Internal PDUSET j The ratio coefficient is relative to the PDUSET within this scheduling cycle τ Internal PDUSETj The total length a of the data packets to be sent j,τ For, there is:

[0032]

[0033] In some exemplary embodiments of the present disclosure, based on the foregoing solution, a is defined j,τ As the total length of the data packets to be sent within the current scheduling cycle schedulingcycle τ Of PDUSET j Then there is:

[0034] a j,τ = The total length of the newly arrived data packets of PDUSET at the start time of the current scheduling cycle schedulingcycle τ + The total length of the unsuccessfully sent data packets of PDUSET cached in the previous scheduling cycle schedulingcycle j τ-1 j Of PDUSET τ τ

[0035] In some exemplary embodiments of the present disclosure, based on the foregoing solution, b is defined τ As the total number of available bandwidth time slots of the protocol data unit set of all the time slots to be allocated within the current scheduling cycle schedulingcycle τ ; Define The number of time slots already allocated within the current scheduling cycle schedulingcycle τ Then there is:

[0036]

[0037] According to another aspect of the present disclosure, there is also provided a bandwidth allocation system, including: in a PON network, the optical line terminal device identifies the relevant information of the protocol data unit set and performs bandwidth allocation by executing any one of the above-mentioned bandwidth allocation methods; in a WiFi network, the wireless access point device identifies the relevant information of the protocol data unit set and performs bandwidth allocation by executing any one of the above-mentioned bandwidth allocation methods; in a 5G network, the user plane function device or the access network device identifies the relevant information of the protocol data unit set and performs bandwidth allocation by executing any one of the above-mentioned bandwidth allocation methods.

[0038] According to still another aspect of the present disclosure, there is also provided an electronic device, including: a processor; and a memory for storing the executable instructions of the processor; wherein, the processor is configured to execute any one of the above-mentioned bandwidth allocation methods by executing the executable instructions.

[0039] According to another aspect of the present disclosure, there is also provided a computer-readable storage medium, on which a computer program is stored, and when the computer program is executed by a processor, the above-mentioned any bandwidth allocation method is implemented.

[0040] According to another aspect of the present disclosure, there is also provided a computer program product, including: a computer program or instruction, and when the computer program or instruction is executed by a processor, the bandwidth allocation method of any one of the above is implemented.

[0041] In an embodiment of the present disclosure, a bandwidth allocation method, device and related equipment are provided. By globally optimizing the allocation calculation, it is determined whether the total delay length consumed by each protocol data unit set from the start of sending the first data packet to the current moment meets the delay budget of each protocol data unit set. For the protocol data unit sets that meet the delay budget, the optimal solution of the bandwidth allocation formula is used as the bandwidth allocation result to determine the bandwidth resources allocated to each protocol data unit set, which can meet the delay and priority requirements of different priority types of protocol data unit sets from the perspective of the overall network bandwidth resource allocation and maximize the utilization rate of the overall network bandwidth resources.

[0042] It should be understood that the above general description and the following detailed description are only exemplary and explanatory, and cannot limit the present disclosure. Brief Description of the Drawings

[0043] The drawings herein are incorporated into the specification and constitute a part of the specification, showing embodiments consistent with the present disclosure, and are used together with the specification to explain the principles of the present disclosure. Obviously, the drawings in the following description are only some embodiments of the present disclosure, and those of ordinary skill in the art can obtain other drawings without creative efforts based on these drawings.

[0044] Figure 1 Exemplary application system architecture diagram showing a bandwidth allocation method in an embodiment of the present disclosure;

[0045] Figure 2 Diagram showing a bandwidth allocation method in an embodiment of the present disclosure;

[0046] Figure 3 Diagram showing a bandwidth allocation method in a GPON network in an embodiment of the present disclosure;

[0047] Figure 4 Diagram showing an electronic device applying a bandwidth allocation method in an embodiment of the present disclosure. Detailed Embodiments

[0048] Example embodiments will now be described more fully with reference to the accompanying drawings. However, the example embodiments can be implemented in various forms and should not be construed as limited to the examples set forth herein; rather, these embodiments are provided so that this disclosure will be thorough and complete, and will fully convey the concept of example embodiments to those skilled in the art. The features, structures, or characteristics described may be combined in any suitable manner in one or more embodiments.

[0049] In addition, the features, structures, or characteristics described may be combined in any suitable manner in one or more embodiments. In the following description, numerous specific details are provided to give a thorough understanding of the embodiments of this disclosure. However, those skilled in the art will recognize that the technical solutions of this disclosure may be practiced without one or more of the specific details, or may be implemented using other methods, components, devices, steps, etc. In other cases, well-known methods, devices, implementations, or operations are not shown or described in detail to avoid obscuring aspects of this disclosure.

[0050] The flowchart shown in the accompanying drawings is merely illustrative and not necessarily inclusive of all content and operations / steps, nor is it necessarily to be executed in the order described. For example, some operations / steps may be decomposed, while some operations / steps may be combined or partially combined, so the actual execution order may change according to the actual situation.

[0051] As Figure 1 shown, the system architecture includes a terminal device 101, a network 102, and a network-side device 103.

[0052] The network 102 is used to provide a medium for the communication link between the terminal device 101 and the network-side device 103, and can be a wired network or a wireless network.

[0053] Optionally, the above-mentioned wireless network or wired network uses standard communication technologies and / or protocols. The network is usually the Internet, but can also be any network, including but not limited to any combination of a local area network (LAN), a metropolitan area network (MAN), a wide area network (WAN), a mobile, wired or wireless network, a private network or a virtual private network. In some embodiments, technologies and / or formats including Hyper Text Mark-up Language (HTML), Extensible Markup Language (XML), etc. are used to represent the data exchanged through the network. In addition, conventional encryption technologies such as Secure Socket Layer (SSL), Transport Layer Security (TLS), Virtual Private Network (VPN), Internet Protocol Security (IPSec), etc. can be used to encrypt all or some of the links. In other embodiments, customized and / or dedicated data communication technologies can also be used to replace or supplement the above data communication technologies.

[0054] Optionally, the terminal device in the embodiments of the present disclosure can also be referred to as a UE (User Equipment). In specific implementation, the terminal device can be a mobile phone, a tablet personal computer, a laptop computer, a personal digital assistant (PDA), a mobile Internet device (MID), a wearable device or a vehicle-mounted device, etc. It should be noted that the specific type of the terminal device is not limited in the embodiments of the present invention.

[0055] The network-side device can be a base station, a relay or an access point, etc. The base station can be a base station of 5G and later versions (for example: 5G NR NB), or a base station in other communication systems (for example: eNB base station). It should be noted that the specific type of the network-side device is not limited in the embodiments of the present disclosure.

[0056] Those skilled in the art can know that Figure 1The number of terminals, networks, and network-side devices in [it] is only illustrative. According to actual needs, there can be any number of terminals, networks, and network-side devices. The embodiments of the present disclosure do not limit this.

[0057] Under the above system architecture, an embodiment of the present disclosure provides a bandwidth allocation method, which can be executed by any electronic device with computing and processing capabilities.

[0058] In some embodiments, the bandwidth allocation method provided in the embodiments of the present disclosure can be executed by the terminal device of the above system architecture; in some other embodiments, the bandwidth allocation method provided in the embodiments of the present disclosure can be executed by the server in the above system architecture; in some other embodiments, the bandwidth allocation method provided in the embodiments of the present disclosure can be implemented by the terminal device and the server in the above system architecture through interaction.

[0059] First, in view of the above problems, an embodiment of the present disclosure provides a bandwidth allocation method that can be applied to, but is not limited to, GPON networks, and can be applied to other types of PON networks, WiFi networks, other types of PON networks plus WiFi networks, 5G networks, and other types of networks. For other types of networks, such as WiFi networks, PON networks + WiFi networks, 5G networks, etc., although there may be situations where the scheduling period is not a fixed-length period or cycle scheduling is not adopted, the bandwidth allocation method in the embodiments of the present disclosure is also applicable to these scenarios. For example, in a scenario with a non-fixed-length cycle scheduling, according to the non-fixed-length cycle, at the start of each cycle, scheduling can be performed according to the calculation method of each scheduling cycle in the bandwidth allocation method of the embodiments of the present disclosure. Another example is that in a scenario where cycle scheduling is not adopted, the bandwidth allocation method in the embodiments of the present disclosure can use the arrival of each new protocol data unit set or each batch of new protocol data unit sets as the starting point of the operation steps for bandwidth scheduling. At the start of each operation step, scheduling is performed according to the calculation method of each scheduling cycle in the bandwidth allocation method of the embodiments of the present disclosure, and the bandwidth allocation method in the embodiments of the present disclosure is still applicable.

[0060] Figure 2 The following shows a schematic diagram of a bandwidth allocation method in an embodiment of the present disclosure. The method includes the following steps:

[0061] S202. Based on the delay budget requirements, priority requirements of different types of protocol data unit sets, and the overall network bandwidth resource utilization rate, perform global optimization allocation of bandwidth for the protocol data unit sets. Among them, the protocol data unit sets with higher priorities are preferentially allocated bandwidth resources, and the transmission delay of all data packets in the protocol data unit sets is completed within the delay budget time range. Set the revenue coefficient that each protocol data unit set can obtain for each unit length of data sent. The revenue coefficient is related to the protocol data unit set priority and the protocol data unit set delay budget factor, and calculate the maximization of the overall revenue of the network bandwidth resources based on the revenue coefficient.

[0062] It should be noted that the protocol data unit (PDU) set in the embodiments of the present disclosure can be represented by PDUSET. PDUSET can be understood as a set of related PDUs. These PDUs together form a complete application layer message or transaction. Each PDU in this set is a part of the message, and only when all PDUs are successfully received and reorganized can the original application layer message be completely restored.

[0063] Compared with the problem of low network bandwidth resource utilization rate in the related art, in the bandwidth allocation method provided in the embodiments of the present disclosure, by globally optimizing the allocation, it is calculated whether the total length of the delay consumed by each protocol data unit set from the start of sending the first data packet to the current moment meets the delay budget of each protocol data unit set. For the protocol data unit sets that meet the delay budget, calculate the optimal solution of the bandwidth allocation formula as the bandwidth allocation result, and determine the bandwidth resources allocated to each protocol data unit set, which can meet the delay and priority requirements of different priority types of protocol data unit sets from the perspective of the overall network bandwidth resource allocation, and achieve the maximization of the overall network bandwidth resource utilization rate.

[0064] In some embodiments, when the bandwidth in the embodiments of the present disclosure is scheduled according to a scheduling period and allocated according to time slots, at the beginning of each scheduling period, global optimization allocation is used to calculate the number of time slots that all protocol data unit sets can obtain in the current scheduling period, and calculate the optimal solution that simultaneously meets the following conditions: the protocol data unit sets with higher priorities are preferentially allocated bandwidth resources, and the transmission delay of all data packets in the protocol data unit sets is completed within the delay budget time range. Set the revenue coefficient that each protocol data unit set can obtain for each unit length of data sent. The revenue coefficient is related to the protocol data unit set priority and the protocol data unit set delay budget factor, and calculate the maximization of the overall revenue of the network bandwidth resources based on the revenue coefficient.

[0065] In some embodiments, the bandwidth allocation method in the embodiments of the present disclosure is applicable to various network scenarios. It is applicable not only to GPON networks but also to other types of PON networks. The bandwidth allocation method in the embodiments of the present disclosure is applicable not only to PON networks but also to other types of networks such as WiFi networks, PON + WiFi networks, and 5G networks. Specifically, in the above content, the bandwidth allocation method of this method takes the bandwidth allocation scheduling of GPON networks as an example. In addition, the bandwidth allocation method in the embodiments of the present disclosure is applicable not only to GPON but also to many other different types of PON networks. For example, in GPON networks, the downstream bandwidth is cyclically scheduled and allocated in a fixed-length period, and each scheduling period is 125 μs. The bandwidth allocation method in the embodiments of the present disclosure performs bandwidth allocation in each scheduling period, and the scheduling periods of other types of PON networks are different, and the global optimization allocation in the embodiments of the present disclosure is applicable.

[0066] In some embodiments, for other types of networks, the bandwidth allocation in the embodiments of the present disclosure is not limited to the scenario of allocating bandwidth in a fixed period. This method is applicable to fixed scheduling period scenarios, non-fixed scheduling period scenarios, and scenarios without periodic scheduling. For scenarios with a non-fixed-length periodic scheduling, the method schedules according to a non-fixed-length period. At the start of each period, it schedules according to the calculation method of each scheduling period in the bandwidth allocation method in the embodiments of the present disclosure. In scenarios without periodic scheduling, the bandwidth allocation method in the embodiments of the present disclosure takes the arrival of each new protocol data unit set or each batch of new protocol data unit sets as the starting point of the operation steps of bandwidth scheduling. At the start of each operation step, it schedules according to the calculation method of each scheduling period in the bandwidth allocation method in the embodiments of the present disclosure.

[0067] In some embodiments, in each scheduling period, the embodiments of the present disclosure divide the protocol data unit set into preset batches according to the type of priority; and sequentially perform bandwidth allocation scheduling on different batches of protocol data unit sets according to global optimization allocation. For example, first schedule the PDUSET of the highest priority batch, apply the above global optimization allocation, then calculate the remaining available time slots, schedule the PDUSET of the next lower priority batch, apply the above global optimization allocation, and so on, until the PDUSET of the lowest priority batch is scheduled and allocated.

[0068] In some embodiments, in each scheduling cycle, according to the high, medium, and low classification of priorities, the present disclosure embodiments first perform bandwidth allocation scheduling on the set of protocol data units with high priority. For the set of protocol data units with the same high priority, they are allocated in sequence according to the priority order of the urgency coefficient from high to low; calculate the remaining allocable time slots after the allocation of the set of protocol data units with high priority; perform scheduling on the set of protocol data units with medium priority. For the set of protocol data units with the same medium priority, they are allocated in sequence according to the priority order of the urgency coefficient from high to low; calculate the remaining allocable time slots after the allocation of the sets of protocol data units with high and medium priorities; perform scheduling on the set of protocol data units with low priority. For the set of protocol data units with the same low priority, they are allocated in sequence according to the priority order of the urgency coefficient from high to low.

[0069] In some embodiments, when the present disclosure embodiments perform scheduling on the set of protocol data units according to global optimization allocation in each scheduling cycle, when in a certain scheduling cycle, a certain set of protocol data units fails to obtain the total length time slot of the data packet to be sent, a proportional allocation strategy is adopted, and a part of the time slot of the total length time slot of the data packet to be sent is allocated, partially meeting the transmission requirements. The data that fails to be allocated a time slot to complete the transmission is cached to the next cycle to participate in the allocation of the next cycle.

[0070] In some embodiments, the bandwidth allocation method in the present disclosure embodiments can meet the delay and priority requirements of different priority types of sets of protocol data units and maximize the utilization rate of the overall network bandwidth resources from the perspective of the overall network bandwidth resource allocation.

[0071] In some embodiments, at the start time of each scheduling cycle schedulingcycle τ calculate whether the boundary conditions such as the delay budget of each set of protocol data units PDUSET j are met through the following algorithm formula (1). For the data packets of the set of protocol data units PDUSET j that meet the conditions, continue to perform bandwidth allocation calculation according to the following algorithm formula (2):

[0072]

[0073] Calculate the bandwidth allocation ratio x τ of each set of protocol data units PDUSET j in each scheduling cycle schedulingcycle j，τ through the following algorithm formula (2):

[0074]

[0075] where τcurrent is the protocol data unit set PDUSET j The scheduling period where it is currently located; τ0 is the protocol data unit set PDUSET j The scheduling period starting from the transmission of the first data packet; d j,τ is the protocol data unit set PDUSET j The consumed delay; is the protocol data unit set PDUSET j The total length of the consumed delay from the transmission of the first data packet to the current moment; PSDB PDUSETj is the protocol data unit set PDUSET j The delay budget; n τ Is defined as within this scheduling cycle schedulingcycle τ The number of protocol data unit sets of all the time slots to be allocated; c j,τ Is defined as within this scheduling cycle schedulingcycle τ The protocol data unit set PDUSET within j The revenue coefficient obtained for each unit length of data transmitted; x j,τ Is defined as within this scheduling cycle schedulingcycle τ The protocol data unit set PDUSET within j The bandwidth allocation ratio coefficient; a j,τ Is defined as within this scheduling cycle schedulingcycle τ The protocol data unit set PDUSET within j The total length of the data packets to be transmitted; b τ Is defined as within this scheduling cycle schedulingcycle τ The protocol data unit set PDUSET of all the time slots to be allocated within j The total number of available bandwidth time slots.

[0076] In addition, the algorithm formula (2) in the embodiments of the present disclosure can adopt a recursive solution method. More specifically, one method of the recursive solution method is as shown in the following formulas (3) to (6):

[0077]

[0078] Define f k,τ (λ τ ) as shown in formula (4):

[0079]

[0080] Then there is:

[0081]

[0082] Define as f k,τ (λ τ ) as the optimal solution.

[0083] Define f 0,τ (λ τ ) = 0, if k = 1, λ τ ≥ 0.

[0084]

[0085] f k,τ (λ τ ) = c k,τ + f k-1,τ (λ τ - a k,τ )

[0086]

[0087] f k,τ (λ τ ) = f k-1,τ (λ τ )

[0088] For k = 2, …, n τ , λ τ = 0, …, b τ ,

[0089]

[0090] Define

[0091]

[0092] For k = n τ - 1, …, 1, there is

[0093]

[0094] In some embodiments, in the global optimization allocation of the embodiments of the present disclosure, the benefit coefficient c j,τMultiple definition methods are adopted. Among them, one definition of the benefit coefficient includes: setting the benefit coefficient related to the priority of the protocol data unit set; setting the benefit weighting ratio coefficient related to the current transmission urgency of the protocol data unit set; setting the benefit weighting ratio coefficient is measured by the ratio of the remaining delay budget to the total delay budget, the ratio of the remaining length of the data packets to be sent to the total length of the data packets, and the ratio of the remaining budget of the delay data packets to the total budget; setting the benefit coefficient that the protocol data unit set can obtain for each unit length of data sent is related to the data unit set priority, the benefit coefficient related to the priority of the protocol data unit set, the protocol data unit set priority, and the benefit weighting ratio coefficient related to the current transmission urgency of the protocol data unit set. Specifically, the embodiments of the present disclosure define the benefit coefficient related to the priority of the protocol data unit set, which can ensure that the critical services in the protocol data unit set can be processed preferentially; defining the benefit weighting ratio coefficient related to the transmission urgency provides the ability of dynamic adjustment to cope with the sudden high-priority data transmission requirements; setting the multi-dimensional measurement method improves the accuracy and flexibility of the global optimization allocation in the embodiments of the present disclosure, enabling it to better adapt to diverse application scenarios. In summary, the embodiments of the present disclosure comprehensively evaluate the transmission value of the protocol data unit set by introducing multiple factors (such as priority, transmission urgency, remaining delay budget, etc.), which can effectively improve the service quality and resource utilization rate of the network.

[0095] In some embodiments, the benefit coefficient c in the global optimization allocation in the embodiments of the present disclosure j,τ Adopt multiple definition methods. Among them, one definition of the benefit coefficient includes:

[0096] Define As the benefit coefficient associated with PDUSET j 's priority The benefit coefficient is defined according to the needs of the service scenario;

[0097] Define As the benefit weighting ratio coefficient related to the τ transmission urgency of PDUSET within this scheduling cycle schedulingcycle j

[0098] Define As the packet transmission urgency of PDUSET within this scheduling cycle schedulingcycle τ j ​​​​Measured in multiple ways, such as the ratio of the remaining delay budget to the total delay budget, the ratio of the remaining length of the data packets to be sent to the total length of the data packets, and the ratio of the remaining budget considering delay data packets to the total budget; define As calculated from the perspective of the ratio of the remaining delay budget to the total delay budget Define As calculated from the perspective of the ratio of the remaining length of the data packets to be sent to the total length of the data packets Define As PDUSET j The total length of the data packets that have been sent, Statistically accumulated and calculated by the system device; define As calculated from the perspective of the ratio of the remaining budget considering delay data packets to the total budget

[0099] In some embodiments, the benefit coefficient c in the embodiments of the present disclosure j,τ Is obtained through the following formula:

[0100]

[0101]

[0102] Or the benefit coefficient c j,τ Is obtained through the following formula:

[0103]

[0104] Or the benefit coefficient c j,τ Is obtained through the following formula:

[0105]

[0106] In some embodiments, the embodiments of the present disclosure define x j,τ As the bandwidth allocation ratio coefficient of PDUSET τ Within this scheduling cycle j The ratio coefficient is relative to the total length a τ Of the data packets to be sent of PDUSET j Within this scheduling cycle j,τ Then there is:

[0107]

[0108] In some embodiments, the embodiments of the present disclosure define a j,τ As the total length of the data packets to be sent of PDUSET τInner PDUSET j For the total length of the data packets to be sent, there is:

[0109] a j,τ = The current scheduling cycle τ The start time of PDUSET j The total length of the newly arrived data packets + the total length of the PDUSET τ-1 Buffered in the previous scheduling cycle j Of the unsuccessfully sent data packets.

[0110] In some embodiments, the present disclosure defines b τ As the total number of available bandwidth time slots of the protocol data unit set of all time slots to be allocated within the current scheduling cycle; define τ The number of time slots already allocated within the current scheduling cycle, then there is: Within the current scheduling cycle τ The number of time slots already allocated, then there is:

[0111]

[0112] In some embodiments, the present disclosure takes the periodic scheduling of a GPON network as an example for illustration. At the start time of each scheduling cycle τ Obtain the information of each PDUSET. Taking PDUSET j As an example, it includes:

[0113] Obtain the priority of PDUSET j Through the data packet header information PDUSET j The total length of all data packets Set based on the priority of PDUSET j The priority Set PDUSET j The delay budget Wherein, Indicates the total delay budget from the start of the first data packet to the completion of the transmission of the last data packet for all data packets of this PDUSET. All packets should be transmitted within the delay budget to meet the requirements, and can be obtained through the corresponding rules of the preset PDUSET priority type (PPM) and the PDUSET delay budget PSDB metric.

[0114] In some embodiments, such as Figure 3As shown, in a certain GPON time slot allocation unit time of the embodiments of the present disclosure, the OLT obtains the relevant information of the PDUSET by identifying the data packet header, including the priority of the PDUSET, the total length of the data packet, the start and end packet markers, and obtains information such as the delay budget. The OLT calculates the total number of time slots available for allocation in this scheduling unit time. According to the bandwidth allocation method in the embodiments of the present disclosure, the PDUSET is allocated time slots by using formulas (1) to (6), and the data packets corresponding to the PDUSET are sent out according to the allocated time slots. In the next GPON time slot allocation unit time, the OLT continues to allocate time slots to the PDUSET by using formulas (1) to (6) according to the bandwidth allocation method in the embodiments of the present disclosure, and sends out the data packets corresponding to the PDUSET according to the allocated time slots, so as to meet the delay and priority requirements of PDUSETs of different priority types and maximize the utilization rate of the overall network bandwidth resources from the perspective of overall bandwidth resource allocation.

[0115] Based on the same inventive concept, an embodiment of the present disclosure also provides a bandwidth allocation system, as described in the following embodiments. Since the principle of solving problems in this system embodiment is similar to that of the above method embodiment, the implementation of this system embodiment can refer to the implementation of the above method embodiment, and the repeated parts will not be described again.

[0116] In some embodiments, the bandwidth allocation system in the embodiments of the present disclosure includes:

[0117] In the PON network, the relevant information of the protocol data unit set is identified by the optical line terminal device, and the bandwidth allocation method in any one of the above embodiments of the present disclosure is executed for bandwidth allocation;

[0118] In the WiFi network, the relevant information of the protocol data unit set is identified by the wireless access point device, and the bandwidth allocation method in any one of the above embodiments of the present disclosure is executed for bandwidth allocation;

[0119] In the 5G network, the relevant information of the protocol data unit set is identified by the user plane function device or the access network device, and the bandwidth allocation method in any one of the above embodiments of the present disclosure is executed for bandwidth allocation.

[0120] It can be seen that for other types of networks, such as PON networks, WiFi networks, 5G networks, etc., although there may be situations where the scheduling period is not a fixed-length period or periodic scheduling is not adopted, the bandwidth allocation method in the embodiments of the present disclosure is also applicable to these scenarios. The bandwidth allocation method in the embodiments of the present disclosure is not limited to the scenario of allocating bandwidth in a fixed period. The bandwidth allocation method in the embodiments of the present disclosure is applicable to fixed scheduling periods, non-fixed scheduling periods, and non-periodic scheduling. For example, in the scenario of periodic scheduling with a non-fixed length, the bandwidth allocation method in the embodiments of the present disclosure is still applicable. It can be scheduled according to a non-fixed length period. At the start of each period, scheduling can be performed according to the calculation method of each scheduling period in the bandwidth allocation method in the embodiments of the present disclosure. Another example is that in the scenario where periodic scheduling is not adopted, the bandwidth allocation method in the embodiments of the present disclosure can use the arrival of each new PDUSET or the arrival of each batch of new PDUSETs as the starting point of the operation steps of bandwidth scheduling. At the start of each operation step, scheduling can be performed according to the calculation method of each scheduling period in the bandwidth allocation method in the embodiments of the present disclosure. The bandwidth allocation method in the embodiments of the present disclosure is still applicable.

[0121] Those skilled in the art of the present technology can understand that various aspects of the present disclosure can be implemented as a system, method, or program product. Therefore, various aspects of the present disclosure can be specifically implemented in the following forms, namely: a complete hardware implementation, a complete software implementation (including firmware, microcode, etc.), or an implementation combining hardware and software aspects, which can be collectively referred to as "circuitry", "module", or "system" here.

[0122] Based on the same inventive concept, an electronic device is also provided in the embodiments of the present disclosure. The electronic device includes: a processor; and a memory for storing executable instructions of the processor; wherein the processor is configured to execute the bandwidth allocation method of any one of the above via executing the executable instructions. Since the principle of solving problems in the embodiment of this electronic device is similar to that of the above method embodiment, the implementation of the embodiment of this electronic device can refer to the implementation of the above method embodiment, and the repeated parts will not be elaborated.

[0123] The following refers to Figure 4 to describe the electronic device 400 according to this embodiment of the present disclosure. Figure 4 The shown electronic device 400 is only an example and should not bring any limitation to the functions and usage scope of the embodiments of the present disclosure.

[0124] As Figure 4 shown, the electronic device 400 is presented in the form of a general computing device. The components of the electronic device 400 may include but are not limited to: at least one of the above processing units 401, at least one of the above storage units 402, and a bus 403 connecting different system components (including the storage unit 402 and the processing unit 401).

[0125] Among them, the storage unit stores program code, and the program code can be executed by the processing unit 401, so that the processing unit 401 executes the steps according to various exemplary embodiments of the present disclosure described in the "Exemplary Method" section above of this specification.

[0126] In some embodiments, when the electronic device is used to control, for example, the above bandwidth allocation method of the present disclosure, the processing unit 401 may execute the following steps of the above method embodiments:

[0127] Based on the delay budget requirements and priority requirements of different types of protocol data unit sets, as well as the overall network bandwidth resource utilization rate, perform global optimization allocation of bandwidth for the protocol data unit set; among them, the protocol data unit set with a higher priority is preferentially allocated bandwidth resources, and the delay for sending all data packets of the protocol data unit set is completed within the delay budget time range; set the revenue coefficient that can be obtained for each unit length of data sent by the protocol data unit set, and the revenue coefficient is related to the protocol data unit set priority and the protocol data unit set delay budget factor, and calculate the maximization of the overall revenue of the network bandwidth resources based on the revenue coefficient.

[0128] The storage unit 402 may include a readable medium in the form of a volatile storage unit, such as a random access storage unit (RAM) 4021 and / or a cache storage unit 4022, and may further include a read-only storage unit (ROM) 4023.

[0129] The storage unit 402 may further include a program / utilities 4024 having a set (at least one) of program modules 4025. Such program modules 4025 include, but are not limited to: an operating system, one or more application programs, other program modules, and program data. Each or some combination of these examples may include the implementation of a network environment.

[0130] The bus 403 may represent one or more of several types of bus structures, including a memory bus or memory controller, a peripheral bus, an accelerated graphics port, a processing unit, or a local bus using any of the various bus structures.

[0131] The electronic device 400 can also communicate with one or more external devices 404 (such as a keyboard, a pointing device, a Bluetooth device, etc.), and can also communicate with one or more devices that enable a user to interact with the electronic device 400, and / or communicate with any device that enables the electronic device 400 to communicate with one or more other computing devices (such as a router, a modem, etc.). Such communication can be carried out through the input / output (I / O) interface 405. Moreover, the electronic device 400 can also communicate with one or more networks (such as a local area network (LAN), a wide area network (WAN), and / or a public network, such as the Internet) through the network adapter 406. As shown in the figure, the network adapter 406 communicates with other modules of the electronic device 400 through the bus 403. It should be understood that, although not shown in the figure, other hardware and / or software modules can be used in combination with the electronic device 400, including but not limited to: microcode, device drivers, redundant processing units, external disk drive arrays, RAID systems, tape drives, and data backup storage systems, etc.

[0132] Through the description of the above embodiments, those skilled in the art can easily understand that the example embodiments described herein can be implemented by software, or can be implemented by the way of software combined with necessary hardware. Therefore, the technical solutions according to the embodiments of the present disclosure can be embodied in the form of a software product, and the software product can be stored in a non-volatile storage medium (which can be a CD-ROM, a USB flash drive, a mobile hard disk, etc.) or on a network, including several instructions to enable a computing device (which can be a personal computer, a server, a terminal device, or a network device, etc.) to execute the method according to the embodiments of the present disclosure.

[0133] Based on the same inventive concept, the embodiments of the present disclosure also provide a computer-readable storage medium, on which a computer program is stored, and when the computer program is executed by a processor, the bandwidth allocation method described in any one of the above is implemented. Since the principle of solving problems in the embodiment of the computer-readable storage medium is similar to that in the above method embodiment, the implementation of the embodiment of the computer-readable storage medium can refer to the implementation of the above method embodiment, and the repeated parts will not be described again.

[0134] More specific examples of the computer-readable storage medium in the present disclosure can include but are not limited to: an electrical connection having one or more wires, a portable computer disk, a hard disk, a random access memory (RAM), a read-only memory (ROM), an erasable programmable read-only memory (EPROM or flash memory), an optical fiber, a portable compact disk read-only memory (CD-ROM), an optical storage device, a magnetic storage device, or any suitable combination of the above.

[0135] In the present disclosure, a computer-readable storage medium may include a data signal propagated in a baseband or as part of a carrier wave, which carries readable program code. Such a propagated data signal may take various forms, including but not limited to electromagnetic signals, optical signals, or any suitable combination of the above. The readable signal medium may also be any readable medium other than the readable storage medium, which can send, propagate, or transmit a program for use by or in conjunction with an instruction execution system, apparatus, or device.

[0136] Optionally, the program code contained on the computer-readable storage medium may be transmitted using any appropriate medium, including but not limited to wireless, wired, optical fiber, RF, etc., or any suitable combination of the above.

[0137] In a specific implementation, the program code for performing the operations of the present disclosure may be written in any combination of one or more programming languages, including object-oriented programming languages such as Java, C++, etc., and also including conventional procedural programming languages such as the "C" language or similar programming languages. The program code may be executed entirely on the user's computing device, partially on the user's device, executed as a stand-alone software package, partially on the user's computing device and partially on a remote computing device, or entirely on a remote computing device or server. In the case of a remote computing device, the remote computing device may be connected to the user's computing device through any type of network, including a local area network (LAN) or a wide area network (WAN), or may be connected to an external computing device (e.g., by connecting through the Internet using an Internet service provider).

[0138] Based on the same inventive concept, an embodiment of the present disclosure also provides a computer program product, including: a computer program or instruction, which when executed by a processor implements the bandwidth allocation method of any one of the above method embodiments. Since the principle of solving problems in this computer program product embodiment is similar to that of the above method embodiments, the implementation of this computer program product embodiment may refer to the implementation of the above method embodiments, and the repeated parts will not be described again.

[0139] It should be noted that although several modules or units of a device for action execution are mentioned in the above detailed description, this division is not mandatory. In fact, according to the embodiments of the present disclosure, the features and functions of the two or more modules or units described above may be embodied in one module or unit. Conversely, the features and functions of one module or unit described above may be further divided and embodied by multiple modules or units.

[0140] In addition, although the various steps of the methods in this disclosure are described in a specific order in the drawings, this does not require or imply that the steps must be performed in that specific order, or that all of the steps shown must be performed to achieve the desired result. Additionally or alternatively, certain steps may be omitted, multiple steps may be combined into one step for execution, and / or one step may be decomposed into multiple steps for execution, etc.

[0141] From the description of the above embodiments, those skilled in the art can easily understand that the example embodiments described herein can be implemented by software or by a combination of software and necessary hardware. Therefore, the technical solutions according to the embodiments of this disclosure can be embodied in the form of a software product, which can be stored in a non-volatile storage medium (which can be a CD-ROM, a USB flash drive, a mobile hard disk, etc.) or on a network, including several instructions to enable a computing device (which can be a personal computer, a server, a mobile terminal, or a network device, etc.) to execute the methods according to the embodiments of this disclosure.

[0142] After considering the specification and practicing the invention disclosed herein, those skilled in the art will readily conceive of other embodiments of this disclosure. This disclosure is intended to cover any variations, uses, or adaptations of this disclosure that follow the general principles of this disclosure and include known common general knowledge or conventional technical means in the technical field not disclosed herein. The specification and the embodiments are only regarded as exemplary, and the true scope and spirit of this disclosure are pointed out by the appended claims.

Claims

1. A bandwidth allocation method, characterized in that: include: Based on the delay budget requirements and priority requirements of different types of protocol data unit sets and the overall network bandwidth resource utilization, globally optimize the bandwidth allocation for the protocol data unit sets; Among them, the protocol data unit set with higher priority is preferentially allocated bandwidth resources, and the delay for sending all data packets of the protocol data unit set is completed within the delay budget time range; a profit coefficient that can be obtained by sending each unit length of data of the protocol data unit set is set, and the profit coefficient is related to the priority of the protocol data unit set and the delay budget factor of the protocol data unit set. The maximization of the overall profit of network bandwidth resources is calculated based on the profit coefficient.

2. The bandwidth allocation method according to claim 1, characterized in that: When the bandwidth is scheduled according to the scheduling period and allocated according to the time slot, at the beginning of each scheduling period, the global optimization allocation is used to calculate the number of time slots available for all protocol data unit sets in the current scheduling period, and the optimal solution that satisfies the following conditions is calculated: Bandwidth resources are allocated preferentially to those with higher priorities, and the delay for sending all data packets of the protocol data unit set is completed within the delay budget time range; a profit coefficient that can be obtained for each unit length of data sent by the protocol data unit set is set, and the profit coefficient is related to the priority of the protocol data unit set and the delay budget factor of the protocol data unit set. The maximization of the overall profit of network bandwidth resources is calculated based on the profit coefficient.

3. The bandwidth allocation method according to claim 1, characterized in that: The method is applicable to a variety of network scenarios. The method is not only applicable to GPON networks, but also to other types of PON networks. The method is not only applicable to PON networks, but also to other types of networks such as WiFi networks, PON networks plus WiFi networks, and 5G networks.

4. The bandwidth allocation method according to claim 1, characterized in that: For other types of networks, the method is not limited to the scenario of allocating bandwidth in a fixed period. The method is applicable to fixed scheduling period scenarios, non-fixed scheduling period scenarios and scenarios where periodic scheduling is not adopted. For periodic scheduling scenarios that are not fixed in length, the method performs scheduling according to the non-fixed length period and at the start of each period, according to the calculation method for each scheduling period in the method; in scenarios where periodic scheduling is not adopted, the method uses each arrival of a new protocol data unit set or each batch of new protocol data unit sets as the starting point of the operation steps of bandwidth scheduling, and performs scheduling at the starting point of each operation step according to the calculation method for each scheduling period in the method.

5. The bandwidth allocation method according to claim 1, characterized in that: In each scheduling cycle, the protocol data unit sets are divided into preset batches according to the type of priority; and bandwidth allocation scheduling is performed on the protocol data unit sets of different batches in turn according to the global optimization allocation.

6. The bandwidth allocation method according to claim 1, characterized in that: In each scheduling cycle, bandwidth allocation scheduling is performed first for high-priority PDU sets according to the priority classification of high, medium and low. For PDU sets with the same high priority, bandwidth allocation is performed in order of priority from high to low according to the urgency coefficient. calculating the allocatable time slots remaining after the high priority protocol data unit set is allocated; Schedule medium-priority PDU sets, and allocate PDU sets with the same medium priority in descending order of priority according to the urgency coefficient; calculate the remaining allocatable time slots after the allocation of high-priority and medium-priority PDU sets; schedule low-priority PDU sets, and allocate PDU sets with the same low priority in descending order of priority according to the urgency coefficient.

7. The bandwidth allocation method according to claim 1, characterized in that: In each scheduling cycle, when the protocol data unit set is scheduled according to the global optimization allocation, when a protocol data unit set is unable to obtain the total length time slot of the data packet to be sent in a certain scheduling cycle, a proportional allocation strategy is adopted to allocate a part of the total length time slot of the data packet to be sent, which partially meets the transmission requirements, and the data that cannot be allocated time slots to complete the transmission is cached to the next cycle to participate in the allocation of the next cycle.

8. The bandwidth allocation method according to claim 1, characterized in that: From the perspective of overall network bandwidth resource allocation, the method can meet the delay and priority requirements of protocol data unit sets of different priority types, and maximize the overall network bandwidth resource utilization.

9. The bandwidth allocation method according to claim 1, characterized in that: In each scheduling cycle schedulingcycle τ At the start time, the PDUSET of each protocol data unit set is calculated by the following algorithm formula (1): j Whether the boundary conditions such as the delay budget are met, the protocol data unit set PDUSET that meets the conditions is j The data packets continue to be allocated bandwidth according to the following algorithm formula (2): Through the following algorithm formula (2) in each scheduling cycle schedulingcycle τ Calculate the PDUSET for each protocol data unit set j Bandwidth allocation ratio x j，τ : Among them, τ current Protocol Data Unit Set PDUSET j The current scheduling cycle; τ0 is the protocol data unit set PDUSET j The scheduling period from the first data packet sent; d j，τ Protocol Data Unit Set PDUSET j The consumption delay; Protocol Data Unit Set PDUSET j The total delay length consumed from the time the first data packet is sent to the current moment; Protocol Data Unit Set PDUSET j The delay budget of n τ Defined as scheduling cycle τ The number of protocol data unit sets in all time slots to be allocated; c j，τ Defined as scheduling cycle τ Protocol Data Unit Set PDUSET j The profit coefficient that can be obtained by sending a unit length of data; x j，τ Defined as scheduling cycle τ Protocol Data Unit Set PDUSET j Bandwidth allocation ratio coefficient; a j，τ Defined as scheduling cycle τ Protocol Data Unit Set PDUSET j The total length of the data packet to be sent; b τ Defined as scheduling cycle τ The protocol data unit set of all time slots to be allocated in PDUSET j The total number of available bandwidth time slots.

10. The bandwidth allocation method according to claim 1, characterized in that: The profit coefficient c in the global optimization allocation j，τ There are many definitions, one of which is: Setting a profit factor associated with the priority of the protocol data unit set; Setting a revenue weighted proportionality factor related to the current urgency of sending the protocol data unit set; The revenue weighted proportional coefficient is set to be measured by the ratio of the remaining delay budget to the total delay budget, the ratio of the remaining length of the data packet to be sent to the total length of the data packet, and the ratio of the remaining budget of the delayed data packet to the total budget; The profit coefficient that can be obtained by sending each unit length of data of the protocol data unit set is set to be related to the data unit set priority, the profit coefficient related to the priority of the protocol data unit set, the protocol data unit set priority, and the profit weighted proportional coefficient related to the current sending urgency of the protocol data unit set.

11. The bandwidth allocation method according to claim 10, characterized in that: The profit coefficient c in the global optimization allocation j,τ There are many definitions, one of which is: definition As with PDUSET j Priority An associated profit coefficient, which is defined according to business scenario requirements; definition As with this scheduling cycle schedulingcycle τ Within PDUSET j The urgency of sending The relevant return weighting ratio coefficient; definition In this scheduling cycle schedulingcycle τ Within PDUSET j The urgency of sending packets, It is measured in many ways, such as the ratio of the remaining delay budget to the total delay budget, the ratio of the remaining length of the data packets to be sent to the total length of the data packets, and the ratio of the remaining budget after comprehensive consideration of the delay data packets to the total budget. is calculated from the perspective of the ratio of the remaining delay budget to the total delay budget definition Calculated as the ratio of the remaining length of the data packets to be sent to the total length of the data packets definition For PDUSE j The total length of packets sent, Obtained through statistical accumulation calculation by system equipment; Definition Calculated as the ratio of the remaining budget to the total budget after comprehensive consideration of delayed packets 12. The bandwidth allocation method according to claim 10, characterized in that: The profit coefficient c j,τ It is obtained by the following formula: Or the profit coefficient c j,τ It is obtained by the following formula: Or the profit coefficient c j,τ It is obtained by the following formula:

13. The bandwidth allocation method according to claim 1, characterized in that: Define x j,τ As in this scheduling cycle schedulingcycle τ Within PDUSET j The bandwidth allocation ratio coefficient is relative to the current scheduling cycle schedulingcycle τ Within PDUSET j The total length of the data packet to be sent is a j,τ In terms of, then there are:

14. The bandwidth allocation method according to claim 1, characterized in that: Definition j,τ As in this scheduling cycle schedulingcycle τ Within PDUSET j The total length of the data packet to be sent, then: a j,τ =Scheduling cycle schedulingcycle τ Start time PDUSET j The total length of the newly arrived data packets + the last scheduling cycle schedulingcycle τ-1 PDUSET cached in j The total length of unsuccessfully sent packets.

15. The bandwidth allocation method according to claim 1, characterized in that: Definition b τ As in this scheduling cycle schedulingcycle τ The total number of available bandwidth time slots for all protocol data unit sets to be allocated time slots in the definition In this scheduling cycle schedulingcycle τ The number of time slots allocated in , then:

16. A bandwidth allocation system, characterized in that: include: In a PON network, the optical line terminal device identifies relevant information of a protocol data unit set and executes the bandwidth allocation method according to any one of claims 1 to 15 to allocate bandwidth; In a WiFi network, the wireless access point device identifies relevant information of a protocol data unit set and executes the bandwidth allocation method described in any one of claims 1 to 15 to allocate bandwidth; In a 5G network, bandwidth allocation is performed by executing the bandwidth allocation method described in any one of claims 1 to 15 through user plane functional equipment or access network equipment to identify relevant information of a protocol data unit set.

17. An electronic device, characterized in that: include: processor; as well as A memory, configured to store executable instructions of the processor; The processor is configured to execute the bandwidth allocation method according to any one of claims 1 to 15 by executing the executable instructions.

18. A computer-readable storage medium having a computer program stored thereon, characterized in that: When the computer program is executed by a processor, the bandwidth allocation method according to any one of claims 1 to 15 is implemented.

19. A computer program product comprising: A computer program or instruction, characterized in that when the computer program or instruction is executed by a processor, the bandwidth allocation method according to any one of claims 1 to 15 is implemented.

Images