CN110290139B - Message transmission method and device - Google Patents
Message transmission method and device Download PDFInfo
- Publication number
- CN110290139B CN110290139B CN201910573044.6A CN201910573044A CN110290139B CN 110290139 B CN110290139 B CN 110290139B CN 201910573044 A CN201910573044 A CN 201910573044A CN 110290139 B CN110290139 B CN 110290139B
- Authority
- CN
- China
- Prior art keywords
- message
- caller
- request
- transmission
- callee
- 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/50—Queue scheduling
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L67/00—Network arrangements or protocols for supporting network services or applications
- H04L67/01—Protocols
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L67/00—Network arrangements or protocols for supporting network services or applications
- H04L67/01—Protocols
- H04L67/133—Protocols for remote procedure calls [RPC]
Abstract
The invention discloses a message transmission method and a device, wherein the message transmission method comprises the following steps: establishing a message queue connection between a caller end for requesting transmission and a callee end for responding transmission; and transmitting at least one message between the caller end and the callee end in an asynchronous non-blocking manner based on the message queue connection, wherein the message queue connection remains in existence during message transmission between the caller end and the callee end. By using the method, the message is transmitted in an asynchronous non-blocking mode, so that the method is more suitable for processing high-concurrency requests and can effectively improve the message transmission efficiency.
Description
Technical Field
The invention belongs to the technical field of communication information processing, and particularly relates to a message transmission method and device.
Background
During the process of accessing the server by the user through the client, the server may receive a large number of access messages from the client, sometimes with a large access amount and high concurrency. Various message queue products have come into existence which are used as containers to hold messages during their transmission.
The message queue products are widely used in various systems, and have the characteristics of load balancing, high robustness, easy scalability and the like, but the currently used message queue framework is still a synchronous blocking mode, and the message queue products widely used in the market are Rabbitmq, Zeromq, Rocktmq and the like.
Production and consumption of messages are involved in the message transmission process, for example, in the process of sending a request message to a server by a client, the client is a producer of the message, and the server is a consumer of the message; however, in the process of sending the processing result to the client by the server, the client is the consumer of the message, and the server is the producer of the message. Therefore, the same device may play different roles in different transmission processes.
In the current related art message queue product, according to the API provided by the message queue product or the SDKs in different programming languages, the producer attaches a message with a different Topic (Topic) and sends the message to the message list; consumers subscribe to a particular Topic (Topic) message queue and, upon receiving a message, process it as a function of the registration.
Accordingly, in the working process of the message queue product of the prior art, a synchronous processing mode is generally adopted. Thus, creating the switch (exchange), creating the list (queue), sending and receiving messages from the message queue product are all real-time processes of the request, resulting in a very large time consumption. In particular, in the face of high-concurrency massive requests, the thread is blocked by the synchronous processing mode, and the resource of the server is excessively consumed by adding the thread.
Disclosure of Invention
An embodiment of the present invention provides a message transmission method and device, which are used to solve at least one of the above technical problems.
In a first aspect, an embodiment of the present invention provides a message transmission method, including: establishing a message queue connection between a caller end for requesting transmission and a callee end for responding transmission; and transmitting at least one message between the caller end and the callee end in an asynchronous non-blocking manner based on the message queue connection, wherein the message queue connection remains in existence during message transmission between the caller end and the callee end.
In a second aspect, an embodiment of the present invention provides a message transmission apparatus, including: the message queue connection construction unit is used for establishing message queue connection between a caller end for requesting transmission and a callee end for responding transmission; an asynchronous non-blocking transmission unit, configured to transmit at least one message between the caller end and the callee end in an asynchronous non-blocking manner based on the message queue connection, where the message queue connection remains in existence during message transmission between the caller end and the callee end.
In a third aspect, an embodiment of the present invention provides an electronic device, including: the computer-readable medium includes at least one processor, and a memory communicatively coupled to the at least one processor, wherein the memory stores instructions executable by the at least one processor to enable the at least one processor to perform the steps of the above-described method.
In a fourth aspect, an embodiment of the present invention provides a storage medium, on which a computer program is stored, which when executed by a processor implements the steps of the above method.
The embodiment of the invention has the beneficial effects that: the method comprises the steps of establishing a message queue connection between a caller end requesting data transmission and a callee end responding to the data transmission, and transmitting at least one message between the caller end and the callee end in an asynchronous non-blocking mode based on the message queue connection, wherein the message queue connection does not disappear in the process of message transmission between the caller end and the callee end. Therefore, on one hand, in the process of message transmission, the message queue connection which is specially used for the caller end and the callee end is provided, so that the message queue connection does not need to be constructed and destroyed aiming at the transmission of each message, and the message transmission efficiency is improved. On the other hand, compared with a synchronous transmission mode, the message is transmitted between the caller end and the callee end in an asynchronous non-blocking mode, so that the blocking of the thread during processing of the high-concurrency message request can be avoided, the processing efficiency for the high-concurrency request is improved, and the system resources can be effectively saved.
Drawings
In order to more clearly illustrate the technical solutions of the embodiments of the present invention, the drawings needed to be used in the description of the embodiments are briefly introduced below, and it is obvious that the drawings in the following description are some embodiments of the present invention, and it is obvious for those skilled in the art to obtain other drawings based on the drawings without creative efforts.
Fig. 1 is a flowchart of an embodiment of a message transmission method according to the present invention;
fig. 2 is a schematic diagram illustrating an operation principle of a message producer architecture in a message transmission method according to an embodiment of the present invention;
FIG. 3 is a schematic diagram illustrating an operation principle of a message consumer architecture in a message transmission method according to an embodiment of the present invention;
FIG. 4 is a schematic flow chart illustrating a message transmission method according to an embodiment of the present invention;
fig. 5 is a block diagram of a skill message transmission device according to an embodiment of the present invention.
Detailed Description
In order to make the objects, technical solutions and advantages of the embodiments of the present invention clearer, the technical solutions in the embodiments of the present invention will be clearly and completely described below with reference to the drawings in the embodiments of the present invention, and it is obvious that the described embodiments are some, but not all, embodiments of the present invention. All other embodiments, which can be derived by a person skilled in the art from the embodiments given herein without making any creative effort, shall fall within the protection scope of the present invention.
It should be noted that the embodiments and features of the embodiments in the present application may be combined with each other without conflict.
The invention may be described in the general context of computer-executable instructions, such as program modules, being executed by a computer. Generally, program modules include routines, programs, objects, components, data structures, etc. that perform particular tasks or implement particular abstract data types. The invention may also be practiced in distributed computing environments where tasks are performed by remote processing devices that are linked through a communications network. In a distributed computing environment, program modules may be located in both local and remote computer storage media including memory storage devices.
As used herein, a "module," "system," and the like are intended to refer to a computer-related entity, either hardware, a combination of hardware and software, or software in execution. In particular, for example, an element may be, but is not limited to being, a process running on a processor, an object, an executable, a thread of execution, a program, and/or a computer. Also, an application or script running on a server, or a server, may be an element. One or more elements may be in a process and/or thread of execution and an element may be localized on one computer and/or distributed between two or more computers and may be operated by various computer-readable media. The elements may also communicate by way of local and/or remote processes based on a signal having one or more data packets, e.g., from a data packet interacting with another element in a local system, distributed system, and/or across a network in the internet with other systems by way of the signal.
Finally, it should be further noted that the terms "comprises" and "comprising," when used herein, include not only those elements but also other elements not expressly listed or inherent to such processes, methods, articles, or devices. Without further limitation, an element defined by the phrase "comprising … …" does not exclude the presence of other identical elements in a process, method, article, or apparatus that comprises the element. The term "synchronization" refers to the field of communications, where synchronization is the initiation of a request and the next action is not performed until the request returns a result. In short, synchronization is that one thing must be done, and the next thing can be done after the previous one is done. In addition, the term "asynchronous" is used as opposed to synchronous, where the difference is whether or not it is necessary to wait for the returned result of an operation. If a request is issued and subsequent operations can be performed without relying on the results of the request, then the request is an asynchronous operation to the network.
The term "blocking" is often described with respect to a thread. Blocking generally refers to: the current thread may be suspended before the call results are returned. Thus, the calling thread is only awakened to execute subsequent operations after the result is obtained.
In addition, the term "non-blocking" is the reverse operation of blocking. Non-blocking calls refer to: the call does not block the current thread until the result is not returned.
As shown in fig. 1, a message transmission method according to an embodiment of the present invention includes:
s100, establishing a message queue connection between a caller end for requesting transmission and a callee end for responding transmission.
Regarding the implementation subject of the embodiment of the present invention, it may be a message queue processing device, such as a server (i.e., a message queue server) having a message queue processing function, disposed between a client and an operation server to serve as a "container" to assist in transmitting requests between the client and the operation server.
Here, the caller end may represent a device requesting transmission, such as a client in a C/S architecture, and accordingly, the callee end may represent a server in the C/S architecture for responding to transmission, and the caller end and the callee end may switch message processing roles, such as a message producer or a message consumer, at different stages of communication transmission. It should be noted that, in the process of transmitting messages in the related art, a message queue connection needs to be created for each message, however, creating a message queue connection is very time-consuming.
In addition, the creation operation for the message queue connection may be triggered based on a message transmission request from the caller side or the callee side, or may be generated by an operation for the message queue server, and all of them are within the scope of the present invention.
S200, based on the message queue connection, at least one message is transmitted between the caller end and the callee end in an asynchronous non-blocking mode.
As described above, asynchronous non-blocking transmission of messages enables subsequent operations of a request not to depend on the result of the request, and the corresponding thread is not blocked until the result is not returned, and can also continue to invoke processing of other requests, thereby increasing the processing efficiency for highly concurrent requests. In addition, the message queue connection is kept in the process of message transmission between the caller end and the callee end, instead of being created and destroyed for each message, so that the resource overhead of the system is reduced, and the message transmission rate is also improved.
In this embodiment, an I/O multiplexing operation is employed. Here, the message queue architecture generally uses a C/S mode, and the producer and the consumer are connected to a message queue server through a network. Therefore, the bottleneck of the message transmission performance is in the network I/O at present, and the I/O multiplexing technology is adopted, so that once the result of waiting for the network IO operation appears, the whole thread performs other operations, and once the IO result returns, the next operation is continuously executed, the thread is ensured not to be in a waiting state, and the processing efficiency for the request is improved.
In this embodiment, the message queue connection is also maintained when the caller end and the callee end perform message transmission. Here, creating a message queue connection (connection) is a very time consuming operation, while creating a message channel (channel) is relatively inexpensive. Thus in this scenario, only two connections may be reserved to serve the producer and consumer respectively, and the message channel is created in an asynchronous, non-blocking manner each time a message is sent or the registration function is registered.
In one example of this embodiment, the request message is relayed from the caller to send to the callee, and correspondingly, the response message is relayed from the callee to send to the caller. Here, one or both of the caller end and the callee end may create a tunnel in an asynchronous, non-blocking manner during transmission for a message.
Specifically, based on the message queue connection, it is determined whether a request instruction for at least one request message to be transmitted is received from the caller, where the at least one request message includes a first request message and a second request message. Here, the request message to be transmitted may be a plurality of (concurrent or non-concurrent) messages.
Then, when a request instruction is received, a first message channel for receiving the first request message and a second message channel for sending the first request message are asynchronously constructed for the caller end and the callee end respectively, wherein the message channel for the first request message does not block the message channel for the second request message. Here, the asynchronous construction may be a process of constructing a first message channel for the caller end when the message queue server receives a request instruction from the caller end. And when the message queue server completely receives the first request message based on the first message channel, constructing a second message channel for sending the first request message to the callee end. In this way, asynchronous creation of the first message channel and the second message channel is achieved. In addition, if a plurality of messages to be transmitted exist, the thread can directly create a new message channel aiming at the new message without waiting for response or result return, thereby improving the processing efficiency aiming at high concurrent requests.
In some embodiments, the message queue server receives the first request message based on the first message channel, and then a plurality of registration functions registered by the called terminal exist in the message queue server, so that the message queue server can determine the registration function corresponding to the first request message and send the determined registration function to the called terminal, so that the called terminal processes the request message based on the registration function.
Further, after the callee processes the request message, a corresponding processing result (or response message) needs to be returned to the caller. In this way, on the premise of the maintained message queue connection, the callee sends a response instruction to the message queue server requesting transmission of at least one response message (including the first response message and the second response message), where the first response message and the second response message may correspond to the first request message and the second request message, respectively.
Then, when the message queue server receives the response instruction, a third message channel for receiving the first response message for the callee end and a fourth message channel for sending the first response message for the caller end are asynchronously constructed respectively, wherein the message channel for the first response message does not block the message channel for the second response message. Here, the asynchronous construction may be that, when the message queue server receives a response instruction from the callee, a third message channel for the callee is constructed. And when the message queue server completely receives the first response message based on the third message channel, the fourth message channel is constructed for sending the first response message to the callee end. In this way, asynchronous creation of the third and fourth message channels is achieved.
It should be understood that, after the transmission of the corresponding message is completed using the message channel, the message channel for completing the transmission of the corresponding message is closed. For example, any one of the first message channel, the second message channel, the third message channel and the fourth message channel is turned off after the transmission of the corresponding message is completed. In this way, since the creation of channels is relatively inexpensive, system resources are conserved while not causing undue time consumption.
In some embodiments, it may also be possible to increase the transmission timer. On the other hand, the whole process of message transmission between the caller end and the callee end may be timed, and if a corresponding result cannot be returned to the caller within a set time period, it is determined that the transmission has failed. On the other hand, in this embodiment, it is also proposed that the message channel is clocked for the transmitted message, for example, whether the first request message is received within a first set time period after the first message channel is constructed is detected, and if the first request message is not received, a first message transmission failure prompt is sent to the caller. In addition, whether the first response message is received in a second set time period after the third message channel is constructed is detected, and if the first response message is not received, a second message transmission failure prompt is sent to the caller end and/or the callee end. Therefore, the client or the operation server can know whether the transmission failure problem exists more quickly, so that corresponding quick processing measures, such as secondary transmission request messages of the client and secondary transmission response messages of the operation server, can be taken conveniently.
In this embodiment, a Remote Procedure Call (RPC) is implemented by using a message queue, and a caller sends a Procedure Call parameter to the message queue and waits for a result to be returned; the callee receives the process parameters and executes, and then puts the results back into the message queue. Here, all operations of the caller and callee may be in an asynchronous non-blocking manner, and then the remote procedure call is also asynchronous non-blocking. In addition, by adding an overtime interrupt mechanism, the call robustness is effectively guaranteed.
It should be understood that, in the process of sending a request message from a caller to a callee, the caller is a message producer and the callee is a message consumer. In the process of sending a response message from the callee to the caller, the caller is a message consumer and the callee is a message producer.
Fig. 2 is a schematic diagram illustrating an operating principle of a message producer architecture in a message transmission method according to an embodiment of the present invention.
As shown in FIG. 2, the whole producer is based on I/O cycle events, the solid line connection is an I/O connection request, the event cycle does not wait for the result to return, the dotted line return is asynchronous execution, and the whole process is asynchronous non-blocking. In addition, the same is true when a message is sent.
Fig. 3 is a schematic diagram illustrating an operating principle of a message consumer architecture in a message transmission method according to an embodiment of the present invention.
As shown in FIG. 3, the entire consumer is also based on I/O cycle events, implemented as a connection request, as in the producer architecture, with the dotted line being the result returned asynchronously.
Fig. 4 is a schematic flow chart illustrating a message transmission method according to an embodiment of the present invention.
In this embodiment, the RPC architecture may be divided into a caller side and a callee side, each of which includes a producer and a consumer, and shares the same connection, and each call creates a respective channel asynchronously. Meanwhile, an asynchronous timer is added, and failure is returned to the overtime RPC calling. Here, the callee end also includes a producer and a consumer, and also shares the same connection, and after receiving the parameters, the consumer performs calculation and asynchronously sends the result to the message queue.
As shown in fig. 5, a message transmission apparatus 500 according to an embodiment of the present invention includes a message queue connection building unit 510 and an asynchronous non-blocking transmission unit 520.
Here, the message queue connection construction unit 510 is configured to establish a message queue connection between a caller end for a request transmission and a callee end for a response transmission;
here, the asynchronous non-blocking transmission unit 520 is configured to transmit at least one message between the caller end and the callee end in an asynchronous non-blocking manner based on the message queue connection, where the message queue connection remains in existence during message transmission between the caller end and the callee end.
The apparatus according to the above embodiment of the present invention may be used to execute the corresponding method embodiment of the present invention, and accordingly achieve the technical effect achieved by the method embodiment of the present invention, which is not described herein again.
In the embodiment of the present invention, the relevant functional module may be implemented by a hardware processor (hardware processor).
In another aspect, an embodiment of the present invention provides a storage medium having stored thereon a computer program for executing, by a processor, the steps of the skills local management method as performed above at a server.
The product can execute the method provided by the embodiment of the application, and has the corresponding functional modules and beneficial effects of the execution method. For technical details that are not described in detail in this embodiment, reference may be made to the methods provided in the embodiments of the present application.
The client of the embodiment of the present application exists in various forms, including but not limited to:
(1) mobile communication devices, which are characterized by mobile communication capabilities and are primarily targeted at providing voice and data communications. Such terminals include smart phones (e.g., iphones), multimedia phones, functional phones, and low-end phones, among others.
(2) The ultra-mobile personal computer equipment belongs to the category of personal computers, has calculation and processing functions and generally has the characteristic of mobile internet access. Such terminals include PDA, MID, and UMPC devices, such as ipads.
(3) Portable entertainment devices such devices may display and play multimedia content. Such devices include audio and video players (e.g., ipods), handheld game consoles, electronic books, as well as smart toys and portable car navigation devices.
(4) And other electronic devices with data interaction functions.
The above-described embodiments of the apparatus are merely illustrative, and the units described as separate parts may or may not be physically separate, and parts displayed as units may or may not be physical units, may be located in one place, or may be distributed on a plurality of network units. Some or all of the modules may be selected according to actual needs to achieve the purpose of the solution of the present embodiment.
Through the above description of the embodiments, those skilled in the art will clearly understand that each embodiment can be implemented by software plus a general hardware platform, and certainly can also be implemented by hardware. Based on such understanding, the above technical solutions substantially or contributing to the related art may be embodied in the form of a software product, which may be stored in a computer-readable storage medium, such as ROM/RAM, magnetic disk, optical disk, etc., and includes instructions for causing a computer device (which may be a personal computer, a server, or a network device, etc.) to execute the method according to the embodiments or some parts of the embodiments.
Finally, it should be noted that: the above embodiments are only used to illustrate the technical solutions of the present application, and not to limit the same; although the present application has been described in detail with reference to the foregoing embodiments, it should be understood by those of ordinary skill in the art that: the technical solutions described in the foregoing embodiments may still be modified, or some technical features may be equivalently replaced; and such modifications or substitutions do not depart from the spirit and scope of the corresponding technical solutions in the embodiments of the present application.
Claims (9)
1. A method of message transmission, comprising:
establishing a message queue connection between a caller end for requesting transmission and a callee end for responding transmission;
based on the message queue connection, transmitting at least one message between the caller end and the callee end in an asynchronous non-blocking manner, wherein the message queue connection remains in existence during message transmission between the caller end and the callee end;
timing the message transmission process of the caller end and the callee end through a timer, and if a corresponding result cannot be returned to the caller end within a set time period, confirming that the transmission fails; the transmitting at least one message between the caller end and the callee end in an asynchronous non-blocking manner based on the message queue connection comprises:
based on the message queue connection, judging whether a request instruction for at least one request message to be transmitted is received from the caller end, wherein the at least one request message comprises a first request message and a second request message;
when the request instruction is received, asynchronously constructing a first message channel for the caller end to receive the first request message and a second message channel for the callee end to send the first request message respectively, wherein the message channel for the first request message does not block the message channel for the second request message;
the asynchronous construction process may be that, when the message queue server receives a request instruction from the caller, a first message channel for the caller is constructed; and when the message queue server completely receives the first request message based on the first message channel, constructing a second message channel for sending the first request message to the callee end.
2. The method of claim 1, wherein the method further comprises:
receiving the first request message based on the first message channel;
determining a registration function corresponding to the first request message; and
and sending the registration function to the callee end.
3. The method of claim 1, wherein the method further comprises:
detecting whether the first request message is received within a first set time period after the first message channel is constructed; and
and if the first request message is not received, sending a first message transmission failure prompt to the caller end.
4. The method of claim 1, wherein transmitting at least one message between the caller end and the callee end in an asynchronous, non-blocking manner based on the message queue connection comprises:
based on the message queue connection, judging whether a response instruction for at least one response message to be transmitted is received from the callee end, wherein the at least one response message comprises a first response message and a second response message;
when the response instruction is received, asynchronously constructing a third message channel for the callee end to receive the first response message and a fourth message channel for the caller end to send the first response message, respectively, wherein the message channel for the first response message does not block the message channel for the second response message.
5. The method of claim 4, wherein the method further comprises:
detecting whether the first response message is received within a second set time period after the third message channel is constructed; and
and if the first response message is not received, sending a second message transmission failure prompt to the callee end.
6. The method according to any one of claims 1-5, wherein the method further comprises:
and after the transmission of the corresponding message is completed by using the message channel, closing the message channel for completing the transmission of the corresponding message.
7. A message transmission apparatus, comprising:
the message queue connection construction unit is used for establishing message queue connection between a caller end for requesting transmission and a callee end for responding transmission;
an asynchronous non-blocking transmission unit, configured to transmit at least one message between the caller end and the callee end in an asynchronous non-blocking manner based on the message queue connection, where the message queue connection remains in existence during message transmission between the caller end and the callee end;
a timer, configured to count time for a message transmission process between the caller and the callee, and if a corresponding result cannot be returned to the caller within a set time period, determine that transmission has failed; the transmitting at least one message between the caller end and the callee end in an asynchronous non-blocking manner based on the message queue connection comprises:
based on the message queue connection, judging whether a request instruction for at least one request message to be transmitted is received from the caller end, wherein the at least one request message comprises a first request message and a second request message;
when the request instruction is received, asynchronously constructing a first message channel for the caller end to receive the first request message and a second message channel for the callee end to send the first request message respectively, wherein the message channel for the first request message does not block the message channel for the second request message;
the asynchronous construction process may be that, when the message queue server receives a request instruction from the caller, a first message channel for the caller is constructed; and when the message queue server completely receives the first request message based on the first message channel, constructing a second message channel for sending the first request message to the callee end.
8. An electronic device, comprising: at least one processor, and a memory communicatively coupled to the at least one processor, wherein the memory stores instructions executable by the at least one processor to enable the at least one processor to perform the steps of the method of any of claims 1-6.
9. A storage medium on which a computer program is stored which, when being executed by a processor, carries out the steps of the method of any one of claims 1 to 6.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201910573044.6A CN110290139B (en) | 2019-06-28 | 2019-06-28 | Message transmission method and device |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201910573044.6A CN110290139B (en) | 2019-06-28 | 2019-06-28 | Message transmission method and device |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN110290139A CN110290139A (en) | 2019-09-27 |
| CN110290139B true CN110290139B (en) | 2021-12-31 |
Family
ID=68019414
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201910573044.6A Active CN110290139B (en) | 2019-06-28 | 2019-06-28 | Message transmission method and device |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN110290139B (en) |
Families Citing this family (2)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN114090305B (en) * | 2022-01-19 | 2022-04-26 | 飞狐信息技术（天津）有限公司 | Business auditing method and device |
| CN115278561A (en) * | 2022-06-01 | 2022-11-01 | 浪潮软件股份有限公司 | Multichannel short message service optimization method applied to government affair field |
Citations (4)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN104811459A (en) * | 2014-01-23 | 2015-07-29 | 阿里巴巴集团控股有限公司 | Processing method, processing device and system for message services and message service system |
| CN104935622A (en) * | 2014-03-21 | 2015-09-23 | 阿里巴巴集团控股有限公司 | Method used for message distribution and consumption and apparatus thereof, and system used for message processing |
| CN107273192A (en) * | 2016-04-06 | 2017-10-20 | 阿里巴巴集团控股有限公司 | A kind of propulsion method of product trading, server and system |
| US10291607B1 (en) * | 2016-02-02 | 2019-05-14 | Wickr Inc. | Providing real-time events to applications |
-
2019
- 2019-06-28 CN CN201910573044.6A patent/CN110290139B/en active Active
Patent Citations (4)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN104811459A (en) * | 2014-01-23 | 2015-07-29 | 阿里巴巴集团控股有限公司 | Processing method, processing device and system for message services and message service system |
| CN104935622A (en) * | 2014-03-21 | 2015-09-23 | 阿里巴巴集团控股有限公司 | Method used for message distribution and consumption and apparatus thereof, and system used for message processing |
| US10291607B1 (en) * | 2016-02-02 | 2019-05-14 | Wickr Inc. | Providing real-time events to applications |
| CN107273192A (en) * | 2016-04-06 | 2017-10-20 | 阿里巴巴集团控股有限公司 | A kind of propulsion method of product trading, server and system |
Non-Patent Citations (1)
| Title |
|---|
| RabbitMQ 小消息确认机制优化;徐震，焦文彬;《计算机系统应用》;20180209;253-257 * |
Also Published As
| Publication number | Publication date |
|---|---|
| CN110290139A (en) | 2019-09-27 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN103297395B (en) | The implementation method of a kind of Internet service, system and device | |
| KR20110076954A (en) | Optimized polling in low resource devices | |
| CN103312528B (en) | A kind of heartbeat message sending method and user terminal | |
| US9258740B2 (en) | Push service providing system and method for balancing message loads | |
| CN110290139B (en) | Message transmission method and device | |
| US9104488B2 (en) | Support server for redirecting task results to a wake-up server | |
| US20130031161A1 (en) | Apparatuses and methods for unified virtual experience (uve) session control | |
| EP4207648A1 (en) | Connection processing method and apparatus, electronic device, and computer-readable storage medium | |
| CN110933075B (en) | Service calling method and device, electronic equipment and storage medium | |
| WO2024067529A1 (en) | Rdma-based link establishment method and apparatus, and device and storage medium | |
| CN105373563B (en) | Database switching method and device | |
| CN108809766A (en) | A kind of method, apparatus and system obtaining RTT | |
| US11716415B2 (en) | Suppressing indications of events in user interfaces | |
| EP2949083B1 (en) | Receiving a communication event | |
| CN106293970B (en) | Asynchronous processing method and system between a kind of process based on IPC | |
| CN111586672A (en) | Network call information processing method and device | |
| CN115242972A (en) | Method and device for calling camera by application, electronic equipment and storage medium | |
| JP2024509804A (en) | Call establishment method, device, electronic device and readable storage medium | |
| CN113778699A (en) | Distributed transaction processing method, device, computer system and readable storage medium | |
| CN114385351A (en) | Cloud management platform load balancing performance optimization method, device, equipment and medium | |
| CN111782366A (en) | Distributed task scheduling method and device | |
| CN114168233B (en) | Data processing method, device, server and storage medium | |
| CN110049071A (en) | Network data exchange control method, device and terminal | |
| US9367367B2 (en) | Application router | |
| WO2023246584A1 (en) | Computing power processing method and apparatus, and communication device |
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 | ||
| CB02 | Change of applicant information | ||
| CB02 | Change of applicant information |
Address after: 215123 building 14, Tengfei Innovation Park, 388 Xinping street, Suzhou Industrial Park, Suzhou City, Jiangsu Province Applicant after: Sipic Technology Co.,Ltd. Address before: 215123 building 14, Tengfei Innovation Park, 388 Xinping street, Suzhou Industrial Park, Suzhou City, Jiangsu Province Applicant before: AI SPEECH Ltd. |
|
| GR01 | Patent grant | ||
| GR01 | Patent grant |