Processing Request Management for Virtualized Network Scheduling
Find Innovative SolutionsGenerate Solutions
Solution Overview
Problem
Conventional technologies face difficulties in minimizing the number of orders that violate execution restrictions, such as processing completion time limits and execution order restrictions, in virtualized communication networks, particularly in scheduling and combining orders.
Innovation Solution
A processing request management apparatus that includes an estimation unit to calculate the time required for processing each request and a determination unit to determine the execution order of requests, minimizing the sum of delays in estimated processing completion times, thereby optimizing the execution order and combining redundant orders to satisfy restrictions.
Engineering Contradictions & Design Principles
Engineering Contradiction Analysis
1Reliability
If conventional scheduling techniques (FIFO, PS, SPTF) are used, then processing orders can be executed, but it is difficult to minimize the number of orders that violate execution restrictions (processing completion time limit and execution order restrictions)
Solution Approach 1:
The patent transforms the order scheduling problem into a mathematical optimization problem by defining objective functions that quantify the satisfaction of execution restrictions. The system calculates violation degrees for each order based on processing completion time limits and execution order restrictions, then uses optimization algorithms to determine the execution sequence that minimizes total violations. This approach converts qualitative scheduling requirements into quantitative parameters that can be systematically optimized.
Solution Approach 2:
The patent introduces an order management apparatus as an intermediary between order input and execution. This intermediary component receives orders, evaluates them against execution restrictions, calculates violation degrees, and determines the optimal execution sequence. By inserting this mediation layer, the system can systematically consider multiple execution restrictions simultaneously without requiring complex direct coordination between orders.
2Loss of time
If processing completion time limit restriction is enforced, then time-sensitive orders can be completed on time, but orders with different time requirements cannot be efficiently prioritized
Solution Approach 1:
The patent transforms time-based scheduling into a multi-dimensional optimization problem by introducing violation degree calculations that consider both time sensitivity and execution order requirements. The system calculates expected violation degrees for each order based on its processing completion time limit and the current execution sequence, then optimizes the overall sequence to minimize total violations. This allows the system to dynamically prioritize time-sensitive orders while maintaining overall processing efficiency.
3Stability of the object's composition
If execution order restriction is enforced, then the intended execution sequence is maintained, but redundant processing occurs when similar orders cannot be combined
Solution Approach 1:
The patent combines multiple execution restrictions into a unified optimization framework that evaluates both processing completion time limits and execution order restrictions simultaneously. By calculating violation degrees for each order based on both types of restrictions and optimizing the execution sequence to minimize total violations, the system can identify opportunities to combine redundant orders that would otherwise violate execution order restrictions. This unified approach maintains execution stability while improving processing throughput.
Data Source
AI summary
A processing request management apparatus includes: an estimation unit which estimates a time required for processing for each of a plurality of processing requests for which desired processing completion times are designated; and a determination unit which determines an execution order of processing for the plurality of processing requests such that a sum of delays of estimated processing completion times based on the required time with respect to the desired processing completion times for the respective processing requests in the plurality of processing requests is minimized, to increase a likelihood of restrictions with respect to processing requests being satisfied.


