CN115378879A - Data control method and related device - Google Patents
Data control method and related device Download PDFInfo
- Publication number
- CN115378879A CN115378879A CN202211006377.9A CN202211006377A CN115378879A CN 115378879 A CN115378879 A CN 115378879A CN 202211006377 A CN202211006377 A CN 202211006377A CN 115378879 A CN115378879 A CN 115378879A
- Authority
- CN
- China
- Prior art keywords
- request
- token
- token bucket
- traffic type
- determining
- Prior art date
- Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
- Pending
Links
- 238000000034 method Methods 0.000 title claims abstract description 67
- 238000004590 computer program Methods 0.000 claims description 17
- 238000012545 processing Methods 0.000 claims description 14
- 238000013468 resource allocation Methods 0.000 abstract description 13
- 230000006870 function Effects 0.000 description 17
- 238000004891 communication Methods 0.000 description 15
- 238000010586 diagram Methods 0.000 description 14
- 230000008569 process Effects 0.000 description 8
- 238000013508 migration Methods 0.000 description 6
- 230000005012 migration Effects 0.000 description 6
- 230000008439 repair process Effects 0.000 description 6
- 230000008878 coupling Effects 0.000 description 3
- 238000010168 coupling process Methods 0.000 description 3
- 238000005859 coupling reaction Methods 0.000 description 3
- 238000004140 cleaning Methods 0.000 description 2
- 238000012217 deletion Methods 0.000 description 2
- 230000037430 deletion Effects 0.000 description 2
- 238000011161 development Methods 0.000 description 2
- 238000005516 engineering process Methods 0.000 description 2
- 230000003287 optical effect Effects 0.000 description 2
- 239000004065 semiconductor Substances 0.000 description 2
- 230000009286 beneficial effect Effects 0.000 description 1
- 230000005540 biological transmission Effects 0.000 description 1
- 239000003795 chemical substances by application Substances 0.000 description 1
- 238000013500 data storage Methods 0.000 description 1
- 230000003247 decreasing effect Effects 0.000 description 1
- 238000013461 design Methods 0.000 description 1
- 238000012986 modification Methods 0.000 description 1
- 230000004048 modification Effects 0.000 description 1
- 239000013307 optical fiber Substances 0.000 description 1
- 230000002093 peripheral effect Effects 0.000 description 1
- 239000007787 solid Substances 0.000 description 1
- 238000006467 substitution reaction Methods 0.000 description 1
Images
Classifications
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L47/00—Traffic control in data switching networks
- H04L47/10—Flow control; Congestion control
- H04L47/215—Flow control; Congestion control using token-bucket
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L47/00—Traffic control in data switching networks
- H04L47/10—Flow control; Congestion control
- H04L47/24—Traffic characterised by specific attributes, e.g. priority or QoS
- H04L47/2441—Traffic characterised by specific attributes, e.g. priority or QoS relying on flow classification, e.g. using integrated services [IntServ]
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L67/00—Network arrangements or protocols for supporting network services or applications
- H04L67/01—Protocols
- H04L67/10—Protocols in which an application is distributed across nodes in the network
- H04L67/104—Peer-to-peer [P2P] networks
- H04L67/1074—Peer-to-peer [P2P] networks for supporting data block transmission mechanisms
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L67/00—Network arrangements or protocols for supporting network services or applications
- H04L67/01—Protocols
- H04L67/10—Protocols in which an application is distributed across nodes in the network
- H04L67/1097—Protocols in which an application is distributed across nodes in the network for distributed storage of data in networks, e.g. transport arrangements for network file system [NFS], storage area networks [SAN] or network attached storage [NAS]
Landscapes
- Engineering & Computer Science (AREA)
- Computer Networks & Wireless Communication (AREA)
- Signal Processing (AREA)
- Data Exchanges In Wide-Area Networks (AREA)
Abstract
The application provides a data control method and a related device, comprising the following steps: when a first request is received, determining the traffic type of the first request, and determining a first token bucket and a second token bucket according to the traffic type, wherein the first token bucket comprises a first number of first tokens, the second token bucket comprises a second number of second tokens, the first token bucket is used for allocating read-write times resources for the first request, and the second token bucket is used for allocating bandwidth resources for the first request; and when the first number is not 0 and the second number is greater than or equal to the number of first bandwidth bytes required by the first request, executing a first operation corresponding to the first request. In the embodiment of the application, the first token bucket and the second token bucket are determined according to the requested traffic type, and the read-write frequency resource and the bandwidth resource which are allocated to the request are determined according to the two token buckets, so that the resource allocation precision is improved, and the read-write frequency resource and the bandwidth resource are fully utilized.
Description
Technical Field
The application belongs to the technical field of computers, and particularly relates to a data control method and a related device.
Background
With the development of modern information technology, the data access requirements of internet users are gradually increased, and the traditional centralized server storage method cannot meet the increasing data access requirements, so that a distributed storage system integrates multiple server resources, thereby breaking the bottleneck of the traditional storage system.
Disclosure of Invention
The application provides a data control method and a related device, a first token bucket for allocating read-write frequency resources and a second token bucket for allocating bandwidth resources are determined according to the type of requested flow, the read-write frequency resources and the bandwidth resources are controlled and allocated through the token buckets, the resource allocation precision is improved, and the resource allocation is more reasonable.
In a first aspect, the present application provides a data control method, including:
when a first request is received, determining the traffic type of the first request;
determining a first token bucket and a second token bucket according to the traffic type, wherein the first token bucket comprises a first quantity of first tokens, the second token bucket comprises a second quantity of second tokens, the first token bucket is used for allocating read-write frequency resources for the first request, and the second token bucket is used for allocating bandwidth resources for the first request;
when the first number is not 0 and the second number is greater than or equal to a first bandwidth byte number required by the first request, executing a first operation corresponding to the first request.
In a second aspect, the present application provides a data control apparatus comprising:
the device comprises a first determining unit, a second determining unit and a processing unit, wherein the first determining unit is used for determining the traffic type of a first request when the first request is received;
a second determining unit, configured to determine a first token bucket and a second token bucket according to the traffic type, where the first token bucket includes a first number of first tokens, the second token bucket includes a second number of second tokens, the first token bucket is configured to allocate read-write frequency resources for the first request, and the second token bucket is configured to allocate bandwidth resources for the first request;
and the execution unit is used for executing a first operation corresponding to the first request when the first number is not 0 and the second number is greater than or equal to the number of first bandwidth bytes required by the first request.
In a third aspect, an embodiment of the present application provides an electronic device, including: a processor, memory, and one or more programs; the one or more programs are stored in the above memory and configured to be executed by the processor, the programs including instructions for performing the steps described in any of the methods of the first aspect of the embodiments of the present application.
In a fourth aspect, this application provides a computer-readable storage medium, where the computer-readable storage medium stores a computer program for electronic data exchange, and the computer program specifically includes instructions for performing some or all of the steps described in any one of the methods in the first aspect of the embodiments of the present application.
In a fifth aspect, the present application provides a computer program, wherein the computer program is operable to cause a computer to perform some or all of the steps as described in any of the methods of the first aspect of the embodiments of the present application. The computer program may be a software installation package.
The beneficial effects brought by the technical scheme provided by some embodiments of the application at least comprise:
in the embodiment of the application, when a first request is received, a corresponding first token bucket and a corresponding second token bucket are determined according to a traffic type of the first request, read-write frequency resources allocated to the first request are limited according to a first number of first tokens in the first token bucket, bandwidth resources allocated to the first request are limited according to a second number of second tokens in the second token bucket, and when the first number is not 0 and the second number is greater than or equal to a first bandwidth byte number required by the first traffic, a first operation corresponding to the first request is executed. According to the method and the device, the corresponding first token bucket and the corresponding second token bucket are determined according to the flow type of the first request, so that the read-write frequency resource and the bandwidth resource which are allocated to the first request are determined, the resource allocation accuracy and the resource allocation rationality are improved, and the phenomenon that when a part of requests are executed, the excessive read-write frequency resource or the bandwidth resource is occupied due to the fact that data corresponding to the requests are too large, and the execution of other requests is influenced is prevented.
Drawings
In order to more clearly illustrate the embodiments of the present application or the technical solutions in the prior art, the drawings used in the description of the embodiments or the prior art will be briefly described below, it is obvious that the drawings in the following description are only some embodiments of the present application, and for those skilled in the art, other drawings can be obtained according to the drawings without creative efforts.
Fig. 1 is an exemplary system architecture diagram of a data control method provided in an embodiment of the present application;
fig. 2 is a schematic flowchart of a data control method according to an embodiment of the present application;
FIG. 3 is a schematic flow chart diagram of another data control method provided in the embodiments of the present application;
FIG. 4 is a schematic flow chart diagram of another data control method provided in the embodiments of the present application;
FIG. 5 is a diagram illustrating an implementation of a request provided by an embodiment of the present application;
fig. 6 is a schematic diagram of correspondence between different levels and traffic types according to an embodiment of the present application;
fig. 7 is a schematic structural diagram of an electronic device according to an embodiment of the present application;
FIG. 8 is a block diagram illustrating functional units of a data control apparatus according to an embodiment of the present disclosure;
fig. 9 is a block diagram of functional units of another data control apparatus according to an embodiment of the present disclosure.
Detailed Description
In order to make the technical solutions of the present application better understood, the technical solutions in the embodiments of the present application will be clearly and completely described below with reference to the drawings in the embodiments of the present application, and it is obvious that the described embodiments are only a part of the embodiments of the present application, and not all of the embodiments. All other embodiments, which can be derived by a person skilled in the art from the embodiments given herein without making any creative effort, shall fall within the protection scope of the present application.
The terms "first," "second," and the like in the description and claims of the present application and in the foregoing drawings are used for distinguishing between different objects and not for describing a particular sequential order. Furthermore, the terms "include" and "have," as well as any variations thereof, are intended to cover non-exclusive inclusions. For example, a process, method, system, article, or apparatus that comprises a list of steps or elements is not limited to only those steps or elements listed, but may alternatively include other steps or elements not listed, or inherent to such process, method, article, or apparatus.
Reference herein to "an embodiment" means that a particular feature, structure, or characteristic described in connection with the embodiment can be included in at least one embodiment of the application. The appearances of the phrase in various places in the specification are not necessarily all referring to the same embodiment, nor are separate or alternative embodiments mutually exclusive of other embodiments. It is explicitly and implicitly understood by one skilled in the art that the embodiments described herein may be combined with other embodiments.
The following first explains key concepts related to the embodiments of the present application:
the read-write frequency resource can be regarded as the frequency of read-write (I/O) operation in unit time and is used for measuring the read-write performance of a hard disk or other storage equipment.
Bandwidth resources refer to the amount of data traffic that can pass through a link per unit time.
With the development of internet information technology, the storage demand for data is gradually increased, while a distributed storage system dispersedly stores data on a plurality of independent devices, adopts an expandable system structure, shares storage load by using a plurality of storage servers, and positions and stores information by using a position server, thereby not only improving the reliability, availability and access efficiency of the system, but also being easy to expand. Through a distributed storage system, increased storage requirements may be satisfied. However, the read-write capability and bandwidth of the distributed storage system are limited, so that in order to ensure the stability of the whole distributed storage system, it is necessary to avoid that too many bandwidth resources of the distributed storage system are occupied due to too large data traffic corresponding to requests of the same traffic type, or too many read-write frequency resources of the distributed storage system are occupied due to too many requests of the same traffic type, which causes too long time for waiting for execution of different types of requests, thereby causing instability of the distributed storage system.
In view of the foregoing problems, an embodiment of the present application provides a data control method, where a first token bucket and a second token bucket are determined according to a traffic type of a received first request, a read-write frequency resource is allocated to the first request through the first token bucket, and a bandwidth resource is allocated to the first request through the second token bucket, so as to implement allocation of the read-write frequency resource and the bandwidth resource of the first request, improve allocation accuracy, and limit the read-write frequency resource and the bandwidth resource used by the first request, thereby achieving a purpose of limiting traffic corresponding to the first request, and making resource allocation more reasonable.
The following describes embodiments of the present application in detail.
Referring to fig. 1, fig. 1 is a diagram illustrating an exemplary system architecture of a data control method according to an embodiment of the present disclosure. The system architecture shown in fig. 1 may include a server 110, a terminal device 120. The server 110 is communicatively connected to the terminal device 120 via a network. The network may include various types of wired or wireless communication links, such as: the wired communication link includes an optical fiber, a twisted pair wire or a coaxial cable, and the Wireless communication link includes a bluetooth communication link, a Wireless-Fidelity (Wi-Fi) communication link, a microwave communication link, or the like.
The server 110 may interact with the terminal device 120 through a network to receive requests from the terminal device 120 or to send messages to the terminal device 120, and the server 110 may receive requests from within the server 110. The terminal device 120 may be hardware or software. When the terminal device 120 is hardware, it may be a variety of electronic devices including, but not limited to, smart watches, smart phones, tablet computers, laptop portable computers, desktop computers, and the like. When the terminal device 120 is software, it may be installed in the electronic device listed above, and it may be implemented as multiple software or software modules (for example, to provide distributed services), or may be implemented as a single software or software module, and is not limited in this respect.
The server 110 may be a business server providing various services. The server 110 may be hardware or software. When the server 110 is hardware, it can be implemented as a distributed server 110 cluster composed of a plurality of servers 110, or can be implemented as a single server 110. When the server 110 is software, it may be implemented as a plurality of software or software modules (for example, to provide distributed services), or may be implemented as a single software or software module, which is not limited herein.
It should be understood that the number of terminal devices 120 and servers 110 in fig. 1 is merely illustrative, and that any number of terminal devices 120 and servers 110 may be provided as desired for an implementation.
In view of the foregoing problems, embodiments of the present application provide a data control method, which is applied to a server of a distributed storage system, and it can be understood that the method can also be applied to a terminal device or other devices in the distributed storage system for access. The following description will take the execution agent as an example of a server. Referring to fig. 2, fig. 2 is a schematic flowchart illustrating a data control method according to an embodiment of the present disclosure. A data control method, comprising:
The server can receive a request from a terminal device outside the server through a network, and corresponding flow can be generated when the server executes an operation corresponding to the request. The server may also receive requests from within the server, such as requests to perform data migration operations, patrol operations, or repair operations. Traffic is also generated when an operation corresponding to the request is executed. Therefore, when a server receives a large number of requests at the same time, under the condition of limited resources, if the traffic of each request is not limited, delay of part of the requests is caused, and user experience is influenced. Therefore, when the first request is received, the traffic type of the first request is obtained first, and the resource allocated to the first request is determined according to the traffic type. It should be understood that, in the embodiment of the present application, the first request is only a general term for the received request, and does not refer to a specific request, and the first request may be replaced by another name, for example, the second request and the third request, which is not limited herein specifically, and in the embodiment of the present application, only the "first request" is taken as an example for description. It is understood that the first request may be a read-write request, a delete request, an access request, etc., and is not limited in particular.
Specifically, the traffic type includes read-write traffic corresponding to the read-write request, delete traffic corresponding to the delete request, repair traffic corresponding to the repair request, data migration traffic corresponding to the data migration request, delete traffic corresponding to the delete request, garbage cleaning traffic corresponding to the internal garbage cleaning request, and patrol traffic corresponding to the patrol request, and the type of the traffic type is not limited here.
It can be seen that, by receiving a first request and determining a traffic type of the first request, a data reference can be provided for subsequently determining a first token bucket and a second token bucket corresponding to the first request.
The first token bucket comprises a first quantity of first tokens, the second token bucket comprises a second quantity of second tokens, the first token bucket is used for allocating read-write times resources for the first request, and the second token bucket is used for allocating bandwidth resources for the first request.
Specifically, after the traffic type of the first request is acquired, a first token bucket and a second token bucket corresponding to the first request may be determined according to the acquired traffic type, the first token bucket includes a first number of first tokens, the first number of the first tokens is used to represent an amount of read-write frequency resources allocated to the first request, the second token bucket includes a second number of second tokens, the second number of the second tokens is used to represent an amount of bandwidth resources allocated to the first request, the read-write frequency resources and the bandwidth resources allocated to the first request are determined according to the traffic type of the first request, and the reasonability of allocation is improved.
For example, when the traffic type is service traffic, the first level is divided into a first level, when the traffic type is repair traffic or data migration traffic, the second level is divided into a second level, when the traffic type is delete traffic, the third level is divided into a fourth level, and when the traffic type is internal traffic, the fourth level is divided into the fourth level. And then selecting the corresponding first token bucket and the second token bucket according to the hierarchy corresponding to the traffic type. That is, after different traffic types are classified into tiers, each tier may correspond to a request of one traffic type, or each tier may also correspond to a request of a plurality of different traffic types. It is to be understood that each level may be provided with a corresponding first token bucket and a second token bucket, and a request of a traffic type corresponding to the same level may obtain a token in the token bucket corresponding to the level. When the requests of different traffic types of the same level are received, the requests of different traffic types of the level share one first token bucket and one second token bucket, resources do not need to be configured for the requests of each traffic type, and configuration efficiency is improved.
It should be noted that, in this embodiment of the present application, the first token bucket is only a generic name of a token bucket for allocating read-write frequency resources, the second token bucket is only a generic name of a token bucket for allocating bandwidth resources, and does not refer to a certain token bucket specifically, the first token bucket and the second token bucket may be replaced by other names, and specific details are not limited herein.
It can be seen that the first token bucket and the second token bucket corresponding to the first request are determined according to the request type of the first request, so that the read-write frequency resource and the bandwidth resource which can be used by the first request are determined, the clearly allocated resource amount is determined, and data reference can be provided for subsequently judging whether the first request can be executed.
After determining a first token bucket and a second token bucket corresponding to a first request, determining whether a first number of first tokens in the first token bucket is 0 or not, determining whether a second number of second tokens in the second token bucket is greater than or equal to a first number of bandwidth bytes required for executing the first request or not when the first number is not 0, wherein each time an operation corresponding to one request is executed, one first token is required, each time one byte of the request is processed, if the first number is not 0 and the second number is greater than or equal to the first number of bandwidth bytes required for the first request, it indicates that the first request can use read-write times resources and bandwidth resources, so after obtaining tokens in the first token bucket and tokens in the second token bucket, executing a first operation corresponding to the first request, and simultaneously subtracting one first token from the first token bucket, and subtracting the same number of second tokens as the first number of bandwidth bytes from the second token bucket.
As can be seen, in this example, after a request is obtained, a first token bucket and a second token bucket corresponding to the request are determined according to a traffic type of the obtained request, a read-write frequency resource allocated to the request of the traffic type is determined according to the number of tokens in the first token bucket, and a bandwidth resource allocated to the request of the traffic type is determined according to the number of tokens in the second token bucket, so that the resource allocation accuracy is improved, and the resource allocation is more reasonable.
In one possible embodiment, please refer to fig. 3, and fig. 3 is a schematic flowchart of another data control method according to an embodiment of the present application. The method specifically comprises the following steps:
Wherein, steps 310 to 320 are the same as steps 210 to 220, and are not described herein again.
After determining a first token bucket and a second token bucket corresponding to a first request, judging whether a first quantity of first tokens in the first token bucket is 0, if the first quantity is 0, representing that the quantity of read-write frequency resources corresponding to the first request at the current moment is 0, and the first token cannot be acquired, so that the first request is added into a first waiting queue. And after the first request is stored in the first waiting queue, continuously re-acquiring the first token in the first token bucket, and executing the step of judging whether the second number of the second tokens in the second token bucket is greater than or equal to the first bandwidth byte number required by the first request or not until the first token is acquired. Specifically, the tokens in the first token bucket may be reacquired according to a preset acquisition period, or the tokens in the first token bucket may be reacquired according to a preset time point, if the tokens are reacquired, the subsequent steps are executed, and if the tokens are not acquired, the next period is continuously waited for, or the tokens are reacquired at the next time point.
As can be seen, in this example, the number of requests allowed to be executed is limited by the number of tokens in the first token bucket, so that the limitation on the traffic is realized, and the accuracy of resource allocation is improved.
In a possible example, please refer to fig. 4, and fig. 4 is a schematic flowchart of another data control method provided in an embodiment of the present application. The method specifically comprises the following steps:
Wherein, steps 410-420 are the same as steps 210-220, and are not described herein again.
After the first token bucket and the second token bucket are determined, if the first number of the first tokens in the first token bucket is judged to be not 0, whether the second number of the second tokens in the second token bucket is larger than or equal to the first bandwidth byte number required by the first request is continuously judged, if the second number is judged to be smaller than the first bandwidth byte number required by the first request, the first request is added into the second waiting queue, the tokens of the second token bucket are continuously obtained again, and when the number of the tokens in the second token bucket exceeds the first bandwidth byte number, the second tokens in the second token bucket are obtained again and the first operation corresponding to the first request is executed.
As can be seen, in this example, the second token bucket limits the bandwidth resources allocated to the request, so as to prevent the request from occupying too many bandwidth resources when the data is too large, which affects the execution of other requests, balance the allocation ratio of the read-write frequency resources to the bandwidth resources, and make the resource allocation more reasonable.
In one possible example, it may be preferentially determined whether the first number in the first token bucket is 0, and if the first number in the first token bucket is 0, the step of determining whether the second number of the second tokens in the second token bucket is greater than or equal to the first number of bandwidth bytes required by the first request may be stopped until the first token is retrieved; or, it may be preferentially determined whether the second number of second tokens in the second token bucket is greater than or equal to the first number of bandwidth bytes required for executing the first request, and if the second number is smaller than the first number of bandwidth bytes required for executing the first request, the step of determining whether the first number in the first token bucket is 0 is stopped until the second token of the first number of bandwidth bytes required for executing the first request is acquired again, so as to save processing time. When the first number is not 0 and the second number is larger than or equal to the number of first bandwidth bytes required by the first request, executing a first operation corresponding to the first request, reasonably distributing read-write frequency resources and bandwidth resources, and improving the utilization rate of the resources.
In one possible example, prior to the determining the first token bucket and the second token bucket based on the traffic type, the method further comprises: determining a first token release number in a preset period and a second token release number in the preset period according to a real-time flow value; configuring the first tokens of the first token bucket according to the first token throw number, and configuring the second tokens of a second token bucket according to the second token throw number, where the first token throw number is an initial value of the first number, the second token throw number is an initial value of the second number, an actual value of the first number is inversely proportional to the received request number in the preset period, and an actual value of the second number is inversely proportional to the received request number in the preset period.
The real-time flow values corresponding to all requests of the server can be obtained through the monitor, after the real-time flow values are determined, the first token release number of each first token bucket in a preset period can be determined, the first token bucket releases the first tokens according to the corresponding first token release number, namely the first token release number is the initial value of the first number of the first tokens in the first token bucket. And determining a second token release number of each second token bucket in a preset period, wherein the second token bucket releases the second tokens according to the corresponding second token release number, namely the second token release number is an initial value of a second number of the second tokens in the second token bucket. Wherein each token bucket corresponds to a token placer and the number of tokens in the token bucket is adjusted in time. In this example, please refer to fig. 5, where fig. 5 is a schematic diagram of an execution process of a request according to an embodiment of the present application. As shown in fig. 5, a traffic type of the first request is determined when the first request is received, and a first token bucket and a second token bucket corresponding to the first request are determined according to the traffic type, and a first number of first tokens of the first token bucket and a second number of second tokens of the second token bucket are determined according to the real-time traffic value obtained by the monitor 510. That is, the monitor 510 obtains real-time traffic values corresponding to all requests of the server, thereby determining a first token throw number assigned to the first token bucket and a second token throw number assigned to the second token bucket. And adjusts, via first token allocator 520, a first number of first tokens within the first token bucket and adjusts, via second token allocator 530, a second number of second tokens within the second token bucket. And adjusting the number of tokens issued to different first token buckets and the number of tokens issued to different second token buckets according to the real-time traffic condition of the server, and further controlling the distributed read-write frequency resources and bandwidth resources, so that the distribution is more reasonable. After determining a first number of first tokens of a first token bucket corresponding to a first request and a second number of second tokens of a second token bucket, judging whether the first number is 0 and whether the second number is greater than or equal to a first bandwidth byte number required for executing the first request, if the first number is 0, storing the first request in a first waiting queue, and simultaneously re-acquiring the first tokens in the first token bucket until the first token is acquired, continuously judging whether the second number is greater than or equal to the first bandwidth byte number required for executing the first request, if the second number is less than the first bandwidth byte number required for executing the first request, storing the first request in a second waiting queue until the second number of the second tokens in the second token bucket is greater than or equal to the first bandwidth byte number required for executing the first request, acquiring a sufficient number of the second tokens, and executing a first operation corresponding to the first request.
After receiving the first request, determining a first token bucket and a second token bucket corresponding to the first request according to the traffic type of the first request, thereby determining the read-write frequency resource and the bandwidth resource corresponding to the first request. In addition, in a preset period, the more requests are received, the more the number of the first tokens in the first token bucket is consumed, so the actual value of the first number is lower, and similarly, the more requests are received, the more bytes of the corresponding data are consumed, the more the number of the second tokens is consumed, and the actual value of the second number is lower. That is, each time a request is fetched, a first token is subtracted from the first token bucket, and the number of tokens in the same number as the number of bandwidth bytes required is subtracted from the second token bucket.
As can be seen, in this example, the number of tokens in each first token bucket and the number of tokens in each second token bucket are determined according to the real-time traffic value, so that the read-write frequency resource and the bandwidth resource are allocated according to the real-time traffic condition, which is convenient for adjustment according to the real-time condition, and improves the accuracy of resource allocation.
In one possible example, the determining, according to the real-time traffic value, a first token release number in a preset period and a second token release number in the preset period includes: determining a first initial token release number and a second initial token release number corresponding to the traffic type; and when the real-time flow value is smaller than a preset flow threshold value, taking the first initial token throwing number as the first token throwing number, and taking the second initial token throwing number as the second token throwing number.
In a specific example, a preset flow threshold is set, after a real-time flow value of the server is obtained, the real-time flow value and the preset flow threshold are judged, if the real-time flow value is smaller than the preset flow threshold, the first initial token throw number is used as a first token throw number, and the second initial token throw number is used as a second token throw number.
As can be seen, in this example, when the real-time traffic value is small, tokens are put in the token bucket according to the preset token putting number, so that requests of different traffic types can be executed, and stable concurrent resource release is realized.
In one possible example, after determining the first initial number of token impressions and the second initial number of token impressions corresponding to the traffic type, the method further comprises: and when the real-time flow value is greater than or equal to the preset flow threshold value, adjusting the first initial token release number according to a first preset proportion corresponding to the flow type, and adjusting the second initial token release number according to a second preset proportion corresponding to the flow type.
In a specific example, a first preset proportion and a second preset proportion corresponding to different traffic types are set in advance, and the first preset proportion and the second preset proportion are respectively used for adjusting and determining a first number of first initial token throwing numbers and adjusting and determining a second number of second initial token throwing numbers. And if the acquired real-time flow value is larger than or equal to the preset flow threshold value, determining a corresponding first preset proportion and a second preset proportion according to the flow type, adjusting the first initial token release number according to the first preset proportion to obtain a first token release number, and adjusting the second initial token release number according to the second preset proportion to obtain a second token release number. And configuring an initial value of a first token of the first token bucket according to the first token throwing number, and configuring an initial value of a second token of the second token bucket according to the second token throwing number.
The first preset proportion can be a positive number, or can be a negative number; the second preset ratio may be a positive number, or alternatively, may be a negative number. When the first preset proportion is a positive number, the token bucket is used for representing that the number of the first tokens stored in the first token bucket is increased in a preset period so as to increase the read-write frequency resource allocated to the flow type request; and when the first preset proportion is a negative number, the token is used for representing that the number of the first tokens stored in the first token bucket is reduced in a preset period so as to reduce the read-write frequency resources allocated to the request of the flow type. Similarly, when the second preset proportion is a positive number, the token is used for representing that the number of the second tokens stored in the second token bucket is increased in a preset period so as to increase the bandwidth resource allocated to the request of the traffic type; and when the second preset proportion is negative, the token is used for reducing the number of the second tokens stored in the second token bucket in a preset period so as to reduce the bandwidth resource allocated to the request of the traffic type.
As can be seen, in this example, when the real-time traffic value is greater than or equal to the preset traffic threshold, the first initial token throw amount is adjusted by the first preset proportion, and the second initial token throw amount is adjusted by the second preset proportion, so that the read-write frequency resources and bandwidth resources allocated to the partial traffic type are increased or decreased according to the real-time traffic condition. When the flow type request corresponding to the token bucket for increasing the token releasing number is increased, sufficient read-write frequency resources and bandwidth resources are ensured, and the processing efficiency of the flow type request is improved.
In one possible example, a plurality of different flow threshold ranges are preset, the different flow threshold ranges corresponding to different preset proportions. After the real-time flow value is obtained, the flow threshold range to which the real-time flow value belongs is judged, and the corresponding preset proportion is searched according to the flow type. It can be understood that different preset proportions can be set for different traffic types, and the preset proportion corresponding to the first token bucket and the preset proportion corresponding to the second token bucket can also be set to different proportions according to actual requirements, which is not limited herein. Adjusting the first preset token throwing number according to a preset proportion to obtain an adjusted first initial token throwing number, and adjusting the second initial token throwing number according to the preset proportion to obtain an adjusted second initial token throwing number. And taking the adjusted first initial token throwing number as a first token throwing number, and taking the adjusted second initial token throwing number as a second token throwing number. Different preset proportions for adjusting the initial token number are determined according to the real-time flow conditions of the flow, so that the resource allocation is more flexible, and the resource allocation precision is improved.
In a possible example, when the traffic type of the first request is a service traffic type, the first preset proportion corresponding to the traffic type is greater than or equal to 0, and the second preset proportion is greater than or equal to 0.
In a specific example, in order to ensure that the request of the traffic type can be preferentially executed, sufficient read-write frequency resources and bandwidth resources need to be allocated to the request of the traffic type. Therefore, the first preset proportion set for the service flow type is greater than or equal to 0, and the second preset proportion is greater than or equal to 0. If the acquired real-time traffic value of the server is greater than or equal to the preset traffic threshold value, judging that the traffic type of the received first request is the service traffic type, and determining that the first preset proportion is greater than or equal to 0 and the second preset proportion is greater than or equal to 0 according to the service traffic type. And keeping or increasing the first initial token throwing amount according to a first preset proportion, and keeping or increasing the second initial token throwing amount according to a second preset proportion. Therefore, the method and the device can process the request of the service flow type in time when the request is received.
As can be seen, in this example, if the traffic type is the service traffic type, the corresponding first preset ratio is greater than or equal to 0, and the second preset ratio is greater than or equal to 0, so as to ensure the read-write frequency resource and the bandwidth resource allocated to the request of the service traffic type, thereby improving the processing efficiency of the request of the service traffic type.
In a possible example, different hierarchies are divided according to actual demands, and the same hierarchy may include one traffic type or a plurality of different traffic types. The flow types in the same layer are marked as the same priority level. The order of the resources it uses is determined according to the priority levels. The traffic types at the same level correspond to a first token bucket and a second token bucket. For example, please refer to fig. 6, fig. 6 is a schematic diagram illustrating correspondence between different levels and traffic types according to an embodiment of the present application. As shown in fig. 6, a total of four levels are set, including a first level, a second level, a third level and a fourth level, where the first level includes service traffic, the second level includes repair traffic corresponding to a repair request and data migration traffic corresponding to a data migration request, the third level includes deletion traffic corresponding to a deletion request, and the fourth level includes spam traffic corresponding to an internal spam request and patrol traffic corresponding to a patrol request. Requests of different traffic types at the same level are allowed to mutually preempt resources corresponding to the level. The priority level of the traffic type of the first hierarchy is highest, the priority levels of the traffic types are sequentially reduced according to the sequence from the first hierarchy to the fourth hierarchy, and the priority level of the traffic type of the fourth hierarchy is lowest. After the first request is received, if the first request is judged to be a service request, the first quantity of the first tokens in the first token bucket corresponding to the first request and the second quantity of the second tokens in the second token bucket are preferentially ensured to meet the requirement of executing the first operation corresponding to the first request. The method and the device can ensure that the request of the service flow type can be processed in time, and improve the user experience.
It is understood that the number of the layers can be set according to actual requirements, and the specific number is not limited.
In one possible example, after the priority levels are calibrated for the traffic types of different hierarchies, a first preset proportion for adjusting the first initial token throwing amount is determined according to the priority levels, and a second preset proportion for adjusting the second initial token throwing amount is determined, so that the processing efficiency of the request of the traffic type with the high priority level is improved. For example, four levels are provided, the priority level of the traffic type of the first level is the highest, and the priority levels of the traffic types are sequentially lowered according to the order from the first level to the fourth level, wherein the priority level of the traffic type of the fourth level is the lowest. Therefore, the first preset proportion and the second preset proportion corresponding to the flow type of the first level are the highest, and the first preset proportion and the second preset proportion corresponding to the flow type of the fourth level are the lowest. The method and the device can ensure that the request with high priority level of the request traffic type can be processed in time, and improve the user experience.
Fig. 7 is a schematic structural diagram of an electronic device in this embodiment, and as shown in fig. 7, the electronic device 700 includes a processor 701, a communication module 702, and a memory 703, where the processor 701, the communication module 702, and the memory 703 are connected to each other, where the electronic device 700 may further include a bus 704, and the processor 701, the communication module 702, and the memory 703 may be connected to each other through the bus 704, and the bus 704 may be a Peripheral Component Interconnect (PCI) bus or an Extended Industry Standard Architecture (EISA) bus, for example. The bus 704 may be divided into an address bus, a data bus, a control bus, and the like. For ease of illustration, only one thick line is shown in FIG. 7, but that does not indicate only one bus or one type of bus. The memory 703 is used for storing a computer program comprising program instructions, and the processor 701 is configured to call the program instructions to execute all or part of the methods described in fig. 2, fig. 3, fig. 4, fig. 5, and fig. 6.
The above description has introduced the solution of the embodiment of the present application mainly from the perspective of the method-side implementation process. It is understood that the electronic device comprises corresponding hardware structures and/or software modules for performing the respective functions in order to realize the functions. Those of skill in the art will readily appreciate that the present application is capable of hardware or a combination of hardware and computer software implementing the various illustrative elements and algorithm steps described in connection with the embodiments provided herein. Whether a function is performed as hardware or computer software drives hardware depends upon the particular application and design constraints imposed on the solution. Skilled artisans may implement the described functionality in varying ways for each particular application, but such implementation decisions should not be interpreted as causing a departure from the scope of the present application.
In the embodiment of the present application, the electronic device may be divided into the functional units according to the method example, for example, each functional unit may be divided corresponding to each function, or two or more functions may be integrated into one processing unit. The integrated unit can be realized in a form of hardware, and can also be realized in a form of a software functional unit. It should be noted that the division of the unit in the embodiment of the present application is schematic, and is only a logic function division, and there may be another division manner in actual implementation.
In the case of dividing each function module according to each function, a data control device in the embodiment of the present application will be described below with reference to fig. 8. Specifically, the data control device is used for executing the steps in the data control method. The data control device provided by the embodiment of the application can comprise modules corresponding to the corresponding steps.
In the embodiment of the present application, the data control device may be divided into the functional modules according to the above method examples, for example, each functional module may be divided according to each function, or two or more functions may be integrated into one processing module. The integrated module can be realized in a hardware mode, and can also be realized in a software functional module mode. The division of the modules in the embodiment of the present application is schematic, and is only a logic function division, and there may be another division manner in actual implementation.
In the case of dividing each function module according to each function, please refer to fig. 8, and fig. 8 is a block diagram of a functional unit of a data control apparatus according to an embodiment of the present application. The data control apparatus includes:
a first determining unit 810, configured to determine, when a first request is received, a traffic type of the first request;
a second determining unit 820, configured to determine a first token bucket and a second token bucket according to the traffic type, where the first token bucket includes a first number of first tokens, the second token bucket includes a second number of second tokens, the first token bucket is configured to allocate read-write times resources for the first request, and the second token bucket is configured to allocate bandwidth resources for the first request;
an executing unit 830, configured to execute a first operation corresponding to the first request when the first number is not 0 and the second number is greater than or equal to a first number of bandwidth bytes required by the first request.
Therefore, by the data control method and the related device, firstly, the read-write frequency resources and the bandwidth resources can be reasonably distributed according to the flow type, so that the resource distribution is reasonable; secondly, when a request is received, a corresponding first token bucket and a corresponding second token bucket are determined according to the flow type of the request so as to determine the allocated resources, and when a plurality of requests are received, the resources of part of the requests are prevented from being preempted, so that the waiting time is too long. And the priority of the traffic type can be determined according to the actual use condition so as to ensure the resource of the request of the traffic type with high priority, so that waiting is not needed, the processing efficiency is improved, the user use experience is improved, and finally, the first quantity of the first tokens distributed to the first token bucket and the second quantity of the second tokens distributed to the second token bucket are determined according to the real-time traffic value, the resource distribution condition can be adjusted in real time, and the resource distribution precision is improved.
In the case of using integrated units, the following describes in detail another data control apparatus 900 in this embodiment with reference to fig. 9, where fig. 9 is a block diagram formed by functional units of another data control apparatus provided in this embodiment, and the data control apparatus 900 includes a processing unit 901 and a communication unit 902, where the processing unit 901 is configured to execute any step in the above method embodiments, and when data transmission such as sending is performed, the communication unit 902 is optionally invoked to complete a corresponding operation.
The data control device 900 may further include a storage unit 903 for storing program codes and data. The processing unit 901 may be a processor, the communication unit 902 may be a wireless communication module, and the storage unit 903 may be a memory.
The processing unit 901 is specifically configured to:
when a first request is received, determining the traffic type of the first request;
determining a first token bucket and a second token bucket according to the traffic type, wherein the first token bucket comprises a first quantity of first tokens, the second token bucket comprises a second quantity of second tokens, the first token bucket is used for allocating read-write frequency resources for the first request, and the second token bucket is used for allocating bandwidth resources for the first request;
when the first number is not 0 and the second number is greater than or equal to a first bandwidth byte number required by the first request, executing a first operation corresponding to the first request.
Therefore, by the data control method and the related device, the read-write frequency resources and the bandwidth resources can be reasonably distributed according to the flow type, so that the resource distribution is reasonable, the situation that when a plurality of requests are received, the resources of part of the requests are occupied, the waiting time is too long, the user use experience is further improved, in addition, the first quantity of the first tokens distributed to the first token bucket and the second quantity of the second tokens distributed to the second token bucket can be adjusted in real time, and the resource distribution precision is improved.
The above-described embodiments may be implemented in whole or in part by software, hardware, firmware, or any combination thereof. When implemented in software, the above-described embodiments may be implemented in whole or in part in the form of a computer program product. The computer program product includes one or more computer instructions or computer programs. The procedures or functions according to the embodiments of the present application are wholly or partially generated when the computer instructions or the computer program are loaded or executed on a computer. The computer may be a general purpose computer, a special purpose computer, a network of computers, or other programmable device. The computer instructions may be stored in a computer readable storage medium or transmitted from one computer readable storage medium to another computer readable storage medium, for example, the computer instructions may be transmitted from one website, computer, server, or data center to another website, computer, server, or data center by wire or wirelessly. The computer-readable storage medium can be any available medium that can be accessed by a computer or a data storage device, such as a server, data center, etc., that contains one or more collections of available media. The usable medium may be a magnetic medium (e.g., floppy disk, hard disk, magnetic tape), an optical medium (e.g., DVD), or a semiconductor medium. The semiconductor medium may be a solid state disk.
Embodiments of the present application also provide a computer storage medium, where the computer storage medium stores a computer program for electronic data exchange, the computer program enabling a computer to execute part or all of the steps of any one of the methods described in the above method embodiments, and the computer includes an electronic device.
Embodiments of the present application also provide a computer program product, which includes a computer program operable to cause a computer to perform some or all of the steps of any one of the methods as set forth in the above method embodiments.
The computer program product may be a software installation package, the computer comprising an electronic device.
It should be understood that, in the various embodiments of the present application, the sequence numbers of the above-mentioned processes do not imply any order of execution, and the order of execution of the processes should be determined by their functions and inherent logic, and should not constitute any limitation to the implementation process of the embodiments of the present application.
In the several embodiments provided in the present application, it should be understood that the disclosed method, apparatus, and system may be implemented in other ways. For example, the above-described apparatus embodiments are merely illustrative; for example, the division of the unit is only a logic function division, and there may be another division manner in actual implementation; for example, various elements or components may be combined or may be integrated into another system, or some features may be omitted, or not implemented. In addition, the shown or discussed mutual coupling or direct coupling or communication connection may be an indirect coupling or communication connection through some interfaces, devices or units, and may be in an electrical, mechanical or other form.
The units described as separate parts may or may not be physically separate, and parts displayed as units may or may not be physical units, may be located in one position, or may be distributed on multiple network units. Some or all of the units can be selected according to actual needs to achieve the purpose of the solution of the embodiment.
In addition, functional units in the embodiments of the present invention may be integrated into one processing unit, or each unit may be physically included alone, or two or more units may be integrated into one unit. The integrated unit can be realized in a form of hardware, or in a form of hardware plus a software functional unit.
The integrated unit implemented in the form of a software functional unit may be stored in a computer readable storage medium. The software functional unit is stored in a storage medium and includes several instructions for causing a computer device (which may be a personal computer, a server, or a network device) to execute some steps of the methods according to the embodiments of the present invention. And the aforementioned storage medium includes: various media capable of storing program codes, such as a usb disk, a removable hard disk, a Read-Only Memory (ROM), a Random Access Memory (RAM), a magnetic disk, or an optical disk.
Although the present invention is disclosed above, the present invention is not limited thereto. Any person skilled in the art can easily think of changes or substitutions without departing from the spirit and scope of the invention, and all changes and modifications can be made, including different combinations of functions, implementation steps, software and hardware implementations, all of which are included in the scope of the invention.
Claims (10)
1. A data control method, comprising:
when a first request is received, determining the traffic type of the first request;
determining a first token bucket and a second token bucket according to the traffic type, wherein the first token bucket comprises a first quantity of first tokens, the second token bucket comprises a second quantity of second tokens, the first token bucket is used for allocating read-write frequency resources for the first request, and the second token bucket is used for allocating bandwidth resources for the first request;
when the first number is not 0 and the second number is greater than or equal to a first bandwidth byte number required by the first request, executing a first operation corresponding to the first request.
2. The method of claim 1, wherein after determining the first token bucket and the second token bucket based on the traffic type, the method further comprises:
when the first number is 0, adding the first request to a first wait queue until the first number is not 0.
3. The method of claim 1, wherein after determining the first token bucket and the second token bucket based on the traffic type, the method further comprises:
when the first number is not 0 and the second number is less than the first number of bandwidth bytes needed by the first request, adding the first request to a second wait queue until the second number conforms to the first number of bandwidth bytes.
4. The method of claim 1, wherein prior to determining the first token bucket and the second token bucket based on the traffic type, the method further comprises:
determining a first token release number in a preset period and a second token release number in the preset period according to a real-time flow value;
configuring the first tokens of the first token bucket according to the first token throw number, and configuring the second tokens of a second token bucket according to the second token throw number, where the first token throw number is an initial value of the first number, the second token throw number is an initial value of the second number, an actual value of the first number is inversely proportional to the received request number in the preset period, and an actual value of the second number is inversely proportional to the received request number in the preset period.
5. The method according to claim 4, wherein determining a first number of token impressions over a preset period and a second number of token impressions over the preset period based on a real-time traffic value comprises:
determining a first initial token release number and a second initial token release number corresponding to the traffic type;
and when the real-time flow value is smaller than a preset flow threshold value, taking the first initial token throwing number as the first token throwing number, and taking the second initial token throwing number as the second token throwing number.
6. The method of claim 5, wherein after determining a first initial number of token impressions and a second initial number of token impressions corresponding to the traffic type, the method further comprises:
when the real-time flow value is larger than or equal to the preset flow threshold value, adjusting the first initial token throwing amount according to a first preset proportion corresponding to the flow type, and adjusting the second initial token throwing amount according to a second preset proportion corresponding to the flow type.
7. The method of claim 6, further comprising:
when the traffic type of the first request is a service traffic type, the first preset proportion corresponding to the traffic type is greater than or equal to 0, and the second preset proportion is greater than or equal to 0.
8. A data control apparatus, comprising:
the device comprises a first determining unit, a second determining unit and a processing unit, wherein the first determining unit is used for determining the traffic type of a first request when the first request is received;
a second determining unit, configured to determine a first token bucket and a second token bucket according to the traffic type, where the first token bucket includes a first number of first tokens, the second token bucket includes a second number of second tokens, the first token bucket is configured to allocate read-write frequency resources for the first request, and the second token bucket is configured to allocate bandwidth resources for the first request;
and the execution unit is used for executing a first operation corresponding to the first request when the first number is not 0 and the second number is greater than or equal to a first bandwidth byte number required by the first request.
9. An electronic device, comprising: a processor, memory, and one or more programs; the one or more programs stored in the memory and configured to be executed by the processor, the programs comprising instructions for performing the steps in the method of any of claims 1-7.
10. A computer-readable storage medium, characterized in that a computer program for electronic data exchange is stored, wherein the computer program causes a computer to perform the method according to any one of claims 1-7.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202211006377.9A CN115378879A (en) | 2022-08-22 | 2022-08-22 | Data control method and related device |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202211006377.9A CN115378879A (en) | 2022-08-22 | 2022-08-22 | Data control method and related device |
Publications (1)
| Publication Number | Publication Date |
|---|---|
| CN115378879A true CN115378879A (en) | 2022-11-22 |
Family
ID=84068394
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN202211006377.9A Pending CN115378879A (en) | 2022-08-22 | 2022-08-22 | Data control method and related device |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN115378879A (en) |
Cited By (1)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN116431327A (en) * | 2023-03-06 | 2023-07-14 | 钛信(上海)信息科技有限公司 | Task current limiting processing method and fort machine |
Citations (12)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| KR20060032741A (en) * | 2004-10-13 | 2006-04-18 | 한국전자통신연구원 | A method for allocating effective bandwidth according to qos requirement of each traffic, and a system therefore |
| CN104125006A (en) * | 2014-07-28 | 2014-10-29 | 大连大学 | Satellite communication network bandwidth distributing method |
| CN107276827A (en) * | 2017-07-25 | 2017-10-20 | 郑州云海信息技术有限公司 | Qos implementation method and device in a kind of distributed memory system |
| CN107948090A (en) * | 2017-11-23 | 2018-04-20 | 郑州云海信息技术有限公司 | A kind of band width control method and device of Ceph storage clusters volume |
| CN108804043A (en) * | 2018-06-26 | 2018-11-13 | 郑州云海信息技术有限公司 | Distributed block storage system bandwidth traffic control method, device, equipment and medium |
| CN110545246A (en) * | 2018-05-29 | 2019-12-06 | 北京京东尚科信息技术有限公司 | Token bucket-based current limiting method and device |
| CN110661824A (en) * | 2018-06-28 | 2020-01-07 | 阿里巴巴集团控股有限公司 | Flow regulation and control method and device for servers in distributed cluster |
| CN111290701A (en) * | 2018-12-10 | 2020-06-16 | 杭州朗和科技有限公司 | Data read-write control method, device, medium and electronic equipment |
| CN112615793A (en) * | 2020-11-26 | 2021-04-06 | 新华三大数据技术有限公司 | Data current limiting method and device |
| CN112805971A (en) * | 2019-01-07 | 2021-05-14 | 华为技术有限公司 | Traffic shaping method and related equipment |
| CN113938435A (en) * | 2021-08-30 | 2022-01-14 | 奇安信科技集团股份有限公司 | Data transmission method, data transmission device, electronic device, storage medium, and program product |
| CN114666284A (en) * | 2022-05-23 | 2022-06-24 | 阿里巴巴（中国）有限公司 | Flow control method and device, electronic equipment and readable storage medium |
-
2022
- 2022-08-22 CN CN202211006377.9A patent/CN115378879A/en active Pending
Patent Citations (12)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| KR20060032741A (en) * | 2004-10-13 | 2006-04-18 | 한국전자통신연구원 | A method for allocating effective bandwidth according to qos requirement of each traffic, and a system therefore |
| CN104125006A (en) * | 2014-07-28 | 2014-10-29 | 大连大学 | Satellite communication network bandwidth distributing method |
| CN107276827A (en) * | 2017-07-25 | 2017-10-20 | 郑州云海信息技术有限公司 | Qos implementation method and device in a kind of distributed memory system |
| CN107948090A (en) * | 2017-11-23 | 2018-04-20 | 郑州云海信息技术有限公司 | A kind of band width control method and device of Ceph storage clusters volume |
| CN110545246A (en) * | 2018-05-29 | 2019-12-06 | 北京京东尚科信息技术有限公司 | Token bucket-based current limiting method and device |
| CN108804043A (en) * | 2018-06-26 | 2018-11-13 | 郑州云海信息技术有限公司 | Distributed block storage system bandwidth traffic control method, device, equipment and medium |
| CN110661824A (en) * | 2018-06-28 | 2020-01-07 | 阿里巴巴集团控股有限公司 | Flow regulation and control method and device for servers in distributed cluster |
| CN111290701A (en) * | 2018-12-10 | 2020-06-16 | 杭州朗和科技有限公司 | Data read-write control method, device, medium and electronic equipment |
| CN112805971A (en) * | 2019-01-07 | 2021-05-14 | 华为技术有限公司 | Traffic shaping method and related equipment |
| CN112615793A (en) * | 2020-11-26 | 2021-04-06 | 新华三大数据技术有限公司 | Data current limiting method and device |
| CN113938435A (en) * | 2021-08-30 | 2022-01-14 | 奇安信科技集团股份有限公司 | Data transmission method, data transmission device, electronic device, storage medium, and program product |
| CN114666284A (en) * | 2022-05-23 | 2022-06-24 | 阿里巴巴（中国）有限公司 | Flow control method and device, electronic equipment and readable storage medium |
Cited By (2)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN116431327A (en) * | 2023-03-06 | 2023-07-14 | 钛信(上海)信息科技有限公司 | Task current limiting processing method and fort machine |
| CN116431327B (en) * | 2023-03-06 | 2023-11-07 | 钛信(上海)信息科技有限公司 | Task current limiting processing method and fort machine |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN108667748B (en) | Method, device, equipment and storage medium for controlling bandwidth | |
| CN112363813A (en) | Resource scheduling method and device, electronic equipment and computer readable medium | |
| WO2020019743A1 (en) | Traffic control method and device | |
| CN111147395B (en) | Network resource adjusting method and device | |
| CN112445857A (en) | Resource quota management method and device based on database | |
| WO2024016596A1 (en) | Container cluster scheduling method and apparatus, device, and storage medium | |
| WO2020134133A1 (en) | Resource allocation method, substation, and computer-readable storage medium | |
| CN115102908B (en) | Method for generating network message based on bandwidth control and related device | |
| CN112749002A (en) | Method and device for dynamically managing cluster resources | |
| CN115629865B (en) | Deep learning inference task scheduling method based on edge calculation | |
| WO2023226948A1 (en) | Traffic control method and apparatus, electronic device and readable storage medium | |
| CN112214313A (en) | Memory allocation method and related equipment | |
| CN110267276A (en) | Network splitting and disposing method and device | |
| CN115378879A (en) | Data control method and related device | |
| JP2023543744A (en) | Resource scheduling method, system, electronic device and computer readable storage medium | |
| CN115017030A (en) | Resource allocation method, device, electronic equipment and storage medium | |
| CN111190719A (en) | Method, device, medium and electronic equipment for optimizing cluster resource allocation | |
| CN109783236A (en) | Method and apparatus for output information | |
| CN112286930A (en) | Method, device, storage medium and electronic equipment for resource sharing of redis business side | |
| CN114745338A (en) | Flow control method, flow control device, storage medium and server | |
| CN115766582A (en) | Flow control method, device and system, medium and computer equipment | |
| CN117056064A (en) | Resource allocation method, device, server, storage medium and program product | |
| CN108536854A (en) | The method, apparatus and computer readable storage medium of data interaction | |
| CN114374657A (en) | Data processing method and device | |
| CN114138427A (en) | SLO guarantee method, SLO guarantee device, node, and storage medium |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| PB01 | Publication | ||
| PB01 | Publication | ||
| SE01 | Entry into force of request for substantive examination | ||
| SE01 | Entry into force of request for substantive examination |