International Business Machines Corporation

Hewlett-packard Development Company, L.p.

At+t Corp.

Duke University

University of North Carolina at Chapel Hill

Jeffrey Scott Chase

Ronald Patrick Doyle

David Louis Kaminsky

David Mark Ogle

Richard Dean Telford

Arif Abdulhusein Merchant

John Wilkes

Kimberly Keeton

Dirk Manfred Beyer

Cipriano A Santos

Michael Rabinovich

Steven Dale Ims

Javed Mostafa

Michael Rolandus Shoffner

Kenneth G Yocum

Brent Watson Lamm

Syam Gadde

Charles Patrick Schmitt

Ilya Baldin

Jason Matthew Coposky

Methods, systems, and computer readable media for providing a secure virtual research space are disclosed. According to one aspect, a system for providing a secure virtual research space includes: a data grid for storing and managing data to be shared among multiple collaborative partners, the data grid comprising at least one data storage device; at least one virtual network appliance, each virtual network appliance comprising a hardware processor for providing controlled access to shared data on the data grid by a user; and a data leakage protection mechanism for preventing unauthorized transfer of data out of the secure virtual research space.

Methods, systems, and computer readable media for providing a secure virtual research space

Under the present invention, the performance of a set of system resources is monitored in response to incoming request traffic. When a system resource is approaching an overload condition, a corrective action is identified and implemented. Overload thresholds for each system resource and appropriate corrective actions are contained within a management policy. Based on a performance history of the corrective actions, the management policy can be changed/revised.

Resource-aware system, method and program product for managing request traffic based on a management policy

Popular object requests are handled using a front-end cache, and hashing is applied only to the requests in the stream that were not handled by the front-end cache. A cache (e.g., a web proxy cache) is placed in front of a Level 7 switch and services the popular requests from the cache based on the content of the request (e.g., based on the portion of an HTTP request following the domain name). The remaining requests are hashed and then routed to the back-end server. Requests that make it past the cache are still routed to the back-end server. A Level 4 switch is placed in front of a plurality of web proxy caches, each of which are in turn placed in front of a respective Level 7 switch, each of which are connected to a respective server farm, so that incoming web requests are handled on a round robin basis (or other SLB technique) before being sent to the cache.

Hierarchical load balancing

An improved load balancing method, system, and computer program product handles popular object requests using a front-end cache, and hashing is applied only to the requests in the stream that were not handled by the front-end cache. A cache (e.g., a web proxy cache) is placed in front of a Level 7 switch, such that the cache services the popular requests from the cache based on the content of the request (e.g., based on the portion of an HTTP request following the domain name). The remaining requests are hashed and then routed to the back-end server. This allows the requests that make it past the cache to still be routed to the back-end server and take advantage of the efficiencies provided therefrom.

Method, system and computer program product for hierarchical load balancing

A configuration method includes selecting a design configuration, and modeling the solution configuration having a failure event for the selected solution configuration to determine an amount of down time associated with the failure event. A first penalty cost function is applied the amount of down time to determine a first penalty cost associated with the failure event of the selected solution configuration.

Configuration system and method

An embodiment of a method of designing a storage system begins with a step of assigning decision variables to a range of candidate storage systems. Each of the decision variables identifies a single candidate storage system. The method concludes with a step of employing the decision variables in a mathematical program to determine which of the candidate storage systems meets availability and reliability criteria and incurs a near minimal projected cost.

Method of designing storage system

Techniques are disclosed for programmatically allocating memory among competing services in a distributed computing environment. Characteristics of web request streams and formulas for cache hit rates and client response times are used to create an objective function for memory allocation, such that maximum benefit can be realized from the memory allocations. When a particular service is allocated more memory, it can store more of its objects in cache, which improves client response time. Optionally, information from service level agreements may be used as input to the memory allocation computations.

Programmatically allocating memory among competing services in a distributed computing environment

A method for managing multi-tier SLA relationships. The method can include first computing costs of utilizing edge server resources in a CDN, costs of dedicating content host resources in a content host in lieu of the utilization, and prospective revenues which can be generated by the content host providing services based on the resources to content consumers. Minimum QoS levels can be identified which must be maintained when providing the services to the content consumers according to QoS terms in established SLAs between the content host and individual ones of the content consumers. Finally, a new SLA can be established between the content host and the CDN. Importantly, the new SLA can include QoS terms for selectively allocating resources in the CDN. Moreover, the QoS terms can optimize revenues generated by the content host providing services based on the selective allocation of resources and the computed costs.

Multi-tier service level agreement method and system

A method for enforcing a service discrimination policy in a storage system. The service discrimination policy enforcement method can include monitoring load metrics for physical resources required to access content stored within the storage system. A request to access the content stored within the storage system can be received. A corresponding guaranteed service level can be identified from the request. In consequence, a particular one of the physical resources can be selected to service the request based upon a determination that the selected physical resource can service the request while satisfying the guaranteed service level at a load indicated by the monitored load metrics.

Differentiated storage resource provisioning

A system and method termed adaptive message pipelining in which two or more data paths are joined by a data movement device. The data movement device has a data path controller for each incoming and outgoing data path. Adaptive message pipelining is a dynamic policy which adjusts between a store and forward data delivery method and a cut through delivery of data based upon network and I/O bus contention in order to decrease latency and maximize system throughput.

System and method of adaptive message pipelining

In a computer network system, the caches at individual stations are available to other stations. A central cache directory is maintained at a network server. Each time a station caches a data object received from a remote network, it informs the central cache directory. When a station comes online, it is asked to send a list of the contents of its cache. Whenever a station seeks an object from the remote network, the local network server first checks the central directory cache to see if the request can be satisfied at one of the local stations. Only if it cannot is the requested object retrieved from the remote network.

Growing community of inventors

Durham, NC, United States of America

Jeffrey Scott Chase