IP Library Granted Patent US 9,942,340
Granted Patent B2
US 9,942,340 · App. 15/617,575 · Granted Apr 10, 2018

Scalable, real-time messaging system

Inventors: Lev Walkin (Santa Clara, CA); Fredrik Erik Linder (Dublin, CA)
Assignee: SATORI WORLDWIDE, LLC
H04L67/26H04L47/801H04L47/826H04L51/04H04L51/14
View Patent ↗
Loading inventors, assignments & file history…
Monitor This Case
Get email alerts when status or documents change.
Order Certified Copies
Most orders are placed with the USPTO same day — all within 24 business hours.
Order via The Patent Place →
Pre-filled with this patent's details
Quick Facts
Patent No.
US 9,942,340
App. No.
15/617,575
Granted
Apr 10, 2018
Kind
B2
Abstract

Methods, systems, and apparatus, including computer programs encoded on a computer storage medium, for receiving from a plurality of publisher clients a plurality of messages, assigning each of the messages to one of a plurality of distinct channels wherein each channel comprises an ordered plurality of messages, storing messages of each of the channels in one or more respective buffers according to the order, each buffer having a respective time-to-live, retrieving messages for one or more of the channels from respective buffers having time-to-lives that have not expired and according to the order, and sending the retrieved messages to a plurality of subscriber clients.

Claims (49)

1. A computer-implemented method, comprising:

storing messages of each of a plurality of channels in one or more respective buffers according to an order,

wherein each message is associated with a particular one of the plurality of channels, and

wherein each buffer comprises a respective time-to-live; and

retrieving messages for the particular channel from the one or more respective buffers allocated to the channel that have not expired and according to the order.

2. The method of claim 1 , comprising:

receiving a plurality of messages from a plurality of publisher clients.

3. The method of claim 2 , wherein the order comprises the order in which messages for the channel were received.

4. 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 channel.

5. The method of claim 1 , wherein the particular channel is initiated by a message from a publisher client.

6. The method of claim 1 , wherein storing messages of each of the plurality of channels comprises:

identifying a first buffer for storing messages of the particular channel;

ordering 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.

7. The method of claim 6 , 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.

8. The method of claim 1 , wherein storing messages of each of the plurality of channels comprises:

storing messages of each channel earlier in the order in buffers having time-to-lives that will expire sooner than buffers used to store messages of each channel later in the order.

9. The method of claim 1 , wherein retrieving messages for the particular channel is initiated by a connection from a subscriber client subscribing to the particular channel.

10. The method of claim 1 , comprising:

sending messages retrieved for the particular channel to one or more subscriber clients that have subscribed to the particular channel.

11. A system, comprising:

one or more computer processors programmed to perform operations comprising:

storing messages of each of a plurality of channels in one or more respective buffers according to an order,

wherein each message is associated with a particular one of the plurality of channels, and

wherein each buffer comprises a respective time-to-live; and

retrieving messages for the particular channel from the one or more respective buffers allocated to the channel that have not expired and according to the order.

12. The system of claim 11 , wherein the operations further comprise:

receiving a plurality of messages from a plurality of publisher clients.

13. The system of claim 12 , wherein the order comprises the order in which messages for the channel were received.

14. 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 channel.

15. The system of claim 11 , wherein the particular channel is initiated by a message from a publisher client.

16. The system of claim 11 , wherein the operation of storing messages of each of the plurality of channels comprises:

identifying a first buffer for storing messages of the particular channel;

ordering 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.

17. The system of claim 11 , wherein the operation of storing messages of each of the plurality of channels comprises:

storing messages of each channel earlier in the order in buffers having time-to-lives that will expire sooner than buffers used to store messages of each channel later in the order.

18. The system of claim 11 , wherein retrieving messages for the particular channel is initiated by a connection from a subscriber client subscribing to the particular channel.

19. The system of claim 11 , wherein the operations further comprise:

sending messages retrieved for the particular channel to one or more subscriber clients that have subscribed to the particular channel.

20. An article, comprising:

a non-transitory computer-readable medium having instructions stored thereon that, when executed by one or more computer processors, cause the computer processors to perform operations comprising:

storing messages of each of a plurality of channels in one or more respective buffers according to an order,

wherein each message is associated with a particular one of the plurality of channels, and

wherein each buffer comprises a respective time-to-live; and

retrieving messages for the particular channel from the one or more respective buffers allocated to the channel that have not expired and according to the order.

Assignments (6)
RELEASE OF SECURITY INTEREST Recorded May 19, 2020
From: COMERICA BANK
To: SATORI WORLDWIDE, LLC
Reel/Frame 052707/0769 →
RELEASE OF SECURITY INTEREST Recorded May 19, 2020
From: MGG INVESTMENT GROUP LP, AS COLLATERAL AGENT
To: MACHINE ZONE, INC.; SATORI WORLDWIDE, LLC; COGNANT LLC
Reel/Frame 052706/0917 →
SECURITY INTEREST Recorded May 22, 2018
From: SATORI WORLDWIDE, LLC
To: COMERICA BANK
Reel/Frame 046215/0159 →
NOTICE OF SECURITY INTEREST -- PATENTS Recorded Feb 2, 2018
From: MACHINE ZONE, INC.; SATORI WORLDWIDE, LLC; COGNANT LLC
To: MGG INVESTMENT GROUP LP, AS COLLATERAL AGENT
Reel/Frame 045237/0861 →
ASSIGNMENT OF ASSIGNOR'S INTEREST Recorded Nov 13, 2017
From: MACHINE ZONE, INC.
To: SATORI WORLDWIDE, LLC
Reel/Frame 044428/0652 →
ASSIGNMENT OF ASSIGNOR'S INTEREST Recorded Jun 20, 2017
From: WALKIN, LEV; LINDER, FREDRIK ERIK
To: MACHINE ZONE, INC.
Reel/Frame 042761/0022 →
Continuity (3)
Continuation 15223392 · Jul 26, 2016
Continuation 14821416 · Aug 7, 2015
Related Publication 20170272529A1 · Sep 21, 2017