CN111708482B - Method, system, device and medium for limiting bandwidth in distributed storage - Google Patents

Abstract

The invention discloses a method, system, device and storage medium for limiting bandwidth in distributed storage. The method includes: fragmenting a data block to obtain multiple data fragments, and setting a preset bandwidth limit value as a bandwidth token The maximum capacity value of the bucket; judge whether the data length value of each data piece is greater than the current maximum capacity value in turn every predetermined time; in response to the data length value of the data piece is not greater than the current maximum capacity value, judge whether the data stream is received In response to receiving the token application of the data stream, it is determined whether the number of tokens in the token application is greater than the maximum capacity value; The number of tokens required for token application is subtracted from the bucket, and the data is delivered through the virtual disk.

Description

A method, system, device and medium for limiting bandwidth in distributed storage

technical field

The present invention relates to the field of data processing, and more particularly, to a method, system, computer device and readable medium for limiting bandwidth in distributed storage.

Background technique

The storage system can set a bandwidth limit value for the virtual disk provided to the client, so as to improve the service quality of the storage. When performing bandwidth limitation, the token bucket algorithm is generally used. When the IO (input and output) data stream is transmitted, after successfully applying for a token from the token bucket, the data can be delivered to the storage bottom layer. In the traditional process of limiting bandwidth based on the token bucket algorithm, if the data length of a certain IO exceeds the maximum capacity of the token bucket, the IO will be blocked indefinitely because it cannot obtain enough tokens.

SUMMARY OF THE INVENTION

In view of this, the purpose of the embodiments of the present invention is to propose a method, system, computer device and computer-readable storage medium for limiting bandwidth in distributed storage, by slicing data blocks and reducing the maximum It can dynamically adjust the maximum limit capacity of the bandwidth token bucket according to the data slice size and bandwidth limit value, so as to reduce the occurrence of IO blocking problems on the basis of ensuring stable data transmission.

Based on the above purpose, one aspect of the embodiments of the present invention provides a method for limiting bandwidth in distributed storage, including the following steps: fragmenting a data block to obtain multiple data fragments, and setting a preset bandwidth limit value to The maximum capacity value of the bandwidth token bucket; judge whether the data length value of each data slice is greater than the current maximum capacity value in turn every predetermined time; in response to the data length value of the data slice being not greater than the current maximum capacity value, judge whether to receive a token request to a data stream; in response to receiving a token request for a data stream, determining whether the token number of the token request is greater than the maximum capacity value; and responsive to the token number of the token request not being If it is greater than the maximum capacity value, the number of tokens required for the token application is subtracted from the bandwidth token bucket, and the data is delivered through the virtual disk.

In some embodiments, the method further includes: in response to the data length value of the data slice being greater than the current maximum capacity value, updating the maximum capacity value of the bandwidth token bucket to the data length value of the data slice and judging whether a data stream is received Token application.

In some implementations, the method further includes: in response to the number of tokens applied for by the token being greater than the maximum capacity value, suspending data output to wait for the maximum capacity value to be updated.

In some embodiments, the method further includes: judging whether the number of tokens in the bandwidth token bucket is the current maximum capacity value; and responding to the fact that the number of tokens in the bandwidth token bucket is not the current maximum capacity value , adding tokens to the bandwidth token bucket at a preset speed until the number of tokens in the bandwidth token bucket is equal to the current maximum capacity value.

Another aspect of the embodiments of the present invention further provides a system for limiting bandwidth in distributed storage, including: a fragmentation module, configured to fragment a data block to obtain multiple data fragments, and set a preset bandwidth The limit value is set as the maximum capacity value of the bandwidth token bucket; the first judgment module is configured to sequentially judge whether the data length value of each data slice is greater than the current maximum capacity value every predetermined time; the second judgment module is configured with In response to the data length value of the data slice being not greater than the current maximum capacity value, it is judged whether the token application of the data flow is received; the third judgment module is configured to judge the token application of the data flow in response to the received data flow. whether the number of tokens applied for by the token is greater than the maximum capacity value; and an execution module configured to reduce the number of tokens in the bandwidth token bucket in response to the number of tokens applied for by the token being not greater than the maximum capacity value Go to the token to apply for the required number of tokens, and issue the data through the virtual disk.

In some embodiments, it further includes: an update module, configured to update the maximum capacity value of the bandwidth token bucket to the data length value of the data slice in response to the data length value of the data slice being greater than the current maximum capacity value, and Determine whether the token request for the data stream is received.

In some embodiments, it further includes: a suspending module configured to suspend data output to wait for the maximum capacity value to be updated in response to the token quantity of the token application being greater than the maximum capacity value.

In some implementations, it further includes an adding module configured to: determine whether the number of tokens in the bandwidth token bucket is the current maximum capacity value; and in response to the number of tokens in the bandwidth token bucket being different is the current maximum capacity value, adding tokens to the bandwidth token bucket at a preset speed until the number of tokens in the bandwidth token bucket is equal to the current maximum capacity value.

In yet another aspect of the embodiments of the present invention, there is also provided a computer device, comprising: at least one processor; and a memory, where the memory stores computer instructions that can be executed on the processor, and the instructions are executed by the processor. The processor implements the steps of the above method when executed.

In yet another aspect of the embodiments of the present invention, a computer-readable storage medium is also provided, where the computer-readable storage medium stores a computer program that implements the above method steps when executed by a processor.

The invention has the following beneficial technical effects: by slicing the data block, reducing the drastic change of the maximum capacity by slicing the data block, and dynamically adjusting the maximum limit capacity of the bandwidth token bucket according to the size of the data piece and the bandwidth limit value, so that the maximum limit capacity of the bandwidth token bucket can be adjusted dynamically. On the basis of ensuring stable data transmission, the occurrence of IO blocking problems is reduced.

Description of drawings

In order to explain the embodiments of the present invention or the technical solutions in the prior art more clearly, the following briefly introduces the accompanying drawings that need to be used in the description of the embodiments or the prior art. Obviously, the accompanying drawings in the following description are only These are some embodiments of the present invention. For those of ordinary skill in the art, other embodiments can also be obtained according to these drawings without creative efforts.

1 is a schematic diagram of an embodiment of a method for limiting bandwidth in distributed storage provided by the present invention;

FIG. 2 is a schematic diagram of a hardware structure of an embodiment of a computer device for limiting bandwidth in distributed storage provided by the present invention.

Detailed ways

In order to make the objectives, technical solutions and advantages of the present invention more clearly understood, the embodiments of the present invention will be further described in detail below with reference to the specific embodiments and the accompanying drawings.

It should be noted that all expressions using "first" and "second" in the embodiments of the present invention are for the purpose of distinguishing two entities with the same name but not the same or non-identical parameters. It can be seen that "first" and "second" It is only for the convenience of expression and should not be construed as a limitation to the embodiments of the present invention, and subsequent embodiments will not describe them one by one.

Based on the above objective, in a first aspect of the embodiments of the present invention, an embodiment of a method for limiting bandwidth in distributed storage is provided. FIG. 1 shows a schematic diagram of an embodiment of a method for limiting bandwidth in distributed storage provided by the present invention. As shown in Figure 1, the embodiment of the present invention includes the following steps:

S1, fragment the data block to obtain multiple data fragments, and set the preset bandwidth limit value as the maximum capacity value of the bandwidth token bucket;

S2. Judging in turn whether the data length value of each data slice is greater than the current maximum capacity value every predetermined time;

S3, in response to the data length value of the data slice being not greater than the current maximum capacity value, determine whether the token application for the data stream is received;

S4. In response to receiving the token application of the data stream, determine whether the number of tokens in the token application is greater than the maximum capacity value; and

S5. In response to the number of tokens applied for the token is not greater than the maximum capacity value, the number of tokens required for the token application is subtracted from the bandwidth token bucket, and the data is delivered through the virtual disk.

The data block is fragmented to obtain multiple data fragments, and the preset bandwidth limit value is set as the maximum capacity value of the bandwidth token bucket. Fragmentation of data blocks can be performed according to data protection policies. Data protection strategies include replica redundancy strategy and erasure code fault tolerance strategy. The replica redundancy strategy is to copy the original data into multiple copies, each of which is called a copy, and store these copies on different nodes in the cluster; The erasure code error tolerance strategy is to use the erasure code algorithm to encode the original data to obtain redundancy, and store the data and redundancy together. Divide the data block into data pieces of different sizes, perform redundant operations on the data pieces, and store them in different nodes. You can set the bandwidth limit value according to your needs. For example, you can set the bandwidth limit value according to the size of the data slice. If the data slices are all small, you can set the bandwidth limit value to a smaller value. If the data slices are all large, you can set the bandwidth limit value. set larger.

Whether the data length value of each data piece is larger than the current maximum capacity value is sequentially judged every predetermined time. The bandwidth limit value is the maximum capacity value of the original bandwidth token bucket. Whether to update the maximum capacity value of the bandwidth token bucket can be determined by comparing the data length value of the data slice with the size of the bandwidth limit value.

In response to the data length value of the data slice being not greater than the current maximum capacity value, it is determined whether a token application for the data stream is received. If the data length value of the data slice is not greater than the current maximum capacity value, it indicates that the current maximum capacity value can be retained, and at the same time, it is judged in real time whether there is a token application from the data stream.

In some embodiments, the method further includes: in response to the data length value of the data slice being greater than the current maximum capacity value, updating the maximum capacity value of the bandwidth token bucket to the data length value of the data slice and judging whether a data stream is received Token application. If the data length value of the data slice is greater than the current maximum capacity value, it is necessary to update the maximum capacity value to the data length value of the current data slice, and at the same time judge whether there is a token application from the data stream in real time.

In response to receiving the token application of the data stream, it is determined whether the number of tokens in the token application is greater than the maximum capacity value. If a token request from a data stream is received, the number of tokens requested by the token is compared with the maximum capacity value to determine whether data can be issued.

In response to the number of tokens applied for the token is not greater than the maximum capacity value, the number of tokens required for the token application is subtracted from the bandwidth token bucket, and the data is delivered through the virtual disk. If the number of tokens in the token application is less than or equal to the maximum capacity value, it indicates that the data can be distributed. The number of tokens required for the token application can be subtracted from the bandwidth token bucket, and the data can be distributed through the virtual disk. .

In some implementations, the method further includes: in response to the number of tokens applied for by the token being greater than the maximum capacity value, suspending data output to wait for the maximum capacity value to be updated. If the number of tokens applied for by the token is greater than the maximum capacity value, it indicates that the data cannot be distributed, and it is necessary to wait for the update of the maximum capacity value. When the maximum capacity value is greater than or equal to the number of tokens applied for by the token, data can be sent. Issued.

In some embodiments, the method further includes: judging whether the number of tokens in the bandwidth token bucket is the current maximum capacity value; and responding to the fact that the number of tokens in the bandwidth token bucket is not the current maximum capacity value , adding tokens to the bandwidth token bucket at a preset speed until the number of tokens in the bandwidth token bucket is equal to the current maximum capacity value. Determine in real time whether the number of tokens in the bandwidth token bucket is saturated. If not, add tokens to the bandwidth token bucket at a predetermined rate until it is saturated.

It should be particularly pointed out that each step in each embodiment of the method for limiting bandwidth in distributed storage can be crossed, replaced, added, and deleted. Therefore, these reasonable permutations and combinations are limited in distributed storage. The bandwidth method should also belong to the protection scope of the present invention, and the protection scope of the present invention should not be limited to the embodiments.

Based on the above purpose, in a second aspect of the embodiments of the present invention, a system for limiting bandwidth in distributed storage is proposed, including: a fragmentation module configured to fragment a data block to obtain a plurality of data fragments, and The preset bandwidth limit value is set as the maximum capacity value of the bandwidth token bucket; the first judgment module is configured to sequentially judge whether the data length value of each data slice is greater than the current maximum capacity value every predetermined time; the second judgment The module is configured to judge whether the token application of the data stream is received in response to the data length value of the data slice being not greater than the current maximum capacity value; the third judging module is configured to respond to the token application of the data stream received , judging whether the number of tokens applied for by the token is greater than the maximum capacity value; and an execution module, configured to respond that the number of tokens applied for by the token is not greater than the maximum capacity value, in the bandwidth command The number of tokens required for the token application is subtracted from the bucket, and the data is delivered through the virtual disk.

In some embodiments, it further includes: an update module, configured to update the maximum capacity value of the bandwidth token bucket to the data length value of the data slice in response to the data length value of the data slice being greater than the current maximum capacity value, and Determine whether the token request for the data stream is received.

In some embodiments, it further includes: a suspending module configured to suspend data output to wait for the maximum capacity value to be updated in response to the token quantity of the token application being greater than the maximum capacity value.

In some implementations, it further includes an adding module configured to: determine whether the number of tokens in the bandwidth token bucket is the current maximum capacity value; and in response to the number of tokens in the bandwidth token bucket being different is the current maximum capacity value, adding tokens to the bandwidth token bucket at a preset speed until the number of tokens in the bandwidth token bucket is equal to the current maximum capacity value.

Based on the above objective, in a third aspect of the embodiments of the present invention, a computer device is provided, including: at least one processor; and a memory, where the memory stores computer instructions that can be executed on the processor, and the instructions are executed by the processor to The following steps are implemented: S1, slicing the data block to obtain a plurality of data slices, and setting the preset bandwidth limit value as the maximum capacity value of the bandwidth token bucket; S2, sequentially judging the size of each data slice every predetermined time Whether the data length value is greater than the current maximum capacity value; S3, in response to the data length value of the data slice being not greater than the current maximum capacity value, determine whether the token application for the data stream is received; S4, in response to receiving the command of the data stream and S5, in response to the token number of the token application being not greater than the maximum capacity value, subtract the tokens required for the token application from the bandwidth token bucket data, and deliver the data through the virtual disk.

In some embodiments, the method further includes: in response to the data length value of the data slice being greater than the current maximum capacity value, updating the maximum capacity value of the bandwidth token bucket to the data length value of the data slice and judging whether a data stream is received Token application.

In some implementations, the method further includes: in response to the number of tokens applied for by the token being greater than the maximum capacity value, suspending data output to wait for the maximum capacity value to be updated.

In some embodiments, the method further includes: judging whether the number of tokens in the bandwidth token bucket is the current maximum capacity value; and responding to the fact that the number of tokens in the bandwidth token bucket is not the current maximum capacity value , adding tokens to the bandwidth token bucket at a preset speed until the number of tokens in the bandwidth token bucket is equal to the current maximum capacity value.

As shown in FIG. 2 , it is a schematic diagram of the hardware structure of an embodiment of the computer device for limiting bandwidth in the distributed storage provided by the present invention.

Taking the device shown in FIG. 2 as an example, the device includes a processor 301 and a memory 302 , and may further include an input device 303 and an output device 304 .

The processor 301 , the memory 302 , the input device 303 and the output device 304 may be connected by a bus or in other ways, and the connection by a bus is taken as an example in FIG. 2 .

As a non-volatile computer-readable storage medium, the memory 302 can be used to store non-volatile software programs, non-volatile computer-executable programs, and modules, such as bandwidth-limited storage in the distributed storage in the embodiments of the present application. The program instruction/module corresponding to the method. The processor 301 executes various functional applications and data processing of the server by running the non-volatile software programs, instructions and modules stored in the memory 302, that is, implementing the method for limiting bandwidth in distributed storage in the above method embodiments.

The memory 302 may include a stored program area and a stored data area, wherein the stored program area may store an operating system, an application program required for at least one function; data etc. Additionally, memory 302 may include high-speed random access memory, and may also include non-volatile memory, such as at least one magnetic disk storage device, flash memory device, or other non-volatile solid state storage device. In some embodiments, memory 302 may optionally include memory located remotely from processor 301, which may be connected to the local module via a network. Examples of such networks include, but are not limited to, the Internet, an intranet, a local area network, a mobile communication network, and combinations thereof.

The input device 303 can receive input information such as user name and password. The output device 304 may include a display device such as a display screen.

One or more program instructions/modules corresponding to the method for limiting bandwidth in distributed storage are stored in memory 302, and when executed by processor 301, execute the method for limiting bandwidth in distributed storage in any of the above method embodiments.

Any embodiment of the computer device that executes the method for limiting bandwidth in distributed storage above can achieve the same or similar effects as any of the foregoing method embodiments corresponding to it.

The present invention also provides a computer-readable storage medium, where the computer-readable storage medium stores a computer program that executes the above method when executed by a processor.

Finally, it should be noted that those of ordinary skill in the art can understand that all or part of the processes in the methods of the above embodiments can be implemented by instructing the relevant hardware through a computer program. The program of the method for limiting bandwidth in distributed storage can be stored in a In the computer-readable storage medium, when the program is executed, it may include the processes of the foregoing method embodiments. Wherein, the storage medium of the program may be a magnetic disk, an optical disk, a read only memory (ROM) or a random access memory (RAM) or the like. The above computer program embodiments can achieve the same or similar effects as any of the foregoing method embodiments corresponding thereto.

In addition, the methods disclosed according to the embodiments of the present invention may also be implemented as a computer program executed by a processor, and the computer program may be stored in a computer-readable storage medium. When the computer program is executed by the processor, the above-mentioned functions defined in the methods disclosed in the embodiments of the present invention are executed.

In addition, the above-mentioned method steps and system units can also be implemented by using a controller and a computer-readable storage medium for storing a computer program that enables the controller to implement the functions of the above-mentioned steps or units.

In addition, it should be understood that computer-readable storage media (eg, memory) herein can be volatile memory or non-volatile memory, or can include both volatile and non-volatile memory. By way of example and not limitation, nonvolatile memory may include read only memory (ROM), programmable ROM (PROM), electrically programmable ROM (EPROM), electrically erasable programmable ROM (EEPROM), or flash memory memory. Volatile memory may include random access memory (RAM), which may act as external cache memory. By way of example and not limitation, RAM is available in various forms such as synchronous RAM (DRAM), dynamic RAM (DRAM), synchronous DRAM (SDRAM), double data rate SDRAM (DDRSDRAM), enhanced SDRAM (ESDRAM), synchronous Link DRAM (SLDRAM), and Direct Rambus RAM (DRRAM). The storage devices of the disclosed aspects are intended to include, but not be limited to, these and other suitable types of memory.

Those skilled in the art will also appreciate that the various exemplary logical blocks, modules, circuits, and algorithm steps described in connection with the disclosure herein may be implemented as electronic hardware, computer software, or combinations of both. To clearly illustrate this interchangeability of hardware and software, various illustrative components, blocks, modules, circuits, and steps have been described generally in terms of their functionality. Whether such functionality is implemented as software or hardware depends on the specific application and design constraints imposed on the overall system. Those skilled in the art may implement the functions in various ways for each specific application, but such implementation decisions should not be interpreted as causing a departure from the scope of the disclosed embodiments of the present invention.

The various exemplary logical blocks, modules, and circuits described in connection with the disclosure herein can be implemented or executed using the following components designed to perform the functions herein: general purpose processors, digital signal processors (DSPs), application specific integrated circuits (ASIC), Field Programmable Gate Array (FPGA) or other programmable logic device, discrete gate or transistor logic, discrete hardware components, or any combination of these components. A general-purpose processor may be a microprocessor, but in the alternative, the processor may be any conventional processor, controller, microcontroller, or state machine. A processor may also be implemented as a combination of computing devices, eg, a combination of a DSP and a microprocessor, multiple microprocessors, one or more microprocessors in combination with a DSP, and/or any other such configuration.

The steps of a method or algorithm described in connection with the disclosures herein may be embodied directly in hardware, in a software module executed by a processor, or in a combination of the two. A software module may reside in RAM memory, flash memory, ROM memory, EPROM memory, EEPROM memory, registers, hard disk, removable disk, CD-ROM, or any other form of storage medium known in the art. An exemplary storage medium is coupled to the processor, such that the processor can read information from, and write information to, the storage medium. In an alternative, the storage medium may be integrated with the processor. The processor and storage medium may reside in an ASIC. The ASIC may reside in the user terminal. In an alternative, the processor and storage medium may reside in the user terminal as discrete components.

In one or more exemplary designs, functions may be implemented in hardware, software, firmware, or any combination thereof. If implemented in software, the functions may be stored on or transmitted over as one or more instructions or code on a computer-readable medium. Computer-readable media includes both computer storage media and communication media including any medium that facilitates transfer of a computer program from one place to another. A storage medium can be any available medium that can be accessed by a general purpose or special purpose computer. By way of example and not limitation, the computer-readable medium may include RAM, ROM, EEPROM, CD-ROM or other optical disk storage devices, magnetic disk storage devices or other magnetic storage devices, or may be used to carry or store instructions in the form of or data structures and any other medium that can be accessed by a general purpose or special purpose computer or a general purpose or special purpose processor. Also, any connection is properly termed a computer-readable medium. For example, if coaxial cable, fiber optic cable, twisted pair, digital subscriber line (DSL), or wireless technologies such as infrared, radio, and microwave are used to send software from a website, server, or other remote source, the above coaxial cable Cable, fiber optic cable, twisted pair, DSL or wireless technologies such as infrared, radio and microwave are all included in the definition of medium. As used herein, magnetic disks and optical disks include compact disks (CDs), laser disks, optical disks, digital versatile disks (DVDs), floppy disks, blu-ray disks, where disks usually reproduce data magnetically, while optical disks reproduce data optically with lasers . Combinations of the above should also be included within the scope of computer-readable media.

The above are exemplary embodiments of the present disclosure, but it should be noted that various changes and modifications may be made without departing from the scope of the disclosure of the embodiments of the present invention as defined in the claims. The functions, steps and/or actions of the method claims in accordance with the disclosed embodiments described herein need not be performed in any particular order. Furthermore, although elements disclosed in the embodiments of the present invention may be described or claimed in the singular, unless explicitly limited to the singular, the plural may also be construed.

It should be understood that, as used herein, the singular form "a" is intended to include the plural form as well, unless the context clearly supports an exception. It will also be understood that "and/or" as used herein is meant to include any and all possible combinations of one or more of the associated listed items.

The above-mentioned embodiments of the present invention disclose the serial numbers of the embodiments only for description, and do not represent the advantages and disadvantages of the embodiments.

Those of ordinary skill in the art can understand that all or part of the steps of implementing the above embodiments can be completed by hardware, or can be completed by instructing relevant hardware through a program, and the program can be stored in a computer-readable storage medium. The storage medium can be a read-only memory, a magnetic disk or an optical disk, and the like.

Those of ordinary skill in the art should understand that the discussion of any of the above embodiments is only exemplary, and is not intended to imply that the scope (including the claims) disclosed by the embodiments of the present invention is limited to these examples; under the idea of the embodiments of the present invention , the technical features in the above embodiments or different embodiments can also be combined, and there are many other changes in different aspects of the above embodiments of the present invention, which are not provided in detail for the sake of brevity. Therefore, any omission, modification, equivalent replacement, improvement, etc. made within the spirit and principle of the embodiments of the present invention should be included within the protection scope of the embodiments of the present invention.

Claims (8)

1. a method for limiting bandwidth in distributed storage, is characterized in that, comprises the following steps: Fragment the data block to obtain multiple data fragments, and set the preset bandwidth limit value as the maximum capacity value of the bandwidth token bucket; Judging in turn whether the data length value of each data piece is greater than the current maximum capacity value every predetermined time; In response to the data length value of the data slice being not greater than the current maximum capacity value, determine whether a token application for the data stream is received; In response to receiving a token request for a data stream, determining whether the token quantity of the token request is greater than the maximum capacity value; and In response to the number of tokens applied for by the token is not greater than the maximum capacity value, the number of tokens required by the token application is subtracted from the bandwidth token bucket, and the data is delivered through the virtual disk; The method further includes: in response to the data length value of the data slice being greater than the current maximum capacity value, updating the maximum capacity value of the bandwidth token bucket to the data length value of the data slice and judging whether the token of the data stream is received Application. 2. The method of claim 1, further comprising: In response to the number of tokens requested by the token being greater than the maximum capacity value, data output is suspended to wait for the maximum capacity value to be updated. 3. The method of claim 1, further comprising: determining whether the number of tokens in the bandwidth token bucket is the current maximum capacity value; and In response to the number of tokens in the bandwidth token bucket not being the current maximum capacity value, adding tokens to the bandwidth token bucket at a preset rate until the number of tokens in the bandwidth token bucket is equal to the current the maximum capacity value. 4. A system for limiting bandwidth in distributed storage, comprising: The fragmentation module is configured to fragment the data block to obtain multiple data fragments, and set the preset bandwidth limit value as the maximum capacity value of the bandwidth token bucket; a first judgment module, configured to sequentially judge whether the data length value of each data piece is greater than the current maximum capacity value every predetermined time; The second judgment module is configured to judge whether the token application of the data stream is received in response to the data length value of the data slice being not greater than the current maximum capacity value; a third judging module, configured to, in response to receiving the token application of the data stream, judge whether the number of tokens in the token application is greater than the maximum capacity value; and an execution module, configured to subtract the number of tokens required for the token application from the bandwidth token bucket in response to the number of tokens applied for by the token being not greater than the maximum capacity value, and pass the number of tokens required for the token application through the virtual disk release the data; The system further includes: an update module configured to update the maximum capacity value of the bandwidth token bucket to the data length value of the data slice in response to the data length value of the data slice being greater than the current maximum capacity value, and determine whether to receive the data slice or not. Token request to data flow. 5. The system of claim 4, further comprising: A suspending module, configured to suspend data output in response to the number of tokens applied for by the token being greater than the maximum capacity value to wait for the maximum capacity value to be updated. 6. The system of claim 4, further comprising an add-on module configured to: determining whether the number of tokens in the bandwidth token bucket is the current maximum capacity value; and In response to the number of tokens in the bandwidth token bucket not being the current maximum capacity value, adding tokens to the bandwidth token bucket at a preset rate until the number of tokens in the bandwidth token bucket is equal to the current the maximum capacity value. 7. A computer equipment, characterized in that, comprising: at least one processor; and a memory storing computer instructions executable on the processor, the instructions implementing the steps of the method of any one of claims 1-3 when executed by the processor. 8. A computer-readable storage medium storing a computer program, characterized in that, when the computer program is executed by a processor, the steps of the method of any one of claims 1-3 are implemented.

Images