Nested Capacity Plan Linking to Reduce Iterative Processing
Find Innovative SolutionsGenerate Solutions
Solution Overview
Problem
Conventional systems require significant user input and iterative calculations for updating multiple capacity plans, consuming large processing resources and lacking flexibility in linking fixed and flexible capacity plans.
Innovation Solution
Linking capacity plans using a wrapper flexible capacity plan based on link and payment configurations, reducing the need for iterative calculations and allowing for flexible customization of payment applications across multiple capacity plans.
Engineering Contradictions & Design Principles
Engineering Contradiction Analysis
1Device complexity
If multiple capacity plans are stored and processed in a single database, then data storage is simplified, but processing power and computational resources required for concurrent processing increase significantly
Solution Approach 1:
The patent segments capacity plans into nested hierarchical structures with parent-child relationships. Each capacity plan is divided into discrete terms and conditions that can be independently processed and applied. This segmentation allows the system to handle multiple capacity plans more efficiently by processing them in organized groups rather than as monolithic entities, thereby reducing overall processing power requirements while maintaining comprehensive data storage in a single database.
2Reliability
If conventional systems update multiple capacity plans, then all plans can be maintained, but significant user input and iterative calculations are required consuming large processing resources
Solution Approach 1:
The patent implements preliminary action by pre-defining terms, conditions, and payment configurations for capacity plans before they are activated. The system stores predefined rules and parameters that automatically guide the updating process. When updates are needed, the system applies pre-established configurations rather than requiring iterative calculations and significant user input for each update, thereby maintaining reliable capacity plan management while reducing processing time and resource consumption.
3Adaptability or versatility
If fixed and flexible capacity plans are linked, then comprehensive capacity management is achieved, but system complexity increases
Solution Approach 1:
The patent applies the nested doll principle by creating a hierarchical structure where fixed and flexible capacity plans are nested within each other through parent-child relationships. A flexible capacity plan can contain multiple fixed capacity plans as children, or fixed plans can be linked to flexible parent plans. This nesting approach enables comprehensive capacity management and adaptability while maintaining manageable system complexity through organized, hierarchical groupings rather than flat complex interconnections.
4Measurement precision
If iterative calculations are used for updating capacity plans, then accurate updates can be performed, but processing resources and time are consumed
Solution Approach 1:
The patent implements self-service by enabling capacity plans to automatically apply updates based on predefined terms, conditions, and payment configurations. The system automatically determines how payments are applied to different capacity plans based on stored configurations, eliminating the need for manual iterative calculations. This maintains accurate updates by following predetermined business rules while significantly improving processing efficiency by automating what would otherwise require resource-intensive iterative computations.
Data Source
AI summary
Capacity plans may be linked in a nested hierarchy, with customizable linking configurations controlling how the capacity plans are linked. The linking configurations may control how an available credit of a flexible capacity plan is affected by linked capacity plans lower in the nested hierarchy. Payments may be applied to the linked capacity plans based on customizable payment configurations.