CN111083063A - Method and device for dynamically adjusting down-pressure - Google Patents
Method and device for dynamically adjusting down-pressure Download PDFInfo
- Publication number
- CN111083063A CN111083063A CN201911157226.1A CN201911157226A CN111083063A CN 111083063 A CN111083063 A CN 111083063A CN 201911157226 A CN201911157226 A CN 201911157226A CN 111083063 A CN111083063 A CN 111083063A
- Authority
- CN
- China
- Prior art keywords
- downstream
- receiving time
- time
- concurrency number
- receiving
- 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.)
- Granted
Links
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/25—Flow control; Congestion control with rate being modified by the source upon detecting a change of network conditions
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L43/00—Arrangements for monitoring or testing data switching networks
- H04L43/08—Monitoring or testing based on specific metrics, e.g. QoS, energy consumption or environmental parameters
- H04L43/0876—Network utilisation, e.g. volume of load or congestion level
- H04L43/0888—Throughput
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L43/00—Arrangements for monitoring or testing data switching networks
- H04L43/16—Threshold monitoring
-
- 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/26—Flow control; Congestion control using explicit feedback to the source, e.g. choke packets
- H04L47/263—Rate modification at the source after receiving feedback
-
- 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/29—Flow control; Congestion control using a combination of thresholds
-
- Y—GENERAL TAGGING OF NEW TECHNOLOGICAL DEVELOPMENTS; GENERAL TAGGING OF CROSS-SECTIONAL TECHNOLOGIES SPANNING OVER SEVERAL SECTIONS OF THE IPC; TECHNICAL SUBJECTS COVERED BY FORMER USPC CROSS-REFERENCE ART COLLECTIONS [XRACs] AND DIGESTS
- Y02—TECHNOLOGIES OR APPLICATIONS FOR MITIGATION OR ADAPTATION AGAINST CLIMATE CHANGE
- Y02D—CLIMATE CHANGE MITIGATION TECHNOLOGIES IN INFORMATION AND COMMUNICATION TECHNOLOGIES [ICT], I.E. INFORMATION AND COMMUNICATION TECHNOLOGIES AIMING AT THE REDUCTION OF THEIR OWN ENERGY USE
- Y02D10/00—Energy efficient computing, e.g. low power processors, power management or thermal management
Landscapes
- Engineering & Computer Science (AREA)
- Computer Networks & Wireless Communication (AREA)
- Signal Processing (AREA)
- Environmental & Geological Engineering (AREA)
- Management, Administration, Business Operations System, And Electronic Commerce (AREA)
Abstract
The application provides a method and a system for dynamically adjusting down-sending pressure, wherein the method comprises the steps of sending data to downstream according to a first concurrency number, and acquiring first downstream receiving time; sending data to downstream according to a second concurrency number to obtain second downstream receiving time; determining a rate of change of a second receive time relative to the first receive time; adjusting the concurrency number according to the change rate, and calculating an issuing upper limit and an issuing lower limit; and adjusting the issued concurrency number according to the issued upper limit and the issued lower limit. The upstream issuing system can automatically determine the upper and lower limits of the receiving capacity of each downstream, thereby greatly reducing the risk that the receiving capacity originally submitted to the upstream becomes smaller due to a plurality of uncertainties of the downstream and the upstream system collapses, and greatly improving the data issuing capacity.
Description
Technical Field
The present application relates to the field of data communication technologies, and in particular, to a method and an apparatus for dynamically adjusting a delivery pressure.
Background
The e-commerce platform generally accesses a plurality of downstream systems, each system has a strong and weak capability of receiving information, and a general sending system has the following problems:
1. no distinction is made between systems;
2. in the same system, the ability to receive messages varies from time to time;
3. the information receiving capacity of each access enterprise is unclear;
4. there is also no place to acquire the receiving capability of the downstream system;
5. when a large flow impacts, the impact is directly sent to the downstream, so that the downstream system is rushed.
In view of the above, it is necessary to design a scientific message issuing method.
Disclosure of Invention
In order to solve at least one of the above technical problems, the present application provides a method and an apparatus for dynamically adjusting a down pressure. And dynamically recording and adjusting the sending pressure in the sending process of the sending end according to the message receiving capacity of the downstream system at different time intervals.
In a first aspect of the present application, a method for dynamically adjusting a down pressure includes: sending data to downstream according to a first concurrency number to acquire downstream first receiving time; sending data to downstream according to a second concurrency number, and acquiring second downstream receiving time, wherein the second concurrency number is larger than the first concurrency number; determining a rate of change of a second receive time relative to the first receive time; adjusting the concurrency number according to the change rate, recalculating the change rate of new receiving time and last receiving time until the change rate is lower than and closest to a maximum allowable threshold, and setting the corresponding concurrency number as an issuing upper limit; continuously adjusting the concurrency number, recalculating the change rate of the new receiving time and the last receiving time until the change rate is lower than and closest to the minimum allowable threshold, and setting the corresponding concurrency number as a lower issuing limit; and adjusting the issued concurrency number according to the issued upper limit and the issued lower limit.
Preferably, the acquiring a downstream first reception time includes: sending data to downstream for a plurality of times according to the first concurrency number, and taking the average value of downstream receiving time as the downstream first receiving time; the obtaining a downstream first receive time comprises: and the second receiving time calculation unit is used for sending the data to the downstream for a plurality of times according to the second concurrency number and taking the average value of the downstream receiving time as the downstream second receiving time.
Preferably, adjusting the concurrency number according to the change rate comprises: increasing the number of concurrencies by a first step length until the change rate of the new receiving time and the last receiving time exceeds a maximum allowable threshold; and reducing the number of concurrencies by a second step size until the rate of change of the new reception time from the last reception time is below the maximum allowable threshold, the second step size being smaller than the second step size.
Preferably, the continuously adjusting the concurrency number comprises: continuing to reduce the number of concurrencies by the second step size until the rate of change of the new reception time from the last reception time is below the minimum allowable threshold.
Preferably, before transmitting data downstream by the first parallel number, the method includes: for each downstream system, acquiring the upper and lower limits of the receiving capacity of the downstream system in the storage system at the current time interval, and if the upper and lower limits of the receiving capacity of the downstream system at the current time interval exist, directly issuing data according to the upper and lower limits of the receiving capacity of the downstream system at the current time interval; if not, the lower issuing limit and the upper issuing limit of the downstream system are calculated and stored as the upper and lower receiving capacity limits of the downstream system in the current time period.
In a second aspect of the present application, a device for dynamically adjusting delivery pressure includes: the first receiving time acquisition module is used for sending data to the downstream according to the first parallel number and acquiring the first receiving time of the downstream; a second receiving time obtaining module, configured to send data to downstream according to a second concurrency number, and obtain a second receiving time of the downstream, where the second concurrency number is greater than the first concurrency number; a rate of change determination module to determine a rate of change of a second receive time relative to the first receive time; the upper limit issuing determining module is used for adjusting the concurrency number according to the change rate, recalculating the change rate of new receiving time and last receiving time until the change rate is lower than and closest to a maximum allowable threshold value, and setting the corresponding concurrency number at the moment as an upper limit issuing; the sending lower limit determining module is used for continuously adjusting the concurrency number, recalculating the change rate of the new receiving time and the last receiving time until the change rate is lower than and closest to the minimum allowable threshold value, and setting the corresponding concurrency number at the moment as a sending lower limit; and the concurrency number adjusting module is used for adjusting the issued concurrency number according to the issuing upper limit and the issuing lower limit.
Preferably, the first reception time acquiring module includes: the first receiving time calculation unit is used for sending data to downstream for a plurality of times according to the first concurrency number and taking the average value of the downstream receiving time as the downstream first receiving time; the second reception time acquisition module includes: and the second receiving time calculation unit is used for sending the data to the downstream for a plurality of times according to the second concurrency number and taking the average value of the downstream receiving time as the downstream second receiving time.
Preferably, the issuing upper limit determining module includes: an upward adjustment unit, configured to increase the number of concurrencies by a first step length until a change rate between a new reception time and a last reception time exceeds a maximum allowable threshold; and a first downward adjustment unit for decreasing the number of concurrencies by a second step size until a rate of change of a new reception time from a last reception time is lower than the maximum allowable threshold, the second step size being smaller than the second step size.
Preferably, the lower limit issuing determination module includes: and the second downward adjustment unit is used for continuously reducing the concurrency number according to the second step length until the change rate of the new receiving time and the last receiving time is lower than the minimum allowable threshold value.
Preferably, the system further comprises a query and record module, configured to, before sending data downstream according to the first parallel number, acquire, for each downstream system, an upper and lower limit of a receiving capability of the downstream system in the storage system in the current time period, and if the upper and lower limits of the receiving capability of the downstream system in the current time period exist, directly issue the data according to the upper and lower limits of the receiving capability of the downstream system in the current time period; if not, the lower issuing limit and the upper issuing limit of the downstream system are calculated and stored as the upper and lower receiving capacity limits of the downstream system in the current time period.
The upstream issuing system can automatically determine the upper and lower limits of the receiving capacity of each downstream, thereby greatly reducing the risk that the receiving capacity originally submitted to the upstream becomes smaller due to a plurality of uncertainties of the downstream and the upstream system collapses, and greatly improving the data issuing capacity.
Drawings
Fig. 1 is a flowchart of a preferred embodiment of the method for dynamically adjusting the down pressure according to the present application.
Fig. 2 is a flow chart of another preferred embodiment of the method for dynamically adjusting the down pressure according to the present application.
Fig. 3 is an architecture diagram of a preferred embodiment of the apparatus for dynamically adjusting the delivery pressure according to the present application.
Detailed Description
In order to make the implementation objects, technical solutions and advantages of the present application clearer, the technical solutions in the embodiments of the present application will be described in more detail below with reference to the accompanying drawings in the embodiments of the present application. In the drawings, the same or similar reference numerals denote the same or similar elements or elements having the same or similar functions throughout. The described embodiments are some, but not all embodiments of the present application. The embodiments described below with reference to the drawings are exemplary and intended to be used for explaining the present application, and should not be construed as limiting the present application. All other embodiments obtained by a person of ordinary skill in the art without any inventive work based on the embodiments in the present application are within the scope of protection of the present application. Embodiments of the present application will be described in detail below with reference to the drawings.
According to a first aspect of the present application, a method for dynamically adjusting a down pressure, as shown in fig. 1, mainly includes:
step S1, data is sent downstream by the first concurrency number, and a downstream first reception time is obtained. For example, if the initial number of concurrency is 5, data is transmitted downstream in accordance with the number of concurrency.
Step S2, sending data to the downstream according to a second concurrency number, which is greater than the first concurrency number and is, for example, 20, and obtaining a second receiving time of the downstream.
And step S3, determining the change rate of the second receiving time relative to the first receiving time.
And step S4, adjusting the concurrency number according to the change rate, recalculating the change rate of the new receiving time and the last receiving time until the change rate is lower than and closest to the maximum allowable threshold, and setting the corresponding concurrency number as the issuing upper limit.
In this step, the percentage change is (last time average-last time average)/last time average 100%.
And step S5, continuing to adjust the concurrency number, recalculating the change rate of the new receiving time and the last receiving time until the change rate is lower than and closest to the minimum allowable threshold, and setting the corresponding concurrency number as a lower issuing limit.
In steps S4 and S5, the maximum allowable threshold and the minimum allowable threshold that are closest to each other among the plurality of rates of change calculated by changing the number of concurrences are set as the maximum allowable threshold and the minimum allowable threshold
And step S6, adjusting the issued concurrency number according to the issued upper limit and the issued lower limit.
In some optional embodiments, said obtaining a downstream first receive time comprises: sending data downstream for a plurality of times, for example 100 times, according to the first concurrency number, and taking the average value of the downstream receiving time as the downstream first receiving time;
the obtaining a downstream first receive time comprises: and the second receiving time calculation unit is used for sending the data to the downstream for a plurality of times according to the second concurrency number and taking the average value of the downstream receiving time as the downstream second receiving time.
In some alternative embodiments, adjusting the concurrency number according to the rate of change comprises:
increasing the number of concurrencies by a first step length until the change rate of the new receiving time and the last receiving time exceeds a maximum allowable threshold; and reducing the number of concurrencies by a second step size until the rate of change of the new reception time from the last reception time is below the maximum allowable threshold, the second step size being smaller than the second step size.
In some optional embodiments, said continuing to adjust said concurrency number comprises:
continuing to reduce the number of concurrencies by the second step size until the rate of change of the new reception time from the last reception time is below the minimum allowable threshold.
In some optional embodiments, before sending data downstream in the first concurrent number, the method further includes: for each downstream system, acquiring the upper and lower limits of the receiving capacity of the downstream system in the storage system at the current time interval, and if the upper and lower limits of the receiving capacity of the downstream system at the current time interval exist, directly issuing data according to the upper and lower limits of the receiving capacity of the downstream system at the current time interval; if not, the lower issuing limit and the upper issuing limit of the downstream system are calculated and stored as the upper and lower receiving capacity limits of the downstream system in the current time period.
Fig. 2 shows a specific flowchart of the above two embodiments, including:
p1, the issuing platform prepares to issue data;
p2, acquiring information of each downstream receiving system;
p3, traversing each receiving system;
p4, obtaining the upper and lower limits of the receiving ability of the system in different time periods from a storage system (such as db), if not, entering a next process;
p5, sending data downstream according to the minimum concurrency number, wherein the default minimum concurrency number is 5;
p6, recording the receiving time of each time downstream, and calculating the average value after a certain number of times, for example, after 100 times;
p7, increase the number of concurrency (the number of concurrency can be a little larger at the beginning, for example 20, and can be gradually reduced later);
p8, recording the receiving time of each time downstream, and calculating the average value after a certain number of times, for example, after 100 times;
p9, determine whether the percentage of change in the mean value of the reception time 2 times before and after exceeds the maximum allowable threshold?
Percent change (last time average-last time average)/last time average 100%
The allowable threshold may be set by the system, for example, 30% or less for a system with high response requirement, or 100% or less for a system with low requirement.
P10, if not, jumping to step P7;
p11, otherwise, the number of concurrences is reduced, and in order to prevent too fast reduction and miss of the optimal value, the number can be reduced by 2-5 at a time;
p12, recording the receiving time of each time downstream again, and calculating the average value after a certain number of times, for example, after 100 times;
p13, determine whether the percentage of change in the mean value of the reception time 2 times before and after exceeds the maximum allowable threshold?
P14, if the allowable threshold is exceeded, jump to P11;
p15, if not exceeding, marking the concurrence number as the down limit;
p16, continue to decrease the number of concurrencies;
p17, recording the receiving time of each time downstream, and calculating the average value after a certain number of times, for example, after 100 times;
p18, determine whether the percentage of change in the mean value of the reception time 2 times before and after exceeds the minimum allowable threshold?
P19, if exceeding, jumping to step P16;
p20, if not exceeding, marking the concurrence number as the lower issuing limit;
p21, recording the maximum receiving capacity of the downstream system;
p22, but also does the receiving system need to determine the concurrency number and the down-sending frequency? If yes, jumping to the step P3;
p23, otherwise, ends.
It should be noted that, due to the complex environment of the downstream system, for example, for a small enterprise, in addition to deploying the receiving program, other operating systems may be deployed on one machine, and these operating systems may have moving working hours, for example, there may be working hours in the daytime, these operating systems are busy, the occupied machine resources such as cpu are high, and other times are idle, which results in obvious changes of the processing capacity of the receiving system in different time periods.
For the above reasons, the upstream sending system may run the first part of the process periodically (e.g. every hour), so that the law of the receiving capability of each downstream system can be detected and determined.
In addition, the method further includes a step of dynamically correcting data, for example, after every set number of days, the method performs delivery pressure adjustment on all downstream systems according to the method of dynamically adjusting delivery pressure in steps S1-S6, and the downstream systems are warehoused again.
A second aspect of the present application provides a device for dynamically adjusting delivery pressure, including:
the first receiving time acquisition module is used for sending data to the downstream according to the first parallel number and acquiring the first receiving time of the downstream;
a second receiving time obtaining module, configured to send data to downstream according to a second concurrency number, and obtain a second receiving time of the downstream, where the second concurrency number is greater than the first concurrency number;
a rate of change determination module to determine a rate of change of a second receive time relative to the first receive time;
the upper limit issuing determining module is used for adjusting the concurrency number according to the change rate, recalculating the change rate of new receiving time and last receiving time until the change rate is lower than and closest to a maximum allowable threshold value, and setting the corresponding concurrency number at the moment as an upper limit issuing;
the sending lower limit determining module is used for continuously adjusting the concurrency number, recalculating the change rate of the new receiving time and the last receiving time until the change rate is lower than and closest to the minimum allowable threshold value, and setting the corresponding concurrency number at the moment as a sending lower limit; and
and the concurrency number adjusting module is used for adjusting the issued concurrency number according to the issuing upper limit and the issuing lower limit.
In some optional embodiments, the first reception time acquiring module includes:
the first receiving time calculation unit is used for sending data to downstream for a plurality of times according to the first concurrency number and taking the average value of the downstream receiving time as the downstream first receiving time;
the second reception time acquisition module includes:
and the second receiving time calculation unit is used for sending the data to the downstream for a plurality of times according to the second concurrency number and taking the average value of the downstream receiving time as the downstream second receiving time.
In some optional embodiments, the issuing upper limit determining module includes:
an upward adjustment unit, configured to increase the number of concurrencies by a first step length until a change rate between a new reception time and a last reception time exceeds a maximum allowable threshold; and
and the first downward adjustment unit is used for reducing the concurrency number according to a second step length until the change rate of the new receiving time and the last receiving time is lower than the maximum allowable threshold value, and the second step length is smaller than the second step length.
In some optional embodiments, the lower issuing lower limit determining module includes:
and the second downward adjustment unit is used for continuously reducing the concurrency number according to the second step length until the change rate of the new receiving time and the last receiving time is lower than the minimum allowable threshold value.
In some optional embodiments, the system further includes a query and record module, configured to, before sending data downstream according to the first parallel number, acquire, for each downstream system, an upper and lower limit of a receiving capability of the downstream system in the current time period in the storage system, and if the upper and lower limits of the receiving capability of the downstream system in the current time period exist, directly issue the data according to the upper and lower limits of the receiving capability of the downstream system in the current time period; if not, the lower issuing limit and the upper issuing limit of the downstream system are calculated and stored as the upper and lower receiving capacity limits of the downstream system in the current time period.
The upstream issuing system can automatically determine the upper and lower limits of the receiving capacity of each downstream, thereby greatly reducing the risk that the receiving capacity originally submitted to the upstream becomes smaller due to a plurality of uncertainties of the downstream and the upstream system collapses, and greatly improving the data issuing capacity.
In particular, according to embodiments of the present application, the processes described above with reference to the flowcharts may be implemented as computer software programs. For example, embodiments of the present application include a computer program product comprising a computer program embodied on a computer readable medium, the computer program comprising program code for performing the method illustrated by the flow chart. The computer storage media of the present application may be computer-readable signal media or computer-readable storage media or any combination of the two. A computer readable storage medium may be, for example, but not limited to, an electronic, magnetic, optical, electromagnetic, infrared, or semiconductor system, apparatus, or device, or any combination of the foregoing. More specific examples of the computer readable storage medium may include, but are not limited to: an electrical connection having one or more wires, a portable computer diskette, a hard disk, a Random Access Memory (RAM), a read-only memory (ROM), an erasable programmable read-only memory (EPROM or flash memory), an optical fiber, a portable compact disc read-only memory (CD-ROM), an optical storage device, a magnetic storage device, or any suitable combination of the foregoing.
It should be appreciated that in accordance with embodiments of the present application, the apparatus described above is generally configured as a computer server capable of interacting with downstream clients, and that in the present application, the computer readable storage medium may be any tangible medium that can contain, or store a program for use by or in connection with an instruction execution system, apparatus, or device. In this application, however, a computer readable signal medium may include a propagated data signal with computer readable program code embodied therein, for example, in baseband or as part of a carrier wave. Such a propagated data signal may take many forms, including, but not limited to, electro-magnetic, optical, or any suitable combination thereof. A computer readable signal medium may also be any computer readable medium that is not a computer readable storage medium and that can communicate, propagate, or transport a program for use by or in connection with an instruction execution system, apparatus, or device. Program code embodied on a computer readable medium may be transmitted using any appropriate medium, including but not limited to: wireless, wire, fiber optic cable, RF, etc., or any suitable combination of the foregoing.
The flowchart and block diagrams in the figures illustrate the architecture, functionality, and operation of possible implementations of systems, methods and computer program products according to various embodiments of the present application. In this regard, each block in the flowchart or block diagrams may represent a module, segment, or portion of code, which comprises one or more executable instructions for implementing the specified logical function(s). It should also be noted that, in some alternative implementations, the functions noted in the block may occur out of the order noted in the figures. For example, two blocks shown in succession may, in fact, be executed substantially concurrently, or the blocks may sometimes be executed in the reverse order, depending upon the functionality involved. It will also be noted that each block of the block diagrams and/or flowchart illustration, and combinations of blocks in the block diagrams and/or flowchart illustration, can be implemented by special purpose hardware-based systems which perform the specified functions or acts, or combinations of special purpose hardware and computer instructions.
The modules or units described in the embodiments of the present application may be implemented by software or hardware. The modules or units described may also be provided in a processor, the names of which in some cases do not constitute a limitation of the module or unit itself.
The above description is only for the specific embodiments of the present application, but the scope of the present application is not limited thereto, and any changes or substitutions that can be easily conceived by those skilled in the art within the technical scope of the present application should be covered within the scope of the present application. Therefore, the protection scope of the present application shall be subject to the protection scope of the claims.
Claims (10)
1. A method for dynamically adjusting down pressure, comprising:
sending data to downstream according to a first concurrency number to acquire downstream first receiving time;
sending data to downstream according to a second concurrency number, and acquiring second downstream receiving time, wherein the second concurrency number is larger than the first concurrency number;
determining a rate of change of a second receive time relative to the first receive time;
adjusting the concurrency number according to the change rate, recalculating the change rate of new receiving time and last receiving time until the change rate is lower than and closest to a maximum allowable threshold, and setting the corresponding concurrency number as an issuing upper limit;
continuously adjusting the concurrency number, recalculating the change rate of the new receiving time and the last receiving time until the change rate is lower than and closest to the minimum allowable threshold, and setting the corresponding concurrency number as a lower issuing limit; and
and adjusting the issued concurrency number according to the issued upper limit and the issued lower limit.
2. The method of dynamically adjusting down pressure as set forth in claim 1, wherein said obtaining a downstream first receive time comprises: sending data to downstream for a plurality of times according to the first concurrency number, and taking the average value of downstream receiving time as the downstream first receiving time;
the obtaining a downstream first receive time comprises: and the second receiving time calculation unit is used for sending the data to the downstream for a plurality of times according to the second concurrency number and taking the average value of the downstream receiving time as the downstream second receiving time.
3. The method of dynamically adjusting down pressure as recited in claim 1, wherein adjusting the concurrency number as a function of the rate of change comprises:
increasing the number of concurrencies by a first step length until the change rate of the new receiving time and the last receiving time exceeds a maximum allowable threshold; and
reducing the number of concurrencies by a second step size until the rate of change of the new reception time from the last reception time is below the maximum allowable threshold, the second step size being smaller than the second step size.
4. The method of dynamically adjusting down pressure as recited in claim 3, wherein said continuing to adjust said concurrency number comprises:
continuing to reduce the number of concurrencies by the second step size until the rate of change of the new reception time from the last reception time is below the minimum allowable threshold.
5. The method of dynamically adjusting down pressure as set forth in claim 1, wherein prior to sending data downstream by the first number of concurrencies, comprising:
for each downstream system, acquiring the upper and lower limits of the receiving capacity of the downstream system in the storage system at the current time interval, and if the upper and lower limits of the receiving capacity of the downstream system at the current time interval exist, directly issuing data according to the upper and lower limits of the receiving capacity of the downstream system at the current time interval; if not, the lower issuing limit and the upper issuing limit of the downstream system are calculated and stored as the upper and lower receiving capacity limits of the downstream system in the current time period.
6. A device for dynamically adjusting down-sending pressure is characterized by comprising:
the first receiving time acquisition module is used for sending data to the downstream according to the first parallel number and acquiring the first receiving time of the downstream;
a second receiving time obtaining module, configured to send data to downstream according to a second concurrency number, and obtain a second receiving time of the downstream, where the second concurrency number is greater than the first concurrency number;
a rate of change determination module to determine a rate of change of a second receive time relative to the first receive time;
the upper limit issuing determining module is used for adjusting the concurrency number according to the change rate, recalculating the change rate of new receiving time and last receiving time until the change rate is lower than and closest to a maximum allowable threshold value, and setting the corresponding concurrency number at the moment as an upper limit issuing;
the sending lower limit determining module is used for continuously adjusting the concurrency number, recalculating the change rate of the new receiving time and the last receiving time until the change rate is lower than and closest to the minimum allowable threshold value, and setting the corresponding concurrency number at the moment as a sending lower limit; and
and the concurrency number adjusting module is used for adjusting the issued concurrency number according to the issuing upper limit and the issuing lower limit.
7. The apparatus for dynamically adjusting delivered pressure according to claim 6, wherein the first receiving time obtaining module comprises:
the first receiving time calculation unit is used for sending data to downstream for a plurality of times according to the first concurrency number and taking the average value of the downstream receiving time as the downstream first receiving time;
the second reception time acquisition module includes:
and the second receiving time calculation unit is used for sending the data to the downstream for a plurality of times according to the second concurrency number and taking the average value of the downstream receiving time as the downstream second receiving time.
8. The apparatus for dynamically adjusting delivered pressure according to claim 6, wherein the delivered upper limit determining module comprises:
an upward adjustment unit, configured to increase the number of concurrencies by a first step length until a change rate between a new reception time and a last reception time exceeds a maximum allowable threshold; and
and the first downward adjustment unit is used for reducing the concurrency number according to a second step length until the change rate of the new receiving time and the last receiving time is lower than the maximum allowable threshold value, and the second step length is smaller than the second step length.
9. The apparatus for dynamically adjusting delivered pressure according to claim 8, wherein the delivered lower limit determining module comprises:
and the second downward adjustment unit is used for continuously reducing the concurrency number according to the second step length until the change rate of the new receiving time and the last receiving time is lower than the minimum allowable threshold value.
10. The device for dynamically adjusting delivery pressure according to claim 6, further comprising an inquiry and recording module, configured to, before sending data downstream according to the first concurrency number, acquire, for each downstream system, an upper and lower limit of a receiving capability of the downstream system in the current time period in the storage system, and if the upper and lower limits of the receiving capability of the downstream system in the current time period exist, directly deliver the data according to the upper and lower limits of the receiving capability of the downstream system in the current time period; if not, the lower issuing limit and the upper issuing limit of the downstream system are calculated and stored as the upper and lower receiving capacity limits of the downstream system in the current time period.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201911157226.1A CN111083063B (en) | 2019-11-22 | 2019-11-22 | Method and device for dynamically adjusting down-pressure |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201911157226.1A CN111083063B (en) | 2019-11-22 | 2019-11-22 | Method and device for dynamically adjusting down-pressure |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN111083063A true CN111083063A (en) | 2020-04-28 |
| CN111083063B CN111083063B (en) | 2023-04-18 |
Family
ID=70311390
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201911157226.1A Active CN111083063B (en) | 2019-11-22 | 2019-11-22 | Method and device for dynamically adjusting down-pressure |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN111083063B (en) |
Citations (8)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US20090296670A1 (en) * | 2008-05-28 | 2009-12-03 | Microsoft Corporation | Pull-based data transmission approach |
| CN103391253A (en) * | 2013-08-05 | 2013-11-13 | 四川启程科技发展有限公司 | Method, device and system for controlling network congestion |
| CN103617024A (en) * | 2013-11-07 | 2014-03-05 | 华为技术有限公司 | Concurrent-data processing method, concurrent-data processing device and concurrent-data system |
| CN104408088A (en) * | 2014-11-11 | 2015-03-11 | 北京奇虎科技有限公司 | Control method and device for concurrent requests |
| US20150350049A1 (en) * | 2014-05-27 | 2015-12-03 | Huawei Technologies Co., Ltd. | Method and device for generating cnm |
| CN105718474A (en) * | 2014-12-03 | 2016-06-29 | 阿里巴巴集团控股有限公司 | Method and device for controlling concurrent operation of MySQL database |
| CN106330757A (en) * | 2015-06-30 | 2017-01-11 | 腾讯科技（深圳）有限公司 | Traffic control method and apparatus |
| CN109905326A (en) * | 2019-03-26 | 2019-06-18 | 武汉大学 | A kind of rate drawdown parameter optimization method based on the Congestion Level SPCC factor |
-
2019
- 2019-11-22 CN CN201911157226.1A patent/CN111083063B/en active Active
Patent Citations (8)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US20090296670A1 (en) * | 2008-05-28 | 2009-12-03 | Microsoft Corporation | Pull-based data transmission approach |
| CN103391253A (en) * | 2013-08-05 | 2013-11-13 | 四川启程科技发展有限公司 | Method, device and system for controlling network congestion |
| CN103617024A (en) * | 2013-11-07 | 2014-03-05 | 华为技术有限公司 | Concurrent-data processing method, concurrent-data processing device and concurrent-data system |
| US20150350049A1 (en) * | 2014-05-27 | 2015-12-03 | Huawei Technologies Co., Ltd. | Method and device for generating cnm |
| CN104408088A (en) * | 2014-11-11 | 2015-03-11 | 北京奇虎科技有限公司 | Control method and device for concurrent requests |
| CN105718474A (en) * | 2014-12-03 | 2016-06-29 | 阿里巴巴集团控股有限公司 | Method and device for controlling concurrent operation of MySQL database |
| CN106330757A (en) * | 2015-06-30 | 2017-01-11 | 腾讯科技（深圳）有限公司 | Traffic control method and apparatus |
| CN109905326A (en) * | 2019-03-26 | 2019-06-18 | 武汉大学 | A kind of rate drawdown parameter optimization method based on the Congestion Level SPCC factor |
Also Published As
| Publication number | Publication date |
|---|---|
| CN111083063B (en) | 2023-04-18 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| KR101242954B1 (en) | Using priority to determine whether to queue an input/output(i/o) request directed to storage | |
| CN110750341A (en) | Task scheduling method, device, system, terminal equipment and storage medium | |
| US11677769B2 (en) | Counting SYN packets | |
| CN103491152A (en) | Metadata obtaining method, device and system in distributed file system | |
| CN113157625A (en) | Data transmission method and device, terminal equipment and computer readable storage medium | |
| CN112565319A (en) | Transmission control method, network management server, base station and storage medium | |
| CN110008187B (en) | File transmission scheduling method, device, equipment and computer readable storage medium | |
| CN111083063B (en) | Method and device for dynamically adjusting down-pressure | |
| CN113326170B (en) | Task delay risk detection method, electronic equipment and storage medium | |
| CN107707395B (en) | Data transmission method, device and system | |
| CN112988039B (en) | Data uploading method and device, cloud storage gateway and system and storage medium | |
| CN110460486B (en) | Service node monitoring method and system | |
| US11782752B1 (en) | System and method for assigning tasks | |
| JP2010171557A (en) | Multi-address transmission device, receiving node, multi-address transmission program and recording medium | |
| WO2017050121A1 (en) | Overload control method and apparatus for accounting request | |
| CN109246033B (en) | Request processing method, device, equipment and readable storage medium | |
| CN112422467A (en) | Logistics big data transmission method based on 5G network | |
| CN110908886A (en) | Data sending method and device, electronic equipment and storage medium | |
| CN108737293B (en) | Method and device for processing request | |
| CN110473103B (en) | Application management method, device, computer system and medium | |
| CN117852989A (en) | Data processing method and system | |
| CN117934168A (en) | Transaction request processing method, device, equipment and computer storage medium | |
| CN109583933B (en) | Address information judging method, device, equipment and storage medium thereof | |
| CN111104168B (en) | Calculation result submitting method and device | |
| CN117957819A (en) | Data processing system, data uploading method and data processing method thereof |
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 | ||
| TA01 | Transfer of patent application right |
Effective date of registration: 20211021 Address after: No. 303, floor 3, No. 1, District 5, anzhen Xili, Chaoyang District, Beijing 100029 Applicant after: BEIJING YUNSHAN INFORMATION TECHNOLOGY Co.,Ltd. Address before: 402, floor 4, No. 1, District 5, anzhen Xili, Chaoyang District, Beijing 100029 Applicant before: Beijing Meixian Technology Co.,Ltd. |
|
| TA01 | Transfer of patent application right | ||
| GR01 | Patent grant | ||
| GR01 | Patent grant |