Reducing solution space based on partially observed infrastructure graph search for workload placement

A non-transitory storage medium having stored therein instructions that are executable by one or more hardware processors to perform operations comprising:

• building an infrastructure graph comprising nodes and edges, and each node represents a respective infrastructure, and each edge encodes information about aspects of a network that includes the nodes;
• applying a selective harvesting (SH) algorithm to the infrastructure graph, wherein the infrastructure graph is partially observed, wherein the SH algorithm is initialized from a seed set of nodes and iteratively queries additional nodes under a query budget constraint to identify nodes that are able to meet requirements of a workload, wherein the queries are based at least in part on observed node attributes, wherein the nodes that are identified are discovered through the iterative querying, wherein the nodes that are identified collectively form a subset of all the nodes of the infrastructure graph, wherein querying a node reveals connectivity or attributes of nodes that were not previously observed in the partially observed infrastructure graph;
• based on the applying, generating a subgraph of the infrastructure graph, and the subgraph comprises the subset;
• and
• applying a workload placement optimization algorithm to the nodes of the subgraph, wherein the workload placement optimization algorithm searches only the nodes of the subgraph rather than all nodes of the infrastructure graph.

A method comprising:

• building an infrastructure graph comprising nodes and edges, and each node represents a respective infrastructure, and each edge encodes information about aspects of a network that includes the nodes;
• applying a selective harvesting (SH) algorithm to the infrastructure graph to identify the nodes that are able to meet requirements of a workload, and the nodes that are identified collectively form a subset of all the nodes of the infrastructure graph, wherein the SH algorithm is applied to a random set of nodes of the infrastructure graph;
• based on the applying, generating a subgraph of the infrastructure graph, and the subgraph comprises the subset;
• and
• applying a workload placement optimization algorithm to the nodes of the subgraph.