| Patent application number | Description | Published |
|---|
| 20120102148 | METHODS AND SYSTEMS FOR TRANSMISSION OF DATA OVER COMPUTER NETWORKS - A computer-implemented method is provided for transparently optimizing data transmission between a first endpoint and a second endpoint in a computer network. The endpoints have a directly established data session therebetween. The data session is identified by each endpoint at least to itself in the same way throughout the session. The method includes the steps of: relaying data between the endpoints transparently in the session using a network optimization service; and transparently modifying or storing at least some of the data transmitted from the second endpoint to the first endpoint using the network optimization service in order to optimize data communications between the endpoints, wherein transparently modifying at least some of the data comprises changing the data, replacing the data, or inserting additional data such that the first endpoint receives different data than was sent by the second endpoint. | 04-26-2012 |
| 20120117201 | METHODS AND SYSTEMS FOR CACHING DATA COMMUNICATIONS OVER COMPUTER NETWORKS - A computer-implemented method of caching multi-session data communications in a computer network, includes: (a) receiving, intercepting, or monitoring data sessions between a client and metadata services; (b) analyzing queries and responses exchanged between the client and the metadata services to discover metadata for a desired content object; (c) receiving or intercepting subsequent data sessions between the client and content sources; (d) identifying a data protocol used by the client and identifying data queries within the data sessions; (e) identifying the content object requested by the client in the data queries; and (f) determining if the content object is stored in cache and, if so, sending the content object stored in cache to the client, and, if not, sending the data queries to the content sources, storing data responses from the content sources, and sending the data responses to the client. | 05-10-2012 |
| Patent application number | Description | Published |
|---|
| 20110273982 | DEDUPLICATED DATA PROCESSING CONGESTION CONTROL - Various embodiments for deduplicated data processing congestion control in a computing environment are provided. In one such embodiment, a single congestion metric is determined from a sampling of a plurality of combined deduplicated data processing congestion statistics in a number of active deduplicated data processes. The congestion limit is calculated from a comparison of the single congestion metric to a congestion target setpoint, the congestion target setpoint being a virtual dimension setpoint and the congestion limit being a manipulated variable. The number of active deduplicated data processes is compared to the congestion limit. If the number of active deduplicated data processes is less than the congestion limit, a new deduplicated data process is spawned. | 11-10-2011 |
| 20120047338 | SWITCHING VISIBILITY BETWEEN VIRTUAL DATA STORAGE ENTITIES - Various embodiments for switching visibility between virtual data storage entities in a data storage environment using a processor device are provided. Visibility of a data storage entity on a first storage system is switched to a replicated data storage entity on a second storage system. Data from the data storage entity is replicated from the first storage system to the second storage system using a common serial number. The data storage entity is hidden from the first storage system by concealing the common serial number. An ejection of the data storage entity from the first storage system is automated, and the replicated data storage entity is introduced to the second storage system. | 02-23-2012 |
| 20120047392 | DISASTER RECOVERY REPLICATION THROTTLING IN DEDUPLICATION SYSTEMS - Various embodiments for disaster recovery (DR) replication throttling in a computing environment by a processor device are provided. Communication is arrested between a source data entity and a replicated data entity at a location declared in a DR mode. The DR mode is negotiated to a central replication management component as a DR mode entry event. The DR mode entry event is distributed, by the central replication management component, to each member in a shared group. The DR mode is enforced using at least one replication policy. | 02-23-2012 |
| 20120047507 | SELECTIVE CONSTANT COMPLEXITY DISMISSAL IN TASK SCHEDULING - Various embodiments for selective constant complexity dismissal in task scheduling of a plurality of tasks are provided. A strictly increasing function is implemented to generate a plurality of unique creation stamps, each of the plurality of unique creation stamps increasing over time pursuant to the strictly increasing function. A new task to be placed with the plurality of tasks is labeled with a new unique creation stamp of the plurality of unique creation stamps. The one of the list of dismissal rules holds a minimal valid creation (MVC) stamp, which is updated when a dismissal action for the one of the list of dismissal rules is executed. The dismissal action acts to dismiss a selection of tasks over time due to continuous dispatch. | 02-23-2012 |
| 20120089866 | DISASTER RECOVERY PRODUCTION TAKEOVER - Various embodiments for disaster recovery (DR) production takeover in a computing environment by a processor device are provided. If, for a designated storage system operable in the computing environment, a takeover operation may be executed, and a DR storage system has validly replaced the designated storage system using a replacement process, a withdrawal of a DR mode of operation is performed, and ownership of at least one storage device operable in the computing environment is transferred to the DR storage system. The replacement process authorizes the DR storage system to transfer the ownership while withdrawn from the DR mode of operation. | 04-12-2012 |
| 20120096306 | DISASTER RECOVERY FAILBACK - Various embodiments for disaster recovery (DR) failback in a computing environment by a processor device are provided. Pursuant to execution of a predetermined failback policy, if a storage device is not preexistent in a source storage system operable in the computing environment, and an owner of the storage device is one of a DR storage system and a storage system having previously withdrawn from a replication grid, and the DR storage system has authorization to transfer ownership of the storage device by a replacement operation, an instance of the storage device is replicated to the source storage system to generate a replicated instance of the storage device on the source storage system, and ownership of the storage device is designated as the source storage system for each of the instance and the replicated instance of the storage device. | 04-19-2012 |
| Patent application number | Description | Published |
|---|
| 20110040728 | REPLICATION OF DEDUPLICATED DATA - Various embodiments for replicating deduplicated data using a processor device are provided. A block of the deduplicated data, created in a source repository, is assigned a global block identification (id) unique in a grid set inclusive of the source repository. The global block id is generated using at least one unique identification value of the block, a containing grid of the grid set, and the source repository. The global block id is transmitted from the source repository to a target repository. If the target repository determines the global block id is associated with an existing block of the deduplicated data located within the target repository, the block is not received by the target repository during a subsequent replication process. | 02-17-2011 |
| 20110040942 | SYNCHRONIZATION OF REPLICATED SEQUENTIAL ACCESS STORAGE COMPONENTS - Various embodiments for synchronization of source and replicated instances of sequential access storage components in a computing environment by a processor device are provided. A replication synchronization table (RST) is configured for the source instance. The RST is adapted for recording compacted information for at least one of a truncate and an erase operation applied on the source instance. The RST of the source instance is updated at a source component with the compacted information. The updated RST is transmitted from the source instance to the replicated instance. Based on the RST of the source instance and the RST of the replicated instance, data representative of a most recent position on the source component from which data should be transmitted to a replicated component to achieve a full synchronization is determined. | 02-17-2011 |
| 20110040951 | DEDUPLICATED DATA PROCESSING RATE CONTROL - Various embodiments for deduplicated data processing rate control using at least one processor device in a computing environment are provided. A plurality of workers is configured for parallel processing of deduplicated data entities in a plurality of chunks. The deduplicated data processing rate is regulated using a rate control mechanism. The rate control mechanism incorporates a debt/credit algorithm specifying which of the plurality of workers processing the deduplicated data entities must wait for each of a plurality of calculated required sleep times. The rate control mechanism is adapted to limit a data flow rate based on a penalty acquired during a last processing of one of the plurality of chunks in a retroactive manner, and further adapted to operate on at least one vector representation of at least one limit specification to accommodate a variety of available dimensions corresponding to the at least one limit specification. | 02-17-2011 |
