Distributed Parallel Queuing for Call Management
Find Innovative SolutionsGenerate Solutions
Solution Overview
Problem
Conventional call management systems result in high likelihood of missed calls and inefficiencies due to long wait times and centralized queuing, which fails to manage large volumes of callers effectively in parallel.
Innovation Solution
A distributed parallel queuing system that dynamically allocates computing nodes and time slots to manage calls, allowing callers to be assigned to sub-queues and processed in parallel, reducing wait times by initiating communication sessions at specified times based on priority and availability.
Engineering Contradictions & Design Principles
Engineering Contradiction Analysis
1Device complexity
If a centralized queue is used to manage calls, then the system is simple to implement, but the wait time for callers increases and productivity decreases
Solution Approach 1:
The patent divides a single centralized queue into multiple parallel sub-queues, each managed by a separate computing node. This segmentation allows simultaneous processing of multiple callers across different sub-queues, reducing individual wait times while maintaining system simplicity through modular architecture.
Solution Approach 2:
The patent transitions from a single-dimensional centralized queue to a multi-dimensional distributed queue system across multiple computing nodes. By adding the dimension of parallel processing across multiple nodes, the system reduces wait times without proportionally increasing complexity.
2Device complexity
If a centralized queue is used to manage calls, then the implementation is straightforward, but the system cannot effectively manage large volumes of callers in parallel
Solution Approach 1:
The patent segments the call management system into multiple independent computing nodes, each handling a subset of callers through dedicated sub-queues. This enables parallel processing of large volumes of callers while keeping each node's complexity manageable and straightforward to implement.
Solution Approach 2:
The patent combines multiple simple queue management systems into a coordinated distributed system. Each computing node operates independently with simple logic, but together they achieve high parallel processing capacity for managing large volumes of callers simultaneously.
3Ease of operation
If callers are placed in a traditional queue, then all callers are managed in a single line, but this results in long wait times and loss of productivity
Solution Approach 1:
The patent segments the single-line queue into multiple parallel sub-queues distributed across computing nodes. Callers are routed to appropriate sub-queues based on their needs, enabling simultaneous processing and significantly reducing wait times while maintaining ease of operation through automated routing.
Solution Approach 2:
The patent implements preliminary routing of callers to appropriate sub-queues based on their requirements before queuing begins. This preliminary classification enables more efficient parallel processing and reduces overall wait times while keeping the system easy to operate through automated decision-making.
Data Source
AI summary
One example method of operation may include receiving an access request from a user device, creating a current queue position status of a user profile associated with the user device based on one or more known status identifiers associated with the user device, assigning the user profile to a sub-queue and a specified time slot of a queue, managed by a computing node, among various other user profiles stored in the queue, and initiating a communication session to the user device at a specific time.