Abstract: A container image registry is managed in a virtualized computing system. The container image registry manages container images for deploying containers in a host cluster, the host cluster includes hosts and a virtualization layer executing on hardware platforms of the hosts, and the virtualization layer supports execution of virtual machines (VMs). The method includes: creating a namespace for an orchestration control plane integrated with the virtualization layer, the namespace including constraints for deploying workloads in the VMs; invoking, by a registry service in response to creation of the namespace, a management application programming interface (API) of the container image registry to create a project for the container images; and invoking, by the registry service, the management API of the container image registry to both add members to the project, and assign image registry roles to the members, in response to bindings of users and namespace roles derived from the constraints.

Abstract: A container image registry is managed in a virtualized computing system. The container image registry manages container images for deploying containers in a host cluster, the host cluster includes hosts and a virtualization layer executing on hardware platforms of the hosts, and the virtualization layer supports execution of virtual machines (VMs). The method includes: creating a namespace for an orchestration control plane integrated with the virtualization layer, the namespace including constraints for deploying workloads in the VMs; invoking, by a registry service in response to creation of the namespace, a management application programming interface (API) of the container image registry to create a project for the container images; and invoking, by the registry service, the management API of the container image registry to both add members to the project, and assign image registry roles to the members, in response to bindings of users and namespace roles derived from the constraints.

Abstract: A management system and method for deploying a virtual processing instance from an open virtual appliance (OVA) template file involves accessing the OVA template file stored on a storage of a computer to stream at least one file from the storage of the computer for processing and to transmit a disk image file of the virtual processing instance in the OVA template file from the storage of the computer to a storage of a destination host computer on which the virtual processing instance is to be deployed.

Abstract: A coordinated multi-cast content distribution process is used to distribute content, e.g., files, from a source node of a network to target nodes of the network. A minimum spanning tree is identified for the network based on costs of edges connecting the nodes. The minimum spanning tree includes the source node and all target nodes; the minimum spanning tree distinguishes leaf target nodes from non-leaf target nodes. Content parts are moved along the spanning tree in an iterative process in which, for each iteration, the highest-cost leaf nodes are identified and content parts are moved toward the identified leaf nodes. This process reduces avoids network congestion and reduces the total bandwidth consumption required to supply the content to all target nodes.

Abstract: A management system and method for deploying a virtual processing instance from an OVA template file involves accessing the OVA template file stored on a storage of a computer to stream at least one file from the storage of the computer for processing and to transmit a disk image file of the virtual processing instance in the OVA template file from the storage of the computer to a storage of a destination host computer on which the virtual processing instance is to be deployed.

Abstract: A coordinated multi-cast content distribution process is used to distribute content, e.g., files, from a source node of a network to target nodes of the network. A minimum spanning tree is identified for the network based on costs of edges connecting the nodes. The minimum spanning tree includes the source node and all target nodes; the minimum spanning tree distinguishes leaf target nodes from non-leaf target nodes. Content parts are moved along the spanning tree in an iterative process in which, for each iteration, the highest-cost leaf nodes are identified and content parts are moved toward the identified leaf nodes. This process reduces avoids network congestion and reduces the total bandwidth consumption required to supply the content to all target nodes.