CN114844847A - High-reliability real-time message distribution method and device - Google Patents
High-reliability real-time message distribution method and device Download PDFInfo
- Publication number
- CN114844847A CN114844847A CN202111526260.9A CN202111526260A CN114844847A CN 114844847 A CN114844847 A CN 114844847A CN 202111526260 A CN202111526260 A CN 202111526260A CN 114844847 A CN114844847 A CN 114844847A
- Authority
- CN
- China
- Prior art keywords
- server
- route
- request
- client
- time
- 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.)
- Pending
Links
- 238000000034 method Methods 0.000 title claims abstract description 47
- 238000001514 detection method Methods 0.000 claims description 50
- 230000008569 process Effects 0.000 claims description 20
- 230000000694 effects Effects 0.000 claims description 5
- 230000004044 response Effects 0.000 description 3
- 230000001360 synchronised effect Effects 0.000 description 3
- 230000005540 biological transmission Effects 0.000 description 2
- 230000006872 improvement Effects 0.000 description 2
- 230000006855 networking Effects 0.000 description 2
- 230000000903 blocking effect Effects 0.000 description 1
- 238000010586 diagram Methods 0.000 description 1
- 230000000977 initiatory effect Effects 0.000 description 1
- 230000007246 mechanism Effects 0.000 description 1
- 238000012986 modification Methods 0.000 description 1
- 230000004048 modification Effects 0.000 description 1
- 238000006467 substitution reaction Methods 0.000 description 1
Images
Classifications
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L51/00—User-to-user messaging in packet-switching networks, transmitted according to store-and-forward or real-time protocols, e.g. e-mail
- H04L51/04—Real-time or near real-time messaging, e.g. instant messaging [IM]
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L45/00—Routing or path finding of packets in data switching networks
- H04L45/12—Shortest path evaluation
- H04L45/122—Shortest path evaluation by minimising distances, e.g. by selecting a route with minimum of number of hops
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L51/00—User-to-user messaging in packet-switching networks, transmitted according to store-and-forward or real-time protocols, e.g. e-mail
- H04L51/07—User-to-user messaging in packet-switching networks, transmitted according to store-and-forward or real-time protocols, e.g. e-mail characterised by the inclusion of specific contents
- H04L51/18—Commands or executable codes
-
- 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/14—Session management
- H04L67/141—Setup of application sessions
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L69/00—Network arrangements, protocols or services independent of the application payload and not provided for in the other groups of this subclass
- H04L69/16—Implementation or adaptation of Internet protocol [IP], of transmission control protocol [TCP] or of user datagram protocol [UDP]
- H04L69/161—Implementation details of TCP/IP or UDP/IP stack architecture; Specification of modified or new header fields
- H04L69/162—Implementation details of TCP/IP or UDP/IP stack architecture; Specification of modified or new header fields involving adaptations of sockets based mechanisms
Landscapes
- Engineering & Computer Science (AREA)
- Computer Networks & Wireless Communication (AREA)
- Signal Processing (AREA)
- Computer Security & Cryptography (AREA)
- Computer And Data Communications (AREA)
Abstract
The invention discloses a high-reliability real-time message distribution method and a high-reliability real-time message distribution device, wherein the method comprises the following steps: the client side initiates a request, the request is forwarded to a route, the route puts all the requests into a queue, the route judges the distance between the server side and the client side according to an IP address in a configuration file of the server side, the optimal server side is the distance lower than a preset distance, the route sends the request to the optimal server side, data of a preset number of server sides are selected from the optimal server side and returned to the route, and the route sends at least one part of all the returned data to the client side; the invention has the advantages that: the method can deal with the condition that the message queue can not work normally, and ensure the reliability of real-time message distribution.
Description
Technical Field
The invention relates to the field of message distribution, in particular to a high-reliability real-time message distribution method and device.
Background
The robust and reliable real-time message distribution is crucial in a message publishing and subscribing system, a message producer generates a message and sends the message to a message subscriber, and usually, the message is classified into a message queue, and the message subscriber reads the message in the message queue. When a subscriber initiates a request message, namely a request, a message queue should have a reply, namely a response, but when the message queue cannot reply the request in time, the message queue can affect the real-time performance of message distribution, so that the robust and reliable real-time message queue is the key for realizing the real-time message distribution. Reliability is defined from a fault point of view and a method that can handle a specific set of well-defined and understood faults is reliable if these faults can be handled. For real-time message publish-subscribe, reliability is that when a code is in error or crashed, the publish-subscribe can continue to work normally. The reliability of real-time message distribution can be achieved by client reliability or message queue reliability.
Along with the high-speed development of the internet of things, end cloud interconnection becomes a new networking trend, under the networking condition, an end generally consists of a system on a chip with high cost performance, and can only complete limited functions such as signal collection and control instruction issuing; the cloud is characterized in that the computing capacity is ultra-strong and can be infinitely expanded, the cloud runs a complex algorithm or scheduling, the end sends a signal to the cloud, and the signal is transmitted back to the end instruction through the cloud algorithm. Therefore, in order to meet the requirement of real-time message delivery in some end cloud architectures, a method for constructing real-time message distribution between end clouds is required. However, the current real-time message distribution is influenced by various external or internal factors, resulting in message packet loss, so that robust and reliable message distribution is very important. The mainstream method at present is to improve the reliability of the client or to implement a reliable queue. Client reliability is typically done not to perform a blocking reception, but only to poll the REQ socket and receive messages from it when it is certain that a reply has arrived. If no response arrives within the timeout period, a request is resent. If there are no responses after multiple requests, the transaction is aborted. The reliable queue generally adds a role of proxy in the message publishing subscription, and can transparently communicate with a plurality of service nodes through the proxy, and the service nodes generally contain worker. worker is stateless. If the application program needs to share certain states, the queue acts as an agent, which means that the worker does not care about the specific situation of the client; the client also does not need to know anything about the worker. If one worker crashes, another worker takes over it. However, in order to improve the reliability of real-time message distribution from the perspective of the client and the reliable queue, the situation that the message queue cannot work normally needs to be faced, so that the reliability of real-time message distribution cannot be ensured.
Chinese patent grant publication No. CN108833554B discloses a real-time highly reliable message distribution system facing a large-scale network and a method thereof, belonging to the field of network transmission; the device comprises a multimedia platform connected with a central server, wherein one central server is connected with a plurality of transfer servers, one transfer server is connected with a plurality of terminal users, the plurality of terminal users are divided into a plurality of groups, and the terminal users in each group are connected with each other; the method comprises the steps that a central server broadcasts a piece of control information to determine the current online terminal user and the state of the terminal user; when the central server distributes the message, the file information is transmitted through the RabbitMQ, and after receiving the message information, the terminal user returns a feedback message to establish a corresponding message transmission queue; when the sending message is too large, the distribution of the multimedia file is carried out by using P2P; after the terminal user receives the complete seed file, the terminal user starts a local P2P downloading process; the invention effectively solves the problem that the network data can not give consideration to both real-time property and reliability in the distribution process, but does not consider the problem that the reliability of the distribution of the real-time message is reduced under the condition that the message queue can not work normally.
Disclosure of Invention
The technical problem to be solved by the invention is that the real-time message distribution method in the prior art cannot face the situation that the message queue cannot work normally, so that the reliability of real-time message distribution cannot be ensured.
The invention solves the technical problems through the following technical means: a method of high reliability real-time message distribution, the method comprising:
the client side initiates a request, the request is forwarded to the route, the route puts all the requests into a queue, the route judges the distance between the server side and the client side according to an IP address in a configuration file of the server side, the server side with the distance lower than a preset distance is an optimal server side, the route sends the request to the optimal server side, a preset number of server side data are selected from the optimal server side to be returned to the route, and the route sends at least one part of all the returned data to the client side.
The route judges the distance between the server and the client according to the IP address in the configuration file of the server, the server with the distance lower than the preset distance is the optimal server, the route sends a request to the optimal server, the data of the server with the preset number are selected from the optimal server and returned to the route, the route sends at least one part of all the returned data to the client, the route can receive the data and send the data to the client as long as one server can work normally, and the whole system can cope with the condition that a message queue cannot work normally, so that the reliability of real-time message distribution is ensured.
Furthermore, the number of the clients is multiple, and each client establishes connection with the route.
Further, the requests are time stamped, and the route reads the requests from the queue according to the sequence of the time stamps.
Furthermore, the message header of the request is provided with the IP address of the client, and the routing calculates the spatial linear distance between the IP address of the client and the IP address of the client according to the IP address in the configuration file of the server.
Further, the route sends the request to the optimal server, and the data of 3 servers are selected from the optimal server and returned to the route.
Furthermore, when the route selects the data of 3 server sides from the optimal server side and returns the data to the route, if one or two server sides are damaged, only the data of the server side without damage is returned and an error is reported to the damaged server side, and the error content includes the IP address of the server side.
Furthermore, the route sends one copy of the returned data which is received first to the client, and if all the returned data are received simultaneously, one copy is randomly selected to be sent to the client.
Further, the server side performs signal detection in real time, and the signal detection method includes:
setting a liveness, wherein the liveness represents the maximum number of detection signals allowed to miss before a request queue sent by a route crashes, the initial value of the liveness is 3, and the liveness is reduced by 1 each time the detection signals are missed; in the detection cycle, the signal detection interval is 1 second; if the message from the request queue exists in the detection cycle process, setting the activity level as an initial value 3 again; if there are no messages from the queue during the detection cycle, then decrementing the liveness by 1 after each detection interval; if the liveness is reduced to zero in the detection cycle process, the request queue is considered to be crashed; if the request queue is broken down, the socket connected with the route at the server side is destroyed, a new socket is created, the connection is re-established, and the process is carried out again.
Furthermore, the router waits for a preset time interval T before reestablishing the connection with the server, and the preset time interval T is doubled each time the connection is reestablished until 32 seconds is reached.
The invention also provides a high-reliability real-time message distribution device, which comprises:
a request sending module, which is used for the client to initiate a request;
a route forwarding module for forwarding the request to a route, the route placing all requests into a queue;
and the data return module is used for judging the distance between the server and the client by the route according to the IP address in the configuration file of the server, the server with the distance lower than the preset distance is the optimal server, the route sends the request to the optimal server, the data of the server with the preset number are selected from the optimal server and returned to the route, and the route sends at least one part of all the returned data to the client.
Furthermore, the number of the clients is multiple, and each client establishes connection with the route.
Further, the requests are time stamped, and the route reads the requests from the queue according to the sequence of the time stamps.
Furthermore, the message header of the request is provided with the IP address of the client, and the routing calculates the spatial linear distance between the IP address of the client and the IP address of the client according to the IP address in the configuration file of the server.
Further, the route sends the request to the optimal server, and the data of 3 servers are selected from the optimal server and returned to the route.
Furthermore, when the route selects the data of 3 server sides from the optimal server side and returns the data to the route, if one or two server sides are damaged, only the data of the server side without damage is returned and an error is reported to the damaged server side, and the error content includes the IP address of the server side.
Furthermore, the route sends one copy of the returned data which is received first to the client, and if all the returned data are received simultaneously, one copy is randomly selected to be sent to the client.
Further, the server side performs signal detection in real time, and the signal detection method includes:
setting a liveness, wherein the liveness represents the maximum number of detection signals allowed to miss before a request queue sent by a route crashes, the initial value of the liveness is 3, and the liveness is reduced by 1 each time the detection signals are missed; in the detection cycle, the signal detection interval is 1 second; if the message from the request queue exists in the detection cycle process, setting the activity level as an initial value 3 again; if there are no messages from the queue during the detection cycle, then decrementing the liveness by 1 after each detection interval; if the liveness is reduced to zero in the detection cycle process, the request queue is considered to be crashed; if the request queue is broken down, the socket connected with the route at the server side is destroyed, a new socket is created, the connection is re-established, and the process is carried out again.
Furthermore, the router waits for a preset time interval T before reestablishing the connection with the server, and the preset time interval T is doubled each time the connection is reestablished until 32 seconds is reached.
Further, to normalize the behavior of the client and server, three socket types are defined, REQ initiating a request on behalf of the client. The DEALER distributes messages to connected nodes and queues messages received by all connections fairly. Route corresponds to routing. The ROUTER socket does not parse the message content. The REQ socket is synchronous, reads and saves all identity frames including null delimiters, and then passes the next frame or frames to the caller. The dead socket does not parse the message content, it is asynchronous, it distributes the message to connected nodes, and queues the message received by all connections fairly. The role of dead is like the combination of PUSH and PULL, which is equivalent to the data transceiving at the server side. The route socket does not parse the message content, it is asynchronous, it creates an ID for the new connection as the first frame of any received message, passes it on to the caller, and conversely, when the caller sends a message, it also uses the first message frame as the ID to find the connection to send to.
The invention has the advantages that:
(1) the route judges the distance between the server and the client according to the IP address in the configuration file of the server, the server with the distance lower than the preset distance is the optimal server, the route sends a request to the optimal server, the data of the server with the preset number are selected from the optimal server and returned to the route, the route sends at least one part of all the returned data to the client, the route can receive the data and send the data to the client as long as one server can work normally, and the whole system can cope with the condition that a message queue cannot work normally, so that the reliability of real-time message distribution is ensured.
(2) The invention sets the liveness to represent the queue state, continuously adjusts the liveness of the queue which is not replied in the set time until the liveness reaches the lower limit, releases the queue and the socket resource, and prepares for restarting the queue next time. In order to avoid frequent socket opening and closing, the waiting time is automatically adjusted, and the sockets are reasonably utilized.
Drawings
Fig. 1 is a schematic diagram illustrating a data distribution principle in a high-reliability real-time message distribution method 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 embodiments of the present invention, and it is obvious that the described embodiments are some embodiments of the present invention, but not all embodiments. All other embodiments, which can be obtained by a person skilled in the art without inventive step based on the embodiments of the present invention, are within the scope of protection of the present invention.
Example 1
As shown in fig. 1, a high-reliability real-time message distribution method includes:
first three socket types are defined, the REQ socket is synchronous, it reads and saves all identity frames including null separators, and then passes the next frame or frames to the caller. REQ initiates a request on behalf of a client.
The dead socket does not parse the message content, it is asynchronous, it distributes the message to connected nodes, and queues the message received by all connections fairly. The role of dead is like the combination of PUSH and PULL, which is equivalent to the data transceiving at the server side.
The ROUTER socket does not parse the message content, is asynchronous, creates an ID for the new connection as the first frame of any received message and passes it to the caller, whereas when the caller sends a message, the first message frame is also used as the ID to find the connection to send to. Route corresponds to routing.
The real-time message distribution method of the invention is shown in the process of figure 1. (1) The service node starts a set of work threads. Each thread creates a reply socket and then processes the request on that socket. (2) The service node calls a route socket to communicate with the client and binds it to its external interface. (3) The service node creates a dead socket to communicate with the worker and binds it to its internal interface. The specific working process is as follows: the client side initiates a request, the request is forwarded to the route, the route puts all the requests into a queue, the route judges the distance between the server side and the client side according to the IP address in the configuration file of the server side, the optimal server side is the distance lower than the preset distance, the route sends the request to the optimal server side, the data of the server sides with the preset number are selected from the optimal server side and returned to the route, and the route sends at least one part of the returned data to the client side. The number of the clients is multiple, and each client is connected with the route. In this embodiment, 3 clients are provided.
As a further improvement, the requests are time-stamped, and the route reads the requests from the queue according to the precedence order of the time-stamps. The first request sent by the client is ensured to be forwarded to the server by the route as soon as possible, and the message receiving and sending efficiency is improved.
As a further improved scheme, the message header of the request is provided with the IP address of the client, and the route calculates the spatial straight-line distance between the request and the IP address of the client according to the IP address in the configuration file of the server.
As a further improved scheme, the route sends the request to the optimal server, and selects data of 3 server terminals from the optimal server terminal to return to the route. When the route selects the data of 3 server ends from the optimal server end and returns the data to the route, if one or two server ends are damaged, only the data of the server end without damage is returned and an error is reported to the damaged server end, wherein the error content comprises the IP address of the server end.
As a further improvement, the route sends one of all the returned data received first to the client, and if all the returned data are received simultaneously, one is randomly selected to be sent to the client. The first received data is returned to the client so as to improve the forwarding efficiency and reduce the data forwarding time.
And continuously adjusting the liveness of the queue which is not replied within the set time until the liveness reaches the lower limit, releasing the queue and the socket resource, and preparing for restarting the queue next time. The waiting time is automatically adjusted, the sockets are reasonably utilized, and frequent opening and closing of too many sockets are avoided. For a worker of a robust and reliable queue, a DEALER socket is introduced to support the sending and receiving of messages at any time, the problem of low efficiency of a sending/receiving synchronous mechanism agent emphasized by REQ is solved, the server side carries out signal detection in real time, and the signal detection method comprises the following steps:
setting a liveness, wherein the liveness represents the maximum number of detection signals allowed to miss before a request queue sent by a route crashes, the initial value of the liveness is 3, and the liveness is reduced by 1 each time the detection signals are missed; in the detection cycle, the signal detection interval is 1 second; if the message from the request queue exists in the detection cycle process, setting the activity level as an initial value 3 again; if there are no messages from the queue during the detection cycle, then decrementing the liveness by 1 after each detection interval; if the liveness is reduced to zero in the detection cycle process, the request queue is considered to be crashed; if the request queue is broken down, the socket connected with the route at the server side is destroyed, a new socket is created, the connection is re-established, and the process is carried out again. And waiting for a preset time interval T before the connection is reestablished between the router and the server, and doubling the waiting preset time interval each time the connection is reestablished until the time reaches 32 seconds.
According to the technical scheme, the route judges the distance between the server and the client according to the IP address in the configuration file of the server, the server with the distance lower than the preset distance is the optimal server, the route sends a request to the optimal server, the data of the server with the preset number are selected from the optimal server and returned to the route, the route sends at least one part of all the returned data to the client, the route can receive the data and send the data to the client as long as one server can work normally, the whole system can cope with the condition that a message queue cannot work normally, and therefore the reliability of real-time message distribution is guaranteed.
Example 2
Based on embodiment 1, embodiment 2 of the present invention further provides a high-reliability real-time message distribution apparatus, where the apparatus includes:
a request sending module, which is used for the client to initiate a request;
a route forwarding module for forwarding the request to a route, the route placing all requests into a queue;
and the data return module is used for judging the distance between the server and the client by the route according to the IP address in the configuration file of the server, the server with the distance lower than the preset distance is the optimal server, the route sends the request to the optimal server, the data of the server with the preset number are selected from the optimal server and returned to the route, and the route sends at least one part of all the returned data to the client.
Specifically, the number of the clients is multiple, and each client establishes connection with a route.
Specifically, the request is time-stamped, and the route reads the request from the queue according to the sequence of the time stamps.
Specifically, the IP address of the client is set in the message header of the request, and the routing calculates the spatial linear distance between the server and the IP address of the client according to the IP address in the configuration file of the server.
Specifically, the route sends the request to the optimal server, and selects data of 3 server terminals from the optimal server and returns the data to the route.
More specifically, when the route selects data of 3 server sides from the optimal server side and returns the data to the route, if one or two server sides are damaged, only the data of the server side without damage is returned and an error is reported to the damaged server side, and the error content includes the IP address of the server side.
More specifically, the route sends one copy of the returned data, which is received first, to the client, and if all the returned data are received simultaneously, one copy is randomly selected to be sent to the client.
Specifically, the server side performs signal detection in real time, and the signal detection method includes:
setting a liveness, wherein the liveness represents the maximum number of detection signals allowed to miss before a request queue sent by a route crashes, the initial value of the liveness is 3, and the liveness is reduced by 1 each time the detection signals are missed; in the detection cycle, the signal detection interval is 1 second; if the message from the request queue exists in the detection cycle process, setting the activity level as an initial value 3 again; if there are no messages from the queue during the detection cycle, then decrementing the liveness by 1 after each detection interval; if the liveness is reduced to zero in the detection cycle process, the request queue is considered to be crashed; if the request queue is broken down, the socket connected with the route at the server side is destroyed, a new socket is created, the connection is re-established, and the process is carried out again.
More specifically, the router waits for a preset time interval T before reestablishing the connection with the server, and the waiting preset time interval is doubled each time the connection is reestablished until 32 seconds.
The above examples are only intended to illustrate the technical solution of the present invention, and not to limit it; although the present invention has been described in detail with reference to the foregoing embodiments, it will 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 of the embodiments of the present invention.
Claims (10)
1. A method for high reliability real-time message distribution, the method comprising:
the client side initiates a request, the request is forwarded to the route, the route puts all the requests into a queue, the route judges the distance between the server side and the client side according to the IP address in the configuration file of the server side, the optimal server side is the distance lower than the preset distance, the route sends the request to the optimal server side, the data of the server sides with the preset number are selected from the optimal server side and returned to the route, and the route sends at least one part of the returned data to the client side.
2. A method for highly reliable real-time message distribution according to claim 1, wherein there are a plurality of said clients, and each client establishes a connection with a route.
3. A method for highly reliable real-time message distribution according to claim 1, wherein said requests are time stamped and the routing reads the requests from the queue according to the time sequence of the time stamps.
4. The method according to claim 1, wherein the header of the request is set with the IP address of the client, and the routing calculates a linear distance in space from the IP address of the client according to the IP address in the configuration file of the server.
5. The method according to claim 1, wherein the route sends the request to the optimal server, and selects 3 server data from the optimal server to return to the route.
6. The method according to claim 5, wherein when the route selects 3 server-side data from the optimal server-side to return to the route, if one or two server-sides are damaged, only the server-side data without damage is returned and an error is reported to the damaged server-side, and the error content includes the IP address of the server-side.
7. The method according to claim 5, wherein the router sends a copy of all returned data that was received first to the client, and if all returned data were received at the same time, a copy is randomly selected to be sent to the client.
8. The method for distributing the real-time message with high reliability as claimed in claim 1, wherein the server side performs signal detection in real time, and the signal detection method is as follows:
setting a liveness, wherein the liveness represents the maximum number of detection signals allowed to miss before a request queue sent by a route crashes, the initial value of the liveness is 3, and the liveness is reduced by 1 each time the detection signals are missed; in the detection cycle, the signal detection interval is 1 second; if the message from the request queue exists in the detection cycle process, setting the activity level as an initial value 3 again; if there are no messages from the queue during the detection cycle, then decrementing the liveness by 1 after each detection interval; if the liveness is reduced to zero in the detection cycle process, the request queue is considered to be crashed; if the request queue is broken down, the socket connected with the route at the server side is destroyed, a new socket is created, the connection is re-established, and the process is carried out again.
9. The method as claimed in claim 8, wherein the predetermined time interval T is waited before the connection is reestablished between the router and the server, and the predetermined time interval is doubled until 32 seconds are reached each time the connection is reestablished.
10. A highly reliable real-time message distribution apparatus, the apparatus comprising:
a request sending module, which is used for the client to initiate a request;
a route forwarding module for forwarding the request to a route, the route placing all requests into a queue;
and the data return module is used for judging the distance between the server and the client by the route according to the IP address in the configuration file of the server, the server with the distance lower than the preset distance is the optimal server, the route sends the request to the optimal server, the data of the server with the preset number are selected from the optimal server and returned to the route, and the route sends at least one part of all the returned data to the client.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202111526260.9A CN114844847A (en) | 2021-12-14 | 2021-12-14 | High-reliability real-time message distribution method and device |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202111526260.9A CN114844847A (en) | 2021-12-14 | 2021-12-14 | High-reliability real-time message distribution method and device |
Publications (1)
| Publication Number | Publication Date |
|---|---|
| CN114844847A true CN114844847A (en) | 2022-08-02 |
Family
ID=82561654
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN202111526260.9A Pending CN114844847A (en) | 2021-12-14 | 2021-12-14 | High-reliability real-time message distribution method and device |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN114844847A (en) |
Cited By (1)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN115884108A (en) * | 2022-11-29 | 2023-03-31 | 杭州雅赫网络科技有限公司 | Method for improving big data transmission stability |
Citations (7)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN101094237A (en) * | 2007-07-30 | 2007-12-26 | 中兴通讯股份有限公司 | Method for sharing in load among net elements in IP multimedia sub system |
| CN105721438A (en) * | 2016-01-19 | 2016-06-29 | 烽火通信科技股份有限公司 | LTE gateway processing AT instruction method based on Linux |
| CN106790249A (en) * | 2017-01-22 | 2017-05-31 | 阔地教育科技有限公司 | A kind of server resource dispatching method and device |
| CN106953945A (en) * | 2017-05-26 | 2017-07-14 | 北京奇虎科技有限公司 | Domain name intelligently parsing method and device, server based on SDN realizations |
| CN108234348A (en) * | 2016-12-13 | 2018-06-29 | 深圳市中兴微电子技术有限公司 | A kind of processing method and processing device in queue operation |
| CN110224933A (en) * | 2019-06-18 | 2019-09-10 | 成都品果科技有限公司 | A kind of message distributing system |
| CN111741319A (en) * | 2020-06-23 | 2020-10-02 | 北京金山云网络技术有限公司 | Live broadcast data processing method and device and electronic equipment |
-
2021
- 2021-12-14 CN CN202111526260.9A patent/CN114844847A/en active Pending
Patent Citations (7)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN101094237A (en) * | 2007-07-30 | 2007-12-26 | 中兴通讯股份有限公司 | Method for sharing in load among net elements in IP multimedia sub system |
| CN105721438A (en) * | 2016-01-19 | 2016-06-29 | 烽火通信科技股份有限公司 | LTE gateway processing AT instruction method based on Linux |
| CN108234348A (en) * | 2016-12-13 | 2018-06-29 | 深圳市中兴微电子技术有限公司 | A kind of processing method and processing device in queue operation |
| CN106790249A (en) * | 2017-01-22 | 2017-05-31 | 阔地教育科技有限公司 | A kind of server resource dispatching method and device |
| CN106953945A (en) * | 2017-05-26 | 2017-07-14 | 北京奇虎科技有限公司 | Domain name intelligently parsing method and device, server based on SDN realizations |
| CN110224933A (en) * | 2019-06-18 | 2019-09-10 | 成都品果科技有限公司 | A kind of message distributing system |
| CN111741319A (en) * | 2020-06-23 | 2020-10-02 | 北京金山云网络技术有限公司 | Live broadcast data processing method and device and electronic equipment |
Cited By (1)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN115884108A (en) * | 2022-11-29 | 2023-03-31 | 杭州雅赫网络科技有限公司 | Method for improving big data transmission stability |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CA1279933C (en) | Local area network for digital data processing system | |
| US6178453B1 (en) | Virtual circuit switching architecture | |
| US5781726A (en) | Management of polling traffic in connection oriented protocol sessions | |
| CN107528891B (en) | Websocket-based automatic clustering method and system | |
| JP2000276432A (en) | Dynamic load distribution system for transaction message | |
| CN102469124B (en) | Based on the implementation method of the mobile Internet business of AOG, gateway, agency and system | |
| CN104811459A (en) | Processing method, processing device and system for message services and message service system | |
| US7747694B2 (en) | Low latency and assured delivery using HTTP | |
| US10834033B2 (en) | Method and system for transferring messages between messaging systems | |
| CN114338063B (en) | Message queue system, service processing method and computer readable storage medium | |
| CN114844847A (en) | High-reliability real-time message distribution method and device | |
| CN110601989A (en) | Network traffic balancing method and device | |
| EP2944073A2 (en) | Method and system for the handling of redundant long poll | |
| CN111555965B (en) | Message pushing method and system suitable for iOS client | |
| CN111294358B (en) | Message processing method and device | |
| CN115037785B (en) | Instant communication system and method | |
| CN113542324B (en) | Message pushing method and device | |
| CN114785695A (en) | High-performance network communication library realized based on zeroC ICE | |
| CN113037803A (en) | Geological disaster monitoring method and system, electronic equipment and storage medium | |
| CN111262773A (en) | Message synchronization method and data center | |
| KR100297256B1 (en) | Method for processing subscriber management request dispersively in intelligent network service system applying client-server model | |
| Huang et al. | A message push method for iOS mobile terminals | |
| CN116361038B (en) | Acceleration computing management method, system, equipment and storage medium | |
| CN113992737A (en) | Internet of things connection method, gateway server and gateway | |
| CN114268615B (en) | Service processing method and system based on TCP connection |
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 |