Buffer resource allocation method and device based on dynamic adjustment, equipment and medium

Abstract

The invention discloses a buffer resource allocation method and device based on dynamic adjustment, equipment and a medium, and the method comprises the steps: starting a high-priority real-time monitoring task in an initialization stage, initializing a buffer resource allocation module, and configuring basic parameters for the buffer resource allocation module; the basic parameters comprise the quantity of memory resources of an available shared buffer, a queue priority, a monitoring period and a congestion threshold; according to historical flow data and service characteristics of different queues, setting a personalized initial buffer area distribution proportion and a dynamic adjustment step length for each queue; in the real-time monitoring stage, the eCPU is used for reading the multi-dimensional information of each queue one by one according to a set monitoring period and comparing the multi-dimensional information with a preset congestion threshold value; and when the high-priority queue is in a congestion state and the shared buffer area has available resources, carrying out resource allocation according to the priority of the queue and the current flow condition and according to a preset resource allocation priority and an allocation step length.

Description

Technical Field

[0001] The present invention relates to the field of network devices, and particularly to a buffer resource allocation method, device, equipment and medium based on dynamic adjustment. Background Art

[0002] PFC (Priority-based Flow Control) is a technology used to alleviate network congestion by controlling the traffic of specific priorities to avoid congestion. In a traditional network environment, when network ports become congested, a large number of packets may be lost, thus affecting the transmission quality of traffic flows. The PFC technology establishes a feedback mechanism between the receiving end and the sending end. When the receiving end detects congestion, it sends a pause signal to the sending end, requesting the sending end to pause sending the traffic of specific priorities, thereby alleviating congestion.

[0003] As Figure 1 shown, after the port 1 of Device B receives a packet from Device A, the MMU (Memory ManageUnit) allocates cell resources for the packet. When the PFC function of the device is enabled, it counts the occupied cell resources according to the dot1p priority in the packet. When the count of the occupied cell resources of a certain priority of packets on the port 1 of Device B reaches the set threshold, after receiving a new packet of the same priority, the port 1 sends a PFC PAUSE frame of the corresponding priority to Device A and DeviceC. After receiving the PFC PAUSE frame of the corresponding priority, Device A stops sending packets of the corresponding priority, caches the packets of the corresponding priority, and if the cache threshold is triggered, it also sends a PFC PAUSE frame to its upstream device.

[0004] In modern switching chips, the ASIC (Application Specific Integrated Circuit) realizes the intelligent control of network congestion through a dynamic buffer management mechanism. The ASIC allocates a certain percentage of buffer resources for different queues. When the traffic exceeds this percentage, it triggers corresponding traffic control mechanisms, such as Priority-based Flow Control (PFC), etc., to ensure that the traffic in the Lossless queue will not be congested, avoid data loss, and thus ensure the stability and efficiency of network transmission.

[0005] However, although the dynamic buffer management mechanism of ASIC provides a certain degree of flexibility at the hardware level, its adjustment strategy is mainly based on fixed rules and cannot perform refined resource allocation according to complex business requirements and queue priorities. Even if there is still a large amount of remaining buffer space in the system, it cannot be effectively utilized by other queues. For example, when the traffic of a high-priority queue suddenly increases and the allocated buffer resources are full, even if there is remaining space in other low-priority queues, they cannot be directly used, which may lead to data loss. Summary of the Invention

[0006] In view of the above problems, an object of the embodiments of the present invention is to provide a buffer resource allocation method, device, equipment and medium based on dynamic adjustment to improve the above problems.

[0007] The embodiments of the present invention provide a buffer resource allocation method based on dynamic adjustment, which includes the following steps:

[0008] S101, in the initialization stage, start a high-priority real-time monitoring task and initialize the buffer resource allocation module, and configure basic parameters for it; the basic parameters include the memory resource quantity of the available shared buffer, queue priority, monitoring period, and congestion threshold;

[0009] S102, according to the historical traffic data and business characteristics of different queues, set personalized initial buffer allocation ratios and dynamic adjustment steps for each queue;

[0010] S103, in the real-time monitoring stage, use the eCPU to read the multi-dimensional information of each queue one by one according to the set monitoring period and compare it with the preset congestion threshold;

[0011] S104, when the high-priority queue is in a congested state and there are available resources in the shared buffer, perform resource allocation according to the queue priority and the current traffic situation according to the preset resource allocation priority and allocation step.

[0012] Preferably, in step S102:

[0013] For queues with high priority and large traffic fluctuations, increase their initial buffer allocation ratios and set smaller dynamic adjustment steps to more finely adapt to traffic changes;

[0014] For queues with low priority and stable traffic, reduce their initial buffer allocation ratios and set larger adjustment steps to improve the efficiency of resource adjustment.

[0015] Preferably, in step S103, the multi-dimensional information includes the buffer occupancy rate information of each queue, the traffic rate of the queue, the packet size distribution, and the traffic burst duration.

[0016] Preferably, when the buffer occupancy rate of a queue exceeds the threshold, but its traffic rate and packet size distribution are both within the normal range, and the traffic burst duration is short, it indicates a short-term traffic peak and no immediate resource allocation is required; conversely, if the buffer occupancy rate exceeds the threshold while the traffic rate also increases significantly, the packet size distribution shows abnormal changes, and the traffic burst duration is long, it indicates that the queue is facing continuous congestion pressure and resources need to be allocated in a timely manner.

[0017] Preferably, it further includes:

[0018] In the resource recovery stage, considering the traffic trend and resource usage history of the queue comprehensively, for those queues that have been allocated extra resources and whose current traffic has decreased significantly, the extra resources they occupy are preferentially recovered; while for those queues with fluctuating traffic and possible risks of re-congestion, a strategy of delayed recovery or gradual recovery is adopted.

[0019] Preferably, the delayed recovery means that for queues with potential fluctuation risks, observe for a period of time and then recover when the traffic is truly stable;

[0020] Gradual recovery means recovering the extra buffer resources in multiple times, with a part recovered each time.

[0021] Preferably, it further includes:

[0022] Analyze the historical resource usage data of the queue, predict the possible future resource requirements of the queue, so as to more reasonably determine the amount of resource recovery and improve the utilization rate of buffer resources.

[0023] An embodiment of the present invention provides a buffer resource allocation device based on dynamic adjustment, which includes:

[0024] An initialization unit, used in the initialization stage to start a high-priority real-time monitoring task and initialize the buffer resource allocation module, and configure basic parameters for it; the basic parameters include the memory resource quantity of the available shared buffer, queue priority, monitoring period, and congestion threshold;

[0025] A queue setting unit, used to set personalized initial buffer allocation ratios and dynamic adjustment steps for each queue according to the historical traffic data and service characteristics of different queues;

[0026] A real-time monitoring unit, used in the real-time monitoring stage to use the eCPU to read the multi-dimensional information of each queue one by one according to the set monitoring period and compare it with the preset congestion threshold;

[0027] A resource allocation unit, which is used to perform resource allocation according to the preset resource allocation priority and allocation step length based on the priority of the queue and the current traffic situation when the high-priority queue is congested and there are available resources in the shared buffer.

[0028] An embodiment of the present invention provides a buffer resource allocation device based on dynamic adjustment, which includes a memory and a processor. A computer program is stored in the memory and can be executed by the processor to implement the buffer resource allocation method based on dynamic adjustment as described above.

[0029] An embodiment of the present invention also provides a computer-readable storage medium, which stores a computer program that can be executed by the processor of the device where the computer-readable storage medium is located to implement the buffer resource allocation method based on dynamic adjustment as described above.

[0030] In summary, this embodiment realizes the allocation of buffer resources in the shared buffer according to the real-time traffic situation through software, and has the following advantages:

[0031] First of all, it can adjust the memory resource allocation of the shared buffer in real time according to the actual congestion status of the queue, avoiding the problem of resource waste in the traditional allocation method and significantly improving the utilization rate of Buffer resources;

[0032] Secondly, this embodiment supports differential management according to the priority of the queue and the service type. The high-priority queue can obtain more shared Buffer resources preferentially, so as to ensure that the transmission quality of key services is not affected by congestion;

[0033] Then, by utilizing the high-efficiency computing power of the eCPU, this embodiment can monitor the congestion status of the queue in real time with microsecond-level precision and quickly make resource allocation decisions, avoiding the limitations of ASIC based on fixed rules;

[0034] In addition, by implementing dynamic resource allocation through software, the dependence on hardware ASIC is reduced, the hardware cost and complexity are lowered, and the system is easier to upgrade and optimize. BRIEF DESCRIPTION OF THE DRAWINGS

[0035] In order to more clearly illustrate the technical solutions of the present invention, the drawings required for implementation will be briefly introduced below. Obviously, the drawings in the following description are only some embodiments of the present invention. For those of ordinary skill in the art, other drawings can be obtained based on these drawings without creative efforts.

[0036] Figure 1 It is a flowchart of the existing pfc service.

[0037] Figure 2 It is a schematic flowchart of a buffer resource allocation method based on dynamic adjustment provided by the first embodiment of the present invention.

[0038] Figure 3 It is another schematic flowchart of a buffer resource allocation method based on dynamic adjustment provided by the first embodiment of the present invention.

[0039] Figure 4 It is a schematic structural diagram of a buffer resource allocation device based on dynamic adjustment provided by the second embodiment of the present invention. Detailed implementation manners

[0040] Next, the technical solutions in the embodiments of the present invention will be clearly and completely described in conjunction with the accompanying drawings in the embodiments of the present invention. Obviously, the described embodiments are only a part of the embodiments of the present invention, rather than all the embodiments. Based on the embodiments of the present invention, all other embodiments obtained by those of ordinary skill in the art without creative efforts shall fall within the protection scope of the present invention.

[0041] Please refer to Figure 2 , the first embodiment of the present invention provides a buffer resource allocation method based on dynamic adjustment, which can be executed by a buffer resource allocation device based on dynamic adjustment (hereinafter referred to as the allocation device), and particularly, by one or more processors in the allocation device to implement the following steps:

[0042] S101. In the initialization stage, start a high-priority real-time monitoring task and initialize the buffer resource allocation module, and configure basic parameters for it; the basic parameters include the memory resource quantity of the available shared buffer, queue priority, monitoring period, and congestion threshold.

[0043] S102. Set personalized initial buffer allocation ratios and dynamic adjustment steps for each queue according to the historical traffic data and service characteristics of different queues.

[0044] In this embodiment, in the system initialization stage, the allocation device will start a high-priority real-time monitoring task and initialize the buffer resource allocation module. During this process, configure the basic parameters of the buffer resource allocation module, including the memory resource quantity of the available shared buffer, queue priority, monitoring period (such as 10 microseconds), congestion threshold (such as the buffer occupancy rate exceeding 60%), etc.

[0045] Then, according to the historical traffic data and service characteristics of different queues, personalized initial buffer allocation ratios and dynamic adjustment steps are set for each queue. For example, for a queue with high priority and large traffic fluctuations, appropriately increase its initial buffer allocation ratio and set a smaller dynamic adjustment step to more finely adapt to traffic changes; while for a queue with low priority and stable traffic, the initial buffer allocation ratio can be appropriately reduced and a larger adjustment step can be set to improve the efficiency of resource adjustment.

[0046] S103. In the real-time monitoring stage, use the eCPU to read the multi-dimensional information of each queue one by one according to the set monitoring period and compare it with the preset congestion threshold.

[0047] In this embodiment, after the allocation device enters the real-time monitoring stage, use the eCPU to read the multi-dimensional information such as the buffer occupancy rate information of each queue, the traffic rate of the queue, the packet size distribution, and the traffic burst duration one by one according to the set monitoring period and compare it with the preset threshold. For example, if the buffer occupancy rate of a queue exceeds the threshold, but its traffic rate and packet size distribution are both within the normal range, and the traffic burst duration is short, then it may be just a short-term traffic peak and resource allocation may not be required immediately; on the contrary, if the buffer occupancy rate exceeds the threshold and at the same time the traffic rate also increases significantly, the packet size distribution shows abnormal changes, and the traffic burst duration is long, it indicates that the queue may face continuous congestion pressure and resources need to be allocated in a timely manner.

[0048] S104. When the high-priority queue is in a congested state and there are available resources in the shared buffer, perform resource allocation according to the priority of the queue and the current traffic situation, in accordance with the preset resource allocation priority and allocation step.

[0049] In this embodiment, when a high-priority queue (such as a real-time video conference, financial transaction, etc.) is in a congested state and there are available resources in the shared buffer, perform resource allocation according to the priority of the queue and the current traffic situation, in accordance with the preset resource allocation priority and allocation step, to avoid allocating too many resources at one time and causing insufficient resources for other queues. At the same time, record in detail the additional resource amount allocated to each queue and information such as the allocation time for subsequent resource recovery and performance analysis.

[0050] In this embodiment, preferably, it further includes:

[0051] In the resource recovery stage, comprehensively consider the traffic trend of the queue and the resource usage history. For those queues that have been allocated additional resources and whose current traffic has significantly decreased, preferentially recover the occupied additional resources; while for queues with still fluctuating traffic and possible risks of congestion again, adopt a strategy of delayed recovery or gradual recovery.

[0052] Specifically, during the resource recovery phase, in addition to monitoring the buffer occupancy rate of the high-priority queue, the traffic trend and resource usage history of the queue are also comprehensively considered. For queues that have been allocated additional resources and whose current traffic has significantly decreased, the additional resources they occupy are preferentially recovered; while for queues with fluctuating traffic and a possible risk of congestion again, a delayed recovery or gradual recovery strategy can be adopted. Delayed recovery means observing a queue with a risk of fluctuation for a period of time and then recovering the resources when the traffic is truly stable. For example, resource recovery is carried out 20 milliseconds later, and the traffic situation of the queue is continuously monitored during this time. If the traffic steadily decreases, the recovery is performed; if the traffic shows an upward trend again, the recovery operation is cancelled or postponed; Gradual recovery means recovering the extra buffer resources in multiple times, with a part recovered each time. For example, if a certain queue has been allocated an additional 100MB of buffer, it can be set to recover 20MB each time, once every 10 milliseconds, and completed in 5 times. Through gradual recovery and delayed recovery, the queue can gradually adapt to the reduction of the buffer and reduce the impact on the service.

[0053] To more accurately determine the amount of resource recovery, the system analyzes the historical resource usage data of the queue, such as the average usage amount, peak usage amount, etc. in different time periods such as the past 1 minute, 5 minutes, 10 minutes, etc. At the same time, combined with the traffic model of the queue, such as constant bit rate, variable bit rate, etc., the possible future resource requirements of the queue are predicted. For example, if the traffic of the queue usually increases at every whole hour, this factor is considered during prediction, and a certain amount of buffer resources is reserved for the queue in advance. According to the prediction result and the current usage situation of the buffer, a reasonable recovery amount is calculated. For example, if it is predicted that the buffer requirement of the queue will decrease by 30MB within the next 10 seconds, 30MB of buffer resources can be recovered first, and then adjusted according to the actual situation later. Through this prediction method based on historical data and traffic models, the system can more reasonably determine the amount of resource recovery, improve the utilization rate of buffer resources, and ensure the stable operation of the service.

[0054] In summary, this embodiment realizes the allocation of buffer resources of the shared buffer according to the real-time traffic situation through software, and it has the following advantages:

[0055] First, it can adjust the memory resource allocation of the shared buffer in real time according to the actual congestion status of the queue, avoiding the problem of resource waste in the traditional allocation method, and significantly improving the utilization rate of Buffer resources;

[0056] Second, this embodiment supports differential management according to the priority and service type of the queue. High-priority queues can preferentially obtain more shared Buffer resources, thus ensuring that the transmission quality of key services is not affected by congestion;

[0057] Then, leveraging the high computing power of the eCPU, this embodiment can monitor the congestion status of the queue in real time with microsecond-level precision and make quick resource allocation decisions, avoiding the limitations of ASICs based on fixed rules;

[0058] In addition, by implementing dynamic resource allocation through software, the dependence on hardware ASICs is reduced, the hardware costs and complexity are lowered, and the system is made more easily upgradable and optimizable.

[0059] Please refer to Figure 3 , a buffer resource allocation device based on dynamic adjustment according to the second embodiment of the present invention, which includes:

[0060] An initialization unit 210, configured to start a high-priority real-time monitoring task during the initialization phase and initialize the buffer resource allocation module, and configure basic parameters for it; the basic parameters include the memory resource quantity of the available shared buffer, queue priorities, monitoring period, and congestion thresholds;

[0061] A queue setting unit 220, configured to set personalized initial buffer allocation ratios and dynamic adjustment step sizes for each queue according to the historical traffic data and service characteristics of different queues;

[0062] A real-time monitoring unit 230, configured to, during the real-time monitoring phase, use the eCPU to read the multi-dimensional information of each queue one by one according to the set monitoring period and compare it with the preset congestion thresholds;

[0063] A resource allocation unit 240, configured to, when a high-priority queue is in a congested state and there are available resources in the shared buffer, perform resource allocation according to the queue priorities and current traffic conditions according to the preset resource allocation priorities and allocation step sizes.

[0064] A buffer resource allocation device based on dynamic adjustment according to the third embodiment of the present invention, which includes a memory and a processor, and a computer program is stored in the memory, and the computer program can be executed by the processor to implement the buffer resource allocation method based on dynamic adjustment as described above.

[0065] The fourth embodiment of the present invention further provides a computer-readable storage medium, which stores a computer program, and the computer program can be executed by the processor of the device where the computer-readable storage medium is located to implement the buffer resource allocation method based on dynamic adjustment as described above.

[0066] In several embodiments provided by the embodiments of the present invention, it should be understood that the disclosed devices and methods can also be implemented in other ways. The device and method embodiments described above are merely illustrative. For example, the flowcharts and block diagrams in the accompanying drawings show the possible architectures, functions, and operations of devices, methods, and computer program products according to multiple embodiments of the present invention. In this regard, each block in the flowchart or block diagram may represent a module, a program segment, or a part of code, and the module, program segment, or part of code contains one or more executable instructions for implementing the specified logical function. It should also be noted that in some alternative implementations, the functions marked in the blocks may occur in a different order than marked in the accompanying drawings. For example, two consecutive blocks can actually be executed substantially in parallel, and they can sometimes be executed in the reverse order, depending on the functions involved. It should also be noted that each block in the block diagram and / or flowchart, as well as the combination of blocks in the block diagram and / or flowchart, can be implemented by a dedicated hardware-based system for performing the specified functions or actions, or can be implemented by a combination of dedicated hardware and computer instructions.

[0067] In addition, each functional module in various embodiments of the present invention may be integrated together to form an independent part, or each module may exist separately, or two or more modules may be integrated to form an independent part.

[0068] If the described functions are implemented in the form of software functional modules and sold or used as independent products, they can be stored in a computer-readable storage medium. Based on this understanding, the technical solution of the present invention, in essence, or the part that contributes to the prior art, or a part of this 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 may be a personal computer, an electronic device, or a network device, etc.) to execute all or part of the steps of the methods described in various embodiments of the present invention. The aforementioned storage medium includes: various media such as USB flash drives, mobile hard disks, read-only memories (ROM, Read-Only Memory), random access memories (RAM, Random Access Memory), magnetic disks, or optical discs that can store program codes. It should be noted that in this article, the term "including", "comprising", or any other variant thereof is intended to cover non-exclusive inclusion, so that a process, method, article, or device including a series of elements not only includes those elements but also includes other elements not explicitly listed, or further includes elements inherent to such process, method, article, or device. Without further limitation, an element defined by the statement "including one..." does not exclude the existence of additional identical elements in the process, method, article, or device including the said element.

[0069] The terms used in the embodiments of the present invention are for the purpose of describing specific embodiments only and are not intended to limit the present invention. The singular forms "a", "the" and "said" used in the embodiments of the present invention and the appended claims are also intended to include the plural forms unless the context clearly dictates otherwise.

[0070] It should be understood that the term "and / or" used herein is merely a description of the association relationship of associated objects, indicating that there can be three relationships. For example, A and / or B can mean: A exists alone, A and B exist simultaneously, and B exists alone. In addition, the character " / " herein generally indicates that the associated objects before and after are in an "or" relationship.

[0071] Depending on the context, the word "if" as used herein can be interpreted as "when" or "while" or "in response to determining" or "in response to detecting". Similarly, depending on the context, the phrase "if determined" or "if detected (stated condition or event)" can be interpreted as "when determined" or "in response to determining" or "when detected (stated condition or event)" or "in response to detecting (stated condition or event)".

[0072] The "first / second" mentioned in the embodiments is only to distinguish similar objects and does not represent a specific order for the objects. It can be understood that the "first / second" can be interchanged in a specific order or sequence when permitted. It should be understood that the objects distinguished by the "first / second" can be interchanged appropriately so that the embodiments described herein can be implemented in an order other than those illustrated or described herein.

[0073] The above are only the preferred embodiments of the present invention and are not used to limit the present invention. For those skilled in the art, the present invention can have various changes and modifications. Any modification, equivalent replacement, improvement, etc. made within the spirit and principle of the present invention shall be included within the protection scope of the present invention.

Claims

1. A buffer resource allocation method based on dynamic adjustment, characterized in that It includes the following steps: S101, in the initialization stage, start a high-priority real-time monitoring task and initialize the buffer resource allocation module, and configure basic parameters for it; the basic parameters include the memory resource quantity of the available shared buffer, queue priority, monitoring period, congestion threshold; S102, according to the historical traffic data and service characteristics of different queues, set personalized initial buffer allocation ratios and dynamic adjustment steps for each queue; S103, in the real-time monitoring stage, use the eCPU to read the multi-dimensional information of each queue one by one according to the set monitoring period and compare it with the preset congestion threshold; S104, when the high-priority queue is in a congested state and there are available resources in the shared buffer, perform resource allocation according to the queue priority and current traffic conditions, in accordance with the preset resource allocation priority and allocation step; 2. The buffer resource allocation method based on dynamic adjustment according to claim 1, wherein In step S102: For queues with high priority and large traffic fluctuations, increase their initial buffer allocation ratios and set smaller dynamic adjustment steps to more finely adapt to traffic changes; For queues with low priority and stable traffic, reduce their initial buffer allocation ratios and set larger adjustment steps to improve the efficiency of resource adjustment; 3. The buffer resource allocation method based on dynamic adjustment according to claim 1, wherein In step S103, the multi-dimensional information includes the buffer occupancy rate information of each queue, the traffic rate of the queue, the packet size distribution, and the traffic burst duration; 4. The buffer resource allocation method based on dynamic adjustment according to claim 3, wherein When the buffer occupancy rate of a queue exceeds the threshold, but its traffic rate and packet size distribution are both within the normal range, and the traffic burst duration is short, it indicates a short-term traffic peak and no immediate resource allocation is required; on the contrary, if the buffer occupancy rate exceeds the threshold while the traffic rate also increases significantly, the packet size distribution shows abnormal changes, and the traffic burst duration is long, it indicates that the queue is facing continuous congestion pressure and resource allocation is required in a timely manner; 5. The buffer resource allocation method based on dynamic adjustment according to claim 1, characterized in that, It also includes: In the resource recovery stage, comprehensively considering the traffic trend and resource usage history of the queue, for those queues that have been allocated additional resources and whose current traffic has significantly decreased, preferentially recover the occupied additional resources; while for queues with still fluctuating traffic and possible risk of re-congestion, adopt a strategy of delayed recovery or gradual recovery; 6. The buffer resource allocation method based on dynamic adjustment according to claim 5, wherein The delayed recovery means that for queues with a risk of fluctuation, observe for a period of time and then recover when the traffic is truly stable; Gradual recovery means recovering the extra buffer resources in multiple times, recovering a part each time; 7. The buffer resource allocation method based on dynamic adjustment according to claim 6, wherein It also includes: Analyze the historical resource usage data of the queue, predict the possible future resource requirements of the queue, so as to more reasonably determine the resource recovery amount and improve the utilization rate of buffer resources; 8. A buffer resource allocation device based on dynamic adjustment, characterized in that It includes: An initialization unit, used to start a high-priority real-time monitoring task in the initialization stage, and initialize the buffer resource allocation module, and configure basic parameters for it; the basic parameters include the memory resource quantity of the available shared buffer, queue priority, monitoring period, congestion threshold; A queue setting unit, used to set personalized initial buffer allocation ratios and dynamic adjustment steps for each queue according to the historical traffic data and service characteristics of different queues; A real-time monitoring unit, which is used in the real-time monitoring stage to use the eCPU to read the multi-dimensional information of each queue one by one according to the set monitoring period and compare it with the preset congestion threshold; A resource allocation unit, which is used to perform resource allocation according to the preset resource allocation priority and allocation step length according to the priority of the queue and the current traffic situation when the high-priority queue is in a congested state and there are available resources in the shared buffer.

9. A buffer resource allocation device based on dynamic adjustment, characterized in that, It includes a memory and a processor. The memory stores a computer program, and the computer program can be executed by the processor to implement the buffer resource allocation method based on dynamic adjustment according to any one of claims 1 to 7.

10. A computer-readable storage medium, characterized in that, A computer program is stored, and the computer program can be executed by the processor of the device where the computer-readable storage medium is located to implement the buffer resource allocation method based on dynamic adjustment according to any one of claims 1 to 7.

Images