CN114039925A - Priority-based dynamic flow control method in short message gateway system - Google Patents
Priority-based dynamic flow control method in short message gateway system Download PDFInfo
- Publication number
- CN114039925A CN114039925A CN202111263168.8A CN202111263168A CN114039925A CN 114039925 A CN114039925 A CN 114039925A CN 202111263168 A CN202111263168 A CN 202111263168A CN 114039925 A CN114039925 A CN 114039925A
- Authority
- CN
- China
- Prior art keywords
- current
- flow
- priority
- short message
- allowed
- 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
- 238000000034 method Methods 0.000 title claims abstract description 22
- 230000008569 process Effects 0.000 claims description 4
- 230000003247 decreasing effect Effects 0.000 claims description 2
- 238000009825 accumulation Methods 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
- 230000009286 beneficial effect Effects 0.000 description 1
- 238000010586 diagram 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/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
Landscapes
- Engineering & Computer Science (AREA)
- Computer Networks & Wireless Communication (AREA)
- Signal Processing (AREA)
- Data Exchanges In Wide-Area Networks (AREA)
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 of the current priority is less than or equal to the current allowed flow of the current priority, if so, issuing the short message, otherwise, intercepting the short message; judging whether the current priority needs to increase the flow, if so, judging whether the current allowed flow of the priority reaches the maximum allowed flow of the priority, if not, then, judging whether the current SP unused total flow is enough to expand the priority to the maximum allowed flow, if so, then, expanding the current SP unused total flow to the maximum, otherwise, reducing the flow of the lower priority. By the technical scheme of the invention, the dynamic occupation of the channels by the short messages with various priorities is realized, and the utilization rate of 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 accessed to the short message gateway based on TCP long connection and relies on a four-layer switch or F5 load to balance the number of long connections, thereby ensuring the balance of the downlink short message flow of each gateway node. However, if the load is unbalanced, all connections are concentrated on one gateway node, which causes centralized processing of all short messages, the resource consumption of the current gateway node is too high, and other gateway nodes are idle, which causes abnormal node resource utilization, and unbalanced short message traffic sent to the short message center.
Meanwhile, short messages are distinguished according to priorities of services, and flow between the priorities is independently configured to independently occupy preset flow, so that the flow utilization rate of a short message channel is low. It is required to have an algorithm to integrally control the traffic, split the short messages accessed by the short message service platform according to priority, send the high priority short messages preferentially and occupy more channel traffic dynamically, and delay the sending of the low priority short messages or reduce the occupied channel traffic dynamically by limiting. When the high-priority short message is sent, the low-priority short message can automatically expand the sending flow, and channel flow resources are fully utilized. .
Disclosure of Invention
Aiming at the problems, the invention provides a priority-based dynamic flow control method in a short message gateway system, which realizes the dynamic occupation of each priority short message to a channel and improves the utilization rate of channel flow resources by means of the priority of accessing short messages to a short message service platform and according to the modes that high-priority short messages are preferentially sent and occupy more channel flows dynamically, and low-priority short messages are sent after delay or the occupied channel flows are reduced by dynamic limitation.
In order to achieve the above object, the present invention provides a method for controlling a dynamic flow based on a 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; and step 3: the gateway node analyzes the SP number and the priority number in the message sent by the short message and calculates the actual use flow of the current priority; and 4, step 4: judging whether the actual use flow of the current priority is less than or equal to the current allowable flow of the current priority, if so, sending the short message, otherwise, intercepting the short message and informing the short message service platform of the excessive flow; and 5: after intercepting the short message, judging whether the current priority current allowed issued flow is smaller than the current priority maximum allowed issued flow, if not, not adjusting the flow, if so, calculating the current SP (Service Provider) unused total flow and the current priority maximum expandable 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 allowed issued flow of the current priority as the current allowed issued flow of the current priority, otherwise, reducing the current allowed issued flow of the lower priority from low to high so as to increase the current allowed issued flow of the current priority, and not adjusting the flows of other priorities; and 7: and feeding back the current allowable issuing flow of the current priority through the short message.
In the foregoing technical solution, preferably, the specific process of decreasing the current allowed lower-priority delivered traffic so as to increase the current allowed delivered traffic of the current priority in step 6 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 between the current permitted issued flow of the compared low priority and the corresponding priority guarantee flow and the actual expandable flow of the current priority: if the current allowable issuing flow rate is smaller than or equal to the current allowable issuing flow rate of the current priority, reducing the current allowable issuing flow rate of the compared low priority to be the difference value between the maximum expandable flow rate of the current priority and the actual expandable flow rate, and increasing the current allowable issuing flow rate of the current priority to be the maximum allowable issuing flow rate of the current priority; if the current allowable issuing flow is larger than the current allowable issuing flow, reducing the current allowable issuing flow compared with the low priority to the corresponding priority guarantee flow, accumulating the reduced flow value compared with the low priority to the current priority actual expandable flow, and if the actual expandable flow value is still larger than the current priority along with the increase of the priority, increasing the accumulated actual expandable flow to the current priority current allowable issuing flow.
In the above technical solution, preferably, the method for controlling dynamic flow based on priority in the short message gateway system further includes: when the short message is issued at the current priority, recording the actual total flow of the current priority at the current time; 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 priority currently allowed to be issued, and executing the step 7, otherwise, executing the steps 5 to 7.
In the above technical solution, preferably, the method for calculating the total unused traffic of the current SP and the maximum scalable traffic of the current priority in step 5 includes: the total unused flow of the current SP is the difference value of the total flow of the current SP and the sum of the flows which are allowed to be issued currently at all priorities; the maximum expandable 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.
In the above technical solution, preferably, the current backlog amount of the short message and the estimated backlog processing time are also fed back through the short message.
Compared with the prior art, the invention has the beneficial effects that: by means of the priority of short message access to the short message service platform, the dynamic occupation of the channels by the short messages with various priorities is realized and the utilization rate of channel flow resources is improved according to the mode that the short messages with high priority are sent preferentially and occupy more channel flows dynamically, the short messages with low priority are sent after delay or the occupied channel flows are reduced by dynamic limitation.
Drawings
Fig. 1 is a schematic flow chart of a priority-based dynamic flow control method in a short message gateway system according to an embodiment of the present invention;
fig. 2 is a schematic structural diagram of a short message gateway system according to an embodiment of the present invention.
Detailed Description
In order to make the objects, technical solutions and advantages of the embodiments of the present invention clearer, the technical solutions in the embodiments of the present invention will be clearly and completely described below with reference to the drawings in the embodiments of the present invention, and it is obvious that the described embodiments are some, but not all, embodiments of the present invention. All other embodiments, which can be obtained by a person skilled in the art without any inventive step based on the embodiments of the present invention, are within the scope of the present 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 the gateway node according to the SP number and the short message priority number;
and step 3: the gateway node analyzes the SP number and the priority number in the message sent by the short message and calculates the actual use flow of the current priority;
and 4, step 4: judging whether the actual use flow of the current priority is less than or equal to the current allowable flow of the current priority, if so, sending the short message, otherwise, intercepting the short message and informing the short message service platform of the excessive flow,
if the actual using flow of the current priority is smaller than or equal to the current allowed issuing flow of the current priority, the actual flow is smaller than the current allowed issuing flow, the short message can be directly issued without increasing the flow, otherwise, the short message is intercepted to adjust the flow;
and 5: after intercepting the short message, judging whether the current priority current allowed issued flow is smaller than the current priority maximum allowed issued flow, if not, not adjusting the flow, and if so, calculating the current SP unused total flow and the current priority maximum expandable flow;
that is, on the basis of step 4, it is judged that the current allowed issued flow of the current priority has reached the maximum allowed issued flow of the current priority, if the current allowed issued flow of the current priority has reached, the issued flow of the current priority has no increased space, that is, the flow is not adjusted, and if the current allowed issued flow of the current priority has not reached the maximum allowed issued flow of the current priority, the basis of increasing the issued flow of the current priority is provided, so that the next flow adjustment is prepared;
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 allowed issued flow of the current priority as the current allowed issued flow of the current priority, otherwise, reducing the current allowed issued flow of the lower priority from low to high so as to increase the current allowed issued flow of the current priority, and not adjusting the flows of other priorities;
that is, it is determined whether the total unused traffic of the current SP is enough to expand the current priority to the maximum allowable delivery traffic, if so, the current allowable delivery traffic of the current priority is expanded to the maximum allowable delivery traffic of the current priority, otherwise, the traffic of the lower priority is reduced to increase the traffic of the current priority.
And 7: and feeding back the current allowable issuing flow of the current priority through the short message.
In the embodiment, the dynamic occupation of the channels by the short messages with various priorities is realized by accessing the priority of the short messages to the short message service platform and according to the mode that the short messages with high priority are preferentially sent and dynamically occupy more channel flows, the short messages with low priority are sent after delay or the occupied channel flows are reduced by dynamic limitation, and the utilization rate of channel flow resources is improved.
As shown in fig. 2, specifically, the short message interface based on HTTP realizes the balance of short message reception of the gateway node through Ngnix, and performs the priority splitting of the short message in the interface. Through the priority dynamic flow control module, the dynamic occupation of the channels by the short messages with various priorities is realized, and the resource utilization rate is improved. The HTTP interface message carries the SP number and the priority number of the short message service platform, Ngnix distributes the short message to the gateway node in a balanced manner based on the two numbers, and the priority dynamic flow control module on the gateway node performs actual flow control issuing on the received short message according to the dynamic flow control method disclosed in the above embodiment, thereby ensuring that the high-priority short message is sent preferentially and channel flow resources are utilized to the maximum extent.
Specifically, for each SP delivery message, channel traffic is allocated from high to low in priority according to priority (the priority is increased from 0, the numerical value is larger, and the priority is higher in order upwards). In order to avoid the flow control difficulty of the client caused by too frequent flow updating, the flow adjustment period of each time is preferably set to be 10 seconds, and the flow adjustment period is specifically set according to specific requirements in the implementation process.
To describe the above 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 N (0 ≦ N), f (N) min is the guaranteed flow of the priority N, f (N) max is the maximum allowed flow of the priority N, f (N) now is the current allowed flow of the priority N, and 0< f (N) min ≦ f (N) now is less than f (N) max. For all priority traffic configurations, F (N) max + F (N-1) min +. + F (0) min ≦ SP total traffic. Initial f (n) now ═ f (n) min is set.
When receiving the message sent by the short message, analyzing the SP number and the priority number of the short message, and calculating the current actual flow (n). And if the actual use flow of the current priority is less than or equal to the current allowed flow of the current priority, sending the short message, otherwise, intercepting the short message. If the priority n currently allows the issued traffic f (n) now < the current priority maximum allowed issued traffic f (n) max, it indicates that the current priority n does not fully utilize the channel traffic resource, so as to improve the channel traffic utilization, the traffic of the current priority is dynamically increased.
Specifically, the step of dynamically increasing the current priority traffic includes:
1) calculating the total unused flow of the current SP and the maximum expandable flow of the current priority, wherein the total unused flow F (diff) of the current SP is the difference value of the total unused flow of the current SP and the sum of the currently allowed issued flows of all priorities, namely
F (diff) ═ SP total flow rate- (F (n) now + ·+ F (0) now)
The maximum expandable 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, namely
F(n)＝F(n)max-F(n)now。
2) If f (diff) ≧ f (n), it indicates that the total flow rate used by the current SP is enough for the current priority to extend to the maximum allowed delivery flow rate, so that f (n) now ═ f (n) max, and the flow rates of other priorities are not changed;
3) if f (diff) < f (n), it indicates that the total unused traffic of the current SP is not enough to expand the current priority to the maximum allowable delivered traffic, and reduces the traffic from priority 0 to priority n-1, so that the channel traffic reduced by the traffic from priority 0 to priority n-1 is dynamically increased to the maximum expandable traffic of the current priority n, the channel traffic of lower priority is dynamically reduced, the channel traffic of the current priority n is increased, and the channel traffic utilization rate of the current priority n is improved.
In the foregoing embodiment, preferably, in step 6, the current allowed delivered traffic of a lower priority is reduced, so as to increase the current allowed delivered traffic of the current priority, and first, a current-priority actual expandable initial value f (n) real ═ 0 is defined, and an initial value i of a low priority i ═ 0, where the specific process includes:
starting from the lowest priority, judging condition A: whether the maximum expandable flow of the current priority is larger than the sum of the difference value between the current allowable issuing flow compared with 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 currently reduced by the 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, namely the channel flow which can be currently reduced by the priority i is enough to increase the channel flow of the current priority n to the maximum allowable issuing flow, the current allowable issuing flow which is compared with the low priority is reduced, and the reduction value is the difference value between the maximum expandable flow of the current priority and the actual expandable flow, namely the difference value is
F(i)now＝F(i)now-[F(n)max-F(n)now-F(n)real]
And increasing the current priority current allowed issued traffic to the current priority maximum allowed issued traffic, namely f (n) now ═ f (n) max.
And if the judgment result of the condition A is true, namely the channel flow which can be reduced by the priority i currently is not enough to increase the channel flow of the current priority n to the maximum allowable issuing flow, reducing the current allowable issuing flow compared with the low priority to the corresponding priority guarantee flow, and accumulating the reduced flow value compared with the low priority to the actual expandable flow of the current priority. And then entering the priority (i +1) to judge the condition A again, executing the steps, if the judgment 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 priority 0 to the priority (n-1) is still insufficient to increase the channel traffic of the current priority n to the maximum allowable delivery traffic, increasing the actual expandable traffic after accumulation to the current allowable delivery traffic of the current priority, specifically:
performing F (i) now ═ F (i) min,
then executing F (n) real ═ F (n) real + [ F (i) now-F (i) min ]
Re-executing i +1
If i < n, the condition A is judged again, and if i ═ n, execution is performed
F(n)now＝F(n)now+F(n)real
And realizing the adjustment of the current allowed issued flow of the current priority.
In the above embodiment, preferably, when the short message is sent at the 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 guaranteed flow of the current priority is smaller than the preset utilization rate (the preset utilization rate is preferably 90% in this embodiment), it indicates that the actual flow of the current priority is smaller than the guaranteed flow at this time, and the channel flow of the current priority does not need to be expanded at this time, so that the guaranteed flow of the current priority is taken as the currently allowed flow of the current priority, and step 7 is executed, if not, it indicates that the channel flow required by the current priority is large enough at this time, and in order to avoid that the flow continues to be increased to affect the short message delivery of the current priority, step 5 to step 7 are executed, and the channel flow of the current priority is dynamically increased in advance.
With reference to step 5 in the above embodiment, the embodiment specifically includes: when the short message with the priority n is issued, if the guaranteed flow rate of the priority n at the current time is F (n), the min utilization rate is more than or equal to 90%, and F (n) now is less than F (n) max, it indicates that the flow rate of the current priority n is enough, so as to avoid the influence of the flow rate on the short message issuing with the current priority, and the current allowed issuing flow rate of the current priority does not reach the maximum allowed issuing flow rate, a part of channel flow rate resources can be used, thereby dynamically increasing the flow rate of the current priority.
In the above embodiment, preferably, the current backlog amount of the short message and the expected backlog processing time are also fed back through the short message packet, so as to assist the Ngnix server in distributing the short message to each gateway node in a balanced manner.
The above is only a preferred embodiment of the present invention, and is not intended to limit the present invention, and various modifications and changes will occur to those skilled in the art. Any modification, equivalent replacement, or improvement made within the spirit and principle of the present invention should be included in the protection scope of the present invention.
Claims (5)
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;
and step 3: the gateway node analyzes the SP number and the priority number in the message sent by the short message and calculates the actual use flow of the current priority;
and 4, step 4: judging whether the actual use flow of the current priority is less than or equal to the current allowable flow of the current priority, if so, sending the short message, otherwise, intercepting the short message and informing the short message service platform of the excessive flow;
and 5: after intercepting the short message, judging whether the current priority current allowed issued flow is smaller than the current priority maximum allowed issued flow, if not, not adjusting the flow, and if so, calculating the current SP unused total flow and the current priority maximum expandable 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 allowed issued flow of the current priority as the current allowed issued flow of the current priority, otherwise, reducing the current allowed issued flow of the lower priority from low to high so as to increase the current allowed issued flow of the current priority, and not adjusting the flows of other priorities;
and 7: and feeding back the current allowable issuing flow of the current priority through the short message.
2. The method as claimed in claim 1, wherein the specific process of decreasing the current allowed lower priority flow rate and thereby increasing the current allowed lower priority flow rate in step 6 comprises:
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 between the current permitted issued flow of the compared low priority and the corresponding priority guarantee flow and the actual expandable flow of the current priority:
if the current allowable issuing flow rate is smaller than or equal to the current allowable issuing flow rate of the current priority, reducing the current allowable issuing flow rate of the compared low priority to be the difference value between the maximum expandable flow rate of the current priority and the actual expandable flow rate, and increasing the current allowable issuing flow rate of the current priority to be the maximum allowable issuing flow rate of the current priority;
if the current allowable issuing flow is larger than the current allowable issuing flow, reducing the current allowable issuing flow compared with the low priority to the corresponding priority guarantee flow, accumulating the reduced flow value compared with the low priority to the current priority actual expandable flow, and if the actual expandable flow value is still larger than the current priority along with the increase of the priority, increasing the accumulated actual expandable flow to the current priority current allowable issuing flow.
3. The method of claim 1, wherein the method further comprises:
when the short message is issued at the current priority, recording the actual total flow of the current priority at the current time;
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 priority currently allowed to be issued, and executing the step 7, otherwise, executing the steps 5 to 7.
4. The method as claimed in claim 1, wherein the step 5 of calculating the total unused traffic of the current SP and the maximum scalable traffic of the current priority comprises:
the total unused flow of the current SP is the difference value of the total flow of the current SP and the sum of the flows which are allowed to be issued currently at all priorities;
the maximum expandable 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.
5. The method of claim 1, wherein the current backlog of short messages and the expected backlog processing time are fed back via short 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 true CN114039925A (en) | 2022-02-11 |
| CN114039925B 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) |
Cited By (2)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN115226050A (en) * | 2022-06-22 | 2022-10-21 | 百果园技术(新加坡)有限公司 | Flow distribution method, flow distribution device, flow distribution equipment, storage medium and program product |
| CN116708175A (en) * | 2023-08-01 | 2023-09-05 | 深圳市联合信息技术有限公司 | Operation and maintenance optimization scheduling method for remote information system |
Citations (12)
| 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 |
| US20090219940A1 (en) * | 2008-02-29 | 2009-09-03 | Oracle International Corporation | System and Method for Providing Throttling, Prioritization and Traffic Shaping During Request Processing via a Budget Service |
| 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 |
| US20150106502A1 (en) * | 2013-10-15 | 2015-04-16 | Rawllin International Inc. | Dynamic assignment of connection priorities for applications operating on a client 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 |
| US20170272371A1 (en) * | 2016-03-21 | 2017-09-21 | Alibaba Group Holding Limited | Flow control in connection with an access request |
| 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 |
-
2021
- 2021-10-28 CN CN202111263168.8A patent/CN114039925B/en active Active
Patent Citations (12)
| 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 |
| US20090219940A1 (en) * | 2008-02-29 | 2009-09-03 | Oracle International Corporation | System and Method for Providing Throttling, Prioritization and Traffic Shaping During Request Processing via a Budget Service |
| 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 |
| US20150106502A1 (en) * | 2013-10-15 | 2015-04-16 | Rawllin International Inc. | Dynamic assignment of connection priorities for applications operating on a client device |
| CN105208604A (en) * | 2014-06-09 | 2015-12-30 | 株式会社日立制作所 | Traffic management method in mobile network |
| US20170272371A1 (en) * | 2016-03-21 | 2017-09-21 | Alibaba Group Holding Limited | Flow control in connection with an access request |
| 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 |
|---|
| MOHAMMAD NOORMOHAMMADPOUR等: "Datacenter Traffic Control: Understanding Techniques and Tradeoffs", 《IEEE COMMUNICATIONS SURVEYS & TUTORIALS》 * |
| 李明: "电力短信系统中的流量控制和拥塞控制策略的研究", 《万方》 * |
| 蔡奕群;: "谈谈SP短信接口网关开发", 《河南科技》, no. 14 * |
Cited By (4)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN115226050A (en) * | 2022-06-22 | 2022-10-21 | 百果园技术(新加坡)有限公司 | Flow distribution method, flow distribution device, flow distribution equipment, storage medium and program product |
| 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 |
| CN116708175A (en) * | 2023-08-01 | 2023-09-05 | 深圳市联合信息技术有限公司 | Operation and maintenance optimization scheduling method for remote information system |
| CN116708175B (en) * | 2023-08-01 | 2023-10-20 | 深圳市联合信息技术有限公司 | Operation and maintenance optimization scheduling method for remote information system |
Also Published As
| Publication number | Publication date |
|---|---|
| CN114039925B (en) | 2023-11-28 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| Chen et al. | A service flow management strategy for IEEE 802.16 broadband wireless access systems in TDD mode | |
| CN114039925B (en) | Dynamic flow control method based on priority in short message gateway system | |
| US8165021B2 (en) | Policy-based resource management | |
| US6212200B1 (en) | Dynamic control system for bandwidth restriction value of non-real time communications | |
| EP3163815B1 (en) | Traffic control method and apparatus | |
| WO2015196562A1 (en) | Method for configuring scheduling information, method for processing configuration parameters and apparatuses | |
| EP2561660B1 (en) | Controlling data transmission over a network | |
| US20030214951A1 (en) | Method for differentiating services and users in communication networks | |
| CN108270674B (en) | Message forwarding method and device | |
| CN107872900B (en) | Satellite channel S-ALOHA access system and method supporting differentiated services | |
| CN102487494B (en) | Short message flow control method and system | |
| JP2015502674A (en) | Improving video quality of adaptive streaming by optimizing resource allocation | |
| CN109617836B (en) | Intelligent bandwidth allocation method and system for satellite data transmission | |
| CN101459966A (en) | Ad Hoc network MAC layer QoS guarantee method based on IEEE802.16 | |
| Saidu et al. | A load-aware weighted round-robin algorithm for IEEE 802.16 networks | |
| CN111371701A (en) | MAC layer queue scheduling method based on TDMA | |
| CN105049220A (en) | MCU resource scheduling method based on television video conference | |
| CN112272148B (en) | Multi-priority queue management method, device and storage medium | |
| US10638504B2 (en) | Data pull-up method in which uplink channel is dynamically allocated and communication device | |
| CN113766653B (en) | TDMA time slot allocation method facing service demand | |
| CN110855570A (en) | SDN (software defined network) packet loss judgment method, device and system and multi-network control system | |
| CN103281258A (en) | Method and device for transmitting data | |
| WO2021228180A1 (en) | Service data offloading method and apparatus, and base station and storage medium | |
| CN114845338A (en) | Random back-off method for user access | |
| US8218474B2 (en) | Bandwidth allocation in satellite communication networks |
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 |