High Performance Time-Based Queue

Abstract

Devices, networks, systems, methods, and processes for utilizing a time-based queue are described herein. A device may receive an object stream comprising multiple objects. The device may assign a Time-To-Live (TTL) value for each object in the object stream and a maximum TTL value for the object stream. The device may create and store the time-based queue in a memory based on the maximum TTL value. The device may insert the objects in the time-based queue at corresponding object insertion times. The device can pop the objects out of the time-based queue in First-In-First-Out (FIFO) order. The objects may expire when time periods indicated by corresponding TTL values elapse after the corresponding object insertion times. The device can further remove the expired objects from the time-based queue. The time-based queue stored in the memory can include references to the objects stored in a time-based storage in form of an array.

Dependencies are inferred from the claim text.