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: In one aspect this invention provides a computer program embodied on a computer readable medium that is executed by at least one data processor of a policy management system. The computer program includes first computer program instructions for implementing a user interface and second computer program instructions for implementing a policy manager that is coupled to the user interface via a policy repository for introducing a new attribute, using the first computer program instructions, into a policy for a policy-managed system, without requiring a change to (e.g., without having to re-write or re-compile) the second computer program instructions.

Abstract: A policy for a computer system is transformed into a plurality of sub-policies, at least one synchronization step, and a final action. The sub-policies are distributed to corresponding sub-components in the computer system. The sub-policies are evaluated, wherein each sub-component evaluates its corresponding one or more sub-policies as other sub-components evaluate their corresponding one or more sub-policies. The sub-policies are synchronized by using the at least one synchronization step. The final action is performed in response to synchronizing the sub-policies. The computer system can be singular or distributed.

Abstract: Provided are data structures for use in storing data. A plurality of data structures are defined in a computer readable medium, wherein each data structure indicates a plurality of attributes and at least one function of a storage resource to store data. Policies are defined in the computer readable medium that associate data characteristics to data structures based on a correspondence of data characteristics and the attributes defined in the data structures, wherein each defined data structure is adapted to provide requirements to determine a storage resource to store associated data, and wherein the defined data structure is adapted to provide the storage resource with requirements for storing the data.

Abstract: Provided are data structures for use in storing data. A plurality of data structures are defined in a computer readable medium, wherein each data structure indicates a plurality of attributes and at least one function of a storage resource to store data. Policies are defined in the computer readable medium that associate data characteristics to data structures based on a correspondence of data characteristics and the attributes defined in the data structures, wherein each defined data structure is adapted to provide requirements to determine a storage resource to store associated data, and wherein the defined data structure is adapted to provide the storage resource with requirements for storing the data.

Abstract: One embodiment of the present method and apparatus for performance and policy analysis in distributed computing systems includes representing a distributed computing system as a state transition model. A queuing network is then superimposed upon the state transition model, and the effects of one or more policies on the distributed computing system performance are identified in accordance with a solution to the queuing network.

Abstract: A method, system, computer program product, and computer program storage device for transforming a high-level policy associated with a high layer to a low-level policy associated with a low layer. Mapping between high-level objects in a high layer and low-level objects in a low layer is derived by an automated discovery tool. The high-level policy is mapped to the low-level policy according to the mapping (e.g., by substituting the high-level objects with the low-level objects and by performing a syntax transformation). In one embodiment, a low-level policy is transformed to a high-level policy according to the mapping. As exemplary embodiments, policy transformations in traffic shaping and data retention are disclosed.

Abstract: A method and a system for relating of a value network analysis of a mission to a knowledge base of dependencies of data objects, applications and information technology resources required for achieving of such mission, such method used for optimization of provisioning for information technology resources and for prioritizing of control of data and application security and integrity of such mission.

Abstract: Described is a method, a system, a computer program product and a service implemented at least partially through a data communications network to dynamically change the effect of an enforcement of a policy in a policy-managed system. The method, system, computer program product and service enabling the user to identify at least one policy as a dynamic policy and to specify at least one part of a policy statement of the dynamic policy to have a value that can be varied while the policy is active.

Abstract: A multi-plan generation system generates a multi-plan for a multi-layer storage area network. The system generates a predetermined number of plans while generating and retaining globally optimum plans. The system dynamically calculates and orders these plans according to optimization criteria and user requirements. The system comprises a planner for each of the layers in a storage area network such as a host planner, a storage planner, a network planner, a zone planner, etc. Each of the planners applies a variance optimization, a preview optimization, and a detail optimization and interacts with a policy repository to obtain policy guidance, enabling the system to prune the set of plans. A control module invokes the planners in a predetermined order.

Abstract: A methodology is presented for discovering and storing end-to-end associations between different types of entities in a system configuration model of a distributed middleware system. First associations are determined, at each distributed system tier, between instances of data and data-container configuration elements. Those first associations point to logical subdivision of a data service that is directly responsible for implementing an instance of data. Second associations are determined, at said each distributed system tier, between said data-container configuration elements and a server infrastructure. Said second associations point to a server infrastructure that hosts said data-container configuration elements. Third associations are composed, within said each distributed system tier, between said instances of data and said server infrastructure, using said first associations and said second associations.

Abstract: A method and system are disclosed that enable a user to search a large collection of structured and unstructured documents using semantic concepts that the system provides to them, to search the most relevant business activity first, and then using one of the business activities as the additional context to search for specific document or documents that are most relevant. One aspect of the invention provides a methodology to perform concept-based structured search over document collections to obtain search results as business activities and associated relevant documents using the business activity context. The document collections are obtained by aggregating documents corresponding to a business activity. The instances are extracted from the document collections together with any concept-relationship specific heuristics in that domain. Another aspect of the invention enables the enterprise user to enter concepts and instances that define the search parameters using a structured user interface.

Abstract: Methods for allocation of storage resources, performance monitoring, and reallocation of resources to eliminate hot spots, by specifying high-level goals, rather than by means of low-level manual steps. Policies are specified as administrator specified constraints under which the resources are managed. Goals are specified in terms of performance, availability, and security requirements of the desired storage. As a part of the automation, this invention provides a method for analyzing capabilities of the computer storage system and forming analysis results, which are later used for determining an allocation of resources that will meet the high-level goals specified. This invention also provides methods for automatic monitoring of performance, availability, and security goals for allocated resources. If goals are not met, resources are reallocated so that the goals can be met with the allocation.

Abstract: A method and system are disclosed for providing automated assistance to a service provider for creating a technical solution definition for a project for delivering Information Technology (IT) outsourcing services for a customer. The method comprises the steps of providing, in machine processable form, a definition of a taxonomy of a set of standard services offered by the service provider; providing, in machine processable form, a repository of service designs, each of the service designs describing a set of IT architecture components to deliver a service associated with a standard service element, according to a specified best practice rule; and providing, in machine processable form, a collection of policies that can be executed to validate the service designs selected to deliver the set of contracted services. A computer implemented design tool is used to define the scope of a project a set of service designs, and to run policy-based validation checks on the design.

Abstract: Techniques for automatically designing an application-requirement based configuration for a distributed computing system are provided. One or more application-level templates are obtained, wherein the one or more templates are representative of one or more requirements associated with one or more applications. Using the one or more application-level templates, one or more logical flows are created. The one or more logical flows are then used to generate one or more system-level configuration plans of the distributed computing system.

Abstract: One embodiment of the present method and apparatus for performance and policy analysis in distributed computing systems includes representing a distributed computing system as a state transition model. A queuing network is then superimposed upon the state transition model, and the effects of one or more policies on the distributed computing system performance are identified in accordance with a solution to the queuing network.

Abstract: In one aspect this invention provides a computer program embodied on a computer readable medium that is executed by at least one data processor of a policy management system. The computer program includes first computer program instructions for implementing a user interface and second computer program instructions for implementing a policy manager that is coupled to the user interface via a policy repository for introducing a new attribute, using the first computer program instructions, into a policy for a policy-managed system, without requiring a change to (e.g., without having to re-write or re-compile) the second computer program instructions.

Abstract: Method and system are disclosed for automatically discovering associations between applications and data in multi-tiered distributed systems. The method in one aspect uses a machine-readable specification of a model or template that describes use and transformation of data by software components. The method additionally utilizes a model of system configuration and appropriate runtime support to mine information available from systems management software present in enterprise systems. The application-data association discovery process performs a traversal of the distributed system configuration graph with actions taken during this traversal driven by the contents of the templates for the software components present in the system. The results of the application-data association discovery process are stored in a database and may be used to specify application-specific information lifecycle management (ILM) policy or as input to impact analysis tools in access control and antivirus systems.

Abstract: Goal-based availability and change management are handled over groups of heterogeneous storage controllers. Probabilistic and deterministic methods are employed to determine the allocation and placement of storage volumes to storage controllers, as well as the degree of data redundancy necessary to achieve data availability goals The probabilistic methods can take into account past observations of controller availability, and operator beliefs, as well as the state of storage controller configuration, in coming up with a probabilistic estimate of future availability.

Abstract: There is provided, in a computer processing system, an apparatus for managing object data. The apparatus includes a changed objects manager for creating and managing a changed objects list that at least identifies the objects that have changed based on time of change. The changed objects list is associated with a plurality of time buckets. Each of the plurality of time buckets is associated with a respective date and time period and with object change records for objects having a timestamp falling within the respective date and time period. Each of the object change records is associated with a unique object identifier and the timestamp for a corresponding one of the objects. The timestamp specifies a date and a time corresponding to a latest one of a creation time or a most recent update time for the corresponding one of the objects.