Sequence Recognition Engine for Telecommunication Message Queue Management
Find Innovative SolutionsGenerate Solutions
Solution Overview
Problem
Telecommunications systems face scalability issues due to inefficient resource scheduling and self-expanding performance measures, leading to performance degradation and potential deadlocks, especially under heavy loads, which can result in delayed processing of messages and resource contention.
Innovation Solution
Implementing a sequence recognition engine and exclusive access controller in a computer network to manage message queues, ensuring that partially complete sequences are handled promptly and fairly, with separate queues for each conversation to prevent resource contention and deadlocks, and using a probabilistic order for servicing threads to ensure timely processing.
Engineering Contradictions & Design Principles
Engineering Contradiction Analysis
1Device complexity
If a common first-come-first-serve (FCFS) work queue is used by processes wishing to acquire resources, then resource allocation is simplified, but the holding time of a resource increases due to contention for like resources, leading to self-expansion and performance degradation
Solution Approach 1:
The patent segments the common FCFS work queue into separate queues organized in a tree structure with multiple levels. Each queue contains processes waiting for specific resources, and the tree structure allows hierarchical processing. This segmentation prevents processes from one resource type from blocking processes for other resource types, thereby reducing resource holding time and eliminating the self-expansion problem while maintaining organized queue management.
2Productivity
If resources are scheduled using classical algorithms, then resource allocation is achieved, but the system may migrate from graceful function to overload and deadlock, resulting in poor load scalability
Solution Approach 1:
The patent implements dynamic queue servicing where the servicing order is determined by the current state of queues and resource availability. Rather than using fixed classical scheduling algorithms, the system dynamically adjusts which queue is serviced next based on real-time conditions. This dynamic approach allows the system to adapt to varying loads and prevents deadlock by continuously evaluating the system state, thereby maintaining reliability under heavy load while preserving allocation efficiency.
3Device complexity
If parallelism is not adequately exploited, then resource scheduling is simplified, but the system suffers from suboptimal scheduling and cannot handle increasing work volumes gracefully, reducing load scalability
Solution Approach 1:
The patent segments the scheduling mechanism into multiple independent queue handlers, each responsible for servicing specific queues in the tree structure. This segmentation enables parallelism by allowing multiple handlers to operate simultaneously on different queues. The tree structure naturally divides the workload into hierarchical levels, and each level can be processed in parallel by dedicated handlers, thereby exploiting parallelism to increase work processing capacity while maintaining manageable scheduling complexity through the structured approach.
Data Source
AI summary
A system for servicing a telecommunications conversation comprising one or more messages includes a sequence recognition engine for processing an incoming message, a queue for storing a sequence of messages of said conversation, a length indicator for a message subsequence eligible for processing, a state indicator of said message sequence, and an indicator of a most recently transmitted message of said message sequence. When a new message arrives the sequence recognition engine is invoked to place the message in a correct position in the queue and to determine a next state for the message sequence.