CN113064741A - Message queue retry method and device - Google Patents
Message queue retry method and device Download PDFInfo
- Publication number
- CN113064741A CN113064741A CN202110373575.8A CN202110373575A CN113064741A CN 113064741 A CN113064741 A CN 113064741A CN 202110373575 A CN202110373575 A CN 202110373575A CN 113064741 A CN113064741 A CN 113064741A
- Authority
- CN
- China
- Prior art keywords
- message
- target message
- retry
- target
- consumer
- 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
Links
Images
Classifications
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06F—ELECTRIC DIGITAL DATA PROCESSING
- G06F9/00—Arrangements for program control, e.g. control units
- G06F9/06—Arrangements for program control, e.g. control units using stored programs, i.e. using an internal store of processing equipment to receive or retain programs
- G06F9/46—Multiprogramming arrangements
- G06F9/54—Interprogram communication
- G06F9/546—Message passing systems or structures, e.g. queues
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06F—ELECTRIC DIGITAL DATA PROCESSING
- G06F11/00—Error detection; Error correction; Monitoring
- G06F11/07—Responding to the occurrence of a fault, e.g. fault tolerance
- G06F11/14—Error detection or correction of the data by redundancy in operation
- G06F11/1497—Details of time redundant execution on a single processing unit
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06F—ELECTRIC DIGITAL DATA PROCESSING
- G06F2209/00—Indexing scheme relating to G06F9/00
- G06F2209/54—Indexing scheme relating to G06F9/54
- G06F2209/548—Queue
Landscapes
- Engineering & Computer Science (AREA)
- Theoretical Computer Science (AREA)
- Software Systems (AREA)
- Physics & Mathematics (AREA)
- General Engineering & Computer Science (AREA)
- General Physics & Mathematics (AREA)
- Quality & Reliability (AREA)
- Retry When Errors Occur (AREA)
Abstract
The application aims at providing a message queue retry method and device, and the application receives a target message from a message producer through a message negotiator of a message queue, wherein the target message comprises a message body, records the creation time and the retried times of the target message, configures expiration time and total retry times, and sends the expiration time and the total retry times to a corresponding consumer together, so that when the target message is consumed, whether the target message is retried for the last time is judged according to the retried times and the total retry times, and if so, the retry of the target message is finished when the target message is consumed unsuccessfully; or, when consuming the target message, judging whether the target message is allowed to continuously retry according to the creation time and the expiration time, if not, finishing the retry of the target message when the consumption of the target message fails, thereby realizing the retry strategy when the intervention of the consumer on the message fails, and further making corresponding service processing or finishing the retry in advance.
Description
Technical Field
The present application relates to the field of distributed system technologies, and in particular, to a message queue retry method and device.
Background
In the prior art, a Message Queue (MQ) is widely applied in a distributed system, and plays a great role in solving problems of decoupling, asynchronization, peak clipping and the like. Currently, MQs in the mainstream support the configuration of a retry-on-failure policy, and when MQ message consumption fails, retry can be performed within a certain time. However, the retry strategies are controlled by the message negotiator broker of the MQ, and the consumer can not intervene basically.
Disclosure of Invention
An object of the present application is to provide a message queue retry method and device, which enable a consumer to intervene in a retry strategy when a message fails, so that the consumer can perform corresponding service processing or finish retry in advance, and the like, when a message negotiator of an MQ issues a message, the total retry times, creation time, expiration time and retry times of the message are increased.
According to an aspect of the present application, there is provided a message queue retry method applied to a message negotiator end of a message queue, wherein the method includes:
receiving a target message from a producer of a message, the target message comprising a message body;
recording the creation time and the retried times of the target message, and configuring an expiration time and retriable total retried times for the target message;
and sending the target message and the corresponding creation time, the retried times, the total testing times and the expiration time to corresponding consumers.
Further, in the above method, the method further includes:
setting an identifier in the target message for indicating whether the target message is the last retry or not;
receiving a retry request of the target message sent by the consumer and determining a retry time;
if the retry time exceeds the expiration time and the identifier is used for indicating that the target message is not the last retry, setting the identifier as the identifier used for indicating that the target message is the last retry;
sending the identification indicating that the target message is a last retry to the consumer.
Further, in the above method, the method further includes:
initializing the target message to zero retries when the target message is received from a producer of the message.
Further, in the above method, the method further includes:
and if the consumption of the target message at the consumer end fails, accumulating the retried times of the target message when receiving the retry request of the target message from the message negotiator.
According to another aspect of the present application, there is also provided a message queue retry method applied to a consumer side of a message queue, wherein the method includes:
receiving a target message sent by a message negotiator of a message queue and corresponding creation time, retried times, total retry times and expiration time of the target message, wherein the target message comprises a message body;
when the target message is consumed, judging whether the target message is retried for the last time according to the retried times and the total retried times, if so, finishing the retries of the target message when the target message is consumed unsuccessfully; or the like, or, alternatively,
and when the target message is consumed, judging whether the target message is allowed to continuously retry according to the creation time and the expiration time, if not, finishing the retry of the target message when the consumption of the target message fails.
Further, in the above method, after the target message is consumed and whether the target message is allowed to retry again is determined according to the creation time and the expiration time, the method further includes:
if yes, initiating a retry request of the target message to the message negotiator;
receiving an identifier sent by the message negotiator and used for indicating that the target message is the last retry;
after the target message is consumed again, if the target message is not consumed, the retry of the target message is finished.
According to another aspect of the present application, there is also provided a non-volatile storage medium having computer readable instructions stored thereon, which, when executed by a processor, cause the processor to implement the message queue retry method as described above.
According to another aspect of the present application, there is also provided a message negotiator for message queue retries, wherein the message negotiator includes:
one or more processors;
a computer-readable medium for storing one or more computer-readable instructions,
when executed by the one or more processors, cause the one or more processors to implement a message queue retry method at a message negotiator as described above.
According to another aspect of the present application, there is also provided a consumer-side of message queue retry, wherein the consumer-side includes:
one or more processors;
a computer-readable medium for storing one or more computer-readable instructions,
when executed by the one or more processors, cause the one or more processors to implement a message queue retry method at a consumer-side as described above.
Compared with the prior art, the method and the device receive the target message from the producer of the message through the message negotiator of the message queue, wherein the target message comprises a message body; recording the creation time and the retried times of the target message, configuring expiration time and retriable total retry times for the target message, and sending the target message and the corresponding creation time, the retried times, the total retry times and the expiration time to a corresponding consumer, so that when the target message is consumed by the consumer, whether the target message is retried for the last time or not is judged according to the retried times and the total retry times, and if so, the retry of the target message is finished when the consumption of the target message fails; or, when consuming the target message, judging whether the target message is allowed to continuously retry according to the creation time and the expiration time, if not, finishing the retry of the target message when the consumption of the target message fails, so that when the message negotiator of the MQ issues the message, the total retry times, the creation time, the expiration time and the retried times of the message are increased, and the retry strategy when the message fails is intervened by the consumer, so that the consumer can make corresponding service processing or finish the retry in advance, and the like.
Drawings
Other features, objects and advantages of the present application will become more apparent upon reading of the following detailed description of non-limiting embodiments thereof, made with reference to the accompanying drawings in which:
FIG. 1 illustrates an interaction flow diagram of a message queue retry method in accordance with an aspect of the subject application.
The same or similar reference numbers in the drawings identify the same or similar elements.
Detailed Description
The present application is described in further detail below with reference to the attached figures.
In a typical configuration of the present application, the terminal, the device serving the network, and the trusted party each include one or more processors (CPUs), input/output interfaces, network interfaces, and memory.
The memory may include forms of volatile memory in a computer readable medium, Random Access Memory (RAM) and/or non-volatile memory, such as Read Only Memory (ROM) or flash memory (flash RAM). Memory is an example of a computer-readable medium.
Computer-readable media, including both non-transitory and non-transitory, removable and non-removable media, may implement information storage by any method or technology. The information may be computer readable instructions, data structures, modules of a program, or other data. Examples of computer storage media include, but are not limited to, phase change memory (PRAM), Static Random Access Memory (SRAM), Dynamic Random Access Memory (DRAM), other types of Random Access Memory (RAM), Read Only Memory (ROM), Electrically Erasable Programmable Read Only Memory (EEPROM), flash memory or other memory technology, compact disc read only memory (CD-ROM), Digital Versatile Discs (DVD) or other optical storage, magnetic cassettes, magnetic tape, magnetic disk storage or other magnetic storage devices, or any other non-transmission medium that can be used to store information that can be accessed by a computing device. As defined herein, computer readable media does not include non-transitory computer readable media (transient media), such as modulated data signals and carrier waves.
With the failed retry strategy for MQ messages, the consumer has essentially no way of knowing when the node stops retrying consumption. Sometimes the consumer needs to do some business processing when the MQ message stops retrying. Or the consumer wants to autonomously control the number of retries and the retry duration when consuming the message.
For example, with such an order production process, after the inventory of the goods is successfully deducted, the MQ is required to asynchronously notify the partners to process the order. However, when the partner is notified asynchronously, notification failure may occur, and in some cases, the retry process is required, and the number and duration of the retry process are limited. When the limited number of retries or time is reached, it is deemed to be a failure to notify the partner, which may require adding back inventory of the goods. Such a scenario requires that the consumer know the number of retries of the message and the duration of the retries when consuming the message.
In the application, an aspect proposes a Message Queue retry method, and a specific interaction flow is as shown in fig. 1, where the method relates to an application scenario in which a Message consumer intervenes a retry policy when consuming a Message in a Message Queue (MQ) in a distributed system. The method comprises a step S11, a step S12, a step S13, a step S21, a step S22 and a step S23, and specifically comprises the following steps:
after the producer for producing the message produces a target message, the target message includes a message graph (i.e. message service data), the producer sends the target message to the message negotiator broker of the message queue, step S11, the message negotiator receives the target message from the producer of the message, the target message includes a message body, so that the message negotiator receives the produced target message from the producer.
When the target message produced by the producer reaches the message negotiator broker of the MQ, step S12, the message negotiator broker records the creation time and the retried number of times of the target message, and configures an expiration time and a total retriable number of times for the target message. Here, if the message negotiator broker just receives the target message from the producer of the message, the number of retries for initializing the target message is zero, that is, the target message has not been failed by the message; if the consumption of the target message at the consumer end fails, when the message negotiator broker receives a retry request of the target message from the message negotiator, the number of retries of the target message, namely the number of retries, is recorded and accumulated according to the retry number after the message fails. When the target message has not created the expiration time and the total retry number, the expiration time and the total retry number of the target message are calculated according to the message configuration parameters of the target message, such as the message instantaneity requirement, the message time limit and the message importance.
Step S13, the message negotiator issues the target message and the corresponding creation time, retried time, total retry time and expiration time to the corresponding consumer, that is, when the message negotiator broker issues the target message to the consumer, the creation time, retried time, retriable total retry time and expiration time of the target message are increased, and the increased creation time, retried time, retriable total retry time and expiration time of the target message are issued to the consumer together with the message body (i.e. message service data) of the target message, so that the consumer can perform subsequent service processing of corresponding policies, such as early retry ending and the like, according to the creation time, retried time, retriable total retry time and expiration time of the target message, avoiding unlimited repetition.
Step S21, the consumer receives a target message sent by the message negotiator of the message queue and its corresponding creation time, the retried number, the total retry number, and expiration time, where the target message includes a message body.
Step S22, when consuming the target message, the consumer determines whether the target message is retried for the last time according to the retried times and the total retried times, and if so, ends the retried of the target message when the consumption of the target message fails. For example, in the retry strategy for limiting the retry times, when the target message reaches a consumer and the consumer consumes the target message, according to the retry times of the received target message and the total retry times that can be retried, it is determined whether the target message is the last retry, if the retry times is less than the total retry times, it indicates that the target message is not the last retry, and when the consumption of the target message fails, a retry request may be initiated to the message negotiator broker again; if the retried times are equal to the total retried times, the target message is determined to have been retried for the last time, and when the consumption of the target message fails, the consumer can directly end the retrying of the target message, so that the retrying of the target message after repeated retries is terminated, and the resource waste caused by unlimited retrying is avoided.
Or, in step S23, when consuming the target message, the consumer determines whether the target message is allowed to retry continuously according to the creation time and the expiration time, and if not, when the consumption of the target message fails, the consumer ends the retry of the target message. For example, in the retry policy with an expiration time set, when the consumer consumes the target message, it may be determined whether the target message is allowed to be retried continuously according to the creation time and the expiration time, if the expiration time has elapsed while consuming the target message, the target message is not allowed to be retried continuously, and when the consumption of the target message fails, the retry of the target message is ended; if the target message does not reach the expiration time when consumed and the target message fails to be consumed, the target message can be continuously retried to the broker when the target message fails to be consumed, so that the intervention and the control of the consumer on the retry of the target message are realized.
Further, in the retry strategy for setting the expiration time, the consumer actively determines whether to retry continuously according to the creation time and the expiration time of the target message, and there is a problem that the expiration time is not yet reached when the consumer determines whether to reach the expiration time, but the expiration time is reached when the message negotiator broker is notified that retry consuming needs, so that the message is not retried continuously. For this case, an aspect of the present application provides a message queue retry method further including:
the message negotiator sets an identifier for indicating whether the target message is the last retry or not in the target message;
when consuming the target message in step S23, determining whether the target message is allowed to retry continuously according to the creation time and the expiration time, if yes, the consumer initiates a retry request of the target message to the message negotiator;
the message negotiator receives a retry request of the target message sent by the consumer and determines a retry time;
if the retry time exceeds the expiration time and the identifier indicates that the target message is not a last retry, the message negotiator sets the identifier to indicate that the target message is a last retry;
the message negotiator sends the identification used for indicating that the target message is the last retry to the consumer;
the consumer receives the identifier which is sent by the message negotiator and used for indicating that the target message is the last retry;
and after consuming the target message again, if the consumption of the target message fails, finishing the retry of the target message by the consumer.
For example, the message negotiator broker may set an identification in the target message to identify whether the message was the last retry (which may also be understood as informing the consumer whether the last retry was). When the broker receives the notification that the message needs to be retried, if the retry time has passed but the "retry last" flag is not set, the broker may retry again, while setting the "retry last" flag to be the last retry, and sending the flag indicating that the target message is the last retry to the consumer. Therefore, if the target message is in the consumer or the consumption is failed, the consumer can directly finish the retry of the target message and inform the message negotiator that the brush fails in the retry of this time, and the message negotiator brush can also decide whether to continue the retry by checking the identifier of "whether to retry for the last time", so as to realize the reasonable termination of the retry. Of course, the "retry last" flag is also applicable to the retry strategy for limiting the number of retries, so that when the consumer consumes the message, no matter what the configuration of the retry strategy is, the consumer can recognize whether the retry is the last retry by checking the "retry last retry" flag, thereby facilitating the message negotiator broker or the consumer to make corresponding processing logic corresponding to the message consumption failure.
In the application, when the consumer can obtain the information of the creation time, the expiration time, the retried times, the retriable total retry times and the like of the target message in the MQ, the consumer can finish the retrial in advance according to the information of the failure retry of the master control message, for example, when the retried times reach the retriable total retry times or the retried duration reaches the retriable expiration time, so as to avoid the waste of resources caused by the endless loop of retrial.
According to another aspect of the present application, there is also provided a non-volatile storage medium having computer readable instructions stored thereon, which, when executed by a processor, cause the processor to implement the message queue retry method as described above.
According to another aspect of the present application, there is also provided a message negotiator for message queue retries, wherein the message negotiator includes:
one or more processors;
a computer-readable medium for storing one or more computer-readable instructions,
when executed by the one or more processors, cause the one or more processors to implement a message queue retry method at a message negotiator as described above.
Here, the details of each embodiment of the message negotiator for retry of the message queue may specifically refer to the corresponding part of the embodiment of the message queue retry method at the message negotiator end, and are not described herein again.
According to another aspect of the present application, there is also provided a consumer of message queue retries, wherein the consumer includes:
one or more processors;
a computer-readable medium for storing one or more computer-readable instructions,
when executed by the one or more processors, cause the one or more processors to implement a message queue retry method at a consumer-side as described above.
Here, the details of each embodiment of the consumer for retry of the message queue may specifically refer to the corresponding part of the above embodiment of the message queue retry method of the consumer side, and are not described herein again.
To sum up, the present application receives a target message from a producer of a message through a message negotiator of a message queue, where the target message includes a message body; recording the creation time and the retried times of the target message, configuring expiration time and retriable total retry times for the target message, and sending the target message and the corresponding creation time, the retried times, the total retry times and the expiration time to a corresponding consumer, so that when the target message is consumed by the consumer, whether the target message is retried for the last time or not is judged according to the retried times and the total retry times, and if so, the retry of the target message is finished when the consumption of the target message fails; or, when consuming the target message, judging whether the target message is allowed to continuously retry according to the creation time and the expiration time, if not, finishing the retry of the target message when the consumption of the target message fails, so that when the message negotiator of the MQ issues the message, the total retry times, the creation time, the expiration time and the retried times of the message are increased, and the retry strategy when the message fails is intervened by the consumer, so that the consumer can make corresponding service processing or finish the retry in advance, and the like.
It should be noted that the present application may be implemented in software and/or a combination of software and hardware, for example, implemented using Application Specific Integrated Circuits (ASICs), general purpose computers or any other similar hardware devices. In one embodiment, the software programs of the present application may be executed by a processor to implement the steps or functions described above. Likewise, the software programs (including associated data structures) of the present application may be stored in a computer readable recording medium, such as RAM memory, magnetic or optical drive or diskette and the like. Additionally, some of the steps or functions of the present application may be implemented in hardware, for example, as circuitry that cooperates with the processor to perform various steps or functions.
In addition, some of the present application may be implemented as a computer program product, such as computer program instructions, which when executed by a computer, may invoke or provide methods and/or techniques in accordance with the present application through the operation of the computer. Program instructions which invoke the methods of the present application may be stored on a fixed or removable recording medium and/or transmitted via a data stream on a broadcast or other signal-bearing medium and/or stored within a working memory of a computer device operating in accordance with the program instructions. An embodiment according to the present application comprises an apparatus comprising a memory for storing computer program instructions and a processor for executing the program instructions, wherein the computer program instructions, when executed by the processor, trigger the apparatus to perform a method and/or a solution according to the aforementioned embodiments of the present application.
It will be evident to those skilled in the art that the present application is not limited to the details of the foregoing illustrative embodiments, and that the present application may be embodied in other specific forms without departing from the spirit or essential attributes thereof. The present embodiments are therefore to be considered in all respects as illustrative and not restrictive, the scope of the application being indicated by the appended claims rather than by the foregoing description, and all changes which come within the meaning and range of equivalency of the claims are therefore intended to be embraced therein. Any reference sign in a claim should not be construed as limiting the claim concerned. Furthermore, it is obvious that the word "comprising" does not exclude other elements or steps, and the singular does not exclude the plural. A plurality of units or means recited in the apparatus claims may also be implemented by one unit or means in software or hardware. The terms first, second, etc. are used to denote names, but not any particular order.
Claims (9)
1. A message queue retry method is applied to a message negotiator end of a message queue, wherein the method comprises the following steps:
receiving a target message from a producer of a message, the target message comprising a message body;
recording the creation time and the retried times of the target message, and configuring an expiration time and retriable total retried times for the target message;
and sending the target message and the corresponding creation time, the retried times, the total testing times and the expiration time to corresponding consumers.
2. The method of claim 1, wherein the method further comprises:
setting an identifier in the target message for indicating whether the target message is the last retry or not;
receiving a retry request of the target message sent by the consumer and determining a retry time;
if the retry time exceeds the expiration time and the identifier is used for indicating that the target message is not the last retry, setting the identifier as the identifier used for indicating that the target message is the last retry;
sending the identification indicating that the target message is a last retry to the consumer.
3. The method of claim 1, wherein the method further comprises:
initializing the target message to zero retries when the target message is received from a producer of the message.
4. The method of claim 3, wherein the method further comprises:
and if the consumption of the target message at the consumer end fails, accumulating the retried times of the target message when receiving the retry request of the target message from the message negotiator.
5. A message queue retry method is applied to a consumer end of a message queue, wherein the method comprises the following steps:
receiving a target message sent by a message negotiator of a message queue and corresponding creation time, retried times, total retry times and expiration time of the target message, wherein the target message comprises a message body;
when the target message is consumed, judging whether the target message is retried for the last time according to the retried times and the total retried times, if so, finishing the retries of the target message when the target message is consumed unsuccessfully; or the like, or, alternatively,
and when the target message is consumed, judging whether the target message is allowed to continuously retry according to the creation time and the expiration time, if not, finishing the retry of the target message when the consumption of the target message fails.
6. The method of claim 5, wherein, when consuming the target message, after determining whether the target message is allowed to retry again according to the creation time and the expiration time, the method further comprises:
if yes, initiating a retry request of the target message to the message negotiator;
receiving an identifier sent by the message negotiator and used for indicating that the target message is the last retry;
after the target message is consumed again, if the target message is not consumed, the retry of the target message is finished.
7. A non-transitory storage medium having stored thereon computer readable instructions which, when executed by a processor, cause the processor to implement the method of any one of claims 1 to 6.
8. A message negotiator for message queue retries, wherein the message negotiator includes:
one or more processors;
a computer-readable medium for storing one or more computer-readable instructions,
when executed by the one or more processors, cause the one or more processors to implement the method of any one of claims 1-4.
9. A consumer-side of message queue retries, wherein the consumer-side comprises:
one or more processors;
a computer-readable medium for storing one or more computer-readable instructions,
when executed by the one or more processors, cause the one or more processors to implement the method of claim 5 or 6.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202110373575.8A CN113064741B (en) | 2021-04-07 | 2021-04-07 | Message queue retry method and device |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202110373575.8A CN113064741B (en) | 2021-04-07 | 2021-04-07 | Message queue retry method and device |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN113064741A true CN113064741A (en) | 2021-07-02 |
| CN113064741B CN113064741B (en) | 2022-04-12 |
Family
ID=76566078
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN202110373575.8A Active CN113064741B (en) | 2021-04-07 | 2021-04-07 | Message queue retry method and device |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN113064741B (en) |
Cited By (3)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN113900842A (en) * | 2021-12-10 | 2022-01-07 | 飞狐信息技术（天津）有限公司 | Message consumption method and device, electronic equipment and computer storage medium |
| CN114138506A (en) * | 2021-11-08 | 2022-03-04 | 广州华多网络科技有限公司 | Message queue scheduling method and device, equipment, medium and product thereof |
| CN115333942A (en) * | 2022-08-10 | 2022-11-11 | 北京搜房科技发展有限公司 | Event retry method and device, storage medium and electronic equipment |
Citations (5)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US20090104906A1 (en) * | 2007-10-19 | 2009-04-23 | Samsung Electronics Co., Ltd. | Logical connection establishment method for mobile terminal |
| WO2017219867A1 (en) * | 2016-06-24 | 2017-12-28 | 中兴通讯股份有限公司 | Short message retry processing method, apparatus and system |
| CN110995851A (en) * | 2019-12-11 | 2020-04-10 | 贝壳技术有限公司 | Message processing method, device, storage medium and equipment |
| CN111510469A (en) * | 2019-01-31 | 2020-08-07 | 上海哔哩哔哩科技有限公司 | Message processing method and device |
| CN112328418A (en) * | 2020-11-27 | 2021-02-05 | 行吟信息科技（上海）有限公司 | Method and system for improving MQ synchronization reliability |
-
2021
- 2021-04-07 CN CN202110373575.8A patent/CN113064741B/en active Active
Patent Citations (6)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US20090104906A1 (en) * | 2007-10-19 | 2009-04-23 | Samsung Electronics Co., Ltd. | Logical connection establishment method for mobile terminal |
| WO2017219867A1 (en) * | 2016-06-24 | 2017-12-28 | 中兴通讯股份有限公司 | Short message retry processing method, apparatus and system |
| CN107548039A (en) * | 2016-06-24 | 2018-01-05 | 中兴通讯股份有限公司 | A kind of short message retries processing method and processing device, system |
| CN111510469A (en) * | 2019-01-31 | 2020-08-07 | 上海哔哩哔哩科技有限公司 | Message processing method and device |
| CN110995851A (en) * | 2019-12-11 | 2020-04-10 | 贝壳技术有限公司 | Message processing method, device, storage medium and equipment |
| CN112328418A (en) * | 2020-11-27 | 2021-02-05 | 行吟信息科技（上海）有限公司 | Method and system for improving MQ synchronization reliability |
Non-Patent Citations (1)
| Title |
|---|
| 汪涛: "Kafka 中 Broker 节点磁盘问题的故障处理方法", 《现代信息科技》 * |
Cited By (4)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN114138506A (en) * | 2021-11-08 | 2022-03-04 | 广州华多网络科技有限公司 | Message queue scheduling method and device, equipment, medium and product thereof |
| CN113900842A (en) * | 2021-12-10 | 2022-01-07 | 飞狐信息技术（天津）有限公司 | Message consumption method and device, electronic equipment and computer storage medium |
| CN115333942A (en) * | 2022-08-10 | 2022-11-11 | 北京搜房科技发展有限公司 | Event retry method and device, storage medium and electronic equipment |
| CN115333942B (en) * | 2022-08-10 | 2023-10-27 | 北京搜房科技发展有限公司 | Event retry method and device, storage medium and electronic equipment |
Also Published As
| Publication number | Publication date |
|---|---|
| CN113064741B (en) | 2022-04-12 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN113064741B (en) | Message queue retry method and device | |
| EP3399692B1 (en) | Method and apparatus for upgrading distributed storage system | |
| CN111813791B (en) | Distributed transaction compensation method and equipment | |
| WO2020108325A1 (en) | Transaction processing method, apparatus and device | |
| CN111143093B (en) | Asynchronous message distributed processing method, device, equipment and storage medium | |
| CN107168775B (en) | Method and device for automatically processing suspension affairs | |
| CN109426550B (en) | Resource scheduling method and equipment | |
| US10819611B2 (en) | Dynamic timeout-based fault detection | |
| CN113301009A (en) | Method and device for processing sequence messages | |
| CN110764930B (en) | Request or response processing method and device based on message mode | |
| CN110858166A (en) | Application exception processing method and device, storage medium and processor | |
| WO2024169672A1 (en) | Distributed scheduling method and system | |
| CN114679503A (en) | Market data processing method, system and equipment | |
| CN110673935A (en) | Job scheduling method and device based on Kubernetes system and storage medium | |
| CN113556389A (en) | RPC type cloud side end communication method, system and storage medium | |
| CN114510459A (en) | Distributed lock management method and system based on Redis cache system | |
| CN110888723A (en) | Timing task processing method and device | |
| CN112769928A (en) | Information interaction method and device based on service scene | |
| CN112596882A (en) | Method, device and system for scheduling delayed tasks | |
| CN112199168A (en) | Task processing method, device and system and task state interaction method | |
| CN112882655A (en) | Data caching method and device, electronic equipment and storage medium | |
| CN114510495B (en) | Database service data consistency processing method and system | |
| WO2021259240A1 (en) | Distributed transaction processing method, terminal and computer readable storage medium | |
| CN118509490B (en) | Hot spot data degradation method and device considering relationship between service ends | |
| CN112486478B (en) | Event processing method and device based on field driving |
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 |