Staging Engine for Resource Pool Provisioning
Find Innovative SolutionsGenerate Solutions
Solution Overview
Problem
Current IT systems face challenges in efficiently provisioning resources across multiple services due to time-consuming setting operations and inflexible configurations, making it difficult to respond to sudden load fluctuations and diverse resource requests.
Innovation Solution
A method and system that utilize a staging engine to provide intermediate resource states in a shared resource pool, allowing for dynamic allocation and optimization of resources based on setting operation times, using a graph-based approach to minimize cost and reduce provisioning time.
Engineering Contradictions & Design Principles
Engineering Contradiction Analysis
1Productivity
If resources are allocated to services through conventional provisioning processes, then resource allocation can be performed, but the provisioning process takes a long time due to time-consuming setting operations
Solution Approach 1:
The patent applies preliminary action by pre-configuring resources in a resource pool before they are needed by services. The system stages resources through intermediate states in advance, so when a service needs a resource, it can be quickly allocated without performing time-consuming setting operations from scratch. This resolves the contradiction by preparing resources beforehand to eliminate provisioning delays.
2Loss of time
If resources are pre-configured in a resource pool, then provisioning time is reduced, but the complexity of managing multiple intermediate states increases
Solution Approach 1:
The patent segments the resource provisioning process into distinct intermediate states (stages), where each state represents a specific configuration level. By dividing the complex provisioning process into manageable segments, the system can track and manage resources systematically through these stages without overwhelming complexity. This segmentation approach resolves the contradiction by organizing complexity into structured phases.
Solution Approach 2:
The patent introduces an intermediary management layer that handles the complexity of tracking resources across intermediate states. This intermediary system coordinates the staging process and manages the transitions between states, shielding the overall system from the complexity of direct resource configuration management. This resolves the contradiction by adding a mediating layer that simplifies control.
3Productivity
If a shared resource pool is used across multiple services, then resource utilization efficiency improves, but the flexibility to customize configurations for different services decreases
Solution Approach 1:
The patent applies dynamics by enabling resources to transition between different intermediate states based on the specific needs of services. Rather than static pre-configurations, the system dynamically stages resources through multiple states, allowing the same physical resource to be adapted to different service requirements. This dynamic approach resolves the contradiction by maintaining flexibility through configurable transition paths.
Solution Approach 2:
The patent utilizes parameter changes by allowing resources to change their configuration parameters as they move through intermediate states. Each state represents different parameter settings, and the system can transition resources between states to match different service requirements. This parameter transformation capability resolves the contradiction by enabling adaptation while maintaining shared resource pooling.
Data Source
AI summary
A provisioning method for allocating a plurality of resources required by a plurality of services, including staging, so as to provide at least one stage, as an intermediate state, in the process of provisioning, in a resource pool shared by the plurality of services. A state of at least one of the plurality of resources is allocated to at least one of the stages as an initial state provided in advance. A predetermined cost is calculated by using a predetermined algorithm based on a setting operation time required for causing a state of each of the allocated plurality of resources to transition to another stage, and optimally allocating all the plurality of resources to the respective stages in order to minimize the predetermined cost.