Scalable, real-time messaging system

Patent metadata

Field	Value
Publication number	US-10637947-B2
Application number	US-201816213162-A
Country	US
Kind code	B2
Filing date	Dec 7, 2018
Priority date	Aug 7, 2015
Publication date	Apr 28, 2020
Grant date	Apr 28, 2020

Abstract

A publish-subscribe messaging systems and methods are described. A method may include retrieving, by one or more computer processors, messages for a particular one of a plurality of channels from one or more respective buffers allocated to the particular channel that have not expired and according to an order, wherein each buffer comprises a respective time-to-live. The method also includes sending, by the one or more computer processors, the messages retrieved for the particular channel to one or more subscriber clients that have subscribed to the particular channel.

First claim

What is claimed is:

1. A method, comprising:
storing messages of each of a plurality of channels in one or more respective buffers,
wherein each buffer comprises a respective time-to-live; and

sending, by one or more computer processors, the messages for a channel of the plurality of channels retrieved from the one or more respective buffers allocated to the channel that have not expired.

2. The method of claim 1 , comprising:
receiving the messages from a plurality of publisher clients.

3. The method of claim 1 , wherein each message is associated with a particular one of the plurality of channels.

4. The method of claim 1 , wherein the messages of each of the plurality of channels are stored in the one more respective buffers according to an order.

5. The method of claim 4 , wherein the order comprises the order in which messages for each of the plurality of channels are received.

6. The method of claim 1 , wherein storing messages of each of the plurality of channels in the one or more respective buffers comprises:
storing the messages of each channel earlier in an order in buffers having time-to-lives that will expire sooner than buffers used to store the messages of each channel later in the order.

7. The method of claim 1 , comprising:
retrieving the messages for the channel from the one or more respective buffers allocated to the channel according to an order.

8. The method of claim 1 , wherein the retrieved messages for the channel are sent to one or more subscriber clients that have subscribed to the channel.

9. The method of claim 1 , wherein expiration of the time-to-live of each buffer is based on when the buffer was allocated to a particular channel.

10. The method of claim 1 , comprising:
identifying a first buffer for storing the messages of a particular channel;
ordering the messages for the particular channel based on, at least in part, a respective time each of the messages was received; and
storing a first portion of the messages of the particular channel as ordered in the first buffer.

11. A system, comprising:
one or more computer processors programmed to perform operations to:
store messages of each of a plurality of channels in one or more respective buffers,
wherein each buffer comprises a respective time-to-live; and

send the messages for a channel of the plurality of channels retrieved from the one or more respective buffers allocated to the channel that have not expired.

12. The system of claim 11 , wherein the operations are further to:
receive the messages from a plurality of publisher clients.

13. The system of claim 11 , wherein each message is associated with a particular one of the plurality of channels.

14. The system of claim 11 , wherein the messages of each of the plurality of channels are stored in the one more respective buffers according to an order.

15. The system of claim 14 , wherein the order comprises the order in which the messages for each of the plurality of channels are received.

16. The system of claim 11 , wherein to store messages of each of the plurality of channels in the one or more respective buffers the one or more computer processors are further to:
store the messages of each channel earlier in an order in buffers having time-to-lives that will expire sooner than buffers used to store the messages of each channel later in the order.

17. The system of claim 11 , wherein the operations are further to:
retrieve the messages for the channel from the one or more respective buffers allocated to the channel according to an order.

18. The system of claim 11 , wherein the retrieved messages for the channel are sent to one or more subscriber clients that have subscribed to the channel.

19. The system of claim 11 , wherein expiration of the time-to-live of each buffer is based on when the buffer was allocated to a particular channel.

20. A non-transitory computer-readable medium having instructions stored thereon that, when executed by one or more computer processors, cause the one or more computer processors to:
store messages of each of a plurality of channels in one or more respective buffers,
wherein each buffer comprises a respective time-to-live; and

send, by the one or more computer processors, the messages for a channel of the plurality of channels retrieved from the one or more respective buffers allocated to the channel that have not expired.

Assignees

• Satori Worldwide Llc

Inventors

• Walkin Lev
• Linder Fredrik Erik

Classifications

• H04L47/801

  Real time traffic · CPC title

• H04L47/826

  Involving periods of time · CPC title

• H04L51/04

  Real-time or near real-time messaging, e.g. instant messaging [IM] · CPC title

• H04L51/14

  Electricity · mapped topic

• H04L67/26 Primary

  Electricity · mapped topic