CN111917687A - Method and device for circularly pushing reminding message - Google Patents

Method and device for circularly pushing reminding message Download PDF

Info

Publication number
CN111917687A
CN111917687A CN201910378895.5A CN201910378895A CN111917687A CN 111917687 A CN111917687 A CN 111917687A CN 201910378895 A CN201910378895 A CN 201910378895A CN 111917687 A CN111917687 A CN 111917687A
Authority
CN
China
Prior art keywords
message
reminded
database
request
push
Prior art date
Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
Granted
Application number
CN201910378895.5A
Other languages
Chinese (zh)
Other versions
CN111917687B (en
Inventor
史贤伟
Current Assignee (The listed assignees may be inaccurate. Google has not performed a legal analysis and makes no representation or warranty as to the accuracy of the list.)
Beijing Jingdong Zhenshi Information Technology Co Ltd
Original Assignee
Beijing Jingdong Zhenshi Information Technology Co Ltd
Priority date (The priority date 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 date listed.)
Filing date
Publication date
Application filed by Beijing Jingdong Zhenshi Information Technology Co Ltd filed Critical Beijing Jingdong Zhenshi Information Technology Co Ltd
Priority to CN201910378895.5A priority Critical patent/CN111917687B/en
Publication of CN111917687A publication Critical patent/CN111917687A/en
Application granted granted Critical
Publication of CN111917687B publication Critical patent/CN111917687B/en
Active legal-status Critical Current
Anticipated expiration legal-status Critical

Links

Images

Classifications

    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L67/00—Network arrangements or protocols for supporting network services or applications
    • H04L67/50—Network services
    • H04L67/55—Push-based network services
    • 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/10—Protocols in which an application is distributed across nodes in the network
    • 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
    • Y—GENERAL TAGGING OF NEW TECHNOLOGICAL DEVELOPMENTS; GENERAL TAGGING OF CROSS-SECTIONAL TECHNOLOGIES SPANNING OVER SEVERAL SECTIONS OF THE IPC; TECHNICAL SUBJECTS COVERED BY FORMER USPC CROSS-REFERENCE ART COLLECTIONS [XRACs] AND DIGESTS
    • Y02—TECHNOLOGIES OR APPLICATIONS FOR MITIGATION OR ADAPTATION AGAINST CLIMATE CHANGE
    • Y02D—CLIMATE CHANGE MITIGATION TECHNOLOGIES IN INFORMATION AND COMMUNICATION TECHNOLOGIES [ICT], I.E. INFORMATION AND COMMUNICATION TECHNOLOGIES AIMING AT THE REDUCTION OF THEIR OWN ENERGY USE
    • Y02D30/00—Reducing energy consumption in communication networks
    • Y02D30/70—Reducing energy consumption in communication networks in wireless communication networks

Landscapes

  • Engineering & Computer Science (AREA)
  • Computer Networks & Wireless Communication (AREA)
  • Signal Processing (AREA)
  • Computer Security & Cryptography (AREA)
  • Information Transfer Between Computers (AREA)
  • Data Exchanges In Wide-Area Networks (AREA)

Abstract

The invention discloses a method and a device for circularly pushing a reminding message, and relates to the technical field of computers. One embodiment of the method comprises: receiving a cyclic push request, analyzing the cyclic push request to determine parameter information of the cyclic push request, wherein the parameter information at least comprises a cyclic period, a route identifier and a message to be reminded; according to the cycle and the route identification, searching corresponding route information in a first database at regular time; the first database is used for storing the routing information when the front end establishes connection with the service nodes in the distributed service cluster; and calling a service node in the distributed service cluster according to the routing information, so that the service node pushes the message to be reminded to a corresponding front end. The method can send the reminding message to the front end of any service and connection, solves the problem that the pressure of the server and the database is increased due to the fact that the server is polled for many times in the prior art, and is convenient to develop and maintain.

Description

Method and device for circularly pushing reminding message
Technical Field
The invention relates to the technical field of computers, in particular to a method and a device for circularly pushing reminding messages.
Background
With the development of business, the requirements of a plurality of business scenes on timeliness are continuously improved, such as order taking, order delivery and the like. When the documents are issued to the operation end system, the service scenes need to push a reminding message to the corresponding operation end so as to remind an operator to process as soon as possible. Due to the fact that the difference of the working site environment is large, the reminding message needs to be circularly reminded for many times until an operator processes the service, and the service is guaranteed to be carried out within the set time.
The existing method for pushing the reminding message by the operation end in a circulating way mainly comprises the following steps: and carrying out message reminding by periodically sending an ajax request to a polling server in a JavaScript code of the front-end browser, wherein the polling means that a client periodically sends an ajax request to a server, and the server returns response information immediately after receiving the request and closes the connection. After receiving the request, the server side inquires the database about the relevant data of the service corresponding to the request, returns information to the front end according to the inquired data, and judges whether to need reminding after the front end is connected to the server side for response. The data returned by the server is a mark of "having" or "not having", such as true and false, and then after the front end receives the response of the server, if true, the front end performs reminding, and if false, the front end does not perform reminding, and the specific reminding mode is processed by the front end.
The prior art has the following technical problems: polling the server for multiple times can cause the pressure of the server and a database to increase, and the problem is particularly obvious when the concurrency is increased; the time interval of message reminding is defined in a front-end JavaScript code, if a plurality of services need to be reminded and the reminding periods are inconsistent, a plurality of timers are defined at the front end to send ajax requests, so that the waste of resources is caused, and the development and maintenance are inconvenient; because different service reminders need to inquire different data, the existing scheme needs to define an inquiry service for each service, and the development and maintenance are very inconvenient.
Disclosure of Invention
In view of this, embodiments of the present invention provide a method and an apparatus for circularly pushing a notification message, which can directly determine corresponding routing information according to parameter information of an analyzed circular pushing request, and push a notification message to be prompted in the parameter information to a front end according to the routing information, where a back end service does not need to define a query service. The method can push the reminding message to the front end of any service and connection, does not need to define a plurality of timers at the front end, does not need to specially define an interface to poll the front end, and does not need the front end to judge which needs reminding, how needs reminding and the like. The problem of the prior art that the pressure of the server and the database is increased due to repeated polling of the server is solved, and development and maintenance are facilitated.
To achieve the above object, according to an aspect of the embodiments of the present invention, a method for circularly pushing a reminder message is provided.
The method for circularly pushing the reminding message comprises the following steps: receiving a cyclic push request, analyzing the cyclic push request to determine parameter information of the cyclic push request, wherein the parameter information at least comprises a cyclic period, a route identifier and a message to be reminded; according to the cycle and the route identification, searching corresponding route information in a first database at regular time; the first database is used for storing the routing information when the front end establishes connection with the service nodes in the distributed service cluster; and calling a service node in the distributed service cluster according to the routing information, so that the service node pushes the message to be reminded to a corresponding front end.
Optionally, the step of periodically searching the corresponding routing information in the first database according to the cycle period and the routing identifier includes: sending the message to be reminded of the received cyclic push request to a message queue; consuming the messages to be reminded in the message queue, and generating a delayed pushing task according to the cycle period of the currently consumed messages to be reminded; and based on the delayed pushing task, searching corresponding routing information in a first database at regular time according to the routing identification.
Optionally, based on the delayed push task, the step of searching for corresponding routing information in the first database according to the routing identifier timing includes: the delayed push tasks are stored through a time wheel, so that the time wheel processes the stored delayed push tasks at regular time; for the delay pushing task processed currently, searching corresponding routing information in a first database at regular time according to the routing identification; and/or the message queue is Kafka.
Optionally, before generating the deferred push task according to the cycle period of the currently consumed cycle push request, the method further includes: storing the message to be reminded to a second database according to the message identifier of the message to be reminded corresponding to the received cyclic push request; the parameter information also comprises a message identifier of the message to be reminded; and determining that the corresponding message to be reminded exists in the second database according to the message identifier of the message to be reminded consumed currently.
Optionally, the method further comprises: receiving a push closing request, and analyzing the push closing request to determine a message identifier of a corresponding cyclic push request; searching a message to be reminded of the corresponding cyclic push request in the second database according to the message identifier; and deleting the searched message to be reminded of the corresponding circular pushing request.
Optionally, the distributed service cluster is a Websocket service cluster; and/or the first database is a Redis database.
To achieve the above object, according to another aspect of the embodiments of the present invention, an apparatus for circularly pushing an alert message is provided.
The device for circularly pushing the reminding message comprises the following components:
the request receiving module is used for receiving a cyclic push request, analyzing the cyclic push request and determining parameter information of the cyclic push request, wherein the parameter information at least comprises a cyclic period, a route identifier and a message to be reminded;
the route determining module is used for searching corresponding route information in the first database at regular time according to the cycle and the route identification; the first database is used for storing the routing information when the front end establishes connection with the service nodes in the distributed service cluster;
and the message pushing module is used for calling the service node in the distributed service cluster according to the routing information so that the service node pushes the message to be reminded to the corresponding front end.
Optionally, the route determining module is further configured to send a message to be reminded of the received cyclic push request to a message queue; consuming the messages to be reminded in the message queue, and generating a delayed pushing task according to the cycle period of the currently consumed messages to be reminded; and based on the delayed pushing task, searching corresponding routing information in a first database at regular time according to the routing identification.
Optionally, the route determining module is further configured to store the delayed push task through a time wheel, so that the time wheel processes the stored delayed push task at regular time; for the delay pushing task processed currently, searching corresponding routing information in a first database at regular time according to the routing identification; and/or the message queue is Kafka.
Optionally, the route determining module is further configured to store the message to be reminded to the second database according to the message identifier of the message to be reminded corresponding to the received cyclic push request; the parameter information also comprises a message identifier of the message to be reminded; and determining that the corresponding message to be reminded exists in the second database according to the message identifier of the message to be reminded consumed currently.
Optionally, the system further includes a request closing module, configured to receive a push closing request, and analyze the push closing request to determine a message identifier of a cyclic push request corresponding to the request; searching a message to be reminded of the corresponding cyclic push request in the second database according to the message identifier; and deleting the searched message to be reminded of the corresponding circular pushing request.
Optionally, the distributed service cluster is a Websocket service cluster; and/or the first database is a Redis database.
To achieve the above object, according to still another aspect of an embodiment of the present invention, there is provided an electronic apparatus.
The electronic device of the embodiment of the invention comprises: one or more processors; the storage device is used for storing one or more programs, and when the one or more programs are executed by the one or more processors, the one or more processors implement the method for circularly pushing the reminding message in any one of the above manners.
To achieve the above object, according to a further aspect of the embodiments of the present invention, there is provided a computer readable medium having a computer program stored thereon, wherein the computer program is configured to implement any one of the above methods for circularly pushing a reminder message when the computer program is executed by a processor.
One embodiment of the above invention has the following advantages or benefits: the corresponding routing information can be directly determined according to the analyzed parameter information of the cyclic push request, and the message to be reminded in the parameter information is pushed to the front end according to the routing information, so that the back end service does not need to define the query service. And when the front end is connected with the service nodes in the distributed service cluster, the routing information is stored in the database, so that for the processed cyclic push request, the corresponding routing information can be found in the database according to the routing identification in the parameter information, and the corresponding service nodes are further called according to the routing information so as to push the message to be reminded to the corresponding front end. Moreover, the message to be reminded is the message which needs to be reminded, and the front end does not need to judge which needs to be reminded, how to remind and the like. The embodiment of the invention changes the push timing mode into the mode determined by the server, so that the reminding message can be sent to the front end of any service and connection without defining a plurality of timers at the front end and specially defining an interface for polling the front end.
Further effects of the above-mentioned non-conventional alternatives will be described below in connection with the embodiments.
Drawings
The drawings are included to provide a better understanding of the invention and are not to be construed as unduly limiting the invention. Wherein:
fig. 1 is a schematic diagram of a main flow of a method for circularly pushing a reminding message according to an embodiment of the invention;
FIG. 2 is a schematic diagram of an architecture of a system for implementing the method of pushing an alert message circularly according to an embodiment of the present invention;
FIG. 3 is a schematic diagram of a connection timing sequence between a front end and a service node in a distributed service cluster according to an embodiment of the present invention;
FIG. 4 is a schematic diagram of a front end disconnection timing sequence with service nodes in a distributed service cluster according to an embodiment of the present invention;
FIG. 5 is a schematic diagram of a circular push alert message timing sequence according to an embodiment of the present invention;
FIG. 6 is a schematic diagram of the main modules of an apparatus for circularly pushing an alert message according to an embodiment of the present invention;
FIG. 7 is an exemplary system architecture diagram in which embodiments of the present invention may be employed;
fig. 8 is a schematic structural diagram of a computer system suitable for implementing a terminal device or a server according to an embodiment of the present invention.
Detailed Description
Exemplary embodiments of the present invention are described below with reference to the accompanying drawings, in which various details of embodiments of the invention are included to assist understanding, and which are to be considered as merely exemplary. Accordingly, those of ordinary skill in the art will recognize that various changes and modifications of the embodiments described herein can be made without departing from the scope and spirit of the invention. Also, descriptions of well-known functions and constructions are omitted in the following description for clarity and conciseness.
Fig. 1 is a schematic diagram of a main flow of a method for circularly pushing a reminder message according to an embodiment of the present invention, and as shown in fig. 1, the method for circularly pushing the reminder message according to the embodiment of the present invention mainly includes:
step S101: and receiving a cyclic push request, analyzing the cyclic push request and determining parameter information of the cyclic push request, wherein the parameter information at least comprises a cyclic period, a route identifier and a message to be reminded. After receiving a circular pushing request sent by a message pusher, parameter information of the message pusher can be obtained by analyzing the circular pushing request, wherein a circular period in the parameter information is a period for pushing a reminding message, and the parameter information can also include a period time unit, but a default period time unit is also adopted, such as minutes, 30 seconds and the like. The route identifier in the parameter information is used to uniquely identify the route information stored in the first database, for example, a unique id (UUID) of the front end, a route field route used for performing route judgment when the message is pushed, and the like, or a combination of the UUID and the route. The message to be reminded in the parameter information is the message needing to be pushed to the front end circularly. The message pusher includes the message to be reminded (message body) in the parameter information of the sent circular push request, and can directly store the message to be reminded into the Redis, for example, returning the incoming message entity when pushing the message to the front end. The message to be reminded is the message which needs to be reminded, and the front end does not need to judge which messages need to be reminded, how to remind and the like after receiving the pushed message.
Step S102: and searching corresponding routing information in the first database at regular time according to the cycle period and the routing identification. The first database is used for storing the routing information of the front end when the front end establishes connection with the service nodes in the distributed service cluster. When the user connects to the service node in the distributed service cluster, the connection information (including the routing information) is saved, and when the user exits the browser and the service node is disconnected, the connection information is cancelled. And storing the connection information into a Redis database, using a Set structure, wherein each UUID + route corresponds to one Set, and storing the node information of the service nodes in the distributed service cluster connected by the current UUID and the routing field, wherein the node information comprises the node IP and the port of the connected service node. Wherein the content of the first and second substances,
rediskey is: WEB _ SOCKET _ SESSION _ CACHE _ [ UUID ] [ ROUTE ],
each value in redeset is: [ node IP ]: port ], e.g. 192.168.1.1:80
Specifically, the message to be reminded of the received circular pushing request is sent to a message queue. And consuming the messages to be reminded in the message queue, and generating a delayed pushing task according to the cycle period of the currently consumed messages to be reminded. And based on the delayed pushing task, searching corresponding routing information in the first database at regular time according to the routing identification.
Based on the delayed pushing task, the step of searching corresponding routing information in the first database according to the routing identification timing comprises the following steps: and the time wheel is used for storing the delayed push tasks, so that the time wheel is used for processing the stored delayed push tasks at regular time. And for the delay pushing task currently processed, searching corresponding routing information in the first database at regular time according to the routing identification.
The message queue is Kafka. Kafka is a high-throughput distributed publish-subscribe messaging system that can handle all the action flow data in a consumer-scale website. The method has the advantages of high performance, persistence, multi-copy backup and lateral expansion capability. The producer writes the message into the queue, and the consumer cancels the message from the queue to perform service logic, thereby playing the roles of decoupling, peak clipping and asynchronous processing. The problem that the system pressure is difficult to deal with when the concurrency amount is increased in the prior art is further solved. And, for a large number of delay operations in Kafka, a timer (SystemTimer) for implementing the delay function can be customized based on the time round. The time wheel (TimingWheel) in Kafka is a circular queue for storing timed tasks, the bottom layer is implemented by an array, and each element in the array can store a timed task list (timerttasklist).
And before generating a delayed pushing task according to the cycle period of the currently consumed cycle pushing request, storing the cycle pushing request to a second database according to the message identifier of the received cycle pushing request. Wherein, the parameter information also comprises a message identifier. And determining that the corresponding message to be reminded exists in the second database according to the message identifier of the message to be reminded consumed currently. In the embodiment of the present invention, the first database and the second database may be the same database or different databases. Further, the first database or the second database is a Redis database. And determining that the corresponding cyclic push request exists in the second database according to the message identifier of the reminding message, wherein the corresponding service of the reminding message is not completed, and the reminding message still needs to be continuously pushed according to the cyclic period. If the service corresponding to the reminding message is finished, the circular pushing request stored in the second database can be deleted manually or automatically according to the pushing request closing.
For example, a reminding message is pushed cyclically to the service of entering the order a, the cycle period is 5, the message to be reminded is "order a enters the library", the default cycle time unit is hour, and "order a enters the library" is pushed to the user operation end every other hour within 5 hours from the current time. But if the warehousing of order a is completed within 3 hours, the message to be reminded may be deleted from the second database. And when the next reminding after the service time point is finished, judging that the second database does not have the circular pushing request corresponding to the service, and not continuing to carry out invalid reminding.
In the embodiment of the present invention, the step of automatically deleting the cyclic push request stored in the second database according to the push closing request includes: and receiving a push closing request, and analyzing the push closing request to determine the message identifier of the corresponding circular push request. And searching the corresponding cyclic push request in the second database according to the message identifier, and deleting the message to be reminded of the searched corresponding cyclic push request. Through the process, the condition of invalid reminding is avoided.
Step S103: and calling the service node in the distributed service cluster according to the routing information, so that the service node pushes the message to be reminded to the corresponding front end.
The distributed service cluster is a Websocket service cluster. WebSocket enables data exchange between the client and the server to be simpler, and allows the server to actively push data to the client. In the WebSocket API, the browser and the server only need to complete one handshake, and persistent connection can be directly established between the browser and the server, and bidirectional data transmission is carried out. And the websocket is a full-duplex communication mode established between the browser and the server, solves the problem of excessive resource consumption caused by http request-response, and provides a brand-new implementation mode for the industry field with high real-time requirement.
According to the embodiment of the invention, the corresponding routing information can be directly determined according to the analyzed parameter information of the cyclic push request, and the message to be reminded in the parameter information is pushed to the front end according to the routing information, so that the back end service does not need to define the query service. And when the front end is connected with the service nodes in the distributed service cluster, the routing information is stored in the database, so that for the processed cyclic push request, the corresponding routing information can be found in the database according to the routing identification in the parameter information, and the corresponding service nodes are further called according to the routing information so as to push the message to be reminded to the corresponding front end. Moreover, the message to be reminded is the message which needs to be reminded, and the front end does not need to judge which needs to be reminded, how to remind and the like. The embodiment of the invention changes the pushing timing mode into the mode determined by the server, so that the reminding message can be pushed to the front end of any service and connection without defining a plurality of timers at the front end and specially defining an interface for polling the front end. The problem of the prior art that the pressure of the server and the database is increased due to repeated polling of the server is solved, and development and maintenance are facilitated.
FIG. 2 is a schematic diagram of an architecture of a system for implementing the method of pushing an alert message circularly according to an embodiment of the present invention; FIG. 3 is a schematic diagram of a connection timing sequence between a front end and a service node in a distributed service cluster according to an embodiment of the present invention; FIG. 4 is a schematic diagram of a front end disconnection timing sequence with service nodes in a distributed service cluster according to an embodiment of the present invention; FIG. 5 is a diagram illustrating a timing sequence of a circular push alert message according to an embodiment of the present invention.
The embodiment of the invention can independently deploy the message push service, avoid the influence on the production environment and facilitate the expansion. As shown in fig. 2, a system for implementing a method for circularly pushing a reminder message according to an embodiment of the present invention mainly includes: websocket cluster service, Websocket Session registration service, message push routing service, and circular message push service. The Websocket cluster service is used for carrying out Websocket communication with the browser end. The websocket session registration service is used for registering session information currently connected to the websocket cluster, and the session information includes UUID, routing fields, connection information and the like. The message routing service is used to send the message alert to the corresponding browser via the routing field. And circulating the message pushing service, storing the message under the condition of receiving a request of pushing the back-end message, and calling the message pushing routing service to search the connection information of the websocket and the like.
And, the implementation of the WebSocket cluster service is based on a WebSocket cluster, which includes a plurality of nodes providing services, such as node one and node two shown in fig. 2, each of which includes a WebSocket service (WS service) HTTP service and a component that maintains a WebSocket session connected to the current node. The WebSocket service is mainly used for communicating with a homework browser. The HTTP service is used for providing a service for calling the reminding message to the current node by the message pushing routing service. In the embodiment of the invention, Nginx is used for carrying out load balancing on a plurality of nodes, when the browser is connected with the nodes in the WebSocket cluster service, the browser is connected to the Nginx service through the domain name, and then the Nginx loads the corresponding nodes. The WebSocket cluster connection URL (uniform resource locator) is as follows: ws:// domain name/ws/{ uuid }/{ route }. UUID: the unique ID of the currently connected client; route: and the routing field is used for judging the routing when the message is pushed.
The WebSocketSession registration service is mainly used for storing the connection information of a browser and a node in the WebSocket cluster service, wherein the connection information comprises the IP and a port of a server of a specific node in the WebSocket cluster connected to the connection information and is used for routing subsequent messages to the specific server. When a user connects to the cluster, the connection information is saved. And when the user exits the browser and the cluster connection is disconnected, canceling the connection information. As shown in fig. 3 and 4, when the front-end browser is connected to a service node in the WebSocket cluster, the service node calls the WebSocket Session registration service to store the connection information in the Redis database. When the browser is disconnected with a service node in the WebSocket cluster, the service node calls a WebSocket Session registration service to delete the connection information from the Redis.
In the embodiment of the invention, the connection information is stored in Redis, a Set structure can be used, each UUID + route corresponds to one Set, and the node information connected to the cluster through the current UUID and the routing field is stored.
Rediskey is: WEB _ SOCKET _ SESSION _ CACHE _ [ UUID ] [ ROUTE ]
Each value in redeset is: [ node IP ]: port ], e.g. 192.168.1.1:80
The message push routing service is mainly used for connecting the WebSocket cluster service and the circulating message push service. When the message push routing service calls the routing push message, all corresponding registered WebSocket node addresses are inquired through a service for inquiring registration addresses provided by a WebSocketSession registration service, then a node address set is traversed, HTTP service provided by a calling node is used for pushing a prompt to a corresponding node, and the node calls the WebSocketSession push message stored by the current node to a browser after receiving a push request.
The cyclic message push service mainly comprises: the system comprises an external interface, a Kafka message sending component, a message information storage component, a Kafka message consumption component, a time wheel and a delay message processor. The external interface provides RPC interfaces and HTTP interfaces of two protocols, and each interface can receive a cyclic push request and close the cyclic push request. Because the support of various external interfaces is provided, the direct electrophoresis of various interfaces can be facilitated. Entry of the circular push request is shown in the following table:
field(s) Type (B) Description of the invention
uuid String UUID corresponding to browser when connected
route String Routing field corresponding to the route when the browser is connected
messageId String Unique ID of message
message String Message
cyclePeriod Long Cycle period
cycleTimeUnit TimeUnit Cycle period time unit, which may be by default minutes
The Kafka message sending component is used for sending a circular pushing request to Kafka, the Kafka is used for decoupling the message pushing request and the pushing component, and Kafka topic is as follows: wsp-cycle-message. Kafka is a high throughput distributed publish-subscribe messaging system that can handle all the action flow data in a consumer-scale website. And storing the message information, wherein the message can be stored in Redis, and each UUID + route corresponds to a map by using a Hash structure.
Rediskey is: CYCLE _ MESSAGE _ [ UUID ] [ ROUTE ]
Key in Redismap is: messageId, value is: the message is pushed into the JSON string of the participant.
Consuming Kafka messages is used to consume messages in Kafka. The time wheel is used for storing the delayed push message, and the time wheel service needs to be started when the cyclic message push service is started. The delay message processor is used for calling the route push message to the corresponding node. The Redis can also store Session information and reminder messages to be pushed.
As shown in fig. 5, the message presenter invokes the external interface to send a circular push request. And calling the cycle message pushing service through the external interface so that the cycle message pushing service pushes the message to the Kafka. For a high-throughput scenario, a message presenter may continuously invoke an external interface to send a circular push request, so that the circular message push service may continuously push a received reminder message to Kafka. And the cycle message push service saves the received cycle push request to Redis. After receiving the circular pushing request, the circular message pushing service can store the message to be reminded to Redis according to the route identifier and the message identifier of the circular message pushing service.
In the process of consuming the Kafka message, firstly, the message is inquired in the Redis according to the message identifier, whether the message to be reminded corresponding to the message exists in the Redis is judged, if the message does not exist, the corresponding service is normal, and invalid reminding is not needed. If so, add the delayed message push task to the time wheel.
The time wheel triggers a delayed message push server which invokes a message push routing service. Then, the message pushing routing service searches the routing information according to the routing identification, and queries the service node registered by the browser to be pushed according to the routing information. And further, calling an HTTP interface provided by the Websocket cluster node to push the message to the corresponding node, and finally, pushing the message to the corresponding browser by the Websocket cluster node. And the message pushing routing service pushes the completed reminding message to Kafka.
Based on the embodiment of the invention, the back-end service is regularly inquired in a mode of not needing ajax polling after the connection by using the WebSocket protocol. In addition, the timing mode of pushing is changed into timing by the server side, and a plurality of timers are not required to be defined at the front end. And the service code does not need to specially define an interface to poll the front end, and only needs to call the interface provided by the push service at the place where the push message is expected. And the circulating push reminding message is realized through the websocket and the annular structure of the time wheel. And, the directional push reminding message in the distributed environment is realized by combining the message queue (kafka), the route and the Redis.
Fig. 6 is a schematic diagram of main modules of an apparatus for circularly pushing an alert message according to an embodiment of the present invention, and as shown in fig. 6, the apparatus 600 for circularly pushing an alert message according to an embodiment of the present invention includes a request receiving module 601, a route determining module 602, and a message pushing module 603.
The request receiving module 601 is configured to receive a circular pushing request, analyze the circular pushing request, and determine parameter information of the circular pushing request, where the parameter information at least includes a circular period, a routing identifier, and a message to be reminded.
The route determining module 602 is configured to periodically search the first database for corresponding route information according to the cycle period and the route identifier. The first database is used for storing the routing information of the front end when the front end establishes connection with the service nodes in the distributed service cluster. The route determining module is also used for sending the message to be reminded of the received circular pushing request to a message queue; and consuming the messages to be reminded in the message queue, and generating a delayed pushing task according to the cycle period of the currently consumed messages to be reminded. And based on the delayed pushing task, searching corresponding routing information in the first database at regular time according to the routing identification.
The route determining module is also used for storing the delayed push tasks through the time wheel so that the time wheel processes the stored delayed push tasks at regular time; and for the delay pushing task currently processed, searching corresponding routing information in the first database at regular time according to the routing identification. The message queue may be Kafka.
The route determining module is further configured to store the cyclic push request to the second database according to the message identifier of the received cyclic push request before generating the delayed push task according to the cycle period of the currently consumed cyclic push request. Wherein, the parameter information also comprises a message identifier. And for the current consumed message to be reminded, determining that the corresponding message to be reminded exists in the second database according to the message identifier.
The device for circularly pushing the reminding message further comprises a request closing module, wherein the request closing module is used for receiving the pushing closing request, analyzing the pushing closing request and determining the message identifier of the corresponding circularly pushing request. Searching a corresponding cyclic push request in a second database according to the message identifier; and deleting the searched message to be reminded of the corresponding circular pushing request.
The message pushing module 603 is configured to invoke a service node in the distributed service cluster according to the routing information, so that the service node pushes the message to be reminded to the corresponding front end.
The distributed service cluster is a Websocket service cluster. The first database is a Redis database. In the embodiment of the present invention, the first database and the second database may be the same database, and both may be Redis databases.
In the embodiment of the invention, the route determining module can directly determine the corresponding route information according to the parameter information of the cyclic push request analyzed by the request receiving module, and the message pushing module pushes the message to be reminded in the parameter information to the front end according to the route information, so that the back end service does not need to define the query service. And when the front end establishes connection with the service nodes in the distributed service cluster, the routing information is already stored in the database, so that for the processed cyclic push request, the routing determining module can search the corresponding routing information in the database according to the routing identifier in the parameter information. Further, the message pushing module calls the corresponding service node according to the routing information so as to push the message to be reminded to the corresponding front end. Moreover, the message to be reminded is the message which needs to be reminded, and the front end does not need to judge which needs to be reminded, how to remind and the like. The embodiment of the invention changes the pushing timing mode into the mode determined by the server, so that the reminding message can be pushed to the front end of any service and connection without defining a plurality of timers at the front end and specially defining an interface for polling the front end. The problem of the prior art that the pressure of the server and the database is increased due to repeated polling of the server is solved, and development and maintenance are facilitated.
Fig. 7 shows an exemplary system architecture 700 of a method for circularly pushing an alert message or an apparatus for circularly pushing an alert message, to which an embodiment of the present invention may be applied.
As shown in fig. 7, the system architecture 700 may include terminal devices 701, 702, 703, a network 704, and a server 705. The network 704 serves to provide a medium for communication links between the terminal devices 701, 702, 703 and the server 705. Network 704 may include various connection types, such as wired, wireless communication links, or fiber optic cables, to name a few.
A user may use the terminal devices 701, 702, 703 to interact with a server 705 over a network 704, to receive or send messages or the like. The terminal devices 701, 702, 703 may have installed thereon various communication client applications, such as a shopping-like application, a web browser application, a search-like application, an instant messaging tool, a mailbox client, social platform software, etc. (by way of example only).
The terminal devices 701, 702, 703 may be various electronic devices having a display screen and supporting web browsing, including but not limited to smart phones, tablet computers, laptop portable computers, desktop computers, and the like.
The server 705 may be a server providing various services, such as a background management server (for example only) providing support for shopping websites browsed by users using the terminal devices 701, 702, 703. The background management server can analyze and process the received data such as the product information inquiry request and feed back the processing result to the terminal equipment.
It should be noted that, the method for circularly pushing the alert message provided by the embodiment of the present invention is generally executed by the server 705, and accordingly, the device for circularly pushing the alert message is generally disposed in the server 705.
It should be understood that the number of terminal devices, networks, and servers in fig. 7 is merely illustrative. There may be any number of terminal devices, networks, and servers, as desired for implementation.
Referring now to FIG. 8, shown is a block diagram of a computer system 800 suitable for use with a terminal device implementing an embodiment of the present invention. The terminal device shown in fig. 8 is only an example, and should not bring any limitation to the functions and the scope of use of the embodiments of the present invention.
As shown in fig. 8, the computer system 800 includes a Central Processing Unit (CPU)801 that can perform various appropriate actions and processes in accordance with a program stored in a Read Only Memory (ROM)802 or a program loaded from a storage section 808 into a Random Access Memory (RAM) 803. In the RAM 803, various programs and data necessary for the operation of the system 800 are also stored. The CPU 801, ROM 802, and RAM 803 are connected to each other via a bus 804. An input/output (I/O) interface 805 is also connected to bus 804.
The following components are connected to the I/O interface 805: an input portion 806 including a keyboard, a mouse, and the like; an output section 807 including a signal such as a Cathode Ray Tube (CRT), a Liquid Crystal Display (LCD), and the like, and a speaker; a storage portion 808 including a hard disk and the like; and a communication section 809 including a network interface card such as a LAN card, a modem, or the like. The communication section 809 performs communication processing via a network such as the internet. A drive 810 is also connected to the I/O interface 805 as necessary. A removable medium 811 such as a magnetic disk, an optical disk, a magneto-optical disk, a semiconductor memory, or the like is mounted on the drive 810 as necessary, so that a computer program read out therefrom is mounted on the storage section 808 as necessary.
In particular, according to the embodiments of the present disclosure, the processes described above with reference to the flowcharts may be implemented as computer software programs. For example, embodiments of the present disclosure include a computer program product comprising a computer program embodied on a computer readable medium, the computer program comprising program code for performing the method illustrated in the flow chart. In such an embodiment, the computer program can be downloaded and installed from a network through the communication section 809 and/or installed from the removable medium 811. The computer program executes the above-described functions defined in the system of the present invention when executed by the Central Processing Unit (CPU) 801.
It should be noted that the computer readable medium shown in the present invention can be a computer readable signal medium or a computer readable storage medium or any combination of the two. A computer readable storage medium may be, for example, but not limited to, an electronic, magnetic, optical, electromagnetic, infrared, or semiconductor system, apparatus, or device, or any combination of the foregoing. More specific examples of the computer readable storage medium may include, but are not limited to: an electrical connection having one or more wires, a portable computer diskette, a hard disk, a Random Access Memory (RAM), a read-only memory (ROM), an erasable programmable read-only memory (EPROM or flash memory), an optical fiber, a portable compact disc read-only memory (CD-ROM), an optical storage device, a magnetic storage device, or any suitable combination of the foregoing. In the present invention, a computer readable storage medium may be any tangible medium that can contain, or store a program for use by or in connection with an instruction execution system, apparatus, or device. In the present invention, however, a computer readable signal medium may include a propagated data signal with computer readable program code embodied therein, for example, in baseband or as part of a carrier wave. Such a propagated data signal may take many forms, including, but not limited to, electro-magnetic, optical, or any suitable combination thereof. A computer readable signal medium may also be any computer readable medium that is not a computer readable storage medium and that can communicate, propagate, or transport a program for use by or in connection with an instruction execution system, apparatus, or device. Program code embodied on a computer readable medium may be transmitted using any appropriate medium, including but not limited to: wireless, wire, fiber optic cable, RF, etc., or any suitable combination of the foregoing.
The flowchart and block diagrams in the figures illustrate the architecture, functionality, and operation of possible implementations of systems, methods and computer program products according to various embodiments of the present invention. In this regard, each block in the flowchart or block diagrams may represent a module, segment, or portion of code, which comprises one or more executable instructions for implementing the specified logical function(s). It should also be noted that, in some alternative implementations, the functions noted in the block may occur out of the order noted in the figures. For example, two blocks shown in succession may, in fact, be executed substantially concurrently, or the blocks may sometimes be executed in the reverse order, depending upon the functionality involved. It will also be noted that each block of the block diagrams or flowchart illustration, and combinations of blocks in the block diagrams or flowchart illustration, can be implemented by special purpose hardware-based systems which perform the specified functions or acts, or combinations of special purpose hardware and computer instructions.
The modules described in the embodiments of the present invention may be implemented by software or hardware. The described modules may also be provided in a processor, which may be described as: a processor includes a request receiving module, a route determining module, and a message pushing module. The names of these modules do not form a limitation to the module itself in some cases, for example, the request receiving module may also be described as a module that receives a cyclic push request and parses the cyclic push request to determine its parameter information.
As another aspect, the present invention also provides a computer-readable medium that may be contained in the apparatus described in the above embodiments; or may be separate and not incorporated into the device. The computer readable medium carries one or more programs which, when executed by a device, cause the device to comprise: receiving a cyclic push request, analyzing the cyclic push request to determine parameter information of the cyclic push request, wherein the parameter information at least comprises a cyclic period, a route identifier and a message to be reminded; according to the cycle and the route identification, searching corresponding route information in a first database at regular time; the first database is used for storing the routing information when the front end establishes connection with the service nodes in the distributed service cluster; and calling the service node in the distributed service cluster according to the routing information, so that the service node pushes the message to be reminded to the corresponding front end.
According to the embodiment of the invention, the corresponding routing information can be directly determined according to the analyzed parameter information of the cyclic push request, and the message to be reminded in the parameter information is pushed to the front end according to the routing information, so that the back end service does not need to define the query service. And when the front end is connected with the service nodes in the distributed service cluster, the routing information is stored in the database, so that for the processed cyclic push request, the corresponding routing information can be found in the database according to the routing identification in the parameter information, and the corresponding service nodes are further called according to the routing information so as to push the message to be reminded to the corresponding front end. Moreover, the message to be reminded is the message which needs to be reminded, and the front end does not need to judge which needs to be reminded, how to remind and the like. The embodiment of the invention changes the push timing mode into the mode determined by the server, so that the reminding message can be pushed to the front end of any service and connection without defining a plurality of timers at the front end, specially defining an interface to poll the front end and judging which needs reminding, how needs reminding and the like at the front end. The problem of the prior art that the pressure of the server and the database is increased due to repeated polling of the server is solved, and development and maintenance are facilitated.
The above-described embodiments should not be construed as limiting the scope of the invention. Those skilled in the art will appreciate that various modifications, combinations, sub-combinations, and substitutions can occur, depending on design requirements and other factors. Any modification, equivalent replacement, and improvement made within the spirit and principle of the present invention should be included in the protection scope of the present invention.

Claims (14)

1. A method for circularly pushing reminding messages is characterized by comprising the following steps:
receiving a cyclic push request, analyzing the cyclic push request to determine parameter information of the cyclic push request, wherein the parameter information at least comprises a cyclic period, a route identifier and a message to be reminded;
according to the cycle and the route identification, searching corresponding route information in a first database at regular time; the first database is used for storing the routing information when the front end establishes connection with the service nodes in the distributed service cluster;
and calling a service node in the distributed service cluster according to the routing information, so that the service node pushes the message to be reminded to a corresponding front end.
2. The method of claim 1, wherein the step of periodically searching the first database for corresponding routing information according to the cycle period and the routing identifier comprises:
sending the message to be reminded of the received cyclic push request to a message queue;
consuming the messages to be reminded in the message queue, and generating a delayed pushing task according to the cycle period of the currently consumed messages to be reminded;
and based on the delayed pushing task, searching corresponding routing information in a first database at regular time according to the routing identification.
3. The method of claim 2, wherein the step of searching the first database for corresponding routing information according to the routing identification timing based on the delayed push task comprises: the delayed push tasks are stored through a time wheel, so that the time wheel processes the stored delayed push tasks at regular time; for the delay pushing task processed currently, searching corresponding routing information in a first database at regular time according to the routing identification; and/or
The message queue is Kafka.
4. The method of claim 2, further comprising, before generating the deferred push task according to the cycle period of the currently consumed cyclic push request:
storing the message to be reminded to a second database according to the message identifier of the message to be reminded corresponding to the received cyclic push request; the parameter information also comprises a message identifier of the message to be reminded;
and determining that the corresponding message to be reminded exists in the second database according to the message identifier of the message to be reminded consumed currently.
5. The method of claim 4, further comprising:
receiving a push closing request, and analyzing the push closing request to determine a message identifier of a corresponding cyclic push request;
searching a message to be reminded of the corresponding cyclic push request in the second database according to the message identifier;
and deleting the searched message to be reminded of the corresponding circular pushing request.
6. The method of claim 1, wherein the distributed service cluster is a Websocket service cluster; and/or
The first database is a Redis database.
7. An apparatus for pushing reminding messages in a circulating manner, comprising:
the request receiving module is used for receiving a cyclic push request, analyzing the cyclic push request and determining parameter information of the cyclic push request, wherein the parameter information at least comprises a cyclic period, a route identifier and a message to be reminded;
the route determining module is used for searching corresponding route information in the first database at regular time according to the cycle and the route identification; the first database is used for storing the routing information when the front end establishes connection with the service nodes in the distributed service cluster;
and the message pushing module is used for calling the service node in the distributed service cluster according to the routing information so that the service node pushes the message to be reminded to the corresponding front end.
8. The apparatus according to claim 7, wherein the route determining module is further configured to send a message to be reminded of the received cyclic push request to a message queue; consuming the messages to be reminded in the message queue, and generating a delayed pushing task according to the cycle period of the currently consumed messages to be reminded; and based on the delayed pushing task, searching corresponding routing information in a first database at regular time according to the routing identification.
9. The apparatus of claim 8, wherein the route determination module is further configured to save the delayed push task through a time round, such that the time round processes the saved delayed push task at regular time; for the delay pushing task processed currently, searching corresponding routing information in a first database at regular time according to the routing identification; and/or
The message queue is Kafka.
10. The apparatus according to claim 8, wherein the route determining module is further configured to store the message to be reminded to the second database according to the message identifier of the message to be reminded corresponding to the received cyclic push request; the parameter information also comprises a message identifier of the message to be reminded; and determining that the corresponding message to be reminded exists in the second database according to the message identifier of the message to be reminded consumed currently.
11. The apparatus according to claim 10, further comprising a request closing module, configured to receive a push closing request, parse the push closing request to determine a message identifier of a cyclic push request corresponding to the request; searching a message to be reminded of the corresponding cyclic push request in the second database according to the message identifier; and deleting the searched message to be reminded of the corresponding circular pushing request.
12. The apparatus of claim 7, wherein the distributed service cluster is a Websocket service cluster; and/or
The first database is a Redis database.
13. An electronic device, comprising:
one or more processors;
a storage device for storing one or more programs,
when executed by the one or more processors, cause the one or more processors to implement the method of any one of claims 1-6.
14. A computer-readable medium, on which a computer program is stored, which, when being executed by a processor, carries out the method according to any one of claims 1-6.
CN201910378895.5A 2019-05-08 2019-05-08 Method and device for circularly pushing reminding message Active CN111917687B (en)

Priority Applications (1)

Application Number Priority Date Filing Date Title
CN201910378895.5A CN111917687B (en) 2019-05-08 2019-05-08 Method and device for circularly pushing reminding message

Applications Claiming Priority (1)

Application Number Priority Date Filing Date Title
CN201910378895.5A CN111917687B (en) 2019-05-08 2019-05-08 Method and device for circularly pushing reminding message

Publications (2)

Publication Number Publication Date
CN111917687A true CN111917687A (en) 2020-11-10
CN111917687B CN111917687B (en) 2023-06-27

Family

ID=73241975

Family Applications (1)

Application Number Title Priority Date Filing Date
CN201910378895.5A Active CN111917687B (en) 2019-05-08 2019-05-08 Method and device for circularly pushing reminding message

Country Status (1)

Country Link
CN (1) CN111917687B (en)

Cited By (8)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN112491696A (en) * 2020-11-30 2021-03-12 上海昌投网络科技有限公司 Message center system based on message pushing
CN112671560A (en) * 2020-12-11 2021-04-16 广东电力通信科技有限公司 High-availability distributed real-time alarm processing method and system
CN112910987A (en) * 2021-01-28 2021-06-04 长沙市到家悠享网络科技有限公司 Message pushing method, system, device, equipment and storage medium
CN113452774A (en) * 2021-06-25 2021-09-28 睿视(苏州)视频科技有限公司 Message pushing method, device, equipment and storage medium
CN114039961A (en) * 2021-10-08 2022-02-11 中移（杭州）信息技术有限公司 Message pushing method, device, server and storage medium based on WebSocket
CN114172882A (en) * 2021-11-19 2022-03-11 武汉紫阑信息技术有限公司 Webpage end message reminding method, device, equipment and storage medium
CN115049085A (en) * 2022-06-07 2022-09-13 中国银行股份有限公司 Method and device for reminding reservation service of bank outlets
CN115514809A (en) * 2022-10-17 2022-12-23 网易（杭州）网络有限公司 Message pushing method and device, electronic equipment and storage medium

Citations (6)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US20050108417A1 (en) * 2003-11-19 2005-05-19 Serge Haumont System and method for reducing subscriber database loads
US20090227276A1 (en) * 2008-03-07 2009-09-10 Devesh Agarwal Methods, systems, and computer readable media for routing a message service message through a communications network
WO2011124132A1 (en) * 2010-04-07 2011-10-13 中兴通讯股份有限公司 Data communications system and method
US20120163386A1 (en) * 2009-09-08 2012-06-28 Zte Corporation Name-to-address mapping system, data transmission method and name-to-address mapping maintenance method
CN104184663A (en) * 2014-07-17 2014-12-03 北京交通大学 Communication method and device based on software-defined network and integrated identification network
CN104468805A (en) * 2014-12-12 2015-03-25 用友软件股份有限公司 Message routing device and method

Patent Citations (6)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US20050108417A1 (en) * 2003-11-19 2005-05-19 Serge Haumont System and method for reducing subscriber database loads
US20090227276A1 (en) * 2008-03-07 2009-09-10 Devesh Agarwal Methods, systems, and computer readable media for routing a message service message through a communications network
US20120163386A1 (en) * 2009-09-08 2012-06-28 Zte Corporation Name-to-address mapping system, data transmission method and name-to-address mapping maintenance method
WO2011124132A1 (en) * 2010-04-07 2011-10-13 中兴通讯股份有限公司 Data communications system and method
CN104184663A (en) * 2014-07-17 2014-12-03 北京交通大学 Communication method and device based on software-defined network and integrated identification network
CN104468805A (en) * 2014-12-12 2015-03-25 用友软件股份有限公司 Message routing device and method

Cited By (10)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN112491696A (en) * 2020-11-30 2021-03-12 上海昌投网络科技有限公司 Message center system based on message pushing
CN112671560A (en) * 2020-12-11 2021-04-16 广东电力通信科技有限公司 High-availability distributed real-time alarm processing method and system
CN112910987A (en) * 2021-01-28 2021-06-04 长沙市到家悠享网络科技有限公司 Message pushing method, system, device, equipment and storage medium
CN113452774A (en) * 2021-06-25 2021-09-28 睿视(苏州)视频科技有限公司 Message pushing method, device, equipment and storage medium
CN113452774B (en) * 2021-06-25 2022-07-12 睿视(苏州)视频科技有限公司 Message pushing method, device, equipment and storage medium
CN114039961A (en) * 2021-10-08 2022-02-11 中移（杭州）信息技术有限公司 Message pushing method, device, server and storage medium based on WebSocket
CN114172882A (en) * 2021-11-19 2022-03-11 武汉紫阑信息技术有限公司 Webpage end message reminding method, device, equipment and storage medium
CN114172882B (en) * 2021-11-19 2024-04-12 武汉紫阑信息技术有限公司 Webpage end message reminding method, device, equipment and storage medium
CN115049085A (en) * 2022-06-07 2022-09-13 中国银行股份有限公司 Method and device for reminding reservation service of bank outlets
CN115514809A (en) * 2022-10-17 2022-12-23 网易（杭州）网络有限公司 Message pushing method and device, electronic equipment and storage medium

Also Published As

Publication number Publication date
CN111917687B (en) 2023-06-27

Similar Documents

Publication Publication Date Title
CN111917687B (en) Method and device for circularly pushing reminding message
CN108897854B (en) Monitoring method and device for overtime task
CN112445868B (en) Service message processing method and device
CN110581890A (en) Routing method and device for service request
CN110321252B (en) Skill service resource scheduling method and device
WO2015172497A1 (en) Message pushing and acquisition methods and devices, and computer readable storage medium
CN112653614A (en) Request processing method and device based on message middleware
CN110798495B (en) Method and server for end-to-end message push in cluster architecture mode
CN109981546B (en) Method and device for acquiring remote call relation between application modules
CN113190558A (en) Data processing method and system
CN112948138A (en) Method and device for processing message
CN113553206B (en) Data event execution method and device, electronic equipment and computer readable medium
CN113783826B (en) Micro-service exception handling method and device
CN112799863B (en) Method and device for outputting information
CN112749204B (en) Method and device for reading data
CN112306791B (en) Performance monitoring method and device
CN113556370A (en) Service calling method and device
CN113535768A (en) Production monitoring method and device
CN111767185A (en) Data point burying method and device
CN112306984A (en) Data source routing method and device
CN113495908B (en) Data statistics method and device
CN110633324B (en) Method, apparatus, electronic device and computer readable medium for synchronizing data
CN112311833B (en) Data updating method and device
CN117478535A (en) Log storage method and device
CN115314509A (en) Synchronization method, device, equipment and storage medium of application registration information

Legal Events

Date Code Title Description
PB01 Publication
PB01 Publication
SE01 Entry into force of request for substantive examination
SE01 Entry into force of request for substantive examination
GR01 Patent grant
GR01 Patent grant