Abstract: An example operation may include one or more one or more of receiving two or more authorization decisions from two or more authorization entities into a blockchain system, recording the two or more authorization decisions into one or more blocks of a blockchain of the blockchain system, determining, by the blockchain system, whether the two or more authorization decisions satisfy a policy to authorize access to at least one of a device or identifiable content on the device, and when the two or more authorization decisions satisfy the policy, authorizing access to a public key that can be used to gain access to the device.

Abstract: An example operation may include one or more one or more of receiving two or more authorization decisions from two or more authorization entities into a blockchain system, recording the two or more authorization decisions into one or more blocks of a blockchain of the blockchain system, determining, by the blockchain system, whether the two or more authorization decisions satisfy a policy to authorize access to at least one of a device or identifiable content on the device, and when the two or more authorization decisions satisfy the policy, authorizing access to a public key that can be used to gain access to the device.

Abstract: Aspects of the present invention provide a solution for creating a snapshot of a virtual server. In an embodiment, a first write storage is created in response to a snapshot request. For each write from the virtual server to primary storage that is the first write of that particular data block since the snapshot request, the data that resided in the data block previous to the write is copied from the primary storage to the first write storage.

Abstract: Aspects of the present invention provide a solution for creating a snapshot of a virtual server. In an embodiment, a first write storage is created in response to a snapshot request. For each write from the virtual server to primary storage that is the first write of that particular data block since the snapshot request, the data that resided in the data block previous to the write is copied from the primary storage to the first write storage.

Abstract: Techniques for improving application server performance and availability are provided. In one aspect, a method of monitoring the health of one or more application servers comprises the following steps. One or more health classes are specified, each of the one or more health classes defining one or more health policies for the one or more application servers. At least one of the one or more health policies is monitored. Violations, if any, of the one or more health policies are detected.

Abstract: Upgrading a multi-tiered application is provided. In response to receiving a request to upgrade a multi-tiered application, wherein components of the multi-tiered application are deployed across a plurality of virtual machines, an appropriate integrated patch is selected for the upgrade. The selected integrated patch includes an integrated set of patches for the components of the multi-tiered application, state update data, and order constraints. The components of the multi-tiered application specified in the selected integrated patch are upgraded by using the integrated set of patches and order constraints. In addition, the state of the components of the multi-tiered application are updated by using the state update data. Then, the updated state of the multi-tiered application is saved to storage.

Abstract: Managing a distributed software application is provided. Metadata describing a set of dependencies of a set of software components is identified in the distributed software application from data associated with the set of software components. Then, a sequence for changing an operational state of the set of software components of the distributed software application is identified from the metadata to form an identified sequence. Thereafter, the operational state of the set of software components is changed using the identified sequence.

Abstract: A system, computer program and method for transmitting requested data from a data source in response to data transmission requests from at least one electronic device according to differential rates of throughput. Data transmission requests are classified into one of a plurality of throughput classes, with each throughput class having an assigned rate of throughput. A proportion of data transmission requests to be processed from each throughput class is selected such that each data transmission request has a rate of throughput approximating the assigned rate of throughput of its class. The requested data is then sent from the data source to the electronic device.

Abstract: Provides control of the workload, flow control, and concurrency control of a computer system through the use of only external performance monitors. Data collected by external performance monitors are used to build a simple, black box model of the computer system, comprising two resources: a virtual bottleneck resource and a delay resource representing all non-bottleneck resources combined. The service times of the two resource types are two parameters of the black box model. The two parameters are evaluated based on historical data collected by the external performance monitors. The workload capacity that avoids saturation of the bottleneck resource is then determined and used as a control variable by a flow controller to limit the workload on the computer system. The workload may include a mix of traffic classes. In such a case, data is collected, parameters are evaluated and control variables are determined for each of the traffic classes.

Abstract: Coordinating tasks of performance management and application placement management in a dynamic fashion by: estimating capacity needs for various service classes of service requests; computing desired capacities of at least one application for said service requests; deciding whether the desired capacities are satisfied by a current application placement; making no change to current application placement if the desired capacities are satisfied; determining a new application placement based on the desired capacities and a projected load if the desired capacities are not satisfied; computing corresponding capacity constraints for all pairs of service classes and servers; and computing an optimal allocation of capacities among the service classes so as to optimize a quality of service.

Abstract: A decentralized process to ensure the dynamic placement of applications on servers under two types of simultaneous resource requirements, those that are dependent on the loads placed on the applications and those that are independent. The demand (load) for applications changes over time and the goal is to satisfy all the demand while changing the solution (assignment of applications to servers) as little as possible.

Abstract: System for managing a life cycle of a virtual resource. One or more virtual resources are defined. The one or more defined virtual resources are created. The created virtual resources are instantiated. Then, a topology of a virtual resource is constructed using a plurality of virtual resources that are in at least one of a defined, a created, or an instantiated state.

Abstract: A computer implemented method, apparatus, and computer usable program code for load balancing in a cluster. In response to receiving a notification of an impending state change event in the server, a weight adjustment value for a server is identified to form an identified weight adjustment. An adjusted routing weight for the server is generated using the identified weight adjustment to form a current routing weight for the server. An incoming service request is routed to a selected server in the cluster using current routing weight associated with servers in the cluster.

Abstract: Techniques for selectively off-loading workload across multiple data centers are disclosed. For example, a technique for processing a user request in accordance with a multiple data center environment comprises the following steps/operations. A user request is obtained at a first data center. The user request is classified based on one or more classification criterion. At least a portion of a workload associated with the classified user request is off-loaded to at least a second data center to be processed, wherein the off-loading step/operation is at least based on one or more administrative policies associated with at least one of the first data center and the second data center. The workload is processed such that the user request is at least substantially satisfied in accordance with a service level agreement for the requesting user.

Abstract: A digital rights management (DRM) system and methodology for a Java client implementing a Java Runtime Environment (JRE). The JRE comprises a Java Virtual Machine (JVM) and Java runtime libraries components and is capable of executing a player application for presenting content that can be presented through a Java program (e.g., a Java application, applet, servlet, bean, etc.) and downloaded from a content server to the client. The DRM system includes an acquisition component for receiving downloaded protected contents; and a dynamic rights management layer located between the JRE and player application for receiving requests to view or play downloaded protected contents from the player, and, in response to each request, determining the rights associated with protected content and enabling viewing or playing of the protected contents via the player application if permitted according to the rights.

Abstract: Coordinating tasks of performance management and application placement management in a dynamic fashion by: estimating capacity needs for various service classes of service requests; computing desired capacities of at least one application for said service requests; deciding whether the desired capacities are satisfied by a current application placement; making no change to current application placement if the desired capacities are satisfied; determining a new application placement based on the desired capacities and a projected load if the desired capacities are not satisfied; computing corresponding capacity constraints for all pairs of service classes and servers; and computing an optimal allocation of capacities among the service classes so as to optimize a quality of service.

Abstract: A method, system and apparatus for on-demand application resource allocation. In accordance with the method of the invention, an anticipated workload can be compared to a measured capacity for an application cluster in one or more server computing nodes in a server farm. If the measured capacity warrants a re-configuration of the application clusters, a new placement can be computed for application server instances in individual ones of the server computing nodes. Subsequently, the new placement can be applied to the server computing nodes in the server farm. In this regard, the applying step can include starting and stopping selected ones of the application server instances in different ones of the server computing nodes to effectuate the new placement.

Abstract: Apparatus, systems and methods for service and/or business for coordinating tasks of performance management and application placement management in a dynamic fashion. An example process is dynamic in the face of fluctuations in the request load to the distributed computer system and the periodic adjustments to the placement of applications onto servers in said distributed computer system. There are two opposite functional flows in said process: a demand estimation function and a capacity adjustment function. The coordination system involves two subsystems: a demand estimator and a capacity adjuster, along with appropriate interfaces to of the performance manager and the application placement manager.

Abstract: A system for providing persistent access control of protected content is disclosed. The method on a client system includes sending a first request for authentication of the client to a server system. Subsequently, the client is authenticated by the server. Next, a user on the client attempts to access a file comprising a trailer and content encrypted with an encrypting key. Then, a second request for access to the content is sent to the server by the client, wherein an identifier from the trailer is included in the second request. The identifier identifies the content or an access control policy of the content. The server determines that the second request is in accordance with an access control policy associated with the content, and grants access to the content. Lastly, the client accesses the content in accordance with the access control policy.

Abstract: The present invention provides a method, system, and computer program product for supporting a large number of intermittently used application clusters without consuming all the resources needed to run server processes for all the application clusters all the time. A method in accordance with the present invention comprises: holding an application request for a dormant application cluster in a holding zone; changing a status of the dormant application cluster to active; changing a status of an unused active application cluster to dormant; stopping server processes for the newly dormant application cluster; starting server processes for the newly active application cluster; and directing the application request held in the holding zone to the server processes for the newly active application cluster.