Abstract: A method for managing resources of virtual backup appliances is described. The method includes receiving, by a backup management server (BMS), a request to back up a plurality of virtual machines (VMs), determining, at the BMS, a set of VMs to be backed up from the plurality of VMs that yields a maximum performance for the backup request without causing the set of VM servers to become bottlenecked, wherein the determination is performed based on at least one of a concurrency limit of the virtual backup appliance (VBA) and any VBA proxies corresponding to the set of VMs, and a set of one or more data performance metrics of one or more storage devices in the set of VM storage arrays, and sending one or more backup jobs to the VBA to back up the determined set of VMs to be backed up to a backup storage system.

Abstract: A method for managing resources of virtual backup appliances is described. The method includes receiving, by a backup management server (BMS), a request to back up a plurality of virtual machines (VMs), determining, at the BMS, a set of VMs to be backed up from the plurality of VMs that yields a maximum performance for the backup request without causing the set of VM servers to become bottlenecked, wherein the determination is performed based on at least one of a concurrency limit of the virtual backup appliance (VBA) and any VBA proxies corresponding to the set of VMs, and a set of one or more data performance metrics of one or more storage devices in the set of VM storage arrays, and sending one or more backup jobs to the VBA to back up the determined set of VMs to be backed up to a backup storage system.

Abstract: Protecting a first backup application is disclosed. A backup of a state of the first backup application is received. The first backup application coordinates backup of a virtual environment. A second backup application external to the virtual environment is used to store the backup. The backup may be stored in a data storage external to the virtual environment.

Abstract: Children backup applications communicating to parent backup applications via application program interfaces are described. A child backup task is executed by a child backup application. Backup information associated with an execution of the child backup task by the child backup application is communicated from the child backup application via an application program interface to a parent backup application. A parent backup task is executed by the parent backup application based on the backup information. The child backup application inherently lacks a functionality to execute the parent backup task as the parent backup application executes the parent backup task.

Abstract: Various methods and techniques are disclosed to manage resources of virtual backup appliances in a backup and recovery network. In one embodiment, a backup server receives a request to decommission a virtual backup appliance (VBA) of a first primary storage system. The backup server is configured to manage backup operations to back up data from a plurality of primary storage systems to a backup storage system over a network, where each primary storage system has one or more VBA that carry out backup operations. In response to the request, the backup server transmits a first request to the first primary storage system over the network to delete data and metadata related to the data associated with the VBA. The back up server then determines whether the backup storage system contains data associated with the requested VBA. Upon the determination, the backup server transmits a second request to the backup storage system to delete the data associated with the requested VBA from the backup storage system.

Abstract: Generating a message output is disclosed. An indication triggering generation of a message is received. A message output of the message is generated in a manner that allows the message to be rendered using a later determined context. Rendering a message is disclosed. An indication that a previously generated output of a message is desired to be rendered is received. The message rendered based at least in part on a context determined after the message output was generated.

Abstract: Specifying a message is disclosed. A message and one or more arguments of the message are specified. An argument type is associating with at least one of the one or more arguments. Processing a message is disclosed. A message is identified to be transformed. The message is transformed at least in part by using an argument type associated with an argument of the message.

Abstract: A process for organizing data objects backed up from a content-addressed storage systems is disclosed. Content-addressed storage systems back up data objects in a flat directory, labeling them with non-intuitive user-unfriendly content addresses. Such directories can be large and difficult to browse, making selective recovery of desired data objects inefficient and laborious. When the content-addressed storage system is further archived to a secondary storage device, such as tape, navigation of archived data objects is especially tedious and difficult. An embodiment of the present invention enables easy navigation of a data object directory created by building a pseudo-file structure as content addressed data objects are archived to a secondary backup device. The file structure of the data object director is based upon timestamp metadata extracted from each data object, resulting in a navigable directory tree that is more intuitive and user-friendly.

Abstract: Associating a message identifier with a message is disclosed. The message is specified in a program code. It is determined whether the message specified in the program code matches an entry of a message catalog. A message identifier is associated with the message automatically based at least in part on the determination.

Abstract: What is disclosed is process for backing data objects from a content addressed storage system to a tape storage device such that the data objects are written in a contiguous sequential fashion. Data objects are kept together on the storage medium, rather than fragmented. An embodiment of the present invention describes the software modules and memory buffers required to implement this process. Additionally, what is disclosed is a process that restores data objects that have been contiguously written to tape. According to one embodiment of the present invention, recovery of non-fragmented data objects is made more efficient and less prone to failure.

Abstract: In some embodiments, a technique for processing a character comprises receiving a character; determining whether the character is in a predetermined language; transforming the character to a symbol associated with a private area of Unicode if it is determined that the character is not in the predetermined language; and storing a result of the transformation.

Abstract: What is disclosed is process for backing data objects from a content addressed storage system to a tape storage device such that the data objects are written in a contiguous sequential fashion. Data objects are kept together on the storage medium, rather than fragmented. An embodiment of the present invention describes the software modules and memory buffers required to implement this process. Additionally, what is disclosed is a process that restores data objects that have been contiguously written to tape. According to one embodiment of the present invention, recovery of non-fragmented data objects is made more efficient and less prone to failure.

Abstract: A process for organizing data objects backed up from a content-addressed storage systems is disclosed. Content-addressed storage systems back up data objects in a flat directory, labeling them with non-intuitive user-unfriendly content addresses. Such directories can be large and difficult to browse, making selective recovery of desired data objects inefficient and laborious. When the content-addressed storage system is further archived to a secondary storage device, such as tape, navigation of archived data objects is especially tedious and difficult. An embodiment of the present invention enables easy navigation of a data object directory created by building a pseudo-file structure as content addressed data objects are archived to a secondary backup device. The file structure of the data object director is based upon timestamp metadata extracted from each data object, resulting in a navigable directory tree that is more intuitive and user-friendly.