Scalable, real-time messaging system

US10182124B2 · US · B2

Patent metadata
FieldValue
Publication numberUS-10182124-B2
Application numberUS-201815908303-A
CountryUS
Kind codeB2
Filing dateFeb 28, 2018
Priority dateAug 7, 2015
Publication dateJan 15, 2019
Grant dateJan 15, 2019

How to read this patent

A practical reading order for non-experts. Skip the full description unless you need deep technical detail.

  1. Title

    What the patent document calls the invention.

  2. Abstract

    A short plain-language summary of the technical disclosure.

  3. Assignees and inventors

    Who owns or filed the patent and who is credited as inventor.

  4. Key dates

    Filing, priority, publication, and grant dates set the timeline.

  5. First independent claim

    The legal scope of protection — read this for what is actually claimed.

  6. CPC / IPC classifications

    Technology tags used to group this patent with similar filings.

  7. Citations and related patents

    Prior art links and similar publications in this corpus.

Abstract

Official abstract text for this publication.

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

Opening claim text (preview).

What is claimed is: 1. A method, comprising: 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; and 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. 2. The method of claim 1 , comprising: receiving the messages from a plurality of publisher clients. 3. The method of claim 1 , comprising: storing the messages of each of the plurality of channels in the one or more respective buffers according to the order. 4. The method of claim 1 , wherein the order comprises the order in which the messages for the channel are received. 5. The method of claim 1 , wherein expiration of the time-to-live of each buffer is based on when the buffer was allocated to the particular channel. 6. The method of claim 1 , wherein the particular channel is initiated by a message from a publisher client. 7. The method of claim 1 , comprising: identifying a first buffer to store the messages of the particular channel; ordering the messages for the particular channel based on, at least in part, a respective time each of the messages was received from respective publisher clients; and storing a first portion of the messages of the particular channel as ordered in the first buffer. 8. The method of claim 7 , comprising: determining that the first buffer is full; and, based thereon: identifying a second buffer; and storing a different second portion of the messages of the particular channel as ordered in the second buffer. 9. The method of claim 1 , comprising: storing the messages of each channel earlier in the 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. 10. The method of claim 1 , wherein retrieval of the messages for the particular channel is initiated by a connection from the one or more subscriber clients subscribing to the particular channel. 11. A system, comprising: one or more computer processors programmed to perform operations to: retrieve 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; and send the messages retrieved for the particular channel to one or more subscriber clients that have subscribed to the particular channel. 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 the operations are further to: store the messages of each of the plurality of channels in the one or more respective buffers according to the order. 14. The system of claim 11 , wherein the order comprises the order in which the messages for the channel are received. 15. The system of claim 11 , wherein expiration of the time-to-live of each buffer is based on when the buffer was allocated to the particular channel. 16. The system of claim 11 , wherein the particular channel is initiated by a message from a publisher client. 17. The system of claim 11 , wherein the operations are further to: identify a first buffer to store the messages of the particular channel; order the messages for the particular channel based on, at least in part, a respective time each of the messages was received from respective publisher clients; and store a first portion of the messages of the particular channel as ordered in the first buffer. 18. The system of claim 17 , wherein the operations are further to: determine that the first buffer is full; and, based thereon: identify a second buffer; and store a different second portion of the messages of the particular channel as ordered in the second buffer. 19. The system of claim 11 , wherein the operations are further to: store the messages of each channel earlier in the 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. 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: retrieve 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; and send the messages retrieved for the particular channel to one or more subscriber clients that have subscribed to the particular channel.

Assignees

Inventors

Classifications

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

  • Involving periods of time · CPC title

  • Real time traffic · CPC title

  • H04L67/26Primary

    Electricity · mapped topic

  • Electricity · mapped topic

Patent family

Related publications grouped by family.

External sources

Frequently asked questions

Answers are generated from the same data shown on this page.

What does patent US10182124B2 cover?
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 sen…
Who is the assignee on this patent?
Satori Worldwide Llc
What technology area does this patent fall under?
Primary CPC classification H04L67/26. Mapped technology areas include Electricity.
When was this patent published?
Publication date Tue Jan 15 2019 00:00:00 GMT+0000 (Coordinated Universal Time) (B2). Legal status and post-grant events are not shown on this page.
What related patents are in patentsdb?
We list 12 related publications on this page (citations in our corpus or others sharing the same primary CPC).