Transaction Queue Sorting for Priority Processing
Find Innovative SolutionsGenerate Solutions
Solution Overview
Problem
Enterprise Service Bus (ESB) systems face challenges in processing messages with repeating elements, as they typically process elements in the order they appear, which can lead to high-priority transactions being delayed, such as those with high fraud probability, during end-of-day transaction processing.
Innovation Solution
A computer system and method for managing a queue of transactions that determines a sort order and sorts batches of transactions accordingly, notifying when each batch is ready for processing, allowing higher priority transactions to be processed first.
Engineering Contradictions & Design Principles
Engineering Contradiction Analysis
1Ease of operation
If transactions are processed in the order they appear in the queue, then processing simplicity is maintained, but high-priority transactions are delayed
Solution Approach 1:
The patent applies preliminary action by sorting transactions into batches based on priority criteria before processing begins. The system pre-establishes sort orders and batches high-priority transactions (such as those with high fraud probability) to be processed first, rather than waiting for them to naturally appear at the front of the queue during sequential processing.
2Loss of time
If the entire queue is sorted before processing, then transaction priority is optimized, but processing time increases
Solution Approach 1:
The patent applies segmentation by dividing the transaction queue into multiple batches based on priority criteria. Instead of sorting and processing all transactions as a single large batch, the system segments them into smaller batches (e.g., high-priority batch, medium-priority batch, low-priority batch) that can be processed separately and in parallel, reducing overall processing time while maintaining priority optimization.
Solution Approach 2:
The patent applies partial action by sorting and processing only the necessary portion of transactions at each stage. The system identifies and processes high-priority transactions in the first batch without requiring complete sorting of the entire queue beforehand, thus achieving priority optimization for critical transactions while avoiding the overhead of sorting all transactions.
3Productivity
If batches are processed sequentially without sorting, then processing speed is maintained, but service level agreements may not be met
Solution Approach 1:
The patent applies preliminary action by pre-sorting transactions into batches according to priority criteria before processing begins. This ensures that when batches are processed sequentially, the high-priority transactions are already positioned in the first batch to be processed first, guaranteeing service level agreement compliance for critical transactions while maintaining efficient sequential processing.
Data Source
AI summary
A queue of transactions is managed. A sort order for the queue of transaction is determined. A first batch of transactions is sorted according to the determined sort order and a further batch of transactions is also sorted according to the determined sort order. A notifying is performed that the first batch of transactions is ready for processing and that the further batch of transactions is ready for processing. The sorting and notifying for further batches of the transactions continues until all the transactions in the queue have been sorted and notified as ready for processing.