CN109474542B - Message push request flow control method, device and medium based on business rules - Google Patents
Message push request flow control method, device and medium based on business rules Download PDFInfo
- Publication number
- CN109474542B CN109474542B CN201811242274.6A CN201811242274A CN109474542B CN 109474542 B CN109474542 B CN 109474542B CN 201811242274 A CN201811242274 A CN 201811242274A CN 109474542 B CN109474542 B CN 109474542B
- Authority
- CN
- China
- Prior art keywords
- pushing
- message
- service dimension
- request
- push
- Prior art date
- Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
- Active
Links
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
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L47/00—Traffic control in data switching networks
- H04L47/10—Flow control; Congestion control
- H04L47/29—Flow control; Congestion control using a combination of thresholds
-
- 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/50—Network services
- H04L67/55—Push-based network services
Abstract
The invention relates to big data analysis, and provides a message push request flow control method based on business rules, which comprises the following steps: obtaining a message pre-sent by a pushing end, inputting a classifier to classify the message, wherein each class corresponds to a service dimension and comprises group pushing, single pushing, label pushing and alias pushing; setting a threshold value of each service dimension; detecting the request quantity of pushing each service dimension message at a set time; respectively judging whether the request quantity of message pushing of each service dimension is not greater than the set threshold value of the corresponding service dimension; if the service dimension is not larger than the threshold value, pushing the message of the service dimension; if the quantity of the requests for message pushing exceeds the threshold value, an alarm signal indicating that the quantity of the requests for message pushing exceeds the threshold value is returned to the pushing end. The invention also provides an electronic device and a computer readable storage medium. The invention carries out flow control of different service dimensions and meets the requirement of service personalized flow control.
Description
Technical Field
The present invention relates to the technical field of big data analysis, and more particularly, to a method, an apparatus, and a medium for controlling a message push request flow based on a business rule.
Background
With the development of network technology, users use services provided by network operators to access networks by consuming certain flow, the flow is controlled to be the content most concerned by the users, most of push request flow control is controlled by controlling the requested network bandwidth flow or controlling the request frequency at present, so that the request flow at the system level can be controlled only coarsely, the flow control cannot be performed according to the business rules of specific fields, and the requirements of business personalized flow control cannot be met.
Disclosure of Invention
In view of the foregoing problems, it is an object of the present invention to provide a business rule-based message push request flow control method, an electronic device, and a computer-readable storage medium for performing flow control of different business dimensions.
In order to achieve the above object, the present invention provides an electronic device, which includes a memory and a processor, wherein the memory includes a message push request flow control program based on business rules, and the message push request flow control program based on business rules, when executed by the processor, implements the following steps:
the method comprises the steps of obtaining messages pre-sent by a pushing end, inputting a classifier to classify the messages, wherein each class corresponds to a service dimension, and the classification comprises group pushing, single pushing, label pushing and alias pushing, wherein the group pushing refers to the step of sending the messages pre-sent by the pushing end to all pushed ends related to the pushing end; the single push refers to sending a message pre-sent by a push end to a specified pushed end; the label pushing refers to sending a message pre-sent by a pushing end to a recommended end of a specified user label; the alias push refers to pushing a message pre-sent by a push end to a pushed end of an alias account appointed to be sent;
setting a threshold value of each service dimension;
detecting the request quantity of pushing of each service dimension message at set time;
respectively judging whether the request quantity of message pushing of each service dimension is not greater than the set threshold value of the corresponding service dimension;
if the request quantity of the message pushing of the service dimension is not larger than the corresponding threshold value, the message of the service dimension is pushed;
and if the request quantity of the message pushing of the service dimension is larger than the corresponding threshold value, returning an alarm signal that the request quantity of the message pushing exceeds the threshold value to the pushing end.
In addition, in order to achieve the above object, the present invention further provides a method for controlling a message push request flow based on a business rule, including:
the method comprises the steps of obtaining messages pre-sent by a pushing end, inputting a classifier to classify the messages, wherein each class corresponds to a service dimension, and the classification comprises group pushing, single pushing, label pushing and alias pushing, wherein the group pushing refers to the step of sending the messages pre-sent by the pushing end to all pushed ends related to the pushing end; the single push refers to sending a message pre-sent by a push end to a specified pushed end; the label pushing refers to sending a message pre-sent by a pushing end to a recommended end of a specified user label; the alias push refers to pushing a message pre-sent by a push end to a pushed end of an alias account appointed to be sent;
setting a threshold value of each service dimension;
detecting the request quantity of pushing of each service dimension message at set time;
respectively judging whether the request quantity of message pushing of each service dimension is not greater than the set threshold value of the corresponding service dimension;
if the request quantity of the message pushing of the service dimension is not larger than the corresponding threshold value, the message of the service dimension is pushed;
and if the request quantity of the message pushing of the service dimension is larger than the corresponding threshold value, returning an alarm signal that the request quantity of the message pushing exceeds the threshold value to the pushing end.
Preferably, the method further comprises the following steps: and after the request quantity of the message pushing of the set time is obtained, executing a timing task for clearing the request quantity, and resetting the request quantity of the message pushing of each service dimension.
Preferably, the method further comprises the following steps: different weights are given to different service dimensions, when the sum of the request quantity of message pushing of all the service dimensions exceeds a set threshold or the request quantity of message pushing of the service dimension with larger weight exceeds the set threshold, the threshold of the service dimension with larger weight is increased, and the threshold of the service dimension with smaller weight is reduced.
In addition, in order to achieve the above object, the present invention further provides a computer-readable storage medium, where the computer-readable storage medium includes a message push request traffic control program based on a business rule, and when the message push request traffic control program based on the business rule is executed by a processor, the steps of the message push request traffic control method based on the business rule are implemented.
The message pushing request flow control method, the message pushing request flow control device and the message pushing request flow control medium based on the business rules perform the flow control of message pushing by controlling the business dimensions of the message types (group pushing, single pushing, label pushing and alias pushing) of a pushing party, can perform the flow control of different business dimensions according to the business rules in different fields, and meet the requirements of business personalized flow control.
Drawings
Other objects and results of the present invention will become more apparent and more readily appreciated as the same becomes better understood by reference to the following description taken in conjunction with the accompanying drawings. In the drawings:
FIG. 1 is a schematic diagram of an application environment of a preferred embodiment of a method for controlling flow of a message push request based on business rules according to the present invention;
FIG. 2 is a block diagram of a preferred embodiment of the business rule based message push request flow control procedure of FIG. 1;
fig. 3 is a flow chart of a preferred embodiment of the method for controlling flow of message push request based on business rules according to the present invention.
The same reference numbers in all figures indicate similar or corresponding features or functions.
Detailed Description
It should be understood that the specific embodiments described herein are merely illustrative of the invention and are not intended to limit the invention.
Specific embodiments of the present invention will be described in detail below with reference to the accompanying drawings.
The invention provides a message pushing request flow control method based on business rules, which is applied to an electronic device 1. Fig. 1 is a schematic application environment diagram of a preferred embodiment of the method for controlling a message push request flow based on a business rule according to the present invention.
In the present embodiment, the electronic device 1 may be a terminal device having an arithmetic function, such as a server, a mobile phone, a tablet computer, a portable computer, or a desktop computer.
The electronic device 1 comprises a memory 11, a processor 12, a network interface 13 and a communication bus 14.
The memory 11 includes at least one type of readable storage medium. The at least one type of readable storage medium may be a non-volatile storage medium such as a flash memory, a hard disk, a multimedia card, a card-type memory 11, and the like. In some embodiments, the readable storage medium may be an internal storage unit of the electronic apparatus 1, such as a hard disk of the electronic apparatus 1. In other embodiments, the readable storage medium may also be an external memory 11 of the electronic device 1, such as a plug-in hard disk, a Smart Media Card (SMC), a Secure Digital (SD) Card, a Flash memory Card (Flash Card), and the like, which are provided on the electronic device 1.
In the present embodiment, the readable storage medium of the memory 11 is generally used for storing the business rule-based message push request flow control program 10 installed in the electronic device 1, a database, a pre-trained classifier, a prediction model, a clustering model, and the like. The memory 11 may also be used to temporarily store data that has been output or is to be output.
The processor 12 may be a Central Processing Unit (CPU), a microprocessor or other data Processing chip in some embodiments, and is used to execute program codes stored in the memory 11 or process data, such as executing the message pushing request flow control program 10 based on business rules.
The network interface 13 may comprise a wireless network interface or a wired network interface, and the network interface 13 is generally used for establishing communication connection between the electronic device 1 and other electronic devices. For example, the network interface 13 is used to connect the electronic apparatus 1 to an external terminal through a network, establish a data transmission channel and a communication connection between the electronic apparatus 1 and the external terminal, and the like. The network may be a wireless or wired network such as an Intranet (Intranet), the internet (Intranet), a Global System of Mobile communication (GSM), Wideband Code Division Multiple Access (WCDMA), a 4G network, a 5G network, Bluetooth (Bluetooth), Wi-Fi, and the like.
The communication bus 14 is used to enable connection communication between these components.
Fig. 1 only shows the electronic device 1 with components 11-14, but it is to be understood that not all of the shown components are required to be implemented, and that more or fewer components may alternatively be implemented.
Optionally, the electronic device 1 may further include a user interface, the user interface may include an input unit such as a Keyboard (Keyboard), a voice input device such as a microphone (microphone) or other equipment with a voice recognition function, a voice output device such as a sound box, a headset, etc., and optionally the user interface may further include a standard wired interface, a wireless interface.
Optionally, the electronic device 1 may further comprise a display, which may also be referred to as a display screen or a display unit.
In some embodiments, the display device may be an LED display, a liquid crystal display, a touch-sensitive liquid crystal display, an Organic Light-Emitting Diode (OLED) touch device, or the like. The display is used for displaying information processed in the electronic apparatus 1 and for displaying a visualized user interface.
Optionally, the electronic device 1 further comprises a touch sensor. The area provided by the touch sensor for the user to perform touch operation is called a touch area. Further, the touch sensor described herein may be a resistive touch sensor, a capacitive touch sensor, or the like. The touch sensor may include not only a contact type touch sensor but also a proximity type touch sensor. Further, the touch sensor may be a single sensor, or may be a plurality of sensors arranged in an array, for example.
Optionally, the electronic device 1 may further include logic gates, sensors, audio circuits, and the like, which are not described herein.
In the apparatus embodiment shown in fig. 1, a memory 11, which is a kind of computer storage medium, may include therein an operating system, and a message push request flow control program 10; the processor 12, when executing the message push request flow control program 10 stored in the memory 11, implements the following steps:
the method comprises the steps of obtaining messages pre-sent by a pushing end, inputting a classifier to classify the messages, wherein each class corresponds to a service dimension, and the classification comprises group pushing, single pushing, label pushing and alias pushing, wherein the group pushing refers to the step of sending the messages pre-sent by the pushing end to all pushed ends related to the pushing end; the single push refers to sending a message pre-sent by a push end to a specified pushed end; the label pushing refers to sending a message pre-sent by a pushing end to a recommended end of an appointed user label, wherein the user label can be set, can be obtained from the pushing end, and can be obtained from a network through a web crawler technology and the like; the alias push refers to pushing a message pre-sent by a push end to a pushed end of an alias account appointed to be sent, wherein the alias account can be a user identifier of the pushed end set by the push end;
setting a threshold value of each service dimension;
detecting the request quantity of pushing of each service dimension message at set time;
respectively judging whether the request quantity of message pushing of each service dimension is not greater than the set threshold value of the corresponding service dimension;
if the request quantity of the message pushing of the service dimension is not larger than the corresponding threshold value, the message of the service dimension is pushed;
and if the request quantity of the message pushing of the service dimension is larger than the corresponding threshold value, returning an alarm signal that the request quantity of the message pushing exceeds the threshold value to the pushing end.
Preferably, after obtaining the request amount of message pushing of the set time, the processor executes a timing task for clearing the request amount, and resets the request amount of message pushing of each service dimension.
Preferably, the processor assigns different weights to different service dimensions, and when the sum of the request amounts of message push of all service dimensions exceeds a set threshold or the request amount of message push of a service dimension with a larger weight exceeds a set threshold, the threshold of the service dimension with the larger weight is increased, and the threshold of the service dimension with the smaller weight is decreased.
In other embodiments, the message push request flow control program 10 may be further divided into one or more modules, and the one or more modules are stored in the memory 11 and executed by the processor 12 to implement the present invention. The modules referred to herein are referred to as a series of computer program instruction segments capable of performing specified functions. Referring to fig. 2, a functional block diagram of a preferred embodiment of the push request flow control procedure 10 in fig. 1 is shown. The message push request flow control program 10 may be divided into:
the transceiver module 110 is used for acquiring a message which is pre-sent by a push end;
the classifier 120 classifies messages, each class corresponds to a service dimension, and the classification includes group pushing, single pushing, label pushing and alias pushing, wherein the group pushing refers to sending a push end pre-sent message to all pushed ends related to the push end; the single push refers to sending a message pre-sent by a push end to a specified pushed end; the label pushing refers to sending a message pre-sent by a pushing end to a recommended end of a specified user label; the alias push refers to pushing a message pre-sent by a push end to a pushed end of an alias account appointed to be sent;
a setting module 130, which sets a threshold value of each service dimension;
the detection module 140 detects the request quantity of pushing each service dimension message at a set time;
the judging module 150 is used for respectively judging whether the request quantity of message pushing of each service dimension is not greater than the set corresponding threshold value of the service dimension, and sending a signal to the pushing module if the request quantity of message pushing of the service dimension is not greater than the corresponding threshold value; and if the request quantity of the message pushing of the service dimension is larger than the corresponding threshold value, sending an alarm signal of which the request quantity of the message pushing exceeds the threshold value to the transceiver module 110, so as to return the alarm signal to the pushing end.
In one embodiment of the present invention, further comprising:
the sequence construction module constructs a request quantity time sequence of the message request quantity of each service dimension along with the change of time through the detection module 140;
the prediction module predicts the message request quantity of the service dimension at the future time through a prediction model;
and the threshold adjusting module adjusts the threshold of each service dimension according to the predicted message request quantity of each service dimension.
In an embodiment of the present invention, the classifier 120 further sets a classification tag to a message pre-pushed by a push end, and the message push request flow control program 10 further includes: and the clustering module is used for clustering the pushed ends according to the attention degree of the pushed ends to the classified labels for the messages subjected to group pushing, label pushing or/and alias pushing, and sending the messages to the clustered pushed ends.
In addition, the invention also provides a message pushing request flow control method based on the business rule. Fig. 3 is a flowchart illustrating a flow control method for message push request according to a preferred embodiment of the present invention. The method may be performed by an apparatus, which may be implemented by software and/or hardware.
In this embodiment, the method for controlling a message push request flow includes:
step S1, obtaining the message pre-sent by the push terminal, inputting a classifier to classify the message, wherein each class corresponds to a service dimension;
step S2, setting a threshold value of each service dimension;
step S3, detecting a request amount for pushing each service dimension message in a set time (e.g., 5S);
step S4, respectively judging whether the request quantity of message push of each service dimension is not greater than the set threshold value of the corresponding service dimension;
if the request quantity of the message pushing of the service dimension is not larger than the corresponding threshold value, in step S5a, the message of the service dimension is pushed.
If the request volume of message pushing of the service dimension is larger than the corresponding threshold value, in step S5b, an alarm signal indicating that the request volume of message pushing exceeds the threshold value is returned to the pushing end.
Preferably, different weights are given to different service dimensions, when the sum of the request amounts of message push of all service dimensions exceeds a set threshold or the request amount of message push of the service dimension with a larger weight exceeds a set threshold, the threshold of the service dimension with a larger weight is upgraded, and the service dimension with a smaller weight is downgraded, that is, the threshold of the service dimension with a larger weight is increased, and the threshold of the service dimension with a smaller weight is reduced, wherein the weights can be assigned according to the importance of the service, the higher the importance of the service is, the larger the weight is, the smaller the weight is, the weight can be distinguished by setting a reference weight, the difference exceeds a set range, and the two weights corresponding to the difference are respectively the larger weight and the smaller the weight, the invention is not so limited.
The following steps are also included between steps S3 and S4:
after the request quantity of message pushing of the set time is obtained, executing a timing task for clearing the request quantity, and resetting the request quantity of message pushing of each service dimension, wherein,
when obtaining the requested amount of message pushing of the set Time, calculating the Time from the last reset, and if the Time from the last reset is exceeded, clearing the Time from the last reset, for example, calculating the Time from the last reset TSId + broadcast + countKey, Time ═ Now () -TSId + broadcast + clearTime, TSId refers to the identifier of a certain push segment, for example, the TSId of a bank as a push segment is: 5b7245c93290d61a926b09a5, where Broadcast is the identification of group push, and is a message for identifying a group push; the countKey is a name taken, and represents a count, Time ═ Now () -TSId + broadcast + clearTime means that the last cleaning Time is subtracted from the current Time, TSId + broadcast + clearTime means the last cleaning Time, and for example, the Time of the last Time count and the cleaning Time are recorded, for example, the last Time is 1 point 05 minutes 05 seconds, and the next Time is 1 point 05 minutes 10 seconds, the previous count is cleared.
In one embodiment of the present invention, further comprising:
constructing a request quantity time sequence of the message request quantity of each service dimension along with the change of time;
predicting, by a prediction model, a message request quantity of the business dimension at a future time, for example: constructing a prediction model of a neural network, training the prediction model, and substituting the request quantity time sequence of each service dimension into the trained prediction model to obtain the message request quantity of the service dimension at the future moment;
and adjusting the threshold value of each service dimension according to the predicted message request quantity of each service dimension.
Preferably, the method for predicting the message request volume of the service dimension at the future time through the prediction model comprises the following steps:
taking a request quantity time sequence of a service dimension as a first sequence;
dividing the first sequence into a plurality of second sequences with at least one sequence length, the sequence length of the second sequences being shorter than the sequence length of the first sequences;
constructing a dendrogram of the first sequence from the second sequence, comprising: taking each request quantity appearing in the first sequence as a root node, taking various request quantity combinations in the second sequences as branches, forming each sub-tree by each branch connected with the root node, wherein the frequency of the request quantity represented by the root node appearing in the first sequence is the node value of the root node, and the sum of the frequency of the request quantity combinations represented from the root node to the child nodes appearing in the second sequences is the node value of the child nodes;
predicting a probability that the requested quantity in the next order of each second sequence is any one of the requested quantities in the first sequence, which can be calculated according to the following equation (1),
wherein i represents a level index of the tree diagram of the first behavior sequence, y1One root node, y, of a subtree representing a tree-like graph2,...,yiA root node y representing the sub-tree1A sub-node of layer 2 to i of a branch, y1y2...yiA second viewing behavior sequence with sequence length i corresponding to the branch, x representing the amount of requests to predict, p (x | y)1y2...yi) An internal probability, N (y), representing a request quantity x for said second sequence order i +1i+1X) represents the i-th level node y of the branchiThe child node of the (i + 1) th layer of (2) is a node value of x, N (y)i) Node y of the i-th layer representing the branchiA node value of (a);
and taking the maximum value of the probability as the request quantity of the next order.
In one embodiment of the present invention, further comprising:
setting a classification label for the message, wherein the classification label comprises the type of the message (product pushing, notification, purchasing and the like), a pushing end identifier, a keyword of the message and the like;
when the message is pushed in groups, labels or/and aliases, clustering the pushed ends according to the attention of the pushed ends to the classified labels, wherein the attention can be the browsing times of the client to the message, or after the message is obtained, the attention can be the purchasing times of the product according to the behavior data of the message, for example, the product pushing message;
and sending the message to the clustered pushed end.
The method for clustering the pushed end according to the attention degree of the pushed end to the classification label comprises the following steps:
constructing an attention matrix of the pushed end according to the attention of the pushed end to the classification label
B＝[b1...bj]
Wherein XB represents information classification label set, m represents information number, x1…xmFor information names, 1 st to m pieces of information, [ fb ]m,1,…fbm,k]Representing information xm1 to k classification tags, wherein k represents the number of the classification tags;
set of all non-zero and non-overlapping classification labels in information classification label set XB, j represents information x1To xmOf classification tagsNon-zero and non-overlapping numbers, 0<j is less than or equal to mk, G is an attention matrix, GnjIs referred to as the pushed end ymFor classification label bjWhen the same classification label exists in different information, the pushed end takes an average value of the attention of the information as the attention of the classification label, and the attention of the non-overlapping classification label is the attention of the user to the information;
taking each row of elements in the attention matrix as a vector, randomly selecting a set number of vectors, and randomly selecting one vector as a clustering center of a set number of initial clusters;
analyzing Euclidean distances between other vectors except the clustering center in the attention matrix and the clustering center, and pointing the other vectors to the initial cluster with the minimum Euclidean distance to form a new cluster;
after other vectors point to the most similar clusters to synthesize a new cluster, adding all columns of the attention matrix of the new cluster respectively to calculate the average to obtain the cluster center of the new cluster;
and judging whether the cluster center of the new cluster is equal to the cluster center of the initial cluster or not.
If yes, clustering and grouping by the pushing end are completed;
if not, taking the center of the new cluster as the clustering center of the initial cluster, and returning to the step of analyzing the Euclidean distance between the vectors until the center of the new cluster is not changed any more, namely, clustering by the pushing end is completed.
Preferably, the method further comprises the following steps: analyzing the support degree and the confidence degree of each classification label and the combination thereof in the attention matrix, and outputting the association rules of the classification labels and the combination thereof meeting the requirements of the minimum support degree or/and the minimum confidence degree, specifically:
scanning a set of information-bearing classification labels, deriving a first set of classification labels, e.g., classification label b, based on the support of each non-zero and non-overlapping classification labeljSupport degree support (b)j) Comprises the following steps:
wherein, | bjI denotes a class label bjThe number of occurrences of the information classification label set XB, d is the total number of non-zero messages in the information classification label set XB, 0<d≤(n*m)；
If support (b)j) Satisfies the support (b)j)>min, will bjIncorporating the first set of category labels FT as an element to obtain a first set of category labels FT, FT [ < FT >1 ... fta]，
Wherein minsup is a minimum support threshold value and satisfies 0<minsup<1, is a set value; a is the number of the classification labels larger than the minimum support threshold, a is more than or equal to 0 and less than or equal to j, ft1 ... ftaThe category label names in the first set of category labels FT representing category labels.
After the first classification label set is obtained, respectively constructing a non-empty true subset of the first classification label set;
the confidence level for each non-empty proper subset is calculated, e.g., the t confidence level for the proper subset in the first set of classification tags FT is,
where | FT | represents the number of occurrences of the first set of classification tags FT in the set of classification tags XB, and | t | is the frequency of occurrences of the non-empty subset t of the first set of classification tags FT in the set of classification tags XB.
And after obtaining the confidence degrees of all the non-vacuum proper subsets, judging whether the confidence degree of the non-vacuum proper subsets is larger than a minimum confidence degree threshold value.
If the confidence of the non-empty proper subset is larger than the minimum confidence threshold, generating an association rule:
class labels or combination of class labels in a non-empty subset illustrating the generation of association rules with the sameThe classification labels or combination of classification labels in the complement of the proper subset have a strong relationship, e.g., in the above example, t confidence conf (t) of the proper subset>minconf，
That is, the classification labels in the proper subset t have a strong association relationship with the classification labels in its complement (FT-t), where minconf is a minimum confidence threshold and is a set value, and FT is a first classification label set consisting of three classification labels { "discount", "commodity", "first-line brand" } if an association rule is generated
The classification labels (discount labels) and the commodity combination are explained to have a strong incidence relation with the classification target labels (first-line brands), namely, the cluster of the pushed end is interested in commodity discount information of the first-line brands.
In addition, an embodiment of the present invention further provides a computer-readable storage medium, where the computer-readable storage medium includes a message push request flow control program based on a business rule, and when executed by the processor, the message push request flow control program based on the business rule implements the following steps:
the method comprises the steps of obtaining messages pre-sent by a pushing end, inputting a classifier to classify the messages, wherein each class corresponds to a service dimension, and the classification comprises group pushing, single pushing, label pushing and alias pushing, wherein the group pushing refers to the step of sending the messages pre-sent by the pushing end to all pushed ends related to the pushing end; the single push refers to sending a message pre-sent by a push end to a specified pushed end; the label pushing refers to sending a message pre-sent by a pushing end to a recommended end of a specified user label; the alias push refers to pushing a message pre-sent by a push end to a pushed end of an alias account appointed to be sent;
setting a threshold value of each service dimension;
detecting the request quantity of pushing of each service dimension message at set time;
respectively judging whether the request quantity of message pushing of each service dimension is not greater than the set threshold value of the corresponding service dimension;
if the request quantity of the message pushing of the service dimension is not larger than the corresponding threshold value, the message of the service dimension is pushed;
and if the request quantity of the message pushing of the service dimension is larger than the corresponding threshold value, returning an alarm signal that the request quantity of the message pushing exceeds the threshold value to the pushing end.
The specific implementation of the computer-readable storage medium of the present invention is substantially the same as the above-mentioned message push request flow control method based on the business rules and the specific implementation of the electronic device, and will not be described herein again.
The message pushing request flow control method based on the business rules, the electronic device and the readable storage medium realize flow control through each business attribute angle of the pushing end, meet the requirement of flow control for business refinement, simultaneously associate the flow control with the business, and guarantee the normal operation of core services through business dimension degradation services.
It should be noted that, in this document, the terms "comprises," "comprising," or any other variation thereof, are intended to cover a non-exclusive inclusion, such that a process, apparatus, article, or method that comprises a list of elements does not include only those elements but may include other elements not expressly listed or inherent to such process, apparatus, article, or method. Without further limitation, an element defined by the phrase "comprising an … …" does not exclude the presence of other like elements in a process, apparatus, article, or method that includes the element.
The above-mentioned serial numbers of the embodiments of the present invention are merely for description and do not represent the merits of the embodiments. Through the above description of the embodiments, those skilled in the art will clearly understand that the method of the above embodiments can be implemented by software plus a necessary general hardware platform, and certainly can also be implemented by hardware, but in many cases, the former is a better implementation manner. Based on such understanding, the technical solution of the present invention may be embodied in the form of a software product, which is stored in a storage medium (e.g., ROM/RAM, magnetic disk, optical disk) as described above and includes instructions for enabling a terminal device (e.g., a mobile phone, a computer, a server, or a network device) to execute the method according to the embodiments of the present invention.
The above description is only a preferred embodiment of the present invention, and not intended to limit the scope of the present invention, and all modifications of equivalent structures and equivalent processes, which are made by using the contents of the present specification and the accompanying drawings, or directly or indirectly applied to other related technical fields, are included in the scope of the present invention.
Claims (10)
1. A message pushing request flow control method based on business rules is applied to an electronic device and is characterized by comprising the following steps:
the method comprises the steps of obtaining messages pre-sent by a pushing end, inputting a classifier to classify the messages, wherein each class corresponds to a service dimension, and the classification comprises group pushing, single pushing, label pushing and alias pushing, wherein the group pushing refers to the step of sending the messages pre-sent by the pushing end to all pushed ends related to the pushing end; the single push refers to sending a message pre-sent by a push end to a specified pushed end; the label pushing refers to sending a message pre-sent by a pushing end to a recommended end of a specified user label; the alias push refers to pushing a message pre-sent by a push end to a pushed end of an alias account appointed to be sent;
setting a threshold value of each service dimension;
detecting the request quantity of pushing of each service dimension message of the message which is about to be sent by a pushing end and is set in time;
respectively judging whether the request quantity of message pushing of each service dimension is not greater than the set threshold value of the corresponding service dimension;
if the request quantity of the message pushing of the service dimension is not larger than the corresponding threshold value, the message of the service dimension is pushed;
and if the request quantity of the message pushing of the service dimension is larger than the corresponding threshold value, returning an alarm signal that the request quantity of the message pushing exceeds the threshold value to the pushing end.
2. The message push request traffic control method according to claim 1, further comprising:
and after the request quantity of the message pushing of the set time is obtained, executing a timing task for clearing the request quantity, and resetting the request quantity of the message pushing of each service dimension.
3. The message push request traffic control method according to claim 2, further comprising: when the request quantity of message pushing of the set time is obtained, the time from the last reset is calculated, and if the time exceeds the time of the last reset, the time of the last reset is cleared.
4. The message push request traffic control method according to claim 1, further comprising: different weights are given to different service dimensions, when the sum of the request quantity of message pushing of all the service dimensions exceeds a set threshold or the request quantity of message pushing of the service dimension with larger weight exceeds the set threshold, the threshold of the service dimension with larger weight is increased, and the threshold of the service dimension with smaller weight is reduced.
5. The message push request traffic control method according to claim 1, further comprising:
constructing a request quantity time sequence of the message request quantity of each service dimension along with the change of time;
predicting message request quantity of the service dimension at future time through a prediction model;
and adjusting the threshold value of each service dimension according to the predicted message request quantity of each service dimension.
6. The message push request traffic control method according to claim 1, further comprising:
setting a classification label for the message;
when the information is subjected to group pushing, label pushing or/and alias pushing, clustering the pushed ends according to the attention degree of the pushed ends to the classified labels;
and sending the message to the clustered pushed end.
7. An electronic device, comprising a memory and a processor, wherein the memory includes a business rule based message push request flow control program, and wherein the business rule based message push request flow control program when executed by the processor implements the steps of:
the method comprises the steps of obtaining messages pre-sent by a pushing end, inputting a classifier to classify the messages, wherein each class corresponds to a service dimension, and the classification comprises group pushing, single pushing, label pushing and alias pushing, wherein the group pushing refers to the step of sending the messages pre-sent by the pushing end to all pushed ends related to the pushing end; the single push refers to sending a message pre-sent by a push end to a specified pushed end; the label pushing refers to sending a message pre-sent by a pushing end to a recommended end of a specified user label; the alias push refers to pushing a message pre-sent by a push end to a pushed end of an alias account appointed to be sent;
setting a threshold value of each service dimension;
detecting the request quantity of pushing of each service dimension message of the message pre-sent by a pushing end in set time;
respectively judging whether the request quantity of message pushing of each service dimension is not greater than the set threshold value of the corresponding service dimension;
if the request quantity of the message pushing of the service dimension is not larger than the corresponding threshold value, the message of the service dimension is pushed;
and if the request quantity of the message pushing of the service dimension is larger than the corresponding threshold value, returning an alarm signal that the request quantity of the message pushing exceeds the threshold value to the pushing end.
8. The electronic device according to claim 7, wherein the processor executes a timing task for clearing the request amount after obtaining the request amount for message pushing for the set time, and resets the request amount for message pushing for each service dimension.
9. The electronic device of claim 7, wherein the processor assigns different weights to different service dimensions, and when the sum of the request amounts of message push of all service dimensions exceeds a set threshold or the request amount of message push of a service dimension with a larger weight exceeds a set threshold, the threshold of the service dimension with a larger weight is increased, and the threshold of the service dimension with a smaller weight is decreased.
10. A computer-readable storage medium, characterized in that the computer-readable storage medium includes a message push request flow control program based on business rules, and when the message push request flow control program based on business rules is executed by a processor, the steps of the message push request flow control method based on business rules according to any one of claims 1 to 6 are implemented.
Priority Applications (2)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201811242274.6A CN109474542B (en) | 2018-10-24 | 2018-10-24 | Message push request flow control method, device and medium based on business rules |
| PCT/CN2019/089152 WO2020082733A1 (en) | 2018-10-24 | 2019-05-30 | Method for message push request flow control based on service rules, device and medium |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201811242274.6A CN109474542B (en) | 2018-10-24 | 2018-10-24 | Message push request flow control method, device and medium based on business rules |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN109474542A CN109474542A (en) | 2019-03-15 |
| CN109474542B true CN109474542B (en) | 2022-05-13 |
Family
ID=65666022
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201811242274.6A Active CN109474542B (en) | 2018-10-24 | 2018-10-24 | Message push request flow control method, device and medium based on business rules |
Country Status (2)
| Country | Link |
|---|---|
| CN (1) | CN109474542B (en) |
| WO (1) | WO2020082733A1 (en) |
Families Citing this family (9)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN109474542B (en) * | 2018-10-24 | 2022-05-13 | 平安科技（深圳）有限公司 | Message push request flow control method, device and medium based on business rules |
| CN110677824A (en) * | 2019-08-29 | 2020-01-10 | 凡普数字技术有限公司 | Short message sending method, device and storage medium |
| CN112581150A (en) * | 2019-09-27 | 2021-03-30 | 北京国双科技有限公司 | Information management method, device, equipment and storage medium |
| CN111131063B (en) * | 2019-12-31 | 2022-03-25 | 腾讯科技（深圳）有限公司 | Flow control method, related device, equipment and storage medium |
| CN113765969A (en) * | 2020-09-28 | 2021-12-07 | 北京沃东天骏信息技术有限公司 | Flow control method and device |
| CN112637295B (en) * | 2020-12-15 | 2023-04-28 | 平安普惠企业管理有限公司 | Service object pushing method, device, equipment and storage medium |
| CN115002691B (en) * | 2021-03-01 | 2023-08-15 | 中国移动通信集团四川有限公司 | Message sending method, device, equipment and computer readable storage medium |
| CN114710556B (en) * | 2022-06-08 | 2022-09-16 | 深圳市信润富联数字科技有限公司 | Multi-system integrated message pushing method, device, equipment and storage medium |
| CN115665074B (en) * | 2022-10-08 | 2023-09-15 | 广州市玄武无线科技股份有限公司 | Message flow-limiting sending method, device, equipment and storage medium |
Citations (5)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN101026802A (en) * | 2007-03-16 | 2007-08-29 | 华为技术有限公司 | Information push method and device |
| CN105704312A (en) * | 2016-01-20 | 2016-06-22 | 广东欧珀移动通信有限公司 | Message push processing method and device |
| CN105791910A (en) * | 2016-03-08 | 2016-07-20 | 北京四达时代软件技术股份有限公司 | Multimedia resource pushing system and multimedia resource pushing method |
| CN107872483A (en) * | 2016-09-27 | 2018-04-03 | 腾讯科技（北京）有限公司 | Method for pushing, the apparatus and system of media content |
| CN108400927A (en) * | 2018-01-22 | 2018-08-14 | 广州欧赛斯信息科技有限公司 | A kind of information push method and device for high concurrent message |
Family Cites Families (4)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US8023981B2 (en) * | 2008-05-12 | 2011-09-20 | Qualcomm Incorporated | Method and apparatus for adaptive dynamic call setup based on real-time network resource availability |
| US9779260B1 (en) * | 2012-06-11 | 2017-10-03 | Dell Software Inc. | Aggregation and classification of secure data |
| CN104731958B (en) * | 2015-04-03 | 2018-11-13 | 北京航空航天大学 | A kind of cloud manufacturing service recommendation method of Users ' Need-oriented tendency |
| CN109474542B (en) * | 2018-10-24 | 2022-05-13 | 平安科技（深圳）有限公司 | Message push request flow control method, device and medium based on business rules |
-
2018
- 2018-10-24 CN CN201811242274.6A patent/CN109474542B/en active Active
-
2019
- 2019-05-30 WO PCT/CN2019/089152 patent/WO2020082733A1/en active Application Filing
Patent Citations (5)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN101026802A (en) * | 2007-03-16 | 2007-08-29 | 华为技术有限公司 | Information push method and device |
| CN105704312A (en) * | 2016-01-20 | 2016-06-22 | 广东欧珀移动通信有限公司 | Message push processing method and device |
| CN105791910A (en) * | 2016-03-08 | 2016-07-20 | 北京四达时代软件技术股份有限公司 | Multimedia resource pushing system and multimedia resource pushing method |
| CN107872483A (en) * | 2016-09-27 | 2018-04-03 | 腾讯科技（北京）有限公司 | Method for pushing, the apparatus and system of media content |
| CN108400927A (en) * | 2018-01-22 | 2018-08-14 | 广州欧赛斯信息科技有限公司 | A kind of information push method and device for high concurrent message |
Non-Patent Citations (1)
| Title |
|---|
| 古国杰.移动互联网消息智能推送服务的研究.《 CNKI优秀硕士学位论文全文库》.2017, * |
Also Published As
| Publication number | Publication date |
|---|---|
| CN109474542A (en) | 2019-03-15 |
| WO2020082733A1 (en) | 2020-04-30 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN109474542B (en) | Message push request flow control method, device and medium based on business rules | |
| CN108280458B (en) | Group relation type identification method and device | |
| US10949000B2 (en) | Sticker recommendation method and apparatus | |
| CN112085565B (en) | Deep learning-based information recommendation method, device, equipment and storage medium | |
| US11748452B2 (en) | Method for data processing by performing different non-linear combination processing | |
| CN104246748A (en) | A system and a method for determining context | |
| CN111008335B (en) | Information processing method, device, equipment and storage medium | |
| US11030532B2 (en) | Information processing apparatus, information processing method, and non-transitory computer readable storage medium | |
| CN110750658A (en) | Recommendation method of media resource, server and computer readable storage medium | |
| CN113434716A (en) | Cross-modal information retrieval method and device | |
| CN115130711A (en) | Data processing method and device, computer and readable storage medium | |
| CN111291217B (en) | Content recommendation method, device, electronic equipment and computer readable medium | |
| CN114416998A (en) | Text label identification method and device, electronic equipment and storage medium | |
| CN106294406B (en) | Method and equipment for processing application access data | |
| US11657596B1 (en) | System and method for cascading image clustering using distribution over auto-generated labels | |
| CN112667790A (en) | Intelligent question and answer method, device, equipment and storage medium | |
| US8971645B1 (en) | Video categorization using heterogeneous signals | |
| CN112818213A (en) | Multimedia service data pushing method, device, equipment and storage medium | |
| CN110162535B (en) | Search method, apparatus, device and storage medium for performing personalization | |
| CN115730217A (en) | Model training method, material recalling method and device | |
| CN114996578A (en) | Model training method, target object selection method, device and electronic equipment | |
| CN114722313A (en) | Search result sorting method, device, equipment and storage medium | |
| CN114298767A (en) | Live broadcast platform information pushing method and device, equipment, medium and product thereof | |
| CN114398960A (en) | Target user determination method and device, electronic equipment and storage medium | |
| CN115511512A (en) | Information acquisition method, device, equipment and storage medium |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| PB01 | Publication | ||
| PB01 | Publication | ||
| SE01 | Entry into force of request for substantive examination | ||
| SE01 | Entry into force of request for substantive examination | ||
| GR01 | Patent grant | ||
| GR01 | Patent grant |