Retry handling in messaging queues

Patent metadata

Field	Value
Publication number	US-10819648-B2
Application number	US-201715634958-A
Country	US
Kind code	B2
Filing date	Jun 27, 2017
Priority date	Jun 27, 2017
Publication date	Oct 27, 2020
Grant date	Oct 27, 2020

Abstract

In one embodiment, a computer-implemented method comprises receiving a plurality of digital data messages in a first-in first-out (FIFO) primary queue of an electronic digital memory that is coupled to a message consuming process that is executed using computer instructions that are programmed to serially obtain messages from the primary queue and to process the messages; determining that processing a first message of the plurality of messages has failed; in response to determining that processing the first message failed, using the message consuming process, sending a first acknowledgement to the primary queue, sending the first message to a retry queue that is different from the primary queue, and processing one or more other messages from the primary queue; obtaining the first message from the retry queue; reprocessing the first message; repeating periodically selecting and processing one or more other messages from the primary queue and periodically selecting and processing one or more different other messages from the retry queue.

First claim

What is claimed is:

1. A computer-implemented method comprising:
receiving a plurality of digital data messages in a first-in first-out (FIFO) primary queue of an electronic digital memory that is coupled to a message consuming process that is executed using computer instructions that are programmed to serially obtain messages from the primary queue and to process the messages;
determining that processing a first message of the plurality of messages has failed;
in response to determining that processing the first message failed, using the message consuming process, sending a first acknowledgement to the primary queue, the first acknowledgement indicative that processing the first message was successful, sending the first message to a retry queue that is different from the primary queue, and processing one or more other messages from the primary queue;
obtaining the first message from the retry queue;
reprocessing the first message;
repeating periodically selecting and processing one or more other messages from the primary queue and periodically selecting and processing one or more different other messages from the retry queue.

2. The method of claim 1 , further comprising:
obtaining a message age value that is associated with the first message as part of obtaining the first message from the retry queue;
performing the reprocessing the of the first message from the retry queue only when the message age value satisfies a threshold.

3. The method of claim 2 , further comprising:
in response to determining that the message age value fails to satisfy the threshold, sending the first message to the retry queue and sending a second acknowledgement to the retry queue.

4. The method of claim 1 , further comprising:
in response to reprocessing the first message from the retry queue failing, sending the first message to the retry queue and sending a third acknowledgement to the retry queue.

5. The method of claim 1 , further comprising:
in response to determining that reprocessing the first message succeeded, sending a fourth acknowledgement to the retry queue.

6. The method of claim 1 , wherein the first acknowledgement causes the primary queue to remove the first message from the primary queue and send a new message to the message consuming process.

7. The method of claim 1 , wherein the plurality of messages are processed sequentially.

8. A computer system comprising:
a computing instance comprising one or more processors and one or more memories storing one or more sequences of instructions for a message consuming process which, when executed by the one or more processors, cause the one or more processors to perform:
obtaining digital data messages from a primary queue and processing the digital data messages, wherein the primary queue is a first-in first-out (FIFO) queue of an electronic digital memory that is coupled to the message consuming process;
determining that processing a first message of the digital data messages has failed;
in response to determining that processing the first message failed, using the message consuming process, sending a first acknowledgement to the primary queue, the first acknowledgement indicative that processing the first message was successful, sending the first message to a retry queue that is different from the primary queue, and processing one or more other messages from the primary queue;
obtaining the first message from the retry queue;
reprocessing the first message;
repeating periodically selecting and processing one or more other messages from the primary queue and periodically selecting and processing one or more different other messages from the retry queue.

9. The system of claim 8 , further comprising:
obtaining a message age value that is associated with the first message as part of obtaining the first message from the retry queue;
performing the reprocessing the of the first message from the retry queue only when the message age satisfies a threshold.

10. The system of claim 9 , further comprising:
in response to determining that the message age value fails to satisfy the threshold, sending the first message to the retry queue and sending a second acknowledgement to the retry queue.

11. The system of claim 8 , further comprising:
in response to reprocessing the first message from the retry queue failing, sending the first message to the retry queue and sending a third acknowledgement to the retry queue.

12. The system of claim 8 , further comprising:
in response to determining that reprocessing the first message succeeded, sending a fourth acknowledgement to the retry queue.

13. The system of claim 8 , wherein the first acknowledgement causes the primary queue to remove the first message from the primary queue and send a new message to the message consuming process.

14. The system of claim 8 , wherein the plurality of messages are processed sequentially.

15. One or more non-transitory computer readable media storing one or more sequences of instructions for a message consuming process which, when executed, cause:
obtaining digital data messages from a primary queue and to processing the digital data messages, wherein the primary queue is a first-in first-out (FIFO) queue of an electronic digital memory that is coupled to the message consuming process;
determining that processing a first message of the digital data messages has failed;
in response to determining that processing the first message failed, using the message consuming process, sending a first acknowledgement to the primary queue, the first acknowledgement indicative that processing the first message was successful, sending the first message to a retry queue that is different from the primary queue, and processing one or more other messages from the primary queue;
obtaining the first message from the retry queue;
reprocessing the first message;
repeating periodically selecting and processing one or more other messages from the primary queue and periodically selecting and processing one or more different other messages from the retry queue.

16. The one or more computer readable media of claim 15 , wherein the one or more sequences of instructions, when executed, further cause:
obtaining a message age value that is associated with the first message as part of obtaining the first message from the retry queue;
performing the reprocessing the of the first message from the retry queue only when the message age satisfies a threshold.

17. The one or more computer readable media of claim 16 , wherein the one or more sequences of instructions, when executed, further cause:
in response to determining that the message age value fails to satisfy the threshold, sending the first message to the retry queue and sending a second acknowledgement to the retry queue.

18. The one or more computer readable media of claim 15 , wherein the one or more sequences of instructions, when executed, further cause:
in response to reprocessing the first message from the retry queue failing, sending the first message to the retry queue and sending a third acknowledgement to the retry queue.

19. The one or more computer readable media of claim 15 , wherein the one or more sequences of instructions, when executed, further cause:
in response to determining that reprocessing the first message succeeded, sending a fourth acknowledgement to the retry queue.

20. The one or more computer readable media of claim 15 , wherein the first acknowledgement causes the primary queue to remove the first message fr

Assignees

• Atlassian Pty Ltd
• Atlassian Inc

Inventors

• Katkov Igor
• Kudinov Alex

Classifications

• H04L47/56 Primary

  implementing delay-aware scheduling · CPC title

• H04L47/621

  Individual queue per connection or flow, e.g. per VC · CPC title

• H04L47/6245

  Modifications to standard FIFO or LIFO · CPC title

• H04L41/069

  using logs of notifications; Post-processing of notifications · CPC title

• H04L47/626 Primary

  channel conditions · CPC title