CN114039925B - Dynamic flow control method based on priority in short message gateway system - Google Patents
Dynamic flow control method based on priority in short message gateway system Download PDFInfo
- Publication number
- CN114039925B CN114039925B CN202111263168.8A CN202111263168A CN114039925B CN 114039925 B CN114039925 B CN 114039925B CN 202111263168 A CN202111263168 A CN 202111263168A CN 114039925 B CN114039925 B CN 114039925B
- Authority
- CN
- China
- Prior art keywords
- priority
- current
- flow
- short message
- allowable
- 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.)
- Active
Links
- 238000000034 method Methods 0.000 title claims abstract description 22
- 230000008569 process Effects 0.000 claims description 4
- 230000000903 blocking effect Effects 0.000 claims description 3
- 230000001105 regulatory effect Effects 0.000 claims description 3
- 230000003247 decreasing effect Effects 0.000 claims description 2
- 238000004364 calculation method Methods 0.000 claims 1
- 230000003111 delayed effect Effects 0.000 description 2
- 230000006872 improvement Effects 0.000 description 2
- 230000004048 modification Effects 0.000 description 2
- 238000012986 modification Methods 0.000 description 2
- 230000009467 reduction Effects 0.000 description 2
- 230000002159 abnormal effect Effects 0.000 description 1
- 238000009825 accumulation Methods 0.000 description 1
- 230000009286 beneficial effect Effects 0.000 description 1
- 230000001276 controlling effect Effects 0.000 description 1
- 238000010586 diagram Methods 0.000 description 1
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/24—Traffic characterised by specific attributes, e.g. priority or QoS
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04W—WIRELESS COMMUNICATION NETWORKS
- H04W28/00—Network traffic management; Network resource management
- H04W28/02—Traffic management, e.g. flow control or congestion control
Abstract
The invention discloses a dynamic flow control method based on priority in a short message gateway system, which comprises the following steps: acquiring an SP number and a short message priority number of a short message service platform; sending a short message sending message to a gateway node; analyzing the SP number and the priority number, calculating the actual use flow of the current priority, judging whether the actual use flow is smaller than or equal to the current allowable issuing flow of the current priority, if yes, issuing a short message, otherwise intercepting the short message; judging whether the current priority needs to increase the traffic, if so, judging whether the current allowable issuing traffic of the priority reaches the maximum allowable issuing traffic of the priority, if so, not adjusting the traffic, if not, judging whether the total unused traffic of the current SP is enough to expand the priority to the maximum allowable issuing traffic, if so, expanding to the maximum, otherwise, reducing the traffic of the lower priority. By the technical scheme of the invention, the dynamic occupation of the channels by the short messages with each priority is realized, and the utilization rate of the channel flow resources is improved.
Description
Technical Field
The invention relates to the technical field of short message gateways, in particular to a dynamic flow control method based on priority in a short message gateway system.
Background
The traditional short message protocol is based on TCP long connection to access the short message gateway, and relies on four layers of switches or F5 load to balance the number of the long connection, so that the downlink short message flow balance of each gateway node is ensured. However, if the load is unbalanced, all connections are concentrated on one gateway node, so that all short messages are concentrated, the current gateway node resources are consumed too high, other gateway node resources are idle, the node resource utilization rate is abnormal, and the short message flow sent to the short message center is unbalanced.
Meanwhile, priorities of the short messages are distinguished on the existing service, traffic among the priorities is independently configured, preset traffic is independently occupied, and the traffic utilization rate of the short message channel is low. The method can control the flow integrally, split the short message accessed by the short message service platform according to the priority, send the short message with high priority preferentially and occupy more channel flow dynamically, and send the short message with low priority postpone or limit the occupied channel flow dynamically. When the sending of the high-priority short message is completed, the low-priority short message can automatically expand the sending flow, and the channel flow resource is fully utilized. .
Disclosure of Invention
In order to solve the problems, the invention provides a priority-based dynamic flow control method in a short message gateway system, which realizes the dynamic occupation of channels by the short messages with various priorities by accessing the priorities of the short messages to a short message service platform according to the modes of preferentially sending the short messages with high priority and dynamically occupying more channel flows, postponing the sending with low priority or dynamically limiting and reducing the occupied channel flows, thereby improving the utilization rate of channel flow resources.
In order to achieve the above object, the present invention provides a dynamic flow control method based on priority in a short message gateway system, comprising the following steps: step 1: acquiring an SP number and a short message priority number of a short message service platform through a short message service interface; step 2: sending a short message sending message to a gateway node according to the SP number and the short message priority number; step 3: the gateway node analyzes the SP number and the priority number in the short message sending message and calculates the actual use flow of the current priority; step 4: judging whether the actual traffic of the current priority is smaller than or equal to the current allowable traffic of the current priority, if yes, sending a short message, otherwise, intercepting the short message, and informing the short message service platform of the excessive traffic; step 5: after blocking the message, judging whether the current allowable issuing flow of the current priority is smaller than the maximum allowable issuing flow of the current priority, if not, not adjusting the flow, and if not, calculating the total unused flow of the current SP (Service Provider) and the maximum expandable flow of the current priority; step 6: judging whether the total unused flow of the current SP is larger than the maximum expandable flow of the current priority, if so, taking the maximum allowable issuing flow of the current priority as the current allowable issuing flow of the current priority, otherwise, reducing the current allowable issuing flow of the lower priority from low to high so as to increase the current allowable issuing flow of the current priority, and the flows of other priorities are not regulated; step 7: and feeding back the current allowable downlink flow of the current priority through the short message.
In the foregoing technical solution, preferably, the specific process of reducing the current allowed downlink traffic of the lower priority in step 6 to increase the current allowed downlink traffic of the current priority includes: defining the actual expandable flow of the current priority as an initial value 0; starting from the lowest priority, judging whether the maximum expandable flow of the current priority is larger than the sum of the difference value of the current allowable issued flow of the low priority and the corresponding priority guarantee flow and the actual expandable flow of the current priority or not: if the current allowable issuing flow is smaller than or equal to the current allowable issuing flow, the current allowable issuing flow with low priority is compared, the decreasing value is the difference value between the maximum expandable flow with the current priority and the actual expandable flow, and the current allowable issuing flow with the current priority is increased to the maximum allowable issuing flow with the current priority; if the current allowable issuing flow rate is larger than the current allowable issuing flow rate, the current allowable issuing flow rate with the low priority is reduced to the corresponding priority guarantee flow rate, the reduced flow rate value with the low priority is accumulated to the current practical expandable flow rate with the priority, if the current allowable issuing flow rate is still larger than the current priority along with the increase of the priority, the accumulated practical expandable flow rate is increased to the current allowable issuing flow rate with the current priority.
In the above technical solution, preferably, the dynamic flow control method based on priority in the short message gateway system further includes: recording the actual total flow of the current priority of the current time when the short message is sent by the current priority; and if the ratio of the actual total flow of the current priority to the current priority guarantee flow is smaller than the preset utilization rate, taking the current priority guarantee flow as the current allowable issuing flow of the current priority, executing the step 7, and if not smaller, executing the steps 5 to 7.
In the above technical solution, preferably, the calculating method of the total traffic unused by the current SP and the maximum scalable traffic of the current priority in the step 5 includes: the total unused flow of the current SP is the difference value between the total flow of the current SP and the sum of the current allowable issuing flows of all priorities; the maximum extensible traffic of the current priority is the difference value between the maximum allowable downlink traffic of the current priority and the current allowable downlink traffic of the current priority.
In the above technical solution, preferably, the current short message backlog amount and the expected backlog processing time consumption are also fed back through the short message.
Compared with the prior art, the invention has the beneficial effects that: by accessing the priority of the short message to the short message service platform, the method realizes the dynamic occupation of the channels by the short messages with various priorities according to the mode that the high-priority short messages are sent preferentially and occupy more channel traffic dynamically, the low-priority delayed sending or the dynamic limitation reduces the occupied channel traffic, and improves the channel traffic resource utilization rate.
Drawings
Fig. 1 is a schematic flow chart of a dynamic flow control method based on priority in a sms gateway system according to an embodiment of the present invention;
fig. 2 is a schematic diagram of a short message gateway system according to an embodiment of the present invention.
Detailed Description
For the purpose of making the objects, technical solutions and advantages of the embodiments of the present invention more apparent, the technical solutions of the embodiments of the present invention will be clearly and completely described below with reference to the accompanying drawings in the embodiments of the present invention, and it is apparent that the described embodiments are some embodiments of the present invention, but not all embodiments of the present invention. All other embodiments, which can be made by those skilled in the art based on the embodiments of the invention without making any inventive effort, are intended to be within the scope of the invention.
The invention is described in further detail below with reference to the attached drawing figures:
as shown in fig. 1, the method for controlling dynamic flow based on priority in a short message gateway system according to the present invention includes the following steps:
step 1: acquiring an SP number and a short message priority number of a short message service platform through a short message service interface;
step 2: sending a short message sending message to a gateway node according to the SP number and the short message priority number;
step 3: the gateway node analyzes the SP number and the priority number in the short message sending message, and calculates the actual use flow of the current priority;
step 4: judging whether the current priority actually used flow is smaller than or equal to the current allowable issuing flow, if so, issuing a short message, otherwise, intercepting the short message, informing the short message service platform of the excessive flow,
judging whether the current priority needs to increase the channel flow, if the actual use flow of the current priority is smaller than or equal to the current allowable issuing flow of the current priority, the actual flow is smaller than the current allowable issuing flow, the short message can be issued directly without increasing the flow, otherwise, the short message interception is carried out to adjust the flow;
step 5: after blocking the message, judging whether the current allowable issuing flow of the current priority is smaller than the maximum allowable issuing flow of the current priority, if not, not adjusting the flow, and if not, calculating the total unused flow of the current SP and the maximum expandable flow of the current priority;
namely, on the basis of the step 4, judging that the current allowable issuing flow of the current priority has reached the maximum allowable issuing flow of the current priority, if the current allowable issuing flow of the current priority has reached, not increasing the space of the issuing flow of the current priority, namely, not adjusting the flow any more, and if the current allowable issuing flow of the current priority has not reached the maximum allowable issuing flow of the current priority, then, having the basis of increasing the issuing flow of the current priority, thus preparing for the next step of rectification flow;
step 6: judging whether the total unused flow of the current SP is larger than the maximum expandable flow of the current priority, if so, taking the maximum allowable issuing flow of the current priority as the current allowable issuing flow of the current priority, otherwise, reducing the current allowable issuing flow of the lower priority from low to high so as to increase the current allowable issuing flow of the current priority, and the flows of other priorities are not regulated;
that is, judging whether the total flow which is not used by the current SP is enough for the current priority to extend to the maximum allowable issuing flow, if so, extending the current allowable issuing flow of the current priority to the maximum allowable issuing flow of the current priority, otherwise, reducing the flow of the lower priority so as to increase the flow of the current priority.
Step 7: and feeding back the current allowable downlink flow of the current priority through the short message.
In the embodiment, the method realizes the dynamic occupation of channels by the short messages with different priorities according to the mode that the short messages with high priority are sent preferentially and occupy more channel traffic dynamically, the low priority is sent in a delayed mode or the occupied channel traffic is reduced by dynamic limitation by accessing the short messages to the short message service platform, and improves the channel traffic resource utilization rate.
As shown in fig. 2, specifically, the HTTP-based short message interface realizes short message receiving equalization of the gateway node through Ngnix, and meanwhile, performs short message priority splitting in the interface. The dynamic occupation of the channels by the priority short messages is realized by the priority dynamic flow control module, and the resource utilization rate is improved. The HTTP interface message carries an SP number and a short message priority number of the short message service platform, the Ngnix distributes the short message to the gateway node in an equalizing mode based on the SP number and the short message priority number, and a priority dynamic flow control module on the gateway node performs actual flow control on the received short message according to the dynamic flow control method disclosed in the embodiment, ensures that the high-priority short message is sent preferentially, and utilizes channel flow resources to the greatest extent.
Specifically, the channel traffic is allocated from high to low priority for each SP-issued message according to priority (the priority increases from 0, the larger the value, the higher the priority). In order to avoid the difficulty in client flow control caused by too frequent flow update, the flow adjustment period is preferably set to 10 seconds each time, and the flow adjustment period is specifically set according to specific requirements in the implementation process.
In order to describe the dynamic flow control method in detail, the maximum priority is set to be N, the minimum priority is set to be 0, the current priority is set to be N (0 is less than or equal to N), F (N) min is the priority N guarantee flow, F (N) max is the priority N maximum allowable issuing flow, F (N) now is the priority N current allowable issuing flow, 0<F (N) min is less than or equal to F (N) now is less than or equal to F (N) max. For all priority traffic configurations, F (N) max+F (N-1) min+ & F (0) min.ltoreq.SP total traffic. Initial F (n) now=f (n) min is set.
When receiving the message sending message, analyzing the SP number and the message priority number, and calculating the current actual flow (n). If the actual use flow of the current priority is smaller than or equal to the current allowable issuing flow of the current priority, issuing a short message, otherwise, intercepting the short message. If the current allowable downlink traffic F (n) now of the priority n is less than the maximum allowable downlink traffic F (n) max of the current priority, it is indicated that the current priority n does not fully utilize the channel traffic resource at this time, so that the traffic of the current priority is dynamically increased in order to improve the channel traffic utilization.
Specifically, the step of dynamically increasing the current priority traffic includes:
1) Calculating the current SP unused total flow and the current priority maximum expandable flow, wherein the current SP unused total flow F (diff) is the difference value between the current SP total flow and the sum of all priority current allowed issued flows, namely
F (diff) =sp total flow- (F (N) now+ & gt F (0) now)
The maximum extensible traffic of the current priority is the difference value between the maximum allowable traffic of the current priority and the current allowable traffic of the current priority, namely
F(n)＝F(n)max-F(n)now。
2) If F (diff) is not less than F (n), indicating that the current SP does not use the total traffic and the current priority is extended to the maximum allowable issuing traffic, and enabling F (n) now=F (n) max and the traffic of other priorities to be unchanged;
3) If F (diff) < F (n), it indicates that the total flow not used by the current SP is insufficient to extend the current priority to the maximum allowable issuing flow, and the flows from priority 0 to priority n-1 are reduced, so that the channel flows reduced from priority 0 to priority n-1 are dynamically increased to the maximum expandable flow of the current priority n, the channel flows with lower priorities are dynamically reduced, and the channel flows with the current priority n are increased, thereby improving the channel flow utilization of the current priority n.
In the above embodiment, preferably, the current allowed downlink traffic of the lower priority is reduced in step 6, so as to increase the current allowed downlink traffic of the current priority, first, the initial value F (n) real=0 of the current priority actual scalable traffic is defined, and the initial value i=0 of the low priority i is defined, which specifically includes:
starting from the lowest priority, condition a: whether the maximum expandable flow of the current priority is larger than the sum of the difference value of the current allowable issuing flow of the low priority and the corresponding priority guarantee flow and the actual expandable flow of the current priority, namely whether the channel flow which can be reduced by the current priority i is enough to increase the channel flow of the current priority n to the maximum allowable issuing flow,
F(n)>F(i)now-F(i)min+F(n)real；
if the judgment result of the condition A is false, that is, the channel flow which can be reduced by the current priority level i is enough to increase the channel flow of the current priority level n to the maximum allowable issuing flow, the current allowable issuing flow which is compared with the low priority level is reduced, and the reduction value is the difference value between the maximum expandable flow of the current priority level and the actual expandable flow, that is
F(i)now＝F(i)now-[F(n)max-F(n)now-F(n)real]
And increasing the current allowable downlink traffic of the current priority to the maximum allowable downlink traffic of the current priority, i.e. F (n) now=f (n) max.
If the judging result of the condition A is true, namely the channel flow which can be reduced by the priority I currently is insufficient to increase the channel flow of the current priority n to the maximum allowable issuing flow, the compared low-priority current allowable issuing flow is reduced to the corresponding priority guarantee flow, and the reduced flow value of the compared low-priority is accumulated to the current priority actual expandable flow. Then, entering a priority (i+1) to judge the condition A again, executing the steps, if the judging result of the condition A is still true along with the improvement of the priority until the current priority n, namely the accumulation of the reduction values of the priorities 0 to (n-1) is still insufficient to increase the channel flow of the current priority n to the maximum allowable issuing flow, and then increasing the accumulated actual expandable flow to the current allowable issuing flow of the current priority, specifically:
f (i) now=f (i) min is performed,
then execute F (n) real=F (n) real+ [ F (i) now-F (i) min ]
Re-execution of i=i+1
If i < n, the condition A is re-judged, if i=n, the process is performed
F(n)now＝F(n)now+F(n)real
And realizing the current permission of the current priority to issue the flow adjustment.
In the above embodiment, preferably, when sending a short message with a current priority, the actual total flow of the current priority at the current time is recorded; if the ratio of the actual total flow of the current priority to the current priority guarantee flow is smaller than the preset use rate (the preferred preset use rate of the embodiment is 90%), the actual flow of the current priority is smaller than the guarantee flow at the moment, and the channel flow of the current priority does not need to be expanded at the moment, so the current priority guarantee flow is used as the current allowable issuing flow of the current priority, and the step 7 is executed, if the current priority guarantee flow is not smaller than the current allowable issuing flow, the channel flow required by the current priority at the moment is large enough, and in order to avoid the short message issuing of the current priority from being continuously increased, the steps 5 to 7 are executed, and the channel flow of the current priority is dynamically increased in advance.
In combination with step 5 in the above embodiment, the embodiment specifically includes: when the priority n short message is sent, if the priority n of the current time ensures that the utilization rate of the flow F (n) min is more than or equal to 90% and F (n) now is less than F (n) max, the utilization rate of the current priority n flow is enough, in order to avoid that the flow continues to be increased, the short message which affects the current priority is sent, and the current allowable sending flow of the current priority does not reach the maximum allowable sending flow at the moment, part of channel flow resources can be utilized, so that the flow of the current priority is dynamically increased.
In the foregoing embodiment, preferably, the current backlog amount of the short message and the expected backlog time consumption are also fed back through the short message, so as to assist the Ngnix server in distributing the short message to each gateway node in an equalizing manner.
The above is only a preferred embodiment of the present invention, and is not intended to limit the present invention, but various modifications and variations can be made to the present invention by those skilled in the art. Any modification, equivalent replacement, improvement, etc. made within the spirit and principle of the present invention should be included in the protection scope of the present invention.
Claims (3)
1. A dynamic flow control method based on priority in a short message gateway system is characterized by comprising the following steps:
step 1: acquiring an SP number and a short message priority number of a short message service platform through a short message service interface;
step 2: sending a short message sending message to a gateway node according to the SP number and the short message priority number;
step 3: the gateway node analyzes the SP number and the priority number in the short message sending message and calculates the actual use flow of the current priority;
step 4: judging whether the actual traffic of the current priority is smaller than or equal to the current allowable traffic of the current priority, if yes, sending a short message, otherwise, intercepting the short message, and informing the short message service platform of the excessive traffic;
step 5: after blocking the message, judging whether the current allowable issuing flow of the current priority is smaller than the maximum allowable issuing flow of the current priority, if not, not adjusting the flow, and if not, calculating the total unused flow of the current SP and the maximum expandable flow of the current priority, wherein the calculation method comprises the following steps:
the total unused flow of the current SP is the difference value between the total flow of the current SP and the sum of the current allowable issuing flows of all priorities;
the maximum extensible flow of the current priority is the difference value between the maximum allowable issuing flow of the current priority and the current allowable issuing flow of the current priority;
step 6: judging whether the total unused flow of the current SP is larger than the maximum expandable flow of the current priority, if so, taking the maximum allowable issuing flow of the current priority as the current allowable issuing flow of the current priority, otherwise, reducing the current allowable issuing flow of the lower priority from low to high so as to increase the current allowable issuing flow of the current priority, and the flows of other priorities are not regulated;
wherein the specific process of reducing the current allowed downlink traffic of the lower priority and thereby increasing the current allowed downlink traffic of the current priority comprises the following steps:
defining the actual expandable flow of the current priority as an initial value 0;
starting from the lowest priority, judging whether the maximum expandable flow of the current priority is larger than the sum of the difference value of the current allowable issued flow of the low priority and the corresponding priority guarantee flow and the actual expandable flow of the current priority or not:
if the current allowable issuing flow is smaller than or equal to the current allowable issuing flow, the current allowable issuing flow with low priority is compared, the decreasing value is the difference value between the maximum expandable flow with the current priority and the actual expandable flow, and the current allowable issuing flow with the current priority is increased to the maximum allowable issuing flow with the current priority;
if the current allowable issuing flow of the compared low priority is larger than the current allowable issuing flow of the current priority, the current allowable issuing flow of the compared low priority is reduced to the corresponding priority guarantee flow, the reduced flow value of the compared low priority is accumulated to the current priority actual expandable flow, if the current priority is increased until the current priority is lower than the current priority, the accumulated actual expandable flow is increased to the current allowable issuing flow of the current priority;
step 7: and feeding back the current allowable downlink flow of the current priority through the short message.
2. The dynamic flow control method based on priority in a short message gateway system according to claim 1, further comprising:
recording the actual total flow of the current priority of the current time when the short message is sent by the current priority;
and if the ratio of the actual total flow of the current priority to the current priority guarantee flow is smaller than the preset utilization rate, taking the current priority guarantee flow as the current allowable issuing flow of the current priority, executing the step 7, and if not smaller, executing the steps 5 to 7.
3. The method for priority-based dynamic flow control in a short message gateway system according to claim 1, wherein the current short message backlog amount and the expected backlog processing time consumption are also fed back through short message messages.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202111263168.8A CN114039925B (en) | 2021-10-28 | 2021-10-28 | Dynamic flow control method based on priority in short message gateway system |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202111263168.8A CN114039925B (en) | 2021-10-28 | 2021-10-28 | Dynamic flow control method based on priority in short message gateway system |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN114039925A CN114039925A (en) | 2022-02-11 |
| CN114039925B true CN114039925B (en) | 2023-11-28 |
Family
ID=80142176
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN202111263168.8A Active CN114039925B (en) | 2021-10-28 | 2021-10-28 | Dynamic flow control method based on priority in short message gateway system |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN114039925B (en) |
Families Citing this family (2)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN115226050B (en) * | 2022-06-22 | 2024-04-19 | 百果园技术(新加坡)有限公司 | Traffic distribution method, traffic distribution device, traffic distribution apparatus, traffic distribution storage medium, and traffic distribution program product |
| CN116708175B (en) * | 2023-08-01 | 2023-10-20 | 深圳市联合信息技术有限公司 | Operation and maintenance optimization scheduling method for remote information system |
Citations (9)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN1859122A (en) * | 2006-02-23 | 2006-11-08 | 华为技术有限公司 | Method and device for realizing classified service to business provider |
| CN102217336A (en) * | 2011-05-06 | 2011-10-12 | 华为技术有限公司 | Message processing method and system |
| US8203956B1 (en) * | 2008-08-28 | 2012-06-19 | Raytheon Bbn Technologies Corp. | Method and apparatus providing a precedence drop quality of service (PDQoS) |
| CN103259743A (en) * | 2012-02-15 | 2013-08-21 | 中兴通讯股份有限公司 | Method and device for controlling output flow based on token bucket |
| CN104066119A (en) * | 2013-03-22 | 2014-09-24 | 中兴通讯股份有限公司 | Short message calling flow controlling method and device |
| CN105208604A (en) * | 2014-06-09 | 2015-12-30 | 株式会社日立制作所 | Traffic management method in mobile network |
| CN106385386A (en) * | 2016-08-31 | 2017-02-08 | 成都飞鱼星科技股份有限公司 | Application servo-actuated intelligent floe control method |
| US10462070B1 (en) * | 2016-06-30 | 2019-10-29 | EMC IP Holding Company LLC | Service level based priority scheduler for multi-tenancy computing systems |
| CN111371690A (en) * | 2020-02-24 | 2020-07-03 | 迈普通信技术股份有限公司 | Flow regulation and control method and device, network equipment and computer readable storage medium |
Family Cites Families (3)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US7895353B2 (en) * | 2008-02-29 | 2011-02-22 | Oracle International Corporation | System and method for providing throttling, prioritization and traffic shaping during request processing via a budget service |
| US9350624B2 (en) * | 2013-10-15 | 2016-05-24 | Rawllin International Inc. | Dynamic assignment of connection priorities for applications operating on a client device |
| CN107222426B (en) * | 2016-03-21 | 2021-07-20 | 阿里巴巴集团控股有限公司 | Flow control method, device and system |
-
2021
- 2021-10-28 CN CN202111263168.8A patent/CN114039925B/en active Active
Patent Citations (9)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN1859122A (en) * | 2006-02-23 | 2006-11-08 | 华为技术有限公司 | Method and device for realizing classified service to business provider |
| US8203956B1 (en) * | 2008-08-28 | 2012-06-19 | Raytheon Bbn Technologies Corp. | Method and apparatus providing a precedence drop quality of service (PDQoS) |
| CN102217336A (en) * | 2011-05-06 | 2011-10-12 | 华为技术有限公司 | Message processing method and system |
| CN103259743A (en) * | 2012-02-15 | 2013-08-21 | 中兴通讯股份有限公司 | Method and device for controlling output flow based on token bucket |
| CN104066119A (en) * | 2013-03-22 | 2014-09-24 | 中兴通讯股份有限公司 | Short message calling flow controlling method and device |
| CN105208604A (en) * | 2014-06-09 | 2015-12-30 | 株式会社日立制作所 | Traffic management method in mobile network |
| US10462070B1 (en) * | 2016-06-30 | 2019-10-29 | EMC IP Holding Company LLC | Service level based priority scheduler for multi-tenancy computing systems |
| CN106385386A (en) * | 2016-08-31 | 2017-02-08 | 成都飞鱼星科技股份有限公司 | Application servo-actuated intelligent floe control method |
| CN111371690A (en) * | 2020-02-24 | 2020-07-03 | 迈普通信技术股份有限公司 | Flow regulation and control method and device, network equipment and computer readable storage medium |
Non-Patent Citations (3)
| Title |
|---|
| Datacenter Traffic Control: Understanding Techniques and Tradeoffs;Mohammad Noormohammadpour等;《IEEE Communications Surveys & Tutorials》;全文 * |
| 电力短信系统中的流量控制和拥塞控制策略的研究;李明;《万方》;全文 * |
| 谈谈SP短信接口网关开发;蔡奕群;;《河南科技》(14);全文 * |
Also Published As
| Publication number | Publication date |
|---|---|
| CN114039925A (en) | 2022-02-11 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN114039925B (en) | Dynamic flow control method based on priority in short message gateway system | |
| KR101256293B1 (en) | System and method for heartbeat signal generation | |
| US20120218892A1 (en) | Subscriber/service differentiation in advanced wireless networks | |
| WO2016011903A1 (en) | Traffic control method and apparatus | |
| EP2525620B1 (en) | Method, device and communication system for dormancy timer control | |
| EP2561660B1 (en) | Controlling data transmission over a network | |
| EP1816793A1 (en) | Method for uplink bandwidth request and allocation in wireless communication system | |
| CN105591795B (en) | Bandwidth allocation method and device | |
| JP2009524987A (en) | Method for performing paging (QoS-AWAREPAGING) recognizing QoS in a wireless communication system | |
| WO2015196562A1 (en) | Method for configuring scheduling information, method for processing configuration parameters and apparatuses | |
| WO2018014360A1 (en) | Congestion control method, base station, and terminal | |
| CN101459966A (en) | Ad Hoc network MAC layer QoS guarantee method based on IEEE802.16 | |
| CN109617836B (en) | Intelligent bandwidth allocation method and system for satellite data transmission | |
| WO2016107142A1 (en) | Method and device for regulating and controlling resource allocation | |
| CN107800574B (en) | Storage QOS adjusting method, system, equipment and computer readable memory | |
| WO2021018171A1 (en) | Uplink transmission method and apparatus, resource indication method and apparatus, serving node, and medium | |
| CN103458520B (en) | A kind of distribution method of uplink frequency domain resources and device | |
| CN102196583B (en) | A kind of distribution method of channel resource and base station | |
| CN111371701A (en) | MAC layer queue scheduling method based on TDMA | |
| CN105049220A (en) | MCU resource scheduling method based on television video conference | |
| WO2011023046A1 (en) | Method and device for implementing admission control | |
| WO2016115846A1 (en) | Service scheduling method and apparatus, wireless network controller and base station | |
| US10638504B2 (en) | Data pull-up method in which uplink channel is dynamically allocated and communication device | |
| CN112272148A (en) | Multi-priority queue management method, device and storage medium | |
| CN110855570A (en) | SDN (software defined network) packet loss judgment method, device and system and multi-network control system |
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 | ||
| GR01 | Patent grant | ||
| GR01 | Patent grant |