SLA-Aware Message Queueing for Enterprise Messaging

Resolve Bottlenecks,
Find Innovative Solutions
Generate Solutions

Solution Overview

Problem

Information handling systems face challenges in maintaining service level agreements (SLAs) for message delivery due to queue failures, where traditional first-in-first-out (FIFO) queues can cause delayed messages to miss delivery times, leading to inefficiencies and missed SLAs when servers are offline.

Innovation Solution

Implementing SLA-aware queues that enqueue and dequeue messages based on service level agreement criteria, such as delivery time, priority, and recipient, to ensure timely message delivery and maintain SLA compliance, even during server delays.

Engineering Contradictions & Design Principles

VSEngineering Contradiction Analysis

1Device complexity

If traditional FIFO queues are used for message delivery, then queue implementation is simple, but messages may miss delivery times when servers are offline

Engineering Contradiction:
Improvequeue implementation complexityVSAvoidSLA compliance
Core Design Contradiction:
Device complexityVSReliability

Solution Approach 1:

The patent implements dynamic queue management by transitioning from static FIFO ordering to dynamic SLA-aware ordering. The queue dynamically adjusts message processing order based on SLA delivery time requirements, priority levels, and recipient information. This allows the system to adapt message queue positioning in real-time based on changing SLA constraints, ensuring timely delivery while maintaining manageable complexity through structured sorting criteria.

Inventive Principle:
Principle #15Dynamics

Solution Approach 2:

The patent changes the key parameter for message ordering from simple arrival time (FIFO) to a composite parameter including SLA delivery time, priority level, and recipient. By transforming the sorting key from a single temporal parameter to a multi-dimensional parameter set, the system achieves SLA-compliant message delivery without fundamentally redesigning the queue architecture, thus balancing reliability improvement with implementation complexity.

Inventive Principle:
Principle #35Parameter changes

2Reliability

If SLA-aware queues are implemented to ensure timely delivery, then SLA compliance improves, but queue management complexity increases

Engineering Contradiction:
ImproveSLA complianceVSAvoidqueue management complexity
Core Design Contradiction:
ReliabilityVSDevice complexity

Solution Approach 1:

The patent segments the message queue into multiple priority levels or categories based on SLA requirements. By dividing the single queue into segmented priority-based sub-queues or tagged message sections, the system can manage SLA compliance through structured organization rather than complex real-time sorting algorithms. This segmentation approach reduces management complexity by pre-categorizing messages according to their delivery requirements.

Inventive Principle:
Principle #1Segmentation

Solution Approach 2:

The patent applies preliminary action by evaluating and sorting messages based on SLA delivery time, priority, and recipient information at the time of enqueueing. This preliminary sorting action establishes the message processing order in advance, reducing the need for complex real-time queue management decisions. By performing the sorting operation upfront when messages are received, the system achieves SLA compliance while simplifying subsequent message processing and reducing operational complexity.

Inventive Principle:
Principle #10Preliminary action

3Speed

If messages are prioritized by SLA delivery time, then timely message delivery improves, but message processing order becomes less predictable

Engineering Contradiction:
Improvemessage delivery speedVSAvoidmessage processing order predictability
Core Design Contradiction:
SpeedVSStability of the object's composition

Solution Approach 1:

The patent implements feedback mechanisms that monitor message delivery status and SLA compliance. By tracking which messages have been delivered, which are pending, and which have missed their SLA deadlines, the system can adjust processing priorities dynamically. This feedback loop provides predictability by allowing the system to learn from past performance patterns and optimize future message ordering decisions, balancing speed with predictable processing behavior.

Inventive Principle:
Principle #23Feedback

Solution Approach 2:

The patent applies dynamic adjustment of message processing order based on real-time conditions including SLA status, priority levels, and system load. The message queue dynamically reorders messages based on changing circumstances while maintaining deterministic sorting criteria. This dynamic approach ensures timely delivery by adapting to current system state while preserving predictability through consistent, rule-based decision logic that can be traced and verified.

Inventive Principle:
Principle #15Dynamics

Data Source

PatentUS10742565B2Enterprise messaging system using an optimized queueing model
Publication Date: 2020.08.11 DELL PROD LP
  • US10742565B2 patent drawing
  • US10742565B2 patent drawing
  • US10742565B2 patent drawing

AI summary

An information handling system includes a first provider module to provide a first message and a second provider module to provide a second message, a first memory structure, and a first intermediate integration module. The first intermediate integration module to dequeue the first message from the first queue of the first memory structure prior to the second message in response to a determination that the first delivery time is before the second delivery time, and in response to a determination that the first delivery time is substantially equal to the second delivery time: to determine a first message identifier sequence number for the first message and a second message identifier sequence number for the second message, and to dequeue the second message from the first queue prior to the first message in response to the second message identifier sequence number being lower than the first message identifier sequence number.