CN106330766A - Message transmitting method and apparatus - Google Patents

Abstract

The present invention discloses a message transmitting method and apparatus. The method includes the following steps that: the number of messages stored in a second message circular queue is obtained; if the number of the messages stored in the second message circular queue does not exceed a first threshold value, messages to be transmitted stored in a first message circular queue are obtained and are stored in the second message circular queue; the messages to be transmitted in the second message circular queue are processed; and the processed messages to be transmitted are transmitted to a client. According to the message transmitting method and apparatus of the invention, a plurality of message circular queues store different messages, and therefore, the problems of frequent locking, memory allocation and release, which are caused by a condition that one queue buffering region is adopted, can be solved, the efficiency of message transmission can be improved, and system overhead can be reduced.

Description

A message sending method and device

technical field

The embodiments of the present invention relate to the technical field of software, and in particular, to a message sending method and device.

Background technique

Existing message notification systems generally use a queue buffer to store data retrieved from the notification library, and then send the data in the queue buffer to the corresponding client. This method is simple to implement, but the buffer is implemented by using a queue. When data arrives, memory must be allocated at the end of the queue, and memory must be released at the head of the queue when data transmission is complete. If the system carries a large data flow, it will face the overhead pressure caused by large memory operations. At the same time, in a multi-threaded environment, processing the data in the queue will face frequent adding and unlocking operations, which greatly affects the TPS of the system.

Contents of the invention

Embodiments of the present invention provide a message sending method and device, which are used to improve message sending efficiency and reduce system overhead.

A message sending method provided by an embodiment of the present invention includes:

determining the number of messages stored in the second message circular queue;

If the number of messages stored in the second message loop queue does not exceed the first threshold, then acquire the messages to be sent stored in the first message loop queue and store them in the second message loop queue;

Processing the messages to be sent in the second message circular queue, and sending the processed messages to be sent to the client.

Preferably, after sending the processed to-be-sent message to the client, it further includes:

If the client feeds back that the message to be sent has not been sent successfully, storing the message that was not sent successfully in a third message loop queue;

Send the unsuccessfully sent messages in the third message loop queue to the client.

Preferably, after sending the unsuccessfully sent messages in the third message loop queue to the client, the method further includes:

If the number of sending times of the unsuccessfully sent messages is greater than the second threshold, the server is notified that the unsuccessfully sent messages fail to be sent.

Preferably, before storing the unsuccessfully sent messages in the third message loop queue, the method further includes:

If the number of unsuccessfully sent messages in the third message loop queue exceeds the third threshold, the server is notified that the message to be sent has not been sent successfully, and after a set time, the message is retrieved from the server. Messages that are not sent successfully are sent to the first message circular queue.

Preferably, it also includes:

determining whether the total amount of messages stored in the first message loop queue, the second message loop queue, and the third message loop queue is less than a fourth threshold;

If so, retrieve the message to be sent from the server;

The messages retrieved from the server to be sent are sequentially stored at the tail of the first message circular queue.

Preferably, it also includes:

If the client feedbacks that the message is successfully sent, it notifies the server of the successful message sending status, so that the successfully sent message will not be retrieved.

Preferably, it also includes:

If the messages to be sent stored in the first message circular queue exceed the fifth threshold, the messages retrieved from the server are discarded.

Correspondingly, an embodiment of the present invention also provides a message sending device, including:

a determining unit, configured to determine the number of messages stored in the second message circular queue;

An acquisition unit, configured to acquire messages to be sent stored in the first message loop queue and store them in the second message loop queue if the number of messages stored in the second message loop queue does not exceed the first threshold;

The processing unit is configured to process the messages to be sent in the second message circular queue, and send the processed messages to be sent to the client.

Preferably, the processing unit is also used for:

After sending the processed message to be sent to the client, if the client feeds back that the message to be sent has not been sent successfully, storing the message that was not sent successfully in a third message loop queue;

Send the unsuccessfully sent messages in the third message loop queue to the client.

Preferably, the processing unit is also used for:

After sending the unsuccessfully sent messages in the third message loop queue to the client, if the number of times the unsuccessfully sent messages are sent is greater than a second threshold, then notify the server that the unsuccessfully sent messages are sent fail.

Preferably, the processing unit is also used for:

Before storing the unsuccessfully sent messages in the third message loop queue, if the number of unsuccessfully sent messages in the third message loop queue exceeds a third threshold, then notify the server of the messages to be sent Not successfully sent, and after a set time, retrieve the failed message from the server to the first message circular queue.

Preferably, the determining unit is further configured to determine whether the total amount of messages stored in the first message loop queue, the second message loop queue, and the third message loop queue is less than a fourth threshold;

The acquisition unit is further configured to retrieve messages to be sent from the server if the total amount of messages stored in the first message loop queue, the second message loop queue, and the third message loop queue is less than a fourth threshold messages; and store the messages retrieved from the server to the tail of the first message circular queue in sequence.

Preferably, the processing unit is also used for:

If the client feedbacks that the message is successfully sent, it notifies the server of the successful message sending status, so that the successfully sent message will not be retrieved.

Preferably, the processing unit is also used for:

If the messages to be sent stored in the first message circular queue exceed the fifth threshold, the messages retrieved from the server are discarded.

The embodiment of the present invention shows that by determining the number of messages stored in the second message loop queue, if the number of messages stored in the second message loop queue does not exceed the first threshold, then obtain the messages to be sent stored in the first message loop queue message, and store it in the second message loop queue, process the message to be sent in the second message loop queue, and send the processed message to be sent to the client. By storing different messages in multiple message loop queues, the problem of frequent memory allocation and release using one queue buffer is avoided, thereby improving message sending efficiency and reducing system overhead.

Description of drawings

In order to more clearly illustrate the technical solutions in the embodiments of the present invention, the drawings that need to be used in the description of the embodiments will be briefly introduced below. Obviously, the drawings in the following description are only some embodiments of the present invention. For Those of ordinary skill in the art can also obtain other drawings based on these drawings without making creative efforts.

FIG. 1 is a schematic structural diagram of a system architecture provided by an embodiment of the present invention;

FIG. 2 is a schematic flowchart of a message sending method provided by an embodiment of the present invention;

FIG. 3 is a schematic diagram of a system deployment provided by an embodiment of the present invention;

FIG. 4 is a schematic flowchart of a message sending method provided by an embodiment of the present invention;

FIG. 5 is a schematic flowchart of a message sending method provided by an embodiment of the present invention;

FIG. 6 is a schematic flowchart of a message sending method provided by an embodiment of the present invention;

FIG. 7 is a schematic structural diagram of a message sending device provided by an embodiment of the present invention.

detailed description

In order to make the purpose, technical solutions and advantages of the present invention clearer, the present invention will be further described in detail below in conjunction with the accompanying drawings. Obviously, the described embodiments are only some of the embodiments of the present invention, rather than all of them. Based on the embodiments of the present invention, all other embodiments obtained by persons of ordinary skill in the art without making creative efforts belong to the protection scope of the present invention.

FIG. 1 exemplarily shows a system architecture provided by an embodiment of the present invention, and the system architecture is suitable for running a method for sending a message provided in an embodiment of the present invention. The system architecture includes a server 101 , a client 102 , a message retrieval device 103 , a message processing and sending device 104 and a message storage and forwarding device 105 . The server 101 is used to provide messages to be sent, the message fetching device 103 is used to retrieve messages from the server and store them in the circular queue 1, and the message processing and sending device 104 is used to obtain messages to be sent from the circular queue 1 and store them in the circular queue 2, and process the messages in the circular queue 2 and send them to the client 102, the message storage and forwarding means 105 is used to send the message that the message processing sending means 104 fails to send.

Based on the above description, FIG. 2 shows a message sending process provided by an embodiment of the present invention, and the process can be executed by a message sending device.

As shown in Figure 2, the specific steps of the method process include:

Step 201, determine the number of messages stored in the second message circular queue.

Step 202, if the number of messages stored in the second message loop queue does not exceed the first threshold, acquire the messages to be sent stored in the first message loop queue, and store them in the second message loop queue.

Step 203, process the messages to be sent in the second message circular queue, and send the processed messages to the client.

In the embodiment of the present invention, before processing the messages to be sent in the second message circular queue, it is necessary to determine the number of messages stored in the second message circular queue, if the number of messages stored in the second message circular queue is not If the first threshold is exceeded, the message to be sent stored in the first message loop queue can be acquired, and the acquired message to be sent can be stored in the second message loop queue, and then the message to be sent in the second message loop queue can be The message is processed, and the message to be sent after processing is sent to the client. Wherein, the first message circular queue may be the circular queue 1 in FIG. 1 above, the second message circular queue may be the circular queue 2 in FIG. 1 above, and the first threshold may be set based on experience.

For example, the above-mentioned message processing and sending device acquires a message from the circular queue 1 and saves it in the circular queue 2, and processes and sends the message at the same time. Specifically, when the circular queue 1 is not empty, if the circular queue 2 is not full, save the message obtained by the head of the circular queue 1 to the circular queue 2, and if the circular queue 2 is full, continue to query the circular queue 2 Is it full. When processing the messages in the circular queue 2, the internal field data update, deformation and other processing methods may be used. In particular, at this time, the processing of the messages in the circular queue 2 is isolated from the message reception of the circular queue 1, and there is no need to perform an unlocking operation.

After the processed message to be sent is sent to the client in step 203 above, if the client feeds back that the message to be sent has not been sent successfully, then the message that has not been sent successfully is stored in the third message loop queue, and The unsuccessfully sent messages in the third message loop queue are sent to the client. The failure to send the message to be sent may be indicated as sending failure or sending timeout. If the client feedbacks that the message is successfully sent, it will notify the server of the successful message sending status, so that the sent message will not be retrieved. By using the third message loop queue to store messages that have not been sent successfully, the problem of inefficient data processing in the buffer caused by the backlog of messages that fail to send or time out can be prevented.

Further, after the unsuccessfully sent message in the third message loop queue is sent to the client, if the number of times the unsuccessfully sent message is sent is greater than the second threshold, the server is notified that the unsuccessfully sent message fails to be sent. The second threshold can be set according to experience, and the third message circular queue can be the circular queue 3 in FIG. 1 .

Specifically, when the circular queue 3 is not empty, obtain the message from the circular queue 3 and send it. When the number of times the message is sent exceeds the number specified by the configuration parameter, the update message fails to be sent to the server; otherwise, the message is resent until the message is sent The number of times exceeds the number specified by the configuration parameter.

Preferably, before storing the unsuccessfully sent messages in the third message loop queue, if the number of unsuccessfully sent messages in the third message loop queue exceeds the third threshold, the server is notified that the message to be sent has not been sent success, and re-fetch the unsuccessful message from the server to the first message circular queue after the set time, so as to avoid message loss due to the fullness of the third message circular queue.

In order to retrieve messages to be sent from the server more accurately, it is also necessary to determine whether the total amount of messages stored in the first message loop queue, the second message loop queue, and the third message loop queue is less than the fourth threshold, and if so, Then retrieve the message to be sent from the server, otherwise, it means that the total amount of messages is too large to retrieve a new message to be sent. After fetching, the messages to be sent fetched from the server are sequentially stored at the tail of the first message circular queue.

Further, when retrieving messages to be sent from the server, the number of messages to be sent stored in several first message circular queues is too full, that is to say, if the number of messages to be sent stored in the above-mentioned first message circular queue exceeds the fifth Threshold, the messages obtained from the server are discarded. The fifth threshold is set based on experience.

In order to better explain the embodiment of the present invention, the specific flow of message sending in the embodiment of the present invention will be described below in conjunction with FIG. 1 , FIG. 3 , FIG. 4 , FIG. 5 and FIG. 6 .

Fig. 3 exemplarily shows the structure of the system deployment applicable to the embodiment of the present invention, the message fetching thread in the message fetching device fetches messages from the server and stores them in the circular queue 1, and the message processing and sending thread in the message processing sending device starts from the loop Obtain messages from queue 1 and save them in circular queue 2, process the messages in circular queue 2, and then send them to the client through the Internet. If the message is not sent successfully, it is stored in the circular queue 3, and the message store-and-forward thread in the message store-and-forward device sends the message in the circular queue 3.

Specifically, the process performed by the message retrieval device is shown in Figure 4, and the process specifically includes:

In step 401, the retrieval message trigger value n is obtained from configuration parameters.

Step 402, determine whether the service is running, if yes, go to step 403, if not, go to step 408.

In step 403, it is judged whether the total amount of messages in the three circular queues is less than n, and if yes, then go to step 404, if not, then execute step 403 again.

Step 404, retrieve m messages from the server.

Step 405, judge whether m is greater than 0, if yes, go to step 406, if not, go to step 409.

Step 406, judge whether the circular queue 1 is not full, if yes, go to step 407, if not, go to step 410.

Step 407, save the message in circular queue 1.

Step 408, end the service.

Step 409, the thread sleeps.

Step 410, discarding the message.

The main function of the above-mentioned message fetching device is to obtain message data from the server and save it in the circular queue 1. Specifically, the message fetching thread starts, reads the configuration parameters, obtains the thread sleep time slice size, fetches the message trigger value, etc., and then in the main When the service keeps running, the number of remaining messages in the three circular queues is respectively obtained. When the total amount is less than the trigger value for message retrieval, the message retrieval action is triggered. Get messages from the server. If no messages are found, the thread sleeps for a period of time and then re-enters step b; if messages are found, insert messages into circular queue 1 in sequence. When storing messages in circular queue 1, if the configured circular queue 1 is short or the circular queue 1 is full due to the large number of notification messages retrieved, the message will be discarded. Since the message status in the server is not set to success or failure, these messages will still be retrieved later, so this operation will not cause the message to be lost.

The process performed by the message processing and sending device is shown in Figure 5, and the process specifically includes:

Step 501, start the message processing and sending thread.

Step 502, judge whether the service is running, if yes, go to step 503, otherwise, go to step 511.

Step 503 , judging whether the circular queue 1 is not empty, if yes, then go to step 504 , if not, then go to step 512 .

Step 504, judge whether the circular queue 2 is not full, if yes, go to step 505, if not, re-execute step 504.

Step 505, get the message from the head of the circular queue 1 and save it to the tail of the circular queue 2.

Step 506, process the latest acquired message.

Step 507, send the processed message to the client.

Step 508, judge whether the message sending is unsuccessful, if yes, go to step 509, if not, go to step 513.

Step 509, judge whether the unused length in the circular queue 3 is greater than 15%, if yes, go to step 510, if not, go to step 514.

Step 510, store the message in the circular queue 3.

Step 511, end.

Step 512, waiting to be woken up or waiting for timeout.

Step 513, update the delivery status of the message to the server.

Step 514, notify the server to update the timestamp of the message for subsequent retrieval.

The main function of the message processing and sending device is to obtain message data from the circular queue 1 and save it in the circular queue 2, and process and send the message at the same time. Specifically, the message processing and sending thread is started, the configuration parameters are read, and the thread timeout is obtained. Wait for parameter information such as time slice size. When the main service keeps running, if the circular queue 1 is empty, the thread blocks and waits to be woken up or waits for a timeout to continue to query whether the circular queue 1 is empty. When the circular queue 1 is not empty, if the circular queue 2 is not full , save the message obtained from the head of circular queue 1 into circular queue 2. If the circular queue 2 is full, continue to inquire whether the circular queue 2 is full, and process the latest acquired messages, such as internal field data update, deformation, and so on. Send the processed message to the client. If the message is sent successfully, update the delivery status of the message to the server, and the message will no longer be retrieved later. If the sending fails or times out, if the unused length of the circular queue 3 is less than 10% of the total length at this time, the server will be notified directly, and the message will be retrieved again after a few minutes in the future, so as to avoid causing the circular queue 3 to be full message is lost. Otherwise, store the message in circular queue 3.

The process performed by the message store and forward device is shown in Figure 6, and the process specifically includes:

In step 601, the number T of message sending attempts is obtained from configuration parameters.

Step 602, judge whether the service is running, if yes, go to step 603, if not, go to step 609.

Step 603, judging whether the circular queue 3 is not empty, if yes, then go to step 604, if not, then go to step 610.

Step 604, obtain messages from the circular queue 3 for processing, and set t=T.

Step 605, judge whether t is greater than 0, if yes, go to step 606, if not, go to step 611.

Step 606, send the processed message to the client.

Step 607, judge whether the message sending is unsuccessful, if yes, go to step 608, if not, go to step 612.

Step 608, let t=t-1.

Step 609, end.

Step 610, waiting to be woken up or waiting for timeout.

Step 611, update the delivery status of the message to the server.

Step 612, update the delivery status of the message to the server.

The main function of the message store-and-forward device is to store and forward messages that fail to be delivered or timed out by the message processing and sending device. Specifically, the message store-and-forward thread is started, configuration parameters are read, and parameter information such as the number of repeated message transmissions is obtained. When the main service keeps running, if the circular queue 3 is empty, the thread blocks and waits to be woken up or waits for a timeout to continue to query whether the circular queue 3 is empty. When the circular queue 3 is not empty, get the message from the circular queue 3 waiting to be sent. When the number of times the message is sent exceeds the number specified by the configuration parameter, the update message will fail to be sent to the server, otherwise, the obtained message will be sent. Repeat this process until the update message fails to be sent to the server until the number of sending times is full, or the update message is successfully sent to the server after sending successfully.

The embodiment of the present invention shows that by determining the number of messages stored in the second message loop queue, if the number of messages stored in the second message loop queue does not exceed the first threshold, then obtain the messages to be sent stored in the first message loop queue message, and store it in the second message loop queue, process the message to be sent in the second message loop queue, and send the processed message to be sent to the client. By storing different messages in multiple message loop queues, the problem of frequent memory allocation and release using one queue buffer is avoided, thereby improving message sending efficiency and reducing system overhead.

Based on the same technical concept, FIG. 7 shows the structure of a message sending device provided by an embodiment of the present invention, and the device can execute the flow of the message sending method.

As shown in Figure 7, the device specifically includes:

A determining unit 701, configured to determine the number of messages stored in the second message circular queue;

The acquiring unit 702 is configured to acquire the messages to be sent stored in the first message loop queue and store them in the second message loop queue if the number of messages stored in the second message loop queue does not exceed the first threshold ;

The processing unit 703 is configured to process the messages to be sent in the second message circular queue, and send the processed messages to be sent to the client.

Preferably, the processing unit 703 is further configured to:

After sending the processed message to be sent to the client, if the client feeds back that the message to be sent has not been sent successfully, storing the message that was not sent successfully in a third message loop queue;

Send the unsuccessfully sent messages in the third message loop queue to the client.

Preferably, the processing unit 703 is further configured to:

After sending the unsuccessfully sent messages in the third message loop queue to the client, if the number of times the unsuccessfully sent messages are sent is greater than a second threshold, then notify the server that the unsuccessfully sent messages are sent fail.

Preferably, the processing unit 703 is further configured to:

Before storing the unsuccessfully sent messages in the third message loop queue, if the number of unsuccessfully sent messages in the third message loop queue exceeds a third threshold, then notify the server of the messages to be sent Not successfully sent, and after a set time, retrieve the failed message from the server to the first message circular queue.

Preferably, the determining unit 701 is further configured to determine whether the total amount of messages stored in the first message loop queue, the second message loop queue, and the third message loop queue is less than a fourth threshold;

The acquiring unit 702 is further configured to retrieve messages to be sent from the server if the total amount of messages stored in the first message loop queue, the second message loop queue, and the third message loop queue is less than a fourth threshold. and store the messages retrieved from the server to the tail of the first message circular queue in sequence.

Preferably, the processing unit 703 is further configured to:

If the client feedbacks that the message is successfully sent, it notifies the server of the successful message sending status, so that the successfully sent message will not be retrieved.

Preferably, the processing unit 703 is further configured to:

If the messages to be sent stored in the first message circular queue exceed the fifth threshold, the messages retrieved from the server are discarded.

The present invention is described with reference to flowchart illustrations and/or block diagrams of methods, apparatus (systems), and computer program products according to embodiments of the invention. It should be understood that each procedure and/or block in the flowchart and/or block diagram, and a combination of procedures and/or blocks in the flowchart and/or block diagram can be realized by computer program instructions. These computer program instructions may be provided to a general purpose computer, special purpose computer, embedded processor, or processor of other programmable data processing equipment to produce a machine such that the instructions executed by the processor of the computer or other programmable data processing equipment produce a An apparatus for realizing the functions specified in one or more procedures of the flowchart and/or one or more blocks of the block diagram.

These computer program instructions may also be stored in a computer-readable memory capable of directing a computer or other programmable data processing apparatus to operate in a specific manner, such that the instructions stored in the computer-readable memory produce an article of manufacture comprising instruction means, the instructions The device realizes the function specified in one or more procedures of the flowchart and/or one or more blocks of the block diagram.

These computer program instructions can also be loaded onto a computer or other programmable data processing device, causing a series of operational steps to be performed on the computer or other programmable device to produce a computer-implemented process, thereby The instructions provide steps for implementing the functions specified in the flow chart or blocks of the flowchart and/or the block or blocks of the block diagrams.

While preferred embodiments of the invention have been described, additional changes and modifications to these embodiments can be made by those skilled in the art once the basic inventive concept is appreciated. Therefore, it is intended that the appended claims be construed to cover the preferred embodiment as well as all changes and modifications which fall within the scope of the invention.

Obviously, those skilled in the art can make various changes and modifications to the present invention without departing from the spirit and scope of the present invention. Thus, if these modifications and variations of the present invention fall within the scope of the claims of the present invention and their equivalent technologies, the present invention also intends to include these modifications and variations.

Claims (14)

1. a message method, it is characterised in that including:

Determine the quantity of the message of the second Message Rotation Queue storage；

If the quantity of the message of described second Message Rotation Queue storage is not less than first threshold, then obtain the first message loop team The message to be sent of row storage, and store to described second Message Rotation Queue；

Message to be sent in described second Message Rotation Queue is processed, and will process after message to be sent Send to client.

2. the method for claim 1, it is characterised in that the message to be sent after processing sends to client Afterwards, also include:

If message to be sent described in described client feedback does not sends successfully, then by described do not send successful message store to In 3rd Message Rotation Queue；

The successful message that do not sends in described 3rd Message Rotation Queue is sent to described client.

3. method as claimed in claim 2, it is characterised in that by not sending successfully in described 3rd Message Rotation Queue Message sends after described client, also includes:

If the described transmission times of successful message that do not sends is more than Second Threshold, then do not send successfully described in notice server Message sends unsuccessfully.

4. method as claimed in claim 2, it is characterised in that do not sending successful message store described to the 3rd message Before in round-robin queue, also include:

If the quantity not sending successful message in described 3rd Message Rotation Queue is more than the 3rd threshold value, then notify server Described message to be sent does not sends successfully, and does not sends into described in again fishing for from described server after a set time The message of merit is to described first Message Rotation Queue.

5. the method as described in any one of Claims 1-4, it is characterised in that also include:

Determine the message of storage in described first Message Rotation Queue, the second Message Rotation Queue and the 3rd Message Rotation Queue Whether total amount is less than the 4th threshold value；

From described server, the most then fish for message to be sent；

The message to be sent fished for from server is sequentially stored the afterbody to described first Message Rotation Queue.

6. the method as described in any one of Claims 1-4, it is characterised in that also include:

If described client feedback message sends successfully, then message is sent successful state notifying to server, so that described Send successful message not fished for.

7. the method as described in any one of Claims 1-4, it is characterised in that also include:

If the message to be sent of described first Message Rotation Queue storage is more than the 5th threshold value, by fish for from described server Message abandons.

8. a message dispensing device, it is characterised in that including:

Determine unit, for determining the quantity of the message of the second Message Rotation Queue storage；

Acquiring unit, if for the quantity of message of described second Message Rotation Queue storage not less than first threshold, then obtaining The message to be sent of the first Message Rotation Queue storage, and store to described second Message Rotation Queue；

Processing unit, for processing the message to be sent in described second Message Rotation Queue, and by after process Message to be sent send to client.

9. device as claimed in claim 8, it is characterised in that described processing unit is additionally operable to:

Message to be sent after processing sends after client, if to be sent disappearing described in described client feedback Breath does not sends successfully, then do not send successful message store described to the 3rd Message Rotation Queue；

The successful message that do not sends in described 3rd Message Rotation Queue is sent to described client.

10. device as claimed in claim 9, it is characterised in that described processing unit is additionally operable to:

The successful message that do not sends in described 3rd Message Rotation Queue is sent after described client, does not sends out if described Send the transmission times of successful message more than Second Threshold, then do not send successful message described in notice server and send unsuccessfully.

11. devices as claimed in claim 9, it is characterised in that described processing unit is additionally operable to:

Do not sending before successful message stores to the 3rd Message Rotation Queue by described, if described 3rd message loop team The quantity not sending successful message in row is more than the 3rd threshold value, then message to be sent described in notice server does not sends into Merit, and do not send successful message described in again fishing for from described server after a set time and follow to described first message Ring queue.

12. devices as described in any one of claim 9 to 11, it is characterised in that described determine unit, are additionally operable to determine described In first Message Rotation Queue, the second Message Rotation Queue and the 3rd Message Rotation Queue, whether the total amount of the message of storage is less than 4th threshold value；

Described acquiring unit, if being additionally operable to described first Message Rotation Queue, the second Message Rotation Queue and the 3rd message loop In queue, the total amount of the message of storage is less than the 4th threshold value, then fish for message to be sent from described server；And will be from clothes The message to be sent fished in business device sequentially stores the afterbody to described first Message Rotation Queue.

13. devices as described in any one of claim 9 to 11, it is characterised in that described processing unit is additionally operable to:

If described client feedback message sends successfully, then message is sent successful state notifying to server, so that described Send successful message not fished for.

14. devices as described in any one of claim 9 to 11, it is characterised in that described processing unit is additionally operable to:

If the message to be sent of described first Message Rotation Queue storage is more than the 5th threshold value, by fish for from described server Message abandons.