CN113630327A - Flow control method and device, electronic equipment and computer readable medium - Google Patents
Flow control method and device, electronic equipment and computer readable medium Download PDFInfo
- Publication number
- CN113630327A CN113630327A CN202111185213.2A CN202111185213A CN113630327A CN 113630327 A CN113630327 A CN 113630327A CN 202111185213 A CN202111185213 A CN 202111185213A CN 113630327 A CN113630327 A CN 113630327A
- Authority
- CN
- China
- Prior art keywords
- service node
- traffic
- threshold
- flow
- service
- 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 54
- 238000012544 monitoring process Methods 0.000 claims abstract description 13
- 230000004044 response Effects 0.000 claims abstract description 10
- 238000012545 processing Methods 0.000 claims description 100
- 238000012360 testing method Methods 0.000 claims description 14
- 238000004590 computer program Methods 0.000 claims description 9
- 238000010586 diagram Methods 0.000 description 10
- 230000006870 function Effects 0.000 description 9
- 230000008569 process Effects 0.000 description 8
- 238000004891 communication Methods 0.000 description 6
- 230000003287 optical effect Effects 0.000 description 4
- 238000004364 calculation method Methods 0.000 description 3
- 239000003795 chemical substances by application Substances 0.000 description 3
- 238000005516 engineering process Methods 0.000 description 2
- 230000000644 propagated effect Effects 0.000 description 2
- 238000003491 array Methods 0.000 description 1
- 230000009286 beneficial effect Effects 0.000 description 1
- 230000007547 defect Effects 0.000 description 1
- 230000006872 improvement Effects 0.000 description 1
- 239000004973 liquid crystal related substance Substances 0.000 description 1
- 238000012986 modification Methods 0.000 description 1
- 230000004048 modification Effects 0.000 description 1
- 239000013307 optical fiber Substances 0.000 description 1
- 239000004065 semiconductor Substances 0.000 description 1
- 238000012546 transfer 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
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L67/00—Network arrangements or protocols for supporting network services or applications
- H04L67/01—Protocols
- H04L67/02—Protocols based on web technology, e.g. hypertext transfer protocol [HTTP]
Landscapes
- Engineering & Computer Science (AREA)
- Computer Networks & Wireless Communication (AREA)
- Signal Processing (AREA)
- Data Exchanges In Wide-Area Networks (AREA)
Abstract
The embodiment of the disclosure discloses a flow control method, a flow control device, an electronic device and a computer readable medium. One embodiment of the method comprises: monitoring at least one flow information of at least one service node of a target service, wherein the target service is provided with a service flow threshold value, the service node is provided with a flow sub-threshold value, and the sum of the flow sub-threshold values of the at least one service node is equal to the service flow threshold value; and in response to the target traffic information which exceeds the traffic sub-threshold of the target service node exists in the at least one piece of traffic information, dynamically adjusting the traffic sub-threshold of the at least one service node based on the target traffic information. The implementation mode ensures the normal operation of the target service and improves the utilization rate of the flow.
Description
Technical Field
Embodiments of the present disclosure relate to the field of computer technologies, and in particular, to a flow control method, an apparatus, an electronic device, and a computer-readable medium.
Background
With the popularity of networks, more and more users access the networks by using traffic to query information or to obtain items. When a user inquires information or obtains an article, the user is generally required to gradually implement the information or the article by dividing a plurality of data processing nodes. For example, a user obtains an article by browsing a network, which may be regarded as a service, where the service may include a plurality of service nodes (i.e., data processing nodes) such as logging in a website, browsing an article page, placing an order, generating logistics information, and performing a logistics processing flow, and a data processing amount corresponding to each service node may be different. When a user browses a network, the user logs in a website, places an order, generates logistics information and other service nodes, and the consumed flow is little; and the consumed flow is more in business nodes such as browsing object pages, logistics processing flows and the like. Also, the time spent by the user at each service node is different. The user only takes a few seconds to log on to the web site, while browsing through the item page may take half an hour. Thus, the various service nodes described above are related to each other, but are relatively independent in terms of the amount of traffic and time spent by each service node. Typically, to ensure proper operation of the web site, a technician may set a flow threshold for each service node. When the traffic at a certain service node exceeds a traffic threshold, the service node may not work properly. In order to ensure the normal operation of the website, the existing method usually employs a mode of directly limiting the flow and the like to refuse access, so as to avoid the website crash.
The existing method has the following defects:
firstly, the difference of the flow required by each service node in the user range is not considered, when a large number of users normally visit at the same time and a certain service node exceeds the flow quantum threshold value, the method for directly limiting the flow can reduce the data processing pressure of the service node, but the data processing capacity of the service node is not fully utilized.
Secondly, the website usually has a traffic threshold (or bandwidth, etc.), and the existing method does not fully utilize the traffic threshold to set a traffic threshold for the corresponding service node, so that the traffic is not reasonably utilized, and the traffic utilization rate is reduced.
Disclosure of Invention
This summary is provided to introduce a selection of concepts in a simplified form that are further described below in the detailed description. This summary is not intended to identify key features or essential features of the claimed subject matter, nor is it intended to be used to limit the scope of the claimed subject matter.
Some embodiments of the present disclosure propose a flow control method, apparatus, electronic device and computer readable medium to solve the technical problems mentioned in the background section above.
In a first aspect, some embodiments of the present disclosure provide a flow control method, including: monitoring at least one flow information of at least one service node of a target service, wherein the target service is provided with a service flow threshold value, the service node is provided with a flow sub-threshold value, and the sum of the flow sub-threshold values of the at least one service node is equal to the service flow threshold value; and in response to the target traffic information which exceeds the traffic sub-threshold of the target service node exists in the at least one piece of traffic information, dynamically adjusting the traffic sub-threshold of the at least one service node based on the target traffic information.
In a second aspect, some embodiments of the present disclosure provide a flow control device, the device comprising: a traffic information monitoring unit configured to monitor at least one traffic information of at least one service node of a target service, the target service having a service traffic threshold, the service node having a traffic sub-threshold, and a sum of the traffic sub-thresholds of the at least one service node being equal to the service traffic threshold; and the flow control unit is configured to respond to the target flow information which exceeds the flow sub-threshold of the target service node in the at least one piece of flow information, and dynamically adjust the flow sub-threshold of the at least one service node based on the target flow information.
In a third aspect, some embodiments of the present disclosure provide an electronic device, comprising: one or more processors; a storage device having one or more programs stored thereon, which when executed by one or more processors, cause the one or more processors to implement the method described in any of the implementations of the first aspect.
In a fourth aspect, some embodiments of the present disclosure provide a computer readable medium on which a computer program is stored, wherein the program, when executed by a processor, implements the method described in any of the implementations of the first aspect.
The above embodiments of the present disclosure have the following beneficial effects: the flow rate threshold is adjusted by the flow rate control method of some embodiments of the present disclosure, which improves the utilization rate of the flow rate. Specifically, the reason why the utilization rate of the flow rate is not high is that: the traffic threshold is not properly adjusted for the traffic node. Based on this, the traffic control method in some embodiments of the present disclosure first monitors the traffic information of each service node, and dynamically adjusts the traffic sub-threshold of a service node when the traffic information of a certain service node exceeds the traffic sub-threshold of the service node. Therefore, the service node can acquire the flow after adjusting the flow quantum threshold, so that the normal operation of the target service is ensured, and the utilization rate of the flow is improved.
Drawings
The above and other features, advantages and aspects of various embodiments of the present disclosure will become more apparent by referring to the following detailed description when taken in conjunction with the accompanying drawings. Throughout the drawings, the same or similar reference numbers refer to the same or similar elements. It should be understood that the drawings are schematic and that elements and elements are not necessarily drawn to scale.
Fig. 1 is a schematic diagram of an application scenario of a flow control method of some embodiments of the present disclosure;
fig. 2 is a flow diagram of some embodiments of a flow control method according to the present disclosure;
FIG. 3 is a flow chart of further embodiments of a flow control method according to the present disclosure;
FIG. 4 is a flow chart of still further embodiments of a flow control method according to the present disclosure;
FIG. 5 is a schematic structural view of some embodiments of a flow control device according to the present disclosure;
FIG. 6 is a schematic structural diagram of an electronic device suitable for use in implementing some embodiments of the present disclosure.
Detailed Description
Embodiments of the present disclosure will be described in more detail below with reference to the accompanying drawings. While certain embodiments of the present disclosure are shown in the drawings, it is to be understood that the disclosure may be embodied in various forms and should not be construed as limited to the embodiments set forth herein. Rather, these embodiments are provided for a more thorough and complete understanding of the present disclosure. It should be understood that the drawings and embodiments of the disclosure are for illustration purposes only and are not intended to limit the scope of the disclosure.
It should be noted that, for convenience of description, only the portions related to the related invention are shown in the drawings. The embodiments and features of the embodiments in the present disclosure may be combined with each other without conflict.
It should be noted that the terms "first", "second", and the like in the present disclosure are only used for distinguishing different devices, modules or units, and are not used for limiting the order or interdependence relationship of the functions performed by the devices, modules or units.
It is noted that references to "a", "an", and "the" modifications in this disclosure are intended to be illustrative rather than limiting, and that those skilled in the art will recognize that "one or more" may be used unless the context clearly dictates otherwise.
The names of messages or information exchanged between devices in the embodiments of the present disclosure are for illustrative purposes only, and are not intended to limit the scope of the messages or information.
The present disclosure will be described in detail below with reference to the accompanying drawings in conjunction with embodiments.
Fig. 1 is a schematic diagram of one application scenario of a flow control method according to some embodiments of the present disclosure.
As shown in fig. 1, a user may access a target service on a server 105 through a terminal device 101, 102, 103 via a network 104. The target service of the present application may be a complete process including a plurality of service nodes to perform data processing. For example, the target service may be a network selection item, an information query, a video browsing, and the like. When the target service selects an article for the network, the target service may include a plurality of service nodes such as article page browsing, article ordering, logistics, and the like. For example, the target traffic may contain 5 traffic nodes, and each traffic node may be provided with a corresponding traffic sub-threshold. As in fig. 1, in coordinate system 1 and coordinate system 2, the abscissa represents the number of the service node, and the ordinate represents the traffic of the service node. Each service node is represented by a rectangular graph, and the thick line at the top end of the rectangular graph represents the flow sub-threshold of the corresponding service node. The sum of all the flow sub-thresholds is the service flow threshold of the target service. The traffic flow threshold may be the total flow (or bandwidth, etc.) allocated to the traffic node. The server 105 may monitor the traffic information for each service node in real time. In the coordinate system 1, when the server 105 monitors that the traffic information of the service node 3 and the service node 4 exceeds the corresponding traffic sub-threshold, the traffic sub-thresholds of the service node 2 and the service node 5 may be adjusted downward, and the remaining traffic thresholds after the adjustment are allocated to the service node 3 and the service node 4, as shown in the coordinate system 2 in fig. 1, after part of the traffic thresholds of the service node 2 and the service node 5 are allocated to the service node 3 and the service node 4, the respective traffic sub-thresholds of the service node 3 and the service node 4 become larger, and the traffic sub-thresholds of the service node 2 and the service node 5 become smaller. Therefore, on the basis that the total service flow threshold of the target service is not changed, the flow sub-threshold of the service node is dynamically adjusted, so that the service flow of the target service is fully utilized, and the flow utilization rate is improved.
It should be understood that the number of terminal devices and servers in fig. 1 is merely illustrative. There may be any number of terminal devices and servers, as desired for implementation.
With continued reference to fig. 2, fig. 2 illustrates a flow 200 of some embodiments of a flow control method according to the present disclosure. The flow control method comprises the following steps:
In some embodiments, the execution subject of the flow control method (e.g., the server 105 shown in fig. 1) may receive a web browsing request from a terminal with which a user browses a web page through a wired connection or a wireless connection. It should be noted that the wireless connection means may include, but is not limited to, a 3G/4G/5G connection, a WiFi connection, a bluetooth connection, a WiMAX connection, a Zigbee connection, a uwb (ultra Wide band) connection, and other wireless connection means now known or developed in the future.
The execution body can monitor the flow information of each service node of the target service in real time. In practice, each execution body may be provided with a plurality of services, and each service may have a corresponding service flow threshold. The traffic flow threshold value may be represented by flow data processed per unit time or may be represented by a bandwidth consumed per unit time. Correspondingly, the target service is provided with a service flow threshold value. When the service includes a plurality of service nodes, each service node may be provided with a traffic sub-threshold, and the traffic sub-threshold is used to display the traffic of the corresponding service node. The sum of the traffic sub-thresholds of the at least one service node is equal to the traffic threshold.
When the execution main body detects that the target traffic information exceeds the traffic sub-threshold of the corresponding service node, the execution main body can dynamically adjust the traffic sub-threshold of the service node based on the target traffic information, so that each service node can normally process traffic under the condition that the total traffic of the target service is not changed. Therefore, the normal operation of the target service is ensured, and the utilization rate of the flow of the target service is improved.
The flow control method disclosed in some embodiments of the present disclosure adjusts a flow threshold, improving the utilization of the flow. Specifically, the reason why the utilization rate of the flow rate is not high is that: the traffic threshold is not properly adjusted for the traffic node. Based on this, the traffic control method in some embodiments of the present disclosure first monitors the traffic information of each service node, and dynamically adjusts the traffic sub-threshold of a service node when the traffic information of a certain service node exceeds the traffic sub-threshold of the service node. Therefore, the service node can acquire the flow after adjusting the flow quantum threshold, so that the normal operation of the target service is ensured, and the utilization rate of the flow is improved.
With continued reference to fig. 3, fig. 3 illustrates a flow 300 of some embodiments of a flow control method according to the present disclosure. The flow control method comprises the following steps:
Generally, the execution agent may store a plurality of services, and for each service, the execution agent (e.g., the server 105 shown in fig. 1) may first query at least one service node included in the target service. The service node may be configured to process the received traffic data. As described in the background art, the target service may be shopping, and each corresponding service node may include a plurality of service nodes such as logging in a website, browsing a page of an item, placing an order, generating logistics information, and performing a logistics process. Each service node corresponds to a flow quantum threshold.
In order to set a traffic sub-threshold for each service node, the execution subject may obtain full-load data throughput information of each service node, resulting in a full-load data throughput information set. Wherein, the information of full-load data processing capacity is used for describing the maximum data processing capacity of the service node in unit time. For example, full data throughput information may be 100 megabits per second, etc.
In some optional implementation manners of some embodiments, the obtaining information of full-load data throughput of a service node in the at least one service node may include: and for the service node in the at least one service node, testing the full-load data processing quantity information and the full-load data processing time of the service node through preset test data.
The execution main body can construct test data corresponding to each service node, and the maximum data processing amount which can be borne by the service node is tested through the test data, so that full-load data processing amount information and full-load data processing time are obtained. Wherein the full data processing time may represent a time required for processing the test data at the service node from a start of processing the test data to a full state.
After the full-load data processing amount information set is obtained, the execution main body can set a flow quantum threshold value for the corresponding service node according to each full-load data processing amount information in the full-load data processing amount information set. For example, the execution body may directly set the full data throughput information as the traffic sub-threshold of the corresponding service node.
In some optional implementations of some embodiments, the setting a traffic subthreshold of a service node in the at least one service node based on the full data throughput information set may include:
the first step, for the service node in the at least one service node, constructing a data time relation graph between full-load data processing capacity information and full-load data processing time of the service node.
The executing agent may first construct a data time relationship graph for the service node. The data time relation graph is used for representing the corresponding relation between the data processing quantity and the data processing time of the service node. In this way, the characteristics of processing data by connecting each service node can be intuitively realized through the data time relation graph.
And secondly, setting a flow sub-threshold of a service node in at least one service node based on the data time relation graph.
The execution body may set the traffic sub-threshold of the service node according to the data processing characteristics of the service node embodied by the data time relationship graph. For example, the execution body may set the flow data corresponding to the full data throughput information as the flow sub-threshold, or set the percentage value of the full data throughput information as the flow sub-threshold.
In some optional implementation manners of some embodiments, the setting a traffic subthreshold of a service node of the at least one service node based on the data time relationship graph may include the following steps:
firstly, setting the processing time of the full-load data with the minimum value in the at least one data time relation graph as the processing time of the reference data.
In order to ensure that the target service can stably operate, the execution subject needs to ensure that each service node of the target service does not have traffic congestion and the like. For this purpose, the execution body may find a balance point from the multiple data time relationship graphs, so that all service nodes can stably operate at the balance point. Assuming that the data processing capacity of each service node is the same, the information of the full-load data processing amount of the service node corresponding to the full-load data processing time with the minimum value is also smaller. That is, the service node corresponding to the minimum full-load data processing time reaches the full-load state first, and if the traffic is more, the service node may not operate normally. For this, the execution subject may set a full data processing time, which is the smallest value among the plurality of data time relationship diagrams, as the reference data processing time.
And secondly, acquiring at least one piece of initial data processing amount information of the reference data processing time in the at least one data time relation graph.
The execution main body can inquire each data time relation graph in at least one other data time relation graph according to the reference data processing time, and further determine initial data processing amount information corresponding to the reference data processing time in each data time relation graph.
And thirdly, setting a flow sub-threshold of a service node in at least one service node based on the at least one initial data processing amount information.
After obtaining at least one piece of initial data throughput information, the execution body may determine the flow quantum threshold according to the intermediate value of the initial data throughput information and the full-load data throughput information of the corresponding service node. For example, the executive may set the full data throughput information to 100 million per second and the initial data throughput information to 60 million per second, and the flow sub-threshold may be set to 80 million per second.
In some optional implementations of some embodiments, the setting a traffic subthreshold of a service node in the at least one service node based on the at least one initial data throughput information may include:
the first step is to obtain the data volume ratio between the at least one initial data processing volume information.
For example, the plurality of initial data throughput information may be 20 million per second, 40 million per second, 60 million per second, 80 million per second, and the data volume ratio may be: 2: 4: 6: 8.
and secondly, setting a flow sub-threshold of a service node in at least one service node based on the data volume ratio between the service flow threshold and the at least one piece of initial data processing volume information.
The data volume proportion can be as follows: 2: 4: 6: for example, if the traffic flow threshold of the target traffic is 100 mega per second, the flow sub-thresholds corresponding to the traffic nodes may be 10 mega per second, 20 mega per second, 30 mega per second, and 40 mega per second, respectively.
The contents of step 304 and step 305 are the same as those of step 201 and step 202, and are not described in detail here.
In some optional implementations of some embodiments, the dynamically adjusting the traffic sub-threshold of the at least one service node based on the target traffic information may include the following steps:
first, calculating a traffic difference between the target traffic information and a traffic sub-threshold of the target service node.
The executing body may calculate a traffic difference between the target traffic information and the traffic sub-threshold of the target service node, and the traffic difference may be used to characterize the amount of the threshold that the target service node needs to be increased.
And secondly, dividing a threshold difference value which is equal to the flow difference value from the flow sub-threshold values of other service nodes, and distributing the threshold difference value to the target service node.
The executing body may query the difference between the actual traffic of other service nodes and the traffic sub-threshold, then select a threshold equal to the threshold difference from the difference, and allocate the threshold difference to the target service node. In practice, the traffic per traffic node is typically less than the flow sub-threshold. Correspondingly, the relationship between the full-load data processing capacity information and the flow sub-threshold in the present application is: the full load data throughput information is greater than the flow sub-threshold. Since the traffic of each service node in practice changes dynamically, it may happen that the actual traffic is greater than the flow sub-threshold. Therefore, the flow quantum threshold value can be dynamically adjusted on the premise that full-load data processing quantity information of the service node is not exceeded, so that each service node can process flow to the maximum extent. Therefore, on the premise of ensuring that all service nodes can work normally, the data processing capacity of the target service node is improved, the dynamic adjustment of the flow quantum threshold is realized, and the flow utilization rate of the target service is improved.
With further reference to fig. 4, a flow 400 of further embodiments of a flow control method is illustrated. The flow 400 of the flow control method includes the following steps:
The content of step 401 is the same as that of step 201, and is not described in detail here.
In practice, the traffic data processed by each service node is usually dynamically changed and has a certain regularity. For example, a user usually logs in a network platform to browse information after work or on weekends, and therefore traffic data is different for different time periods by the service node. The execution subject can count the flow of each service node to obtain a flow peak graph of the service node. The traffic peak map may be used to represent a correspondence between traffic peaks and times of corresponding service nodes. The traffic peak map may be a continuous curve having at least one traffic peak, and the abscissa of the curve in the coordinate system may represent time information and the ordinate of the curve in the coordinate system may represent traffic information.
And 403, dynamically adjusting the traffic sub-threshold of the at least one service node based on the traffic peak map.
The traffic peaks may differ for different service nodes. For example, a certain service node may be for processing a browsing page, and the time of traffic peak may be after next shift (e.g. may be 9 pm). Another service node may be for handling logistics information and the time of the traffic peak may be in the early morning. Thus, not all traffic nodes reach traffic peak at the same time. For this purpose, the execution body may adjust the traffic sub-threshold between the service nodes, so that the service node with the peak traffic can use the threshold space of the service node which does not reach the peak traffic, thereby implementing dynamic adjustment of the traffic sub-threshold of the service node according to the traffic peak map. Therefore, the utilization rate of the service flow threshold of each service node is improved on the premise of ensuring the normal operation of each service node.
In some optional implementations of some embodiments, the dynamically adjusting the traffic sub-threshold of the at least one service node based on the traffic peak map may include:
and step one, inquiring target peak time information corresponding to the target traffic information.
In practice, the service node of the target service may have a different function. For example, the service node may be used for browsing pages, and may also be used for ordering or logistics processing of goods. As can be seen from the above description, the peak time of the service nodes of different functions may be different. For this, the execution body may query target rush hour information corresponding to the target traffic information. Optionally, the execution subject may query the target peak time information corresponding to the target traffic information through the traffic peak map. When a traffic peak occurs temporarily, the executive body can inquire the target peak time information corresponding to the target traffic information in a mode of monitoring traffic in real time.
And secondly, inquiring at least one piece of flow to be processed of other service nodes based on the target peak time information.
In order to ensure the normal operation of the target service node at the time corresponding to the target rush hour information, the execution main body may query the pending flows (i.e., actual flows) of other service nodes based on the target rush hour information, so as to search the service nodes capable of adjusting the flow quantum threshold from the pending flows.
And thirdly, dynamically adjusting the flow sub-threshold of the at least one service node based on the service flow threshold and the at least one flow to be processed.
When other service nodes do not reach respective flow sub-threshold values and a certain flow sub-threshold value difference exists between the current flow to be processed of the service node and the flow sub-threshold value, the execution main body can select a certain flow sub-threshold value from the flow sub-threshold value differences to distribute to the target service node on the premise that the service flow threshold value of the target service is not changed, so that the purpose of dynamically adjusting the flow sub-threshold value of at least one service node is achieved.
In some optional implementations of some embodiments, the dynamically adjusting the traffic sub-threshold of the at least one service node based on the traffic threshold and the at least one pending traffic may include:
first, calculating a target traffic difference between the target traffic information and a traffic sub-threshold of a corresponding target service node.
When the execution subject allocates the traffic sub-threshold to the target service node, there may be a case where too much or too little allocation occurs. In order to effectively improve the utilization rate of the traffic flow threshold of the target service, the execution main body may calculate a target traffic difference between the target traffic information and the traffic sub-threshold of the corresponding target service node, so as to achieve accurate adjustment of the traffic sub-threshold of the target service node. Therefore, the data processing capacity of the service node can be utilized to the maximum extent on the premise of ensuring the normal operation of the service node, and the improvement of the data processing efficiency is facilitated.
And secondly, determining at least one flow difference value between the flow to be processed in the at least one flow to be processed and the flow sub-threshold value of the corresponding service node.
The execution body may calculate a traffic difference between the traffic sub-threshold of each service node and the traffic to be processed, respectively, to determine which service nodes may assign the traffic sub-threshold to the target service node.
And thirdly, in response to the fact that the sum of the at least one flow difference value is larger than the target flow difference value, setting an update flow sub-threshold of the target service node and update flow sub-thresholds of other service nodes based on the service flow threshold and the at least one flow difference value.
When the sum of at least one traffic difference value is greater than the target traffic difference value, the execution main body may select a traffic difference value slightly greater than the target traffic difference value (or greater than a set percentage of the target traffic difference value) from the plurality of traffic difference values to allocate to the target service node. And then setting the updated flow sub-threshold of each service node, thereby realizing the dynamic adjustment of the flow sub-threshold of each service node and improving the utilization rate of the service flow threshold of the service node.
With further reference to FIG. 5, as an implementation of the methods illustrated in the above figures, the present disclosure provides some embodiments of a flow control device, corresponding to those method embodiments illustrated in FIG. 2, which may be particularly applicable in various electronic devices.
As shown in fig. 5, the flow control device 500 of some embodiments includes: a flow information monitoring unit 501 and a flow control unit 502. The traffic information monitoring unit 501 is configured to monitor at least one piece of traffic information of at least one service node of a target service, where the target service is provided with a service traffic threshold, the service node is provided with a traffic sub-threshold, and a sum of the traffic sub-thresholds of the at least one service node is equal to the service traffic threshold; a traffic control unit 502 configured to, in response to the target traffic information exceeding the traffic sub-threshold of the target service node existing in the at least one traffic information, dynamically adjust the traffic sub-threshold of the at least one service node based on the target traffic information.
In an optional implementation manner of some embodiments, the flow control device 500 may further include: a flow sub-threshold setting unit (not shown in the figure), a service node querying subunit (not shown in the figure), a full-load data processing amount information obtaining subunit (not shown in the figure), and a flow sub-threshold setting subunit (not shown in the figure). Wherein the flow sub-threshold setting unit is configured to set a flow sub-threshold, and the flow sub-threshold setting unit includes: a service node query subunit configured to query at least one service node included in the target service, where the service node is used to process received traffic data; a full-load data processing amount information obtaining subunit configured to obtain full-load data processing amount information of a service node in the at least one service node, and obtain a full-load data processing amount information set; and the flow sub-threshold setting subunit is configured to set a flow sub-threshold of a service node in at least one service node based on the full-load data processing capacity information set.
In an optional implementation manner of some embodiments, the full-load data throughput information obtaining subunit may include: and a full data processing amount information obtaining module (not shown in the figure) configured to, for a service node in the at least one service node, test full data processing amount information and full data processing time of the service node through preset test data, where the full data processing time is used to represent time required for processing the test data at the service node from start of processing the test data to a full state.
In an optional implementation manner of some embodiments, the traffic sub-threshold setting subunit may include: a data time graph building module (not shown in the figure) and a flow sub-threshold setting module (not shown in the figure). The data time relationship graph constructing module is configured to construct, for a service node in the at least one service node, a data time relationship graph between full-load data processing capacity information and full-load data processing time of the service node, where the data time relationship graph is used to represent a corresponding relationship between data processing capacity and data processing time of the service node; and the flow sub-threshold setting module is configured to set a flow sub-threshold of a service node in the at least one service node based on the data time relation graph.
In an optional implementation manner of some embodiments, the flow sub-threshold setting module may include: a reference data processing time setting sub-module (not shown), an initial data processing amount information obtaining sub-module (not shown), and a flow rate sub-threshold sub-module (not shown). The reference data processing time setting submodule is configured to set the minimum full-load data processing time in the at least one data time relation graph as reference data processing time; an initial data processing amount information acquisition submodule configured to acquire at least one piece of initial data processing amount information of the reference data processing time in the at least one data time relation graph; and the flow sub-threshold submodule is configured to set a flow sub-threshold of a service node in at least one service node based on the at least one piece of initial data processing capacity information.
In an optional implementation manner of some embodiments, the flow sub-threshold sub-module may include: a data volume ratio acquisition module (not shown) and a flow sub-threshold setting module (not shown). The data volume proportion acquisition module is configured to acquire a data volume proportion between the at least one piece of initial data processing volume information; and the flow sub-threshold setting module is configured to set a flow sub-threshold of a service node in at least one service node based on the service flow threshold and the data volume proportion.
In an optional implementation manner of some embodiments, the flow control unit 502 may include: a flow difference calculation subunit (not shown) and a flow control subunit (not shown). The traffic difference calculating subunit is configured to calculate a traffic difference between the target traffic information and a traffic sub-threshold of the target service node; and a traffic control sub-unit configured to divide a threshold difference value equal to the traffic difference value from traffic sub-threshold values of other service nodes, and to allocate the threshold difference value to the target service node.
In an optional implementation manner of some embodiments, the flow control unit 502 may include: a traffic peak map acquisition subunit (not shown in the figure) and a traffic sub-threshold adjustment subunit (not shown in the figure). The traffic peak map acquiring subunit is configured to acquire a traffic peak map of a service node in the at least one service node, where the traffic peak map is used to represent a correspondence between a traffic peak of the corresponding service node and time; a flow sub-threshold adjusting subunit configured to dynamically adjust the flow sub-threshold of the at least one service node based on the flow peak map.
In an optional implementation manner of some embodiments, the traffic sub-threshold adjusting subunit may include: a target rush hour information query module (not shown), a pending traffic query module (not shown), and a traffic sub-threshold adjustment module (not shown). The target peak time information inquiry module is configured to inquire the target peak time information corresponding to the target traffic information; a pending traffic query module configured to query at least one pending traffic of other service nodes based on the target rush hour information; and a traffic sub-threshold adjustment module configured to dynamically adjust the traffic sub-threshold of the at least one service node based on the traffic threshold and the at least one pending traffic.
In an optional implementation manner of some embodiments, the flow sub-threshold adjusting module may include: a target flow difference calculation sub-module (not shown), a flow difference determination sub-module (not shown), and an updated flow sub-threshold setting sub-module (not shown). The target traffic difference calculation submodule is configured to calculate a target traffic difference between the target traffic information and a traffic subthreshold of a corresponding target service node; a traffic difference determination submodule configured to determine at least one traffic difference between a traffic to be processed in the at least one traffic to be processed and a traffic sub-threshold of the corresponding service node; and the updating flow sub-threshold setting sub-module is configured to respond to the condition that the sum of the at least one flow difference value is larger than the target flow difference value, and set the updating flow sub-threshold of the target service node and the updating flow sub-thresholds of other service nodes based on the service flow threshold and the at least one flow difference value.
It will be understood that the elements described in the apparatus 500 correspond to various steps in the method described with reference to fig. 2. Thus, the operations, features and resulting advantages described above with respect to the method are also applicable to the apparatus 500 and the units included therein, and are not described herein again.
As shown in fig. 6, electronic device 600 may include a processing means (e.g., central processing unit, graphics processor, etc.) 601 that may perform various appropriate actions and processes in accordance with a program stored in a Read Only Memory (ROM) 602 or a program loaded from a storage means 608 into a Random Access Memory (RAM) 603. In the RAM 603, various programs and data necessary for the operation of the electronic apparatus 600 are also stored. The processing device 601, the ROM 602, and the RAM 603 are connected to each other via a bus 604. An input/output (I/O) interface 605 is also connected to bus 604.
Generally, the following devices may be connected to the I/O interface 605: input devices 606 including, for example, a touch screen, touch pad, keyboard, mouse, camera, microphone, accelerometer, gyroscope, etc.; output devices 607 including, for example, a Liquid Crystal Display (LCD), a speaker, a vibrator, and the like; storage 608 including, for example, tape, hard disk, etc.; and a communication device 609. The communication means 609 may allow the electronic device 600 to communicate with other devices wirelessly or by wire to exchange data. While fig. 6 illustrates an electronic device 600 having various means, it is to be understood that not all illustrated means are required to be implemented or provided. More or fewer devices may alternatively be implemented or provided. Each block shown in fig. 6 may represent one device or may represent multiple devices as desired.
In particular, according to some embodiments of the present disclosure, the processes described above with reference to the flow diagrams may be implemented as computer software programs. For example, some embodiments of the present disclosure 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 in the flow chart. In some such embodiments, the computer program may be downloaded and installed from a network through the communication device 609, or installed from the storage device 608, or installed from the ROM 602. The computer program, when executed by the processing device 601, performs the above-described functions defined in the methods of some embodiments of the present disclosure.
It should be noted that the computer readable medium described above in some embodiments of the present disclosure may be a computer readable signal medium or a computer readable storage medium 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. In some embodiments of the disclosure, a 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 some embodiments of the present disclosure, 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: electrical wires, optical cables, RF (radio frequency), etc., or any suitable combination of the foregoing.
In some embodiments, the clients, servers may communicate using any currently known or future developed network Protocol, such as HTTP (HyperText Transfer Protocol), and may interconnect with any form or medium of digital data communication (e.g., a communications network). Examples of communication networks include a local area network ("LAN"), a wide area network ("WAN"), the Internet (e.g., the Internet), and peer-to-peer networks (e.g., ad hoc peer-to-peer networks), as well as any currently known or future developed network.
The computer readable medium may be embodied in the electronic device; or may exist separately without being assembled into the electronic device. The computer readable medium carries one or more programs which, when executed by the electronic device, cause the electronic device to: monitoring at least one flow information of at least one service node of a target service, wherein the target service is provided with a service flow threshold value, the service node is provided with a flow sub-threshold value, and the sum of the flow sub-threshold values of the at least one service node is equal to the service flow threshold value; and in response to the target traffic information which exceeds the traffic sub-threshold of the target service node exists in the at least one piece of traffic information, dynamically adjusting the traffic sub-threshold of the at least one service node based on the target traffic information.
Computer program code for carrying out operations for embodiments of the present disclosure may be written in any combination of one or more programming languages, including an object oriented programming language such as Java, Smalltalk, C + +, and conventional procedural programming languages, such as the "C" programming language or similar programming languages. The program code may execute entirely on the user's computer, partly on the user's computer, as a stand-alone software package, partly on the user's computer and partly on a remote computer or entirely on the remote computer or server. In the case of a remote computer, the remote computer may be connected to the user's computer through any type of network, including a Local Area Network (LAN) or a Wide Area Network (WAN), or the connection may be made to an external computer (for example, through the Internet using an Internet service provider).
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 disclosure. 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 units described in some embodiments of the present disclosure may be implemented by software, and may also be implemented by hardware. The described units may also be provided in a processor, and may be described as: a processor includes a flow information monitoring unit and a flow control unit. Where the names of these elements do not in some cases constitute a limitation of the element itself, for example, a flow control element may also be described as an "element for dynamically adjusting a traffic sub-threshold of a service node".
The functions described herein above may be performed, at least in part, by one or more hardware logic components. For example, without limitation, exemplary types of hardware logic components that may be used include: field Programmable Gate Arrays (FPGAs), Application Specific Integrated Circuits (ASICs), Application Specific Standard Products (ASSPs), systems on a chip (SOCs), Complex Programmable Logic Devices (CPLDs), and the like.
The foregoing description is only exemplary of the preferred embodiments of the disclosure and is illustrative of the principles of the technology employed. It will be appreciated by those skilled in the art that the scope of the invention in the embodiments of the present disclosure is not limited to the specific combination of the above-mentioned features, but also encompasses other embodiments in which any combination of the above-mentioned features or their equivalents is made without departing from the inventive concept as defined above. For example, the above features and (but not limited to) technical features with similar functions disclosed in the embodiments of the present disclosure are mutually replaced to form the technical solution.
Claims (10)
1. A method of flow control, comprising:
monitoring at least one flow information of at least one service node of a target service, wherein the target service is provided with a service flow threshold value, the service node is provided with a flow sub-threshold value, and the sum of the flow sub-threshold values of the at least one service node is equal to the service flow threshold value;
and in response to the target traffic information which exceeds the traffic sub-threshold of the target service node exists in the at least one piece of traffic information, dynamically adjusting the traffic sub-threshold of the at least one service node based on the target traffic information.
2. The method of claim 1, wherein the method further comprises:
inquiring at least one service node contained in the target service, wherein the service node is used for processing the received flow data;
acquiring full-load data processing capacity information of a service node in the at least one service node to obtain a full-load data processing capacity information set;
and setting a flow sub-threshold of a service node in at least one service node based on the full-load data processing capacity information set.
3. The method of claim 2, wherein the obtaining full data throughput information for a service node of the at least one service node comprises:
and for a service node in the at least one service node, testing full-load data processing quantity information and full-load data processing time of the service node through preset test data, wherein the full-load data processing time is used for representing the time required by the service node from the beginning of processing the test data to the full-load state of processing the test data.
4. The method of claim 3, wherein said setting a traffic subthreshold for a traffic node of at least one traffic node based on said full data throughput information set comprises:
for a service node in the at least one service node, constructing a data time relation graph between full-load data processing capacity information and full-load data processing time of the service node, wherein the data time relation graph is used for representing the corresponding relation between the data processing capacity and the data processing time of the service node;
and setting a flow sub-threshold value of the service node in the at least one service node based on the data time relation graph.
5. The method of claim 4, wherein the setting of the traffic subthreshold for a traffic node of the at least one traffic node based on the data-time relationship graph comprises:
setting the processing time of the full-load data with the minimum value in the at least one data time relation graph as the reference data processing time;
acquiring at least one piece of initial data processing amount information of the reference data processing time in the at least one data time relation graph;
and setting a flow sub-threshold of a service node in at least one service node based on the at least one initial data processing capacity information.
6. The method of claim 5, wherein said setting a traffic subthreshold for a traffic node of at least one traffic node based on said at least one initial data throughput information comprises:
acquiring a data volume proportion between the at least one piece of initial data processing volume information;
and setting a flow sub-threshold of a service node in at least one service node based on the service flow threshold and the data volume ratio.
7. The method of claim 1, wherein the dynamically adjusting the traffic sub-threshold for the at least one traffic node based on the target traffic information comprises:
calculating a flow difference value between the target flow information and a flow sub-threshold value of a target service node;
and dividing a threshold difference value which is equal to the flow difference value from the flow sub-threshold values of other service nodes, and distributing the threshold difference value to the target service node.
8. A flow control device comprising:
a traffic information monitoring unit configured to monitor at least one traffic information of at least one service node of a target service, the target service being provided with a service traffic threshold, the service node being provided with a traffic sub-threshold, the sum of the traffic sub-thresholds of the at least one service node being equal to the service traffic threshold;
a flow control unit configured to dynamically adjust a traffic sub-threshold of the at least one service node based on target traffic information in response to the target traffic information exceeding the traffic sub-threshold of the target service node being present in the at least one traffic information.
9. An electronic device, comprising:
one or more processors;
a storage device having one or more programs stored thereon,
when executed by the one or more processors, cause the one or more processors to implement the method of any one of claims 1-7.
10. A computer-readable medium, on which a computer program is stored, wherein the program, when executed by a processor, implements the method of any one of claims 1 to 7.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202111185213.2A CN113630327B (en) | 2021-10-12 | 2021-10-12 | Flow control method and device, electronic equipment and computer readable medium |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202111185213.2A CN113630327B (en) | 2021-10-12 | 2021-10-12 | Flow control method and device, electronic equipment and computer readable medium |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN113630327A true CN113630327A (en) | 2021-11-09 |
| CN113630327B CN113630327B (en) | 2022-02-18 |
Family
ID=78391043
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN202111185213.2A Active CN113630327B (en) | 2021-10-12 | 2021-10-12 | Flow control method and device, electronic equipment and computer readable medium |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN113630327B (en) |
Cited By (1)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN114553775A (en) * | 2022-02-15 | 2022-05-27 | 维沃移动通信有限公司 | Flow control method and device |
Citations (4)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US20140297857A1 (en) * | 2011-12-02 | 2014-10-02 | Nec Corporation | Traffic management device, system, method, and non-transitory computer readable medium storing program |
| CN109547364A (en) * | 2018-12-13 | 2019-03-29 | 平安科技（深圳）有限公司 | System bandwidth processing method, device, computer equipment and storage medium |
| CN109889999A (en) * | 2018-12-29 | 2019-06-14 | 深圳市中天网景科技有限公司 | A kind of flow cell management method, system and the terminal of Internet of Things network interface card |
| CN110113224A (en) * | 2019-03-19 | 2019-08-09 | 深圳壹账通智能科技有限公司 | Capacity monitor method, apparatus, computer equipment and storage medium |
-
2021
- 2021-10-12 CN CN202111185213.2A patent/CN113630327B/en active Active
Patent Citations (4)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US20140297857A1 (en) * | 2011-12-02 | 2014-10-02 | Nec Corporation | Traffic management device, system, method, and non-transitory computer readable medium storing program |
| CN109547364A (en) * | 2018-12-13 | 2019-03-29 | 平安科技（深圳）有限公司 | System bandwidth processing method, device, computer equipment and storage medium |
| CN109889999A (en) * | 2018-12-29 | 2019-06-14 | 深圳市中天网景科技有限公司 | A kind of flow cell management method, system and the terminal of Internet of Things network interface card |
| CN110113224A (en) * | 2019-03-19 | 2019-08-09 | 深圳壹账通智能科技有限公司 | Capacity monitor method, apparatus, computer equipment and storage medium |
Cited By (2)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN114553775A (en) * | 2022-02-15 | 2022-05-27 | 维沃移动通信有限公司 | Flow control method and device |
| CN114553775B (en) * | 2022-02-15 | 2024-04-26 | 维沃移动通信有限公司 | Flow control method and device |
Also Published As
| Publication number | Publication date |
|---|---|
| CN113630327B (en) | 2022-02-18 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN108810047B (en) | Method and device for determining information push accuracy rate and server | |
| CN110650209B (en) | Method and device for realizing load balancing | |
| CN112379982B (en) | Task processing method, device, electronic equipment and computer readable storage medium | |
| CN114143270B (en) | Bandwidth adjustment method and device | |
| CN113630327B (en) | Flow control method and device, electronic equipment and computer readable medium | |
| US11172018B2 (en) | Method and apparatus for controlling traffic | |
| CN113760991A (en) | Data operation method and device, electronic equipment and computer readable medium | |
| CN112684899A (en) | Client operation control method and device, electronic equipment and computer readable medium | |
| CN110401731B (en) | Method and apparatus for distributing content distribution nodes | |
| CN113765964A (en) | Method and device for distributing services of distributed system | |
| CN111831448A (en) | Request processing method and device and electronic equipment | |
| CN112561301A (en) | Work order distribution method, device, equipment and computer readable medium | |
| CN109471574B (en) | Method and device for configuring resources | |
| CN111343046B (en) | Method and device for generating pressure flow, electronic equipment and computer readable storage medium | |
| CN112307071A (en) | Monitoring data acquisition method and device, electronic equipment and computer readable medium | |
| CN113778850A (en) | Data processing method and device, electronic equipment and computer readable medium | |
| CN114006871A (en) | Flow control method, flow control device, container and storage medium | |
| CN109088929B (en) | Method and device for sending information | |
| CN115378878A (en) | CDN scheduling method, device, equipment and storage medium | |
| CN112181605A (en) | Load balancing method and device, electronic equipment and computer readable medium | |
| CN113204405A (en) | Page data acquisition method, device, equipment and computer readable storage medium | |
| CN112507676A (en) | Energy report generation method and device, electronic equipment and computer readable medium | |
| US20080009284A1 (en) | Load balancing based on free space of visitor location register | |
| CN112527454A (en) | Container group scheduling method and device, electronic equipment and computer readable medium | |
| CN111694670A (en) | Resource allocation method, device, equipment and computer readable medium |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| PB01 | Publication | ||
| PB01 | Publication | ||
| SE01 | Entry into force of request for substantive examination | ||
| SE01 | Entry into force of request for substantive examination | ||
| GR01 | Patent grant | ||
| GR01 | Patent grant | ||
| TR01 | Transfer of patent right | ||
| TR01 | Transfer of patent right |
Effective date of registration: 20231108 Address after: 518000 807, No. 121, Minsheng Avenue, Shangcun Community, Gongming Street, Guangming District, Shenzhen, Guangdong Patentee after: Shenzhen Runxing Intellectual Property Service Co.,Ltd. Address before: 100102 room 076, no.1-302, 3 / F, commercial building, No.9 Wangjing street, Chaoyang District, Beijing Patentee before: BEIJING MISSFRESH E-COMMERCE Co.,Ltd. |