Graph-based generation of dependency-adherent execution plans for data center migrations
US10673716B1 · kind B1 · utility
Assignee
Inventors
Key dates
| Filing date | Oct 31, 2017 |
| Grant date | Jun 2, 2020 |
| Priority date | — |
| Expiry date | May 21, 2038 |
Classification
- Technology area (CPC H)Electricity
- CPC primaryH04L67/51
- WIPO fieldDigital communication
- WIPO sectorElectrical engineering
Abstract
Techniques for graph-based generation of dependency-adherent execution plans for data center migration are described. One or more agents and/or connectors can be deployed to a first network to collect data that can be used, by a server migration service, to identify resources operating in the first network and dependencies between the resources. A graph of the resources can be constructed and processed to remove any bi-dependencies and cycles from the graph that may exist. The resulting graph can be topologically sorted and used to automatically generate a migration plan for the resources that preserves dependencies between resources so that upon each resource being migrated, its inter-resource dependencies are satisfied.
Source: USPTO / EPO open patent data. Objective bibliographic and citation counts.