Iterative anti-collocation of network resources using prioritized graph coloring

A method for iterative anti-collocation of network resources using prioritized graph coloring, the method comprising:

• receiving a list of network resources, a set of priorities, and a set of rules, wherein each resource of the list is capable of being installed on a physical or virtual component of a networked computing environment, wherein each resource of the list is associated with a priority of the set of priorities, and wherein each rule of the set of rules identifies an anti-collocation constraint of a set of constraints that bars installing two or more resources of the list of network resources on a same component of the networked computing environment;
• representing the resources comprised by the list and the set of rules as an undirected graph,
• wherein each resource of the list of network resources is represented as a node of the graph and each rule of the set of rules is represented as an edge of the graph, and
• wherein a first edge of the graph that connects a first pair of nodes of the graph represents an anti-collocation constraint of the set of rules that bars installing a first pair of resources of the list of network resources on a same component of the one or more physical or virtual components, and wherein the first pair of nodes represents the first pair of resources;
• organizing the resources comprised by the list into a set of groups, such that each group of the set of groups consists of resources associated with a same priority of the set of priorities;
• associating a color of a set of colors with each resource comprised by a first group of the set of groups, such that a first resource identified by a first rule of the set of rules is associated with a color not associated with any other resource identified by the first rule;
• ordering the colors of the set of colors as a function of a number of resources associated with each color of the set of colors, wherein the ordered colors form a color list in which no first color of the list is associated with a greater number of resources than is a color that follows the first color in the list;
• and
• installing, as a function of the ordering, each resource comprised by the first group on a component of the one or more physical or virtual components of the networked computing environment, wherein the resources are installed in an order corresponding to an order of colors of the color list, and wherein no two resources associated with a same color are installed on a same component.

A computer program product, comprising a computer-readable hardware storage device having a computer-readable program code stored therein, the program code configured to be executed by a computerized network-configuration system comprising a processor, a memory coupled to the processor, a computer-readable hardware storage device coupled to the processor, and one or more interfaces to a network-management platform that manages one or more physical or virtual resources of a networked computing environment, the storage device containing program code configured to be run by the processor via the memory to implement a method for iterative anti-collocation of network resources using prioritized graph coloring, the method comprising:

• the system receiving a list of network resources, a set of priorities, and a set of rules, wherein each resource of the list is capable of being installed on a physical or virtual component of the networked computing environment, wherein each resource of the list is associated with a priority of the set of priorities, and wherein each rule of the set of rules identifies an anti-collocation constraint of a set of constraints that bars installing two or more resources of the list of network resources on a same component of the networked computing environment;
• the system representing the resources comprised by the list and the set of rules as an undirected graph, wherein each resource of the list of network resources is represented as a node of the graph and each rule of the set of rules is represented as an edge of the graph;
• the system organizing the resources comprised by the list into a set of groups, such that each group of the set of groups consists of resources associated with a same priority of the set of priorities;
• the system associating a color of a set of colors with each resource comprised by a first group of the set of groups, such that a first resource identified by a first rule of the set of rules is associated with a color not associated with any other resource identified by the first rule;
• the system ordering the colors of the set of colors as a function of a number of resources associated with each color of the set of colors, wherein the ordered colors form a color list in which no first color of the list is associated with a greater number of resources than is a color that follows the first color in the list;
• and
• the system installing, as a function of the ordering, each resource comprised by the first group on a component of the one or more physical or virtual components of the networked computing environment, wherein the resources are installed in an order corresponding to an order of colors of the color list, and wherein no two resources associated with a same color are installed on a same component.