Read-write network visualization
US-2024163189-A1 · May 16, 2024 · US
US2017279692A1 · US · A1
| Field | Value |
|---|---|
| Publication number | US-2017279692-A1 |
| Application number | US-201615079284-A |
| Country | US |
| Kind code | A1 |
| Filing date | Mar 24, 2016 |
| Priority date | Mar 24, 2016 |
| Publication date | Sep 28, 2017 |
| Grant date | — |
A practical reading order for non-experts. Skip the full description unless you need deep technical detail.
What the patent document calls the invention.
A short plain-language summary of the technical disclosure.
Who owns or filed the patent and who is credited as inventor.
Filing, priority, publication, and grant dates set the timeline.
The legal scope of protection — read this for what is actually claimed.
Technology tags used to group this patent with similar filings.
Prior art links and similar publications in this corpus.
Official abstract text for this publication.
A method includes performing by a processor of a server: receiving a requirement description of a service for a software application, generating a migration graph that comprises vertices representing candidate service providers for the service, respectively, identifying migration capability information between the vertices of the migration graph by connecting a portion of the vertices with edges, generating a centrality metric for each of the vertices of the migration graph based on the migration capability information and a number of edges terminating at the respective vertex, grading the candidate service providers based on one of the migration capability information and the centrality metric, and deploying the service using one of the candidate service providers responsive to grading the candidate service providers receiving an architecture description for a software application that identifies a plurality of generic services, receiving a requirement description for the software application that comprises respective values for a plurality of priority parameters for the software application, and generating a proposal that, for each of the plurality of generic services, identifies a specific cloud service for the respective generic service based on the requirement description.
Opening claim text (preview).
That which is claimed: 1 . A method, comprising: performing by a processor: receiving a requirement description of a service for a software application; generating a migration graph that comprises vertices representing candidate service providers for the service, respectively; identifying migration capability information between the vertices of the migration graph by connecting a portion of the vertices with edges; generating a centrality metric for each of the vertices of the migration graph based on the migration capability information and a number of edges terminating at the respective vertex; grading the candidate service providers based on one of the migration capability information and the centrality metric; and deploying the service using one of the candidate service providers responsive to grading the candidate service providers. 2 . The method of claim 1 , wherein receiving a requirement description of the service for the software application comprises receiving a plurality of requirement descriptions of the service for a plurality of software applications, the plurality of software applications comprising the software application; and wherein generating the migration graph comprises: generating a compatibility graph that comprises vertices respectively representing the candidate service providers for the service and a plurality of software applications; and identifying technical capability information between vertices of the compatibility graph by connecting each of the vertices of the compatibility graph corresponding to the plurality of software applications to those vertices of the compatibility graph corresponding to the candidate service providers that satisfy the requirement description for the respective one of the software applications with edges; selecting the candidate service providers for the service as the candidate service providers whose corresponding vertices are connected with edges to the vertex corresponding to the software application in the compatibility graph; and eliminating any of the candidate service providers that were selected for which it is not possible to migrate the service to or from another one of the candidate service providers that were selected. 3 . The method of claim 2 , wherein each of the edges in the migration graph has a weight and a direction associated therewith. 4 . The method of claim 3 , wherein the weight comprises an ease of migration indicium represented as a comparison between a number of input/output operations associated with one of the candidate service providers being migrated from and a number of input/output operations associated with one of the candidate service providers being migrated to. 5 . The method of claim 3 , wherein the weight comprises an ease of migration indicium represented as a ratio of a first number of the plurality of software applications having corresponding vertices in the compatibility graph that are connected to vertices corresponding to one of the candidate service providers being migrated from and to one of the candidate service providers being migrated to, respectively, to a second number of the plurality of software applications having corresponding vertices in the compatibility graph that are connected to the vertex corresponding to the one of the candidate service providers being migrated from. 6 . The method of claim 5 , wherein generating the centrality metric for each of the vertices of the migration graph comprises: using Hyperlink-Induced Topic Search (HITS) to generate the centrality metric for each of the vertices of the migration graph based on the number of edges terminating at the respective vertex and the ease of migration indicium for each of the respective edges terminating at the respective vertex. 7 . The method of claim 5 , wherein generating the centrality metric for each of the vertices of the migration graph comprises: using PageRank to generate the centrality metric for each of the vertices of the migration graph based on the number of edges terminating at the respective vertex and the ease of migration indicium for each of the respective edges terminating at the respective vertex. 8 . The method of claim 7 , wherein grading the candidate service providers based on one of the migration capability information and the centrality metric comprises: generating a maximum ease of migration metric for each of the vertices of the migration graph, the maximum ease of migration metric comprising the maximum ease of migration indicium for an edge directed out from the respective vertex; and grading the candidate service providers based on the maximum ease of migration metric. 9 . The method of claim 8 , wherein grading the candidate service providers based on one of the migration capability information and the centrality metric comprises grading the candidate services based on each of the maximum ease of migration metric, the centrality metric generated using PageRank, and a price metric. 10 . The method of claim 9 , wherein deploying the service using one of the candidate service providers responsive to grading the candidate service providers comprises: generating a first comparison matrix for the candidate service providers based on the maximum ease of migration metric; generating a second comparison matrix for the candidate service providers based on the centrality metric generated using PageRank; and generating a third comparison matrix for the candidate service providers based on the price metric. 11 . The method of claim 10 , further comprising: generating the first Eigen vector of the first comparison matrix; generating the first Eigen vector of the second comparison matrix; and generating the first Eigen vector of the third comparison matrix; 12 . The method of claim 11 , further comprising: receiving a preference ranking for each of the maximum ease of migration metric, the centrality metric generated using PageRank, and the price metric; and generating a preference matrix based on the received preference rankings. 13 . The method of claim 12 , further comprising: generating the first Eigen vector of the preference matrix; multiplying the first Eigen vector of the preference matrix with each of the first Eigen vector of the first comparison matrix, the first Eigen vector of the second comparison matrix, and the first Eigen vector of the third comparison matrix to generate a plurality of final scores corresponding to the candidate service providers, respectively; and deploying the service based on the plurality of final scores. 14 . A system, comprising: a processor; and a memory coupled to the processor and comprising computer readable program code embodied in the memory that is executable by the processor to perform: receiving a requirement description of a service for a software application; generating a migration graph that comprises vertices representing candidate service providers for the service, respectively; identifying migration capability information between the vertices of the migration graph by connecting a portion of the vertices with edges; generating a centrality metric for each of the vertices of the migration graph based on the migration capability information and a number of edges terminating at the respective vertex; generating a migration metric based on the migration capability information; grading the candidate service providers based on each of the centrality metric, the migration metric, and a price metric; and deploying the service using one of the candidate service providers responsive to grading the candidate service provi
involving the movement of software or configuration parameters (network booting or remote initial program loading [RIPL] G06F9/4416) · CPC title
Software deployment · CPC title
Electricity · mapped topic
for graphical visualisation of monitoring data · CPC title
Electricity · mapped topic
Related publications grouped by family.
Answers are generated from the same data shown on this page.