Veritas Technologies LLC

Symantec Corporation

Yingsong Jia

William Joseph Browning

Yong Tian

Xin Wang

Zhi Su

Guangbin Zhang

Hong Yu Jia

Jian Wang

Chao Lei

Shengzhao Li

Xinbao Jin

Hongxing Guan

Shengliang Liu

Xiangrui Liu

Hongyu Jia

Disclosed herein is the creation of probabilistic data structures for container reclamation. One method involves retrieving a segment object list of a data container and creating a probabilistic data structure. The segment object list comprises a plurality of segment objects, the data container comprises the plurality of segment objects and a plurality of data objects, and each segment object of the plurality of segment objects comprises a hash value determined by performing a hashing function on a corresponding data object of the plurality of data objects. The creating includes, for each segment object in the segment object list, identifying an element of a plurality of elements of the probabilistic data structure using a hash value of the each segment object and setting the element to indicate the segment object references a corresponding data object of the plurality of data objects.

Container reclamation using probabilistic data structures

Systems, apparatuses, methods, and computer readable mediums for implementing an I/O router to route requests based on characteristics of the requests. The I/O router may receive requests targeting a single file, and the I/O router may route requests to multiple extent maps based on characteristics of the requests. For example, requests of a first size may be mapped to a first extent map, requests of a second size may be mapped to a second extent map, requests of a third size may be mapped to a third extent map, and so on. Additionally, the system may utilize different deduplication policies for the different types of requests which are mapped to different extent maps.

Routing I/O requests to improve read/write concurrency

Disclosed herein are methods, systems, and processes to perform container reclamation using probabilistic data structures. A hash value associated with a data segment and stored in a data container is received. Elements in a probabilistic data structure are identified using one or more portions of the hash value and element values are determined for each element. In response to a determination that the element values indicate that the segment object should be maintained, the segment object is maintained during compaction of the data container.

Techniques for duplicating deduplicated data include identifying a connection between a source deduplicated data storage and a target deduplicated data storage. A location of a block of data is determined that is located on the source deduplicated data storage for copying to the target deduplicated data storage. A first reference on the target deduplicated data storage is created to the location of the block of data on the source deduplicated data storage. A second reference is created on the source deduplicated data storage to the location of the block of data on the source deduplicated data storage.

Techniques for duplicating deduplicated data

The disclosed computer-implemented method for providing data backup services in a virtual environment may include (1) identifying a data path used to transfer, via a storage area network, backup data between a client system and a host operating system of a backup server, (2) establishing communication between the host operating system and a backup agent on a guest operating system of the backup server, and (3) extending the data path to the guest operating system by facilitating data transfer between the host operating system and the backup agent of the guest operating system such that the backup data is transferred between the client system and the backup agent of the guest operating system. Various other methods, systems, and computer-readable media are also disclosed.

Systems and methods for providing data backup services in a virtual environment

A system and method for efficient transfer of data over a network. A data source and a destination are coupled to one another via a network. The data source is configured to transmit data to the destination and determine a network latency associated with the transmission. In response to determining a first transmission parameter may not be optimized, the source is configured to modify the first transmission parameter and evaluate its effect on data throughput. The source may repeat such modifications as long as throughput is increased. Once the first transmission parameter is deemed optimized, the source may perform a similar procedure for a second transmission parameter. In various embodiments, the first transmission parameter may correspond to a packet size and the second transmission parameter may correspond to a number of streams being processed by the source.

System and method for optimizing transportation over networks

The disclosed computer-implemented method for reconfiguring data flow across network channels may include (1) monitoring, in a replication environment, a first network channel and a second network channel that transmit replication data, where the first network channel transmits the replication data using a first network protocol and the second network channel transmits the replication data using a second network protocol that is different than the first network protocol, (2) identifying one or more characteristics of the first and second network channels, (3) obtaining one or more performance metrics of the first and second network channels, and (4) reconfiguring data flow within the replication environment based on both the characteristics and the performance metrics of the first and second network channels. Various other methods, systems, and computer-readable media are also disclosed.

Systems and methods for reconfiguring data flow across network channels

The disclosed computer-implemented method for dynamically adjusting batch request sizes may include (1) identifying a storage system that accepts batched requests for data stored within the storage system, (2) measuring the latency for at least one request sent to the storage system to retrieve a portion of the data stored within the storage system, (3) adjusting, based on the latency of the request, a batch size for the batched requests sent to the storage system, and (4) sending a batched request of the adjusted batched size to the storage system. Various other methods, systems, and computer-readable media are also disclosed.

Systems and methods for dynamically adjusting batch request sizes

A computer-implemented method for accelerating backup operations may include (1) identifying a volume of data that may be stored by a computing system attached to a network and that may be designated for a backup to a deduplicated data store, (2) monitoring traffic on the network for at least one data object destined for the volume of data, (3) copying the data object from the traffic on the network and (4) seeding the deduplicated data store with the data object before the backup to the deduplicated data store. Various other methods, systems, and computer-readable media are also disclosed.

Systems and methods for accelerating backup operations

A system and method for efficient transfer of backup data over multiple networks. A backup server and a client computer are coupled to one another via a network, such as a local area network (LAN). The backup server is coupled to at least one storage server via another network, such as the Internet. This storage server is coupled to another storage server via at least two networks, such as the Internet and a Fiber Channel connection. The at least two networks are discovered and initialized by the two storage servers. Two or more networks may be bonded together in a single logical communication channel for transferring backup data. In one embodiment, the backup data corresponds to a duplication operation. When two or more network channels are included in the logical communication channel, a load balancing scheme is used to assign backup data traffic to appropriate network channels.

Growing community of inventors

Beijing, China

Yingsong Jia