Patent Application
20070294309
The accompanying drawings, which are incorporated in and constitute part of this specification, illustrate embodiments of the invention and together with the description, serve to explain the principles of the invention. The embodiments illustrated herein are presently preferred, it being understood, however, that the invention is not limited to the precise arrangements and instrumentalities shown, wherein:
Embodiments of the present invention provide a method, system and computer program product for orchestrated peer-to-peer server provisioning. In accordance with an embodiment of the present invention, different target peers in a pool of server targets in a computing enterprise can be grouped according to server provisioning requirements in a peer hierarchy. The server provisioning requirements can relate to the set of components required to be deployed onto a particular target based upon the presence and the absence of specific components required for a complete deployment. In this regard, the set of required components can vary according to the type of peer targeted to receive the deployment, the type of deployment task, or both the type of peer and the type of deployment task.
Thereafter, different server provisioning bundles can be assembled for delivery to the peers in the different groups along with a specification of the server provisioning tasks to be performed in order to complete the deployment in the target group of peers. Notably, each peer in each different group can be enabled to receive the bundle and the instructions and to further deploy the bundle and the instructions to other coupled peers at lower levels in the hierarchy. In this way, a set of target peers directly receiving a server provisioning bundle can be substantially less than the set of target peers intended to receive the server provisioning bundle and the responsibility of server provisioning can be shared with the nodes in the target group of peers.
In illustration,
An orchestration and provisioning server 110 can be coupled to the target computing nodes 160. The orchestration and provisioning server 110 can include knowledge of the target computing nodes 160 such as the location of each of the nodes 160 in terms of network and sub-network, the operating system hosted within each of the nodes 160, the service pack level for each operating system, the fix pack level for each operating system, and the software installed in each of the nodes 160, at both the application and component level. The orchestration and provisioning server 110 further can include a policy that among other parameters, defines the maximum number of servers to be provisioned linearly. The maximum number can be computed according to a number of factors, for example, the processing power of the orchestration and provisioning server 110 as compared to others of the nodes 160, the distribution mechanism for the server provisioning task, e.g. push or pull, and the number of nodes 160 in the environment.
The orchestration and provisioning server 110 can include orchestration and provisioning program logic 200. The orchestration and provisioning logic 200 can include program code enabled to group different ones of the target computing nodes 160 according to provisioning task requirements to fulfill server provisioning for the target computing nodes 160. Specifically, the target computing nodes 160 can be grouped according to the number and identity of components necessary to deploy onto the target computing nodes 160, or the type of provisioning tasks necessary to deploy selected components for server provisioning onto the target computing nodes 160, or both. In one aspect of the invention, the number of groups can be determined according to the policy defining a maximum number of nodes 160 to be provisioned linearly.
Importantly, the program code of the orchestration and provisioning logic 200 can be further enabled to compute a set of metrics for a detailed provisioning task (DPT) 170. The DPT 170 can specify a minimal set of components for a provisioning task and can represent the presence and the absence of different required components in a particular one of the target computing nodes 160. The different required components can vary according to the specific type of the provisioning task, or the type of type of the particular one of the target computing nodes 160. As an example, a value of “0” can represent the absence of a required component, while the value of “1” can represent the presence of a required component. In this way, a single value can encode the set of required components that must be installed onto a specified one of the target computing nodes 160 in order to fulfill a provisioning task.
The program code of the orchestration and provisioning logic 200 yet further can be enabled to compare the DPT 170 for each of the target computing nodes 160 in order to group clusters of the target computing nodes 160 according to similar metrics. In particular, those of the target computing nodes 160 having the most similar set of metrics in a DPT 170 can be considered to require a similar set of components in order to complete a server provisioning task. Consequently, a collection of components necessary to meet the requirements of a server provisioning task for a group of the target computing nodes 160 can be assembled in a bundle 130, such as an Open Services Gateway Initiative (OSGI) bundle, and provided to the group for provisioning onto the target computing nodes 160 in the group.
Notably, each of the target computing nodes 160 in the group can include peer to peer provisioning (P2PP) logic 150. The P2PP logic 150 can include program code enabled to receive the bundle 130 and apply the bundle 130 to other coupled ones of the target computing nodes 160 in the group of target computing nodes 160. In this way, the program code of the orchestration and provisioning logic 200 need only apply the bundle 130 to a root node in the group of target computing nodes 160. The P2PP logic 150 of the root node in the group of target computing nodes 160 in turn can apply the bundle to other nodes in the group of target computing nodes 160 and so forth.
Finally, a certificate managing authority 120 can be communicatively coupled to the orchestration and provisioning server 110 and to each of the target computing nodes 160. The certificate managing authority 120 can be configured to verify on request the source of the bundles 130 so as to ensure a secure environment for server provisioning.
In more particular illustration of the operation of the orchestration and provisioning logic 200,
In block 230, the target nodes can be grouped according to the selected criteria limited only by the number of groups suggested by the policy. In block 240, a first group can be selected for consideration and in block 250, a bundle can be computed for the group. The bundle can include a collection of components and supporting files required to complete server provisioning for the nodes in the group at both the root level and levels below the root level within the hierarchy of the group. Thereafter, in block 260 the bundle can be provided to the root node for the group. The root node in turn can install the requisite components in the bundle and can provide the bundle to nodes below the root node for server provisioning therein.
In decision block 270, if additional groups of nodes remain to be considered, in block 280, a next group of nodes can be selected for consideration and the process can repeat through block 250. In particular, the process can repeat for each computed group wherein each computed group receives a bundle specifically arranged to account for the type of node, the type of provisioning task, or both. When the root nodes of the groups have received and applied the bundles, reports can be generated indicating the results of each of the server provisioning tasks for each of the nodes. The reports can filter back to the orchestration and provisioning server and ultimately can be stored in block 290
As the P2PP logic in the nodes within each group receive a bundle for distribution to other nodes at lower hierarchical levels, the program code of the P2PP logic can undertake measures to avoid network overloading in the course of peer-to-peer distributing the bundles. In particular, as shown in
In decision block 340, if sufficient network bandwidth exists, in block 350 the bundle can be provisioned to the next set of nodes at a lower level in the nodal hierarchy within the set of grouped target computing nodes. Thereafter, in block 360, a resulting report can be received from each of the nodes in the next set of nodes and reported back to a provisioning node at a higher hierarchical level in block 270. In this way, each of the nodes at each level in the hierarchy can share in the burden of performing the provisioning task without requiring the provisioning server to provision each node in the hierarchy sequentially.
Embodiments of the invention can take the form of an entirely hardware embodiment, an entirely software embodiment or an embodiment containing both hardware and software elements. In a preferred embodiment, the invention is implemented in software, which includes but is not limited to firmware, resident software, microcode, and the like. Furthermore, the invention can take the form of a computer program product accessible from a computer-usable or computer-readable medium providing program code for use by or in connection with a computer or any instruction execution system.
For the purposes of this description, a computer-usable or computer readable medium can be any apparatus that can contain, store, communicate, propagate, or transport the program for use by or in connection with the instruction execution system, apparatus, or device. The medium can be an electronic, magnetic, optical, electromagnetic, infrared, or semiconductor system (or apparatus or device) or a propagation medium. Examples of a computer-readable medium include a semiconductor or solid state memory, magnetic tape, a removable computer diskette, a random access memory (RAM), a read-only memory (ROM), a rigid magnetic disk and an optical disk. Current examples of optical disks include compact disk—read only memory (CD-ROM), compact disk—read/write (CD-R/W) and DVD.
A data processing system suitable for storing and/or executing program code will include at least one processor coupled directly or indirectly to memory elements through a system bus. The memory elements can include local memory employed during actual execution of the program code, bulk storage, and cache memories which provide temporary storage of at least some program code in order to reduce the number of times code must be retrieved from bulk storage during execution. Input/output or I/O devices (including but not limited to keyboards, displays, pointing devices, etc.) can be coupled to the system either directly or through intervening I/O controllers. Network adapters may also be coupled to the system to enable the data processing system to become coupled to other data processing systems or remote printers or storage devices through intervening private or public networks. Modems, cable modem and Ethernet cards are just a few of the currently available types of network adapters.
