CN115604669B - Short message sending queuing system - Google Patents
Short message sending queuing system Download PDFInfo
- Publication number
- CN115604669B CN115604669B CN202211609899.8A CN202211609899A CN115604669B CN 115604669 B CN115604669 B CN 115604669B CN 202211609899 A CN202211609899 A CN 202211609899A CN 115604669 B CN115604669 B CN 115604669B
- Authority
- CN
- China
- Prior art keywords
- short message
- short
- messages
- short messages
- historical
- 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
- H04W—WIRELESS COMMUNICATION NETWORKS
- H04W4/00—Services specially adapted for wireless communication networks; Facilities therefor
- H04W4/12—Messaging; Mailboxes; Announcements
- H04W4/14—Short messaging services, e.g. short message services [SMS] or unstructured supplementary service data [USSD]
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04W—WIRELESS COMMUNICATION NETWORKS
- H04W8/00—Network data management
- H04W8/26—Network addressing or numbering for mobility support
-
- Y—GENERAL TAGGING OF NEW TECHNOLOGICAL DEVELOPMENTS; GENERAL TAGGING OF CROSS-SECTIONAL TECHNOLOGIES SPANNING OVER SEVERAL SECTIONS OF THE IPC; TECHNICAL SUBJECTS COVERED BY FORMER USPC CROSS-REFERENCE ART COLLECTIONS [XRACs] AND DIGESTS
- Y02—TECHNOLOGIES OR APPLICATIONS FOR MITIGATION OR ADAPTATION AGAINST CLIMATE CHANGE
- Y02D—CLIMATE CHANGE MITIGATION TECHNOLOGIES IN INFORMATION AND COMMUNICATION TECHNOLOGIES [ICT], I.E. INFORMATION AND COMMUNICATION TECHNOLOGIES AIMING AT THE REDUCTION OF THEIR OWN ENERGY USE
- Y02D30/00—Reducing energy consumption in communication networks
- Y02D30/70—Reducing energy consumption in communication networks in wireless communication networks
Landscapes
- Engineering & Computer Science (AREA)
- Computer Networks & Wireless Communication (AREA)
- Signal Processing (AREA)
- Databases & Information Systems (AREA)
- Telephonic Communication Services (AREA)
- Mobile Radio Communication Systems (AREA)
Abstract
The invention relates to the technical field of short message platforms, and discloses a short message sending queuing system, which comprises: the history short message extraction unit is used for extracting history short messages from a history short message database to be used as reference short messages; a reference short message updating module which iteratively updates the reference short message; the classification module is used for classifying the reference short messages updated by the reference short message updating module; the post-processing module is used for processing the reference short messages classified by the classification module to generate a final reference short message set; the sequencing module is used for respectively putting short messages to be sent with the categories of a first category, a second category and a third category into a first sequence, a second sequence and a third sequence; the invention designs a reasonable queuing system to reasonably adjust the short message sending waiting time according to the requirement, and can match and send the required information for the short message more quickly by matching with a simplified address distribution model.
Description
Technical Field
The invention relates to the technical field of short message platforms, in particular to a short message sending queuing system.
Background
The short message platform is based on an operator short message interface and is combined with the Internet to achieve batch sending and user-defined sending of short messages, the short messages sent by most short message platforms are in a state of large concurrency, although the short messages sent by most short message platforms are processed in batch, the batch sending does not represent the requirement that the short messages do not have receiving time, but the short message platforms in the prior art are designed to sequence the short messages according to time sequence, and the queue mechanism without distinction reduces user experience.
Disclosure of Invention
The invention provides a short message sending queuing system, which solves the technical problem that the experience of a user is reduced due to the undistinguished queuing mechanism of a short message platform in the related technology.
According to an aspect of the present invention, there is provided a short message transmission queuing system, including:
the address allocation model storage module is used for storing an address allocation model, a first layer of the address allocation model stores a first query node associated with a network segment number of the mobile phone number, a second layer of the address allocation model stores a second query node associated with a provincial feature code of the mobile phone number, and a third layer of the address allocation model stores a third query node associated with a serial number of the mobile phone number;
the historical short message database is used for storing historical short message entries, and the historical short message entries comprise user information, short message type information, short message content information and short message characteristic information of historical short messages;
a history short message extraction unit used for extracting history short messages from the history short message database and randomly selecting n 2 Mapping the historical short message as a reference short message to n of a two-dimensional coordinate system 2 Point; deleting the reference short messages from the historical short messages to generate a first short message set;
the reference short message updating module iteratively executes the following steps:
step S101, selecting a history short message from a first short message set as an iterative short message, calculating the distance between the iterative short message and a reference short message, and selecting the reference short message closest to the iterative short message as a core short message; step S102, updating the characteristic value of the reference short message;
the classification module classifies the reference short messages based on the proportion of the historical short messages of which the short message types are emergency short messages in the second short message set of the reference short messages, wherein the classified types comprise a first type, a second type and a third type;
the post-processing module is used for processing the reference short messages classified by the classification module to generate a final reference short message set;
the sequencing module is used for sequencing the short messages to be sent and calculating the distance parameter between the short messages to be sent and the reference short messages of the final reference short message set;
and assigning the type of the reference short message with the minimum distance parameter with the short message to be sent to the short message to be sent, and respectively placing the short messages to be sent with the types of the first type, the second type and the third type into a first sequence, a second sequence and a third sequence, wherein the sending priorities of the first sequence, the second sequence and the third sequence are sequentially reduced.
The system further comprises an allocation model generation module connected with the historical short message database and used for generating an address allocation model and generating a first query node based on the network segment number of the mobile phone number of the sending object served by the short message platform;
generating a second query node based on the province feature code of the mobile phone number of the sending object served by the short message platform;
hashing the value 0000-9999 of the serial number of the mobile phone number by modulo 1000 to obtain a hash value of 0-999, associating the storage bit with the serial number mark of the mobile phone number with the same hash value with a third query node, and endowing the third query node with the mark with the same hash value as the serial number of the mobile phone number of the associated storage bit mark;
a second query node is connected to 1000 third query nodes, and a third query node is connected to 100 storage bits; the storage bit stores information of a short message gateway corresponding to the mobile phone number.
Further, the short message feature information includes a first feature value, a second feature value and a third feature value, wherein the first feature value T is o The calculation formula of (a) is as follows:
wherein L represents the number of all historical short message items related to the short message platform user associated with the short message, L 1 The number L of the emergency short messages in the historical short message items related to the short message platform user and representing the short message association 2 The short message type in the historical short message items related to the short message platform user and representing the short message association is the number k of the general short messages 1 And k 2 The self-defined weights are all larger than 0;
second characteristic value T t The calculation formula of (a) is as follows:
wherein T is h The message sending state receipt time of the previous message received by the sending object of the message is represented;
third characteristic value T s The calculation formula of (a) is as follows:
wherein T is j To representThe sending time interval of the previous short message received by the sending object of the short message.
Further, the calculated distance between the iterative short message and the reference short message is the Euclidean distance, and the distance D between the iterative short message and the reference short message 1 The calculation formula of (a) is as follows:
wherein, F i The ith characteristic value, G, representing the iterative SMS i The ith characteristic value of the reference short message is represented.
Further, the formula for updating the feature value of the reference short message is as follows:
G j (t+1)＝G j (t)+h j (t)(P j (t)-G j (t))
wherein G is j (t) j represents the j characteristic value of the core SMS before updating, G j (t + 1) is the j-th characteristic value of the updated core SMS, P j (t) is the jth eigenvalue of the iterative short message;
wherein D 2 The distance between the reference short message and a coordinate point mapped by the core short message; and t is the number of times that the reference short message updating module iteratively executes the step S101 and the step S102.
Further, the method for classifying the reference short message updated by the reference short message updating module by the classifying module is as follows:
for a reference short message, extracting historical short messages with a distance smaller than a first distance threshold value from a first short message set to generate a second short message set;
judging the category of the reference short message based on the following conditions:
the first condition is that: the ratio of the historical short messages with the short message types of the emergency short messages in the second short message set of the reference short messages is more than or equal to 60 percent; the second condition is that: the proportion of the historical short messages with the short message types of emergency short messages in the second short message set of the reference short messages is less than 60 percent, the proportion of the historical short messages with the short message types of common short messages is more than 30 percent, and the proportion of the historical short messages with the short message types of common short messages is more than that of the historical short messages with the short message types of delay short messages; a third condition: the proportion of the historical short messages with the short message types of emergency short messages in the second short message set of the reference short messages is less than 60%, the proportion of the historical short messages with the short message types of lagging short messages is more than 30%, and the proportion of the historical short messages with the short message types of lagging short messages is more than that of the historical short messages with the short message types of common short messages;
the reference short message satisfying the first condition is classified into a first class; the reference short messages meeting the second condition are classified into a second class, the reference short messages meeting a third condition are classified into a third class, and the reference short messages which do not meet the first condition, the second condition and the third condition are deleted.
Further, a distance parameter D 3 The calculation formula of (a) is as follows:
wherein Z is i I-th characteristic value G representing short message to be sent i The ith characteristic value, M, of the reference short message g Representing a weighting parameter of the reference short message;
weighting parameter M of reference short message g The calculation formula of (c) is as follows:
wherein q is the number of reference short messages in an associated reference short message set to which the reference short message belongs, and the length between two-dimensional coordinate points mapped by the reference short messages in the associated reference short message set can be less than or equal to the length between the two-dimensional coordinate points
Are connected.
And the information acquisition module is connected with the sequencing module and acquires gateway information of the short message to be sent according to the sequence of the first sequence, the second sequence and the third sequence, and the acquisition mode is to search layer by layer along the address distribution model according to the mobile phone number of the sending object.
Further, the information acquisition module includes:
a first identification unit for identifying a segment number of the mobile phone number;
the second identification unit is used for identifying the provincial feature code of the mobile phone number;
the third identification unit is used for identifying the serial number of the mobile phone number and hashing the identified serial number by taking the modulus of 1000 to obtain a hash value;
and the matching unit searches and acquires the information of the short message gateway of the mobile phone number from the address allocation model layer by layer based on the information identified by the first identification unit, the second identification unit and the third identification unit.
Further, the step of processing the reference short messages classified by the classification module by the post-processing module to generate a final reference short message set comprises: traversing the reference short messages, if the categories of the two reference short messages are the same, and the distance between the two-dimensional coordinate points of the two reference short messages is less than or equal to that of the two reference short messages
Marking one of the reference short messages; and deleting the marked reference short messages after all the reference short messages are traversed.
The invention has the beneficial effects that:
the invention designs a reasonable queuing system to reasonably adjust the short message sending waiting time according to the requirement, and can match and send the required information for the short message more quickly by matching with a simplified address distribution model.
Drawings
FIG. 1 is a block diagram of a short message transmission queuing system according to the present invention;
FIG. 2 is a block diagram of an information acquisition module of the present invention;
FIG. 3 is a first flowchart illustrating steps performed by the reference short message update module according to the present invention;
FIG. 4 is a flowchart II of the steps executed by the reference short message update module according to the present invention.
In the figure: the system comprises an address allocation model storage module 101, an allocation model generation module 102, a historical short message database 103, a historical short message extraction unit 104, a reference short message updating module 105, a classification module 106, a post-processing module 107, a sorting module 108, an information acquisition module 109, a first identification unit 1091, a second identification unit 1092, a third identification unit 1093 and a matching unit 1094.
Detailed Description
The subject matter described herein will now be discussed with reference to example embodiments. It is to be understood that such embodiments are discussed merely to enable others skilled in the art to better understand and thereby implement the subject matter described herein, and that changes may be made in the function and arrangement of the elements discussed without departing from the scope of the disclosure. Various examples may omit, substitute, or add various procedures or components as needed. In addition, features described with respect to some examples may also be combined in other examples.
Example one
As shown in fig. 1 and fig. 2, a short message transmission queuing system includes:
an address allocation model storage module 101, configured to store an address allocation model, where the address allocation model includes a first layer, a second layer, and a third layer, where the first layer of the address allocation model stores a first query node associated with a network segment number of a mobile phone number, the second layer stores a second query node associated with a provincial feature code of the mobile phone number, and the third layer stores a third query node associated with a serial number of the mobile phone number;
the distribution model generation module 102 is connected with the historical short message database and used for generating an address distribution model and generating a first query node based on the network segment number of the mobile phone number of the sending object served by the short message platform;
generating a second query node based on the province feature code of the mobile phone number of the sending object served by the short message platform;
hashing the value 0000-9999 of the serial number of the mobile phone number by modulo 1000 to obtain a hash value of 0-999, associating the storage bit with the serial number mark of the mobile phone number with the same hash value with a third query node, and endowing the third query node with the mark with the same hash value as the serial number of the mobile phone number of the associated storage bit mark;
a second query node is connected to 1000 third query nodes, and a third query node is connected to 100 storage bits; the storage bit stores information of a short message gateway corresponding to the mobile phone number;
for a mobile phone number 139XXXXYYYY, where "139" is the network segment number, "XXXX" is the province feature code, and "YYYY" is the serial number;
for a mobile phone number, reducing the traversal range of storage bits from the first layer, the second layer and the third layer of the address allocation model layer by layer, finding out the corresponding storage bits, and acquiring the information of a short message gateway corresponding to the mobile phone number;
in the above embodiment of the present invention, one short message platform may serve all the sending objects served by the operator, or may serve some operators or some provinces of sending objects; therefore, in the above embodiment, the storage address assignment model is generated according to the short message platform service sending object, and the number of the first query node, the second query node and the third query node is determined according to the range of the mobile phone number of the service sending object, for example, the network segment numbers of the service sending objects are all "139", so that there is only one first query node in the first layer.
A historical short message database 103 for storing historical short message data, wherein the historical short message data are stored in a historical short message entry mode, and one historical short message entry comprises the user information, the short message type information, the short message content information and the short message characteristic information of historical short messages;
the user information refers to the information of the short message platform user associated with the short message; specifically, the ID information or the interface information of the short message platform user may be used.
The short message type information represents the short message type of the historical short message, the short message type is divided into three levels according to the urgency degree of a sending object for receiving the short message, as a specific implementation mode, the short message type comprises an emergency short message, a general short message and a lagging short message, wherein the emergency short message represents that the receiving time required by the sending object is less than or equal to a first receiving time threshold, the general short message represents that the receiving time required by the sending object is greater than the first receiving time threshold and less than a second receiving time threshold, and the lagging short message represents that the receiving time required by the sending object is greater than the second receiving time threshold;
the historical short messages are all the short messages which are sent to the sending object, so that the required receiving time information can be collected from the sending object, and the specific mode can be questionnaire survey, or the sending object of the historical short messages is a tester.
The content information of the short message refers to the text content contained in the short message;
the short message characteristic information comprises a first characteristic value, a second characteristic value and a third characteristic value, wherein the first characteristic value T o The calculation formula of (a) is as follows:
wherein L represents the number of all historical short message items related to the short message platform user associated with the short message, L 1 The number L of the emergency short messages in the historical short message items related to the short message platform user and representing the short message association 2 The short message type in the historical short message items related to the short message platform user and representing the short message association is the number k of the general short messages 1 And k 2 The self-defined weights are all larger than 0;
second characteristic value T t The calculation formula of (a) is as follows:
wherein T is h The message sending state receipt time of the previous message received by the sending object of the message is represented; for example, if the short message transmission status receipt time of the previous short message received by the short message transmission object is 36ms, T is h Is 36.
Third characteristic value T s Meter (2)The calculation formula is as follows:
wherein T is j The sending time interval of the previous short message received by the sending object of the short message is represented; the transmission time interval is divided into criteria, e.g. 1 hour 13 minutes, T j Is 73.
A history short message extracting unit 104 for extracting history short messages from the history short message database 103 and randomly selecting n 2 Taking the historical short message as a reference short message, and mapping the reference short message to n of a two-dimensional coordinate system 2 Point, the coordinate of the ith point of the two-dimensional coordinate system is (x) i ，y i )，n≥i≥1；
Deleting the reference short message from the historical short message to generate a first short message set;
the reference short message updating module 105 iteratively executes the following steps:
step S101, selecting a historical short message from a first short message set as an iterative short message, calculating the distance between the iterative short message and a reference short message, and selecting the reference short message closest to the iterative short message as a core short message;
in an embodiment of the invention, the distance D between the iterative short message and the reference short message is calculated 1 Is the Euclidean distance, the calculation formula is as follows:
wherein, F i The ith characteristic value, G, representing the iterative SMS i The ith characteristic value of the reference short message is represented;
step S102, updating the characteristic value of the reference short message, wherein the updated formula is as follows:
G j (t+1)＝G j (t)+h j (t)(P j (t)-G j (t))
wherein G is j (t) denotes the j-th eigenvalue of the core SMS before updating, G j (t + 1) is the j-th characteristic value of the updated core SMS, P j And (t) is the jth characteristic value of the iterative short message.
Wherein D 2 The distance between the reference short message and a coordinate point mapped by the core short message; the core short message also belongs to a reference short message, and the distance between the core short message and the core short message is 1;
t is the number of times that the reference short message updating module 105 iteratively executes the step S101 and the step S102.
As shown in fig. 3, in an embodiment of the present invention, the termination condition of the iterative execution of the reference short message update module 105 is: all historical short messages of the first short message set are selected as iterative short messages.
As shown in fig. 4, in an embodiment of the present invention, the termination condition of the iterative execution of the reference short message update module 105 is: h is a total of j (t) is less than or equal to a set first termination threshold.
A classification module 106, configured to classify the reference short message updated by the reference short message updating module 105, where the classification method is as follows:
for a reference short message, extracting historical short messages, the distance between which is less than a first distance threshold value, from the first short message set to generate a second short message set;
judging the category of the reference short message based on the following conditions:
the first condition is that: the ratio of the historical short messages with the short message types of the emergency short messages in the second short message set of the reference short messages is more than or equal to 60 percent;
the second condition is that: the proportion of the historical short messages with the short message types of emergency short messages in the second short message set of the reference short messages is less than 60 percent, the proportion of the historical short messages with the short message types of common short messages is more than 30 percent, and the proportion of the historical short messages with the short message types of common short messages is more than that of the historical short messages with the short message types of delay short messages;
a third condition: the proportion of the historical short messages with the short message types of emergency short messages in the second short message set of the reference short messages is less than 60 percent, the proportion of the historical short messages with the short message types of delay short messages is more than 30 percent, and the proportion of the historical short messages with the short message types of delay short messages is more than that of the short messages with the short message types of common short messages;
the reference short message satisfying the first condition is classified into a first class; the reference short messages meeting the second condition are classified into a second class, the reference short messages meeting a third condition are classified into a third class, and the reference short messages which do not meet the first condition, the second condition and the third condition are deleted.
A post-processing module 107, configured to process the reference short message classified by the classification module 106 to generate a final reference short message set, where the processing of the reference short message includes: traversing the reference short messages, if the categories of the two reference short messages are the same, and the distance between the two-dimensional coordinate points of the two reference short messages is less than or equal to that of the two reference short messages
Marking one of the reference short messages; deleting the marked reference short messages after all the reference short messages are traversed;
the post-processing module 107 does not mark the same reference short message;
a sorting module 108, configured to sort the short messages to be sent, and calculate a distance parameter D between the short messages to be sent and a reference short message in the final reference short message set 3 The calculation formula is as follows:
wherein Z is i The ith characteristic value G representing the short message to be sent i The ith characteristic value, M, of the reference short message g Representing a weighting parameter of the reference short message;
weighting parameter M of reference short message g The calculation formula of (a) is as follows:
wherein q is a reference in an associated reference short message set to which the reference short message belongsThe number of the short messages and the length between the two-dimensional coordinate points mapped by the reference short messages in the associated reference short message set can be less than or equal to
Are connected.
Assigning the type of the reference short message with the minimum distance parameter with the short message to be sent to the short message to be sent, putting the short message to be sent with the type of the first type into a first sequence, putting the short message to be sent with the type of the second type into a second sequence, and putting the short message to be sent with the type of the third type into a third sequence;
the information acquisition module 109 is connected with the sequencing module and acquires gateway information of the short message to be sent according to the sequence of the first sequence, the second sequence and the third sequence, wherein the acquisition mode is to search layer by layer along the address allocation model according to the mobile phone number of the sending object;
it should be noted that, for short messages to be sent in the same sequence, gateway information is obtained according to the sequence of receiving time.
In one embodiment of the present invention, the information obtaining module 109 includes:
a first identification unit 1091 for identifying a segment number of the mobile phone number;
a second identification unit 1092 for identifying the provincial feature code of the mobile phone number;
a third identification unit 1093, configured to identify a serial number of the mobile phone number, and perform hash on the identified serial number modulo 1000 to obtain a hash value;
the matching unit 1094 is used for searching and acquiring the information of the short message gateway of the mobile phone number from the address allocation model layer by layer based on the information identified by the first identification unit 1091, the second identification unit 1092 and the third identification unit 1093;
in an embodiment of the present invention, the calculated distance between the short message to be sent and the reference short message is an euclidean distance.
In an embodiment of the present invention, the associated reference short message set is generated in advance based on the final reference short message set.
In one embodiment of the invention, classification of short messages to be sent and acquisition of gateway information of the short messages to be sent are parallel processes, and the short messages to be sent classified in the previous period enter the gateway information acquisition process in the next period;
in an embodiment of the present invention, the short message feature information of the short message is generated by a short message feature generating module, and the short message feature generating module generates the short message feature information of the short message for the short message based on the aforementioned calculation formula.
In the above formula, unexplained symbols e all represent natural constants.
The embodiments of the present invention have been described with reference to the drawings, but the present invention is not limited to the above-mentioned specific embodiments, which are only illustrative and not restrictive, and those skilled in the art can make many forms without departing from the spirit of the present invention, and all of them are within the scope of the present invention.
Claims (10)
1. A short message transmission queuing system is characterized by comprising:
the address allocation model storage module is used for storing an address allocation model, a first layer of the address allocation model stores a first query node associated with a network segment number of the mobile phone number, a second layer of the address allocation model stores a second query node associated with a provincial feature code of the mobile phone number, and a third layer of the address allocation model stores a third query node associated with a serial number of the mobile phone number; the serial number of the mobile phone number is the last four digits of the mobile phone number;
the historical short message database is used for storing historical short message entries, and the historical short message entries comprise user information, short message type information, short message content information and short message characteristic information of historical short messages;
a history short message extraction unit for extracting history short messages from the history short message database and randomly selecting n 2 Mapping the historical short message as a reference short message to n of a two-dimensional coordinate system 2 Point; deleting the reference short message from the historical short message to generate a first short message set;
a reference short message updating module, configured to select a historical short message from the first short message set as an iterative short message, calculate a distance between the iterative short message and the reference short message, and select a reference short message closest to the iterative short message as a core short message; then updating the characteristic value of the reference short message;
the classification module classifies the reference short messages based on the proportion of the historical short messages of which the short message types are emergency short messages in the second short message set of the reference short messages, wherein the classified types comprise a first type, a second type and a third type;
the post-processing module is used for processing the reference short messages classified by the classification module to generate a final reference short message set;
the sequencing module is used for sequencing the short messages to be sent and calculating the distance parameter between the short messages to be sent and the reference short messages of the final reference short message set;
and assigning the type of the reference short message with the minimum distance parameter with the short message to be sent to the short message to be sent, and respectively placing the short messages to be sent with the types of the first type, the second type and the third type into a first sequence, a second sequence and a third sequence.
2. The system of claim 1, further comprising an allocation model generation module connected to the historical short message database for generating an address allocation model, wherein the first query node is generated based on a network segment number of a mobile phone number of a transmission object served by the short message platform;
generating a second query node based on the province feature code of the mobile phone number of the sending object served by the short message platform;
hashing a modular 1000 of the value 0000-9999 of the serial number of the mobile phone number to obtain a hash value of 0-999, associating a storage bit of the serial number mark of the obtained mobile phone number with the same hash with a third query node, and endowing the third query node with a mark with the same hash value of the serial number of the mobile phone number of the associated storage bit mark;
a second query node is connected to 1000 third query nodes, and a third query node is connected to 100 storage bits; the storage bit stores information of a short message gateway corresponding to the mobile phone number.
3. The system of claim 1, wherein the SMS characteristic information comprises a first characteristic value, a second characteristic value and a third characteristic value, wherein the first characteristic value T is a value of T o The calculation formula of (a) is as follows:
wherein L represents the number of all historical short message items related to the short message platform user associated with the short message, L 1 The number L of the emergency short messages in the historical short message items related to the short message platform user and representing the short message association 2 The short message type in the historical short message items related to the short message platform user and representing the short message association is the number k of the general short messages 1 And k 2 The weights are self-defined and are all larger than 0;
second characteristic value T t The calculation formula of (c) is as follows:
wherein T is h The message sending state receipt time of the previous message received by the sending object of the message is represented;
third characteristic value T s The calculation formula of (c) is as follows:
wherein T is j And the sending time interval of the previous short message received by the short message sending object is shown.
4. The short message transmission queuing system of claim 1 wherein the calculated distance between the iterative short message and the reference short message is Euclidean distance and the distance D between the iterative short message and the reference short message is 1 The calculation formula of (c) is as follows:
wherein, F i The ith characteristic value, G, of the iterative short message i And the ith characteristic value of the reference short message is represented.
5. The system of claim 4, wherein the formula for updating the eigenvalue of the reference short message is as follows:
G j (t+1)＝G j (t)+h j (t)(P j (t)-G j (t))
wherein G is j (t) denotes the j-th eigenvalue of the core SMS before updating, G j (t + 1) is the j-th characteristic value of the updated core SMS, P j (t) is the jth eigenvalue of the iterative short message;
wherein D 2 The distance between the reference short message and a coordinate point mapped by the core short message; and t is the number of times of updating the characteristic value of the reference short message by the reference short message updating module.
6. The system of claim 1, wherein the classifying module classifies the reference short message updated by the reference short message updating module comprises:
for a reference short message, extracting historical short messages, the distance between which is less than a first distance threshold value, from the first short message set to generate a second short message set;
judging the category of the reference short message based on the following conditions:
a first condition: the ratio of the historical short messages of which the short message types are the emergency short messages in the second short message set of the reference short messages is more than or equal to 60 percent; a second condition: the proportion of the historical short messages with the short message types of emergency short messages in the second short message set of the reference short messages is less than 60 percent, the proportion of the historical short messages with the short message types of common short messages is more than 30 percent, and the proportion of the historical short messages with the short message types of common short messages is more than that of the historical short messages with the short message types of delay short messages; a third condition: the proportion of the historical short messages with the short message types of emergency short messages in the second short message set of the reference short messages is less than 60 percent, the proportion of the historical short messages with the short message types of delay short messages is more than 30 percent, and the proportion of the historical short messages with the short message types of delay short messages is more than that of the short messages with the short message types of common short messages;
the reference short message satisfying the first condition is classified into a first class; the reference short messages satisfying the second condition are classified into a second class, the reference short messages satisfying a third condition are classified into a third class, the first condition,
And deleting the reference short message which does not satisfy the second condition and the third condition.
7. The system as claimed in claim 1, wherein the sorting module calculates a distance parameter D between the short message to be sent and the reference short message 3 The calculation formula of (c) is as follows:
wherein Z is i The ith characteristic value G representing the short message to be sent i The ith characteristic value, M, of the reference short message g Representing a weighting parameter of the reference short message;
weighting parameter M of reference short message g The calculation formula of (c) is as follows:
wherein q is the number of reference short messages in an associated reference short message set to which the reference short message belongs, and the length between two-dimensional coordinate points mapped by the reference short messages in the associated reference short message set can be less than or equal to the length between the two-dimensional coordinate points
Line segment of (1)And (4) connecting.
8. The short message sending queuing system of claim 1, further comprising an information obtaining module connected to the sorting module, wherein the information obtaining module obtains the gateway information of the short message to be sent according to the sequence of the first sequence, the second sequence and the third sequence, and the obtaining mode is to search layer by layer along the address allocation model according to the mobile phone number of the sending object.
9. The system of claim 8, wherein the information acquisition module comprises:
a first identification unit for identifying a segment number of the mobile phone number;
the second identification unit is used for identifying the provincial feature code of the mobile phone number;
the third identification unit is used for identifying the serial number of the mobile phone number and hashing the identified serial number modulo 1000 to obtain a hash value;
and the matching unit searches and acquires the information of the short message gateway of the mobile phone number from the address allocation model layer by layer based on the information identified by the first identification unit, the second identification unit and the third identification unit.
10. The system of claim 1, wherein the post-processing module processes the reference short messages classified by the classification module to generate a final reference short message set, and comprises: traversing the reference short messages, if the categories of the two reference short messages are the same, and the distance between the two-dimensional coordinate points of the two reference short messages is less than or equal to that of the two reference short messages
Marking one of the reference short messages; and deleting the marked reference short messages after all the reference short messages are traversed. />
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202211609899.8A CN115604669B (en) | 2022-12-15 | 2022-12-15 | Short message sending queuing system |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202211609899.8A CN115604669B (en) | 2022-12-15 | 2022-12-15 | Short message sending queuing system |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN115604669A CN115604669A (en) | 2023-01-13 |
| CN115604669B true CN115604669B (en) | 2023-04-04 |
Family
ID=84853961
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN202211609899.8A Active CN115604669B (en) | 2022-12-15 | 2022-12-15 | Short message sending queuing system |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN115604669B (en) |
Citations (1)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| WO2020015107A1 (en) * | 2018-07-19 | 2020-01-23 | 平安科技（深圳）有限公司 | Short message distribution processing method and apparatus, computer device and storage medium |
Family Cites Families (5)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US6560456B1 (en) * | 1999-05-24 | 2003-05-06 | Openwave Systems, Inc. | System and method for providing subscriber-initiated information over the short message service (SMS) or a microbrowser |
| CN102833709B (en) * | 2012-08-16 | 2016-05-11 | 小米科技有限责任公司 | A kind of sending method, mobile terminal, server and system of note |
| CN109963259B (en) * | 2017-12-26 | 2021-11-30 | 中国移动通信集团山东有限公司 | Short message sending method and device |
| CN112822647B (en) * | 2020-12-30 | 2022-11-25 | 平安普惠企业管理有限公司 | Short message sending method, device, storage medium and computer equipment |
| CN114885334B (en) * | 2022-07-13 | 2022-09-27 | 安徽创瑞信息技术有限公司 | High-concurrency short message processing method |
-
2022
- 2022-12-15 CN CN202211609899.8A patent/CN115604669B/en active Active
Patent Citations (1)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| WO2020015107A1 (en) * | 2018-07-19 | 2020-01-23 | 平安科技（深圳）有限公司 | Short message distribution processing method and apparatus, computer device and storage medium |
Also Published As
| Publication number | Publication date |
|---|---|
| CN115604669A (en) | 2023-01-13 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN111046035B (en) | Data automation processing method, system, computer equipment and readable storage medium | |
| CN103631840A (en) | Electronic messaging system utilizing social classification rules | |
| CN1134755A (en) | Method for selecting transmission preferences | |
| CN113326377B (en) | Name disambiguation method and system based on enterprise association relationship | |
| JP5059132B2 (en) | Regional information retrieval server and regional information retrieval method | |
| CN112235159B (en) | Gateway quality portrait generation method, system, network equipment and storage medium | |
| CN109460775A (en) | A kind of data filling method and device based on comentropy | |
| WO2020024444A1 (en) | Group performance grade recognition method and apparatus, and storage medium and computer device | |
| CN111612499B (en) | Information pushing method and device, storage medium and terminal | |
| CN113326363B (en) | Searching method and device, prediction model training method and device and electronic equipment | |
| CN115604669B (en) | Short message sending queuing system | |
| CN113836898A (en) | Automatic order dispatching method for power system | |
| CN116846690B (en) | IPv6 network space mapping method based on industry classification and probability model | |
| CN115185939B (en) | Data processing method of multi-source data | |
| CN114928501B (en) | Phishing mail detection method based on personalized federal learning | |
| CN110633374A (en) | Social relation knowledge graph generation method based on artificial intelligence and robot system | |
| CN108256083A (en) | Content recommendation method based on deep learning | |
| CN110795425B (en) | Customs data cleaning and merging method, device, equipment and medium | |
| CN113779116A (en) | Object sorting method, related equipment and medium | |
| CN109034938B (en) | Information rapid screening and matching method and device, electronic equipment and storage medium | |
| WO2020024448A1 (en) | Group performance grade identification method, device, storage medium, and computer apparatus | |
| CN111950615A (en) | Network fault feature selection method based on tree species optimization algorithm | |
| CN112286874B (en) | Time-based file management method | |
| CN110727858A (en) | Recommendation method, computer storage medium and electronic device | |
| CN115689616B (en) | Cloud content pushing method and system based on big data feature analysis |
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 |