Interleaved Queue Selective Object Processing

Resolve Bottlenecks,
Find Innovative Solutions
Generate Solutions

Solution Overview

Problem

Existing queue management systems face challenges in prioritizing processing of objects, leading to errors and delays, particularly when non-prioritized objects need to be processed before prioritized ones, and consecutive processing of prioritized objects can cause untenable delays in non-prioritized object processing.

Innovation Solution

Implementing a temporal queue and a prioritized queue, referred to as an interleaved queue, which maintains the temporal order of object receipt and prioritizes processing based on priority levels, allowing selective processing from either queue to prevent out-of-order processing and reduce delays.

Engineering Contradictions & Design Principles

VSEngineering Contradiction Analysis

1Reliability

If objects are processed strictly in temporal order from a single queue, then processing order accuracy is maintained, but processing efficiency and responsiveness to high-priority objects deteriorates

Engineering Contradiction:
Improveprocessing order accuracyVSAvoidprocessing efficiency
Core Design Contradiction:
ReliabilityVSProductivity

Solution Approach 1:

The patent divides a single queue into two separate queues: a temporal queue that maintains objects in received order and a prioritized queue that handles high-priority objects. This segmentation allows the system to process high-priority objects efficiently while preserving temporal order for regular objects, resolving the contradiction between processing efficiency and order accuracy.

Inventive Principle:
Principle #1Segmentation

2Speed

If high-priority objects are processed first from a prioritized queue, then responsiveness to critical tasks improves, but temporal order processing and fairness to lower-priority objects deteriorates

Engineering Contradiction:
Improveresponsiveness to high-priority objectsVSAvoidtemporal order processing
Core Design Contradiction:
SpeedVSReliability

Solution Approach 1:

The patent introduces a queue selector as an intermediary component that decides which queue to process from based on the current state. The selector monitors both queues and determines whether to process from the temporal queue or the prioritized queue, ensuring that high-priority objects are handled Responsively while maintaining overall temporal order integrity through controlled selection.

Inventive Principle:
Principle #24Intermediary (Mediator)

3Productivity

If consecutive prioritized objects are processed in succession, then high-priority task completion speed increases, but delays to non-prioritized object processing become untenable

Engineering Contradiction:
Improvehigh-priority task completion speedVSAvoiddelay to non-prioritized objects
Core Design Contradiction:
ProductivityVSLoss of time

Solution Approach 1:

The patent implements periodic switching between processing from the temporal queue and the prioritized queue. Instead of continuously processing only prioritized objects, the system periodically checks both queues and switches processing sources, ensuring that high-priority objects are completed efficiently while preventing excessive delays to non-prioritized objects through rhythmic alternation.

Inventive Principle:
Principle #19Periodic action

Data Source

PatentUS10268510B1Selective prioritization of processing of objects
Publication Date: 2019.04.23 JUNIPER NETWORKS INC
  • US10268510B1 patent drawing
  • US10268510B1 patent drawing
  • US10268510B1 patent drawing

AI summary

A device may receive one or more first objects and one or more second objects to be processed. The device may store, in a first queue, information identifying the one or more first objects, the one or more second objects, and an order in which the one or more first objects and the one or more second objects were received. The device may store, in a second queue, information identifying the one or more first objects based on the one or more first objects being associated with the first priority level. The device may process the one or more first objects and the one or more second objects based on the first queue and the second queue. The device may perform one or more actions based on processing the one or more first objects and the one or more second objects.