Cost-based migration waves planning

Bibliographic Details
Title: Cost-based migration waves planning
Patent Number: 10235,640
Publication Date: March 19, 2019
Appl. No: 12/938776
Application Filed: November 03, 2010
Abstract: A system and method for cost-based migration planning includes determining cost factors and constraints associated with at least one of migrating and transforming a plurality of components. A cost-based model is constructed using the cost factors and constraints. The cost-based model is applied to groupings of the plurality of components to provide a cost-based determination grouping scheme in accordance with the constraints. The grouping scheme is output to provide migration waves for migrating or transforming the plurality of components.
Inventors: Devarakonda, Murthy (Peekskill, NY, US); Joukov, Nikolai A. (Thornwood, NY, US); Pfitzmann, Birgit M. (Valhalla, NY, US); Thompson, Lawrence H. (Fairfield, CT, US)
Assignees: International Business Machines Corporation (Armonk, NY, US)
Claim: 1. A method for cost-based migration, comprising: determining cost factors and constraints associated with migrating and transforming a plurality of components, wherein the cost factors include at least a cost of data migration, a cost of testing at least one of the plurality of components, and a cost of business losses resulting from the migrating; constructing at least one cost-based model using the cost factors and constraints, wherein the constraints include migration scheduling times, legal considerations, modes of migration, and special circumstances; applying, using a processor, the at least one cost-based model to generated affinity groupings of the plurality of components to provide a cost-based determination of a grouping scheme in accordance with the constraints; and migrating and transforming, using a processor, each of the plurality of components in migration waves generated based on the affinity grouping scheme generated by the determining of the cost factors, the constructing of the cost-based model, and the applying of the cost-based model to the groupings of the plurality of components, the migrating being configured to optimize application availability and to reduce complexity of the migration while minimizing costs by prioritizing the migration waves and employing different migration techniques for each of a plurality of different types of migration groups, the different migration techniques including two or more of data mirroring, workload shifting, backup and restore, de-install, and re-install.
Claim: 2. The method as recited in claim 1 , wherein determining cost factors and constraints includes determining constraints by conducting a discovery analysis of the plurality of components.
Claim: 3. The method as recited in claim 1 , wherein constructing at least one cost-based model includes creating a model instance from a generic model using the cost factors and constraints.
Claim: 4. The method as recited in claim 1 , further comprising determining an order for moving the plurality of groupings using the at least one cost model.
Claim: 5. The method as recited in claim 1 , further comprising adjusting the at least one cost model to perform what-if scenarios leading to one or more groupings.
Claim: 6. The method as recited in claim 1 , wherein applying the at least one cost-based model includes employing a solver to determine the cost-based grouping scheme.
Claim: 7. The method as recited in claim 1 , wherein applying the at least one cost-based model to groupings of the plurality of components includes determining a plurality of alternative scenarios and comparing the alternative scenarios based on cost.
Claim: 8. The method as recited in claim 1 , wherein the cost factors include actual physical and data migration costs, testing costs, relinking costs and business costs.
Claim: 9. The method as recited in claim 1 , wherein the constraints include at least one of a budget, component dependencies, downtime constraints, personnel constraints, bandwidth and risks, and the constraints may be modified until a goal is met, a threshold is reached, or a user is satisfied.
Claim: 10. The method as recited in claim 1 , further comprising adjusting the at least one cost model to perform what-if scenarios leading to a migration order for groupings.
Claim: 11. A non-transitory computer readable storage medium comprising a computer readable program for cost-based migration, wherein the computer readable program when executed on a computer causes the computer to perform the steps of: determining cost factors and constraints associated with migrating and transforming a plurality of components, wherein the cost factors include at least a cost of data migration, a cost of testing at least one of the plurality of components, and a cost of business losses resulting from the migrating; constructing at least one cost-based model, stored in a computer readable storage medium, using the cost factors and constraints, wherein the constraints include migration scheduling times, legal considerations, modes of migration, and special circumstances; applying the at least one cost-based model to generated affinity groupings of the plurality of components to provide a cost-based determination of a grouping scheme in accordance with the constraints; and migrating and transforming, using a processor, each of the plurality of components in migration waves generated based on the affinity grouping scheme generated by the determining of the cost factors, the constructing of the cost-based model, and the applying of the cost-based model to the groupings of the plurality of components, the migrating being configured to optimize application availability and to reduce complexity of the migration while minimizing costs by prioritizing the migration waves and employing different migration techniques for different types of migration groups, the different migration techniques including two or more of data mirroring, workload shifting, backup and restore, de-install, and re-install.
Claim: 12. The computer readable storage medium as recited in claim 11 , wherein determining cost factors and constraints includes determining constraints by conducting a discovery analysis of the plurality of components.
Claim: 13. The computer readable storage medium as recited in claim 11 , wherein constructing at least one cost-based model includes creating a model instance from a generic model using the cost factors and constraints, with the cost factors being actual physical and data migration costs, testing costs, relinking costs and business costs.
Claim: 14. The computer readable storage medium as recited in claim 11 , further comprising determining an order for moving the plurality of groupings using the at least one cost model.
Claim: 15. The computer readable storage medium as recited in claim 11 , further comprising adjusting the at least one cost model to perform what-if scenarios on one of the groupings and a migration order for the groupings.
Claim: 16. The computer readable storage medium as recited in claim 11 , wherein applying the at least one cost-based model includes employing a solver to determine the cost-based grouping scheme.
Claim: 17. The computer readable storage medium as recited in claim 11 , wherein applying the at least one cost-based model to groupings of the plurality of components includes determining a plurality of alternative scenarios and comparing the alternative scenarios based on cost.
Claim: 18. A system for cost-based migration, comprising: a memory coupled to a processor, the memory storing a cost-based planning tool which is executed by the processor to: determine cost factors and constraints associated with migrating and transforming a plurality of components, wherein the cost factors include at least a cost of data migration, a cost of testing at least one of the plurality of components, and a cost of business losses resulting from the migrating; construct at least one cost-based model using the cost factors and constraints, wherein the constraints include migration scheduling times, legal considerations, modes of migration, and special circumstances; apply the at least one cost-based model to generated affinity groupings of the plurality of components to determine a cost-based grouping scheme in accordance with the constraints; and migrating and transforming, using the processor, each of the plurality of components in migration waves generated based on the affinity grouping scheme generated by the determining of the cost factors, the constructing of the cost-based model, and the applying of the cost-based model to the groupings of the plurality of components, the migrating being configured to optimize application availability and to reduce complexity of the migration while minimizing costs by prioritizing the migration waves and employing different migration techniques for each of a plurality of different types of migration groups, the different migration techniques including two or more of data mirroring, workload shifting, backup and restore, de-install, and re-install.
Claim: 19. The system as recited in claim 18 , wherein the cost factors include actual physical and data migration costs, testing costs, relinking costs and business costs.
Claim: 20. The system as recited in claim 18 , wherein the constraints include at least one of a budget, component dependencies, and risks, and the constraints may be modified until a goal is met, a threshold is reached, or a user is satisfied.
Claim: 21. The system as recited in claim 18 , wherein the at least one cost-based model is created from a generic model using the cost factors and constraints.
Claim: 22. The system as recited in claim 18 , wherein the cost-based planning tool is configured to determine an order for moving the plurality of groupings using the at least one cost model.
Claim: 23. The system as recited in claim 18 , wherein the cost-based planning tool is configured to adjust the at least one cost model to perform what-if scenarios on one of the groupings and a migration order for the groupings.
Claim: 24. The system as recited in claim 18 , wherein the cost-based planning tool includes a solver to determine the cost-based grouping scheme.
Claim: 25. The system as recited in claim 18 , wherein the cost-based planning tool is configured to determine a plurality of alternative scenarios and compare the alternative scenarios based on cost.
Patent References Cited: 7616583 November 2009 Power
7627493 December 2009 Sarthi et al.
7818410 October 2010 Barnes
7885848 February 2011 Kagan
7890389 February 2011 Harel et al.
8032523 October 2011 Hamilton, II
8095929 January 2012 Ji
2004/0194055 September 2004 Galloway et al.
2006/0190417 August 2006 Hilkemeyer et al.
2010/0049587 February 2010 Dunetz
2010/0241615 September 2010 Marshall et al.


Other References: Geay, E., et al. “Modular String-Sensitive Permission Analysis With Demand-Driven Precision” 31st International Conference on Software Engineering, ICSE 2009. May 2009 pp. 1-11. cited by applicant
Joukov, N., et al. “Built-to-Order Service Engineering for Enterprise IT Discovery” 2008 IEEE International Conference on Services Computing (SCC 2008). Jul. 2008 pp. 1-8. cited by applicant
Magoutis, K., et al. “Galapagos: Model-Driven Discovery of End-to-End Application-Storage Relationships in Distributed Systems” IBM Journal of Research and Development. vol. 52, No. 4/5. Jul./Sep. 2008. pp. 367-377. cited by applicant
Primary Examiner: Nguyen, Kira
Attorney, Agent or Firm: Tutunjian & Bitetto, P.C.
Goudy, Kurt
Accession Number: edspgr.10235640
Database: USPTO Patent Grants
More Details
Language:English