Abstract: A system and method for capacity sizing in a computer device or system includes determining one or more classes of operations based on at least one of historical computational usage and predicted usage for a system. Based on the one or more classes of operations, at least one capacity target is set based on the computational usage for each class such that computational capacity is maintained at a set level over a given time period and the set level satisfies at least one usage criterion over the given time period.

Abstract: The present invention is based on the main ideas that different sub-intervals of a resource utilization time series are to be summarized with different granularity in the time axis, depending on the values of the series over that interval. Therefore, periods of high resource utilization are represented with higher time granularity, while periods of low resource utilization are represented with lower time granularity, the value stored can represent a function of the summarized values, such as the average or maximum value of the low resource utilization period. The captured resource utilization data is used to generate profiles, wherein the profiles summarize the historical utilization data. The profiles further capture pseudo-periodic behavior over different time scales.

Abstract: A system and method are provided for autonomic system management in a computing system containing system resources including network resources and multiple resource demands, or processes. The computing system may be a stream-processing system or other real-time computer management system, such as workload management, or a virtualization engine. The system and method enables achieving a better level of performance than would occur in the computing system using only existing mechanism. It permits, with very low computational overhead, achieving or driving the system closer to a user-defined system performance objective. To do so, a system performance equation is defined to determine a level of performance of the system as a function of the allocation of two or more system resources among a plurality of system resource demands or processes. From this system performance equation, a plurality of resource-specific change equations is derived.

Abstract: A system, method, and computer program product for benchmarking a stream processing system are disclosed. The method comprises generating a plurality of correlated test streams. A semantically related data set is embedded within each of the test streams in the plurality of correlated test streams. The plurality of correlated test streams is provided to at least one stream processing system. A summary is generated for each of the semantically related embedded data sets. A common identifier, which is transparent to the system being tested, is embedded within each stream in the plurality of correlated test streams. The common identifier is extracted from the output data set generated by the stream processing system. At least one of the stored copies of the summaries and the common identifier are compared to an output data set including a set of zero or more correlation results generated by the stream processing system.

Abstract: There is provided a method and system for replicating data at another location. The system includes a source node that contains data in a data storage area. The source node is coupled to a network of potential replication nodes. The processor determines at least two eligible nodes in the network of nodes and determines the communication cost associated with a each of the eligible nodes. The processor also determines a probability of a concurrent failure of the source node and each of eligible nodes, and selects at least one of the eligible nodes for replication of the data located on the source node. The selection is based on an the determined communication costs and probability of concurrent failure.

Abstract: A system and method for workload generation include a processor for identifying a workload model by determining each of a hierarchy for workload generation, time scales for workload generation, and states and transitions at each of the time scales, and defining a parameter by determining each of fields for user specific attributes, application specific attributes, network specific attributes, content specific attributes, and a probability distribution function for each of the attributes; a user level template unit corresponding to a relatively slow time scale in signal communication with the processor; an application level template corresponding to a relatively faster time scale in signal communication with the processor; a stream level template corresponding to a relatively fastest time scale in signal communication with the processor; and a communications adapter in signal communication with the processor for defining a workload generating unit responsive to the template units.

Abstract: An exemplary method of resource allocation is provided. A relationship is estimated between at least one controlled resource and at least one dependent parameter. A resource allocation of the at least one controlled resource is adjusted to effect a desired system goal expressed in terms of the at least one dependent parameter.

Abstract: Systems and methods are provided to determine an allocation of network resources in a distributed on-demand information technology (IT) systems using existing control mechanisms for other operating system resources in order to achieve a desired operating point within the IT system. This desired operating point is obtained by optimizing a goal-based objective function while taking into account system constraints. The relationship between utilization of all system resources, i.e. network resources and processing resources, and attainment of performance objectives is autonomously obtained for a plurality of actions that could be required by a range of system applications. This relationship is used to allocate network resources to applications while maintaining desired performance objectives. The allocation is enforced using existing control mechanisms.

Abstract: Methods and arrangements for constructing a network overlay via embedding an interconnection network in a network overlay graph. Presented herein is one example of an approximation algorithm for efficient mapping of hypercube topology on a network overlay of N nodes such that the average network delay distance measured on the network overlay is minimized. The network delay distances between pairs of overlay nodes are measured on the shortest network paths. The mapping of the interconnection topology to the network overlay nodes preferably involves assigning 2m m-length binary indexes to the network overlay nodes. There is proposed herein a polynomial time algorithm for interconnection topology embedding using iterative cluster division and node binary index assignment. There is further proposed herein a method for construction of network overlays through interconnection network topology embedding, with the objective of optimizing a quality of service metric (e.g.

Abstract: One embodiment of the present method and apparatus for time-based communications port protection includes generating a transmission period schedule that is known only by authorized network users including a server and one or more clients of the server. The transmission period schedule dictates pre-defined times at which the server and clients may communicate, e.g., to transfer data. By communicating only at these secret, pre-defined times, the likelihood that an unauthorized party will be able to disrupt service to the clients is greatly reduced.