Abstract: Embodiments are directed to a distributed computing system comprising a plurality of compute nodes for providing resources to users and a hierarchy of two or more layers of controllers coupling the compute nodes to a user interface via a control plane, wherein at least one compute node receives a local application program interface (API) call from an application running on the at least one compute node, the local API call causing the at least one compute node to configure a local resource without requiring commands from the control plane.

Abstract: Embodiments are directed to a distributed computing system comprising a plurality of compute nodes for providing resources to users and a hierarchy of two or more layers of controllers coupling the compute nodes to a user interface via a control plane, wherein at least one compute node receives a local application program interface (API) call from an application running on the at least one compute node, the local API call causing the at least one compute node to configure a local resource without requiring commands from the control plane.

Abstract: Embodiments are directed to a distributed computing system comprising a plurality of compute nodes for providing resources to users and a hierarchy of two or more layers of controllers coupling the compute nodes to a user interface via a control plane, wherein at least one compute node receives a local application program interface (API) call from an application running on the at least compute node, the local API call causing the at least one compute node to configure a local resource without requiring commands from the control plane.

Abstract: Embodiments are directed to a distributed computing system comprising a plurality of compute nodes for providing resources to users and a hierarchy of two or more layers of controllers coupling the compute nodes to a user interface via a control plane, wherein at least one compute node receives a local application program interface (API) call from an application running on the at least compute node, the local API call causing the at least one compute node to configure a local resource without requiring commands from the control plane.

Abstract: A message transport system may use a publication subscription mechanism to connect nodes and transport messages through the nodes. Each node may establish connections to other nodes, and subscription requests and publication notifications may be passed across the nodes to establish paths for messages. When a message is published, the message may be passed over those connections for which a subscription is active. A path identifier may be added to the message as it is passed between nodes, and the path identifier may be used by a subscribing node for identification of the information being received. When a subscriber notification is removed, the path may be deconstructed across multiple nodes. The nodes may be arranged such that each node is agnostic to any connections past the nodes to which it is connected, and may allow any node to subscribe to any information published within the network.

Abstract: A regional data center system corresponding to a particular region of the world. The data center system includes multiple data centers, each configured such that region-specific requests for services may be satisfied by any of the data centers. One or more of the data centers may also perform load balancing on received region-specific request. In order to perform load balancing, the receiving data center may itself process the requests, but in some cases may determine that the request is to be processed by another data center within the regional data center system.

Abstract: A regional data center system corresponding to a particular region of the world. The data center system includes multiple data centers, each configured such that region-specific requests for services may be satisfied by any of the data centers. One or more of the data centers may also perform load balancing on received region-specific request. In order to perform load balancing, the receiving data center may itself process the requests, but in some cases may determine that the request is to be processed by another data center within the regional data center system.

Abstract: Automatic file replication and scanning for malware in a sharing environment is based on detection of file system changes. Only one client of the multi-client environment needs to include malware protection software for all clients to benefit. A file replication service for each client monitors a shared directory, and synchronizes files across clients at the file system driver level. When a new file appears in the shared directory of a client system, through this driver, the new file automatically gets replicated. A malware protection component operates by monitoring the directory for new or modified files. File replication causes automatic malware scanning on the client that has protection. When the file has been cleaned and re-written to the directory, the replication service senses that the file has changed and replicates the cleaned file to the other clients. Thus, the replication behavior produces a multiparty file scanning and cleansing protection scheme.

Abstract: A message transport system may use a publication subscription mechanism to connect nodes and transport messages through the nodes. Each node may establish connections to other nodes, and subscription requests and publication notifications may be passed across the nodes to establish paths for messages. When a message is published, the message may be passed over those connections for which a subscription is active. A path identifier may be added to the message as it is passed between nodes, and the path identifier may be used by a subscribing node for identification of the information being received. When a subscriber notification is removed, the path may be deconstructed across multiple nodes. The nodes may be arranged such that each node is agnostic to any connections past the nodes to which it is connected, and may allow any node to subscribe to any information published within the network.

Abstract: A message transport system may use a publication subscription mechanism to connect nodes and transport messages through the nodes. Each node may establish connections to other nodes, and subscription requests and publication notifications may be passed across the nodes to establish paths for messages. When a message is published, the message may be passed over those connections for which a subscription is active. A path identifier may be added to the message as it is passed between nodes, and the path identifier may be used by a subscribing node for identification of the information being received. When a subscriber notification is removed, the path may be deconstructed across multiple nodes. The nodes may be arranged such that each node is agnostic to any connections past the nodes to which it is connected, and may allow any node to subscribe to any information published within the network.

Abstract: A block based backup system may store backed up data from multiple clients by maintaining backup databases for each client, where each backup database may include blocks of data. The backup system may perform a de-duplication process by examining the databases to identify common blocks and moving the common blocks to a common database. The common blocks may be removed from the client backup databases and a pointer substituted for the data, thus compacting the client backup databases. The de-duplication operation may be performed at an opportunistic time, such as after the clients have completed any data transfer to the backup system.

Abstract: A prioritized backup time within a predetermined backup window can be calculated. The calculated backup time can be a time to initiate a backup operation to backup information from a client to a server. The calculation of the backup time can use a priority of the client and/or a degree of compliance of the client with a backup policy. An initiation of the backup operation by the client can be scheduled to occur at the calculated backup time, and the backup operation can be initiated. Other prioritized scheduling techniques can also be used, such as prioritized backup queue ordering, prioritized preemption of partially complete backup operations, and/or server override of the client's calculated backup time to begin a backup operation on demand.

Abstract: A block based backup system may perform several partial backups to incrementally transfer backup information to a backup system. Each partial backup may build on the previous backup and the partial backups may be marked as unable to be used for restoration. In some cases, the partial backups may be portions of a file system snapshot, while in other cases, the partial backups may include any changes that occurred since a last partial backup. The size of the partial backups may be dynamically changed depending on network connections, workloads, and other factors.

Abstract: A block based backup system may store backed up data from multiple clients by maintaining backup databases for each client, where each backup database may include blocks of data. The backup system may perform a de-duplication process by examining the databases to identify common blocks and moving the common blocks to a common database. The common blocks may be removed from the client backup databases and a pointer substituted for the data, thus compacting the client backup databases. The de-duplication operation may be performed at an opportunistic time, such as after the clients have completed any data transfer to the backup system.

Abstract: A message transport system may use a publication subscription mechanism to connect nodes and transport messages through the nodes. Each node may establish connections to other nodes, and subscription requests and publication notifications may be passed across the nodes to establish paths for messages. When a message is published, the message may be passed over those connections for which a subscription is active. A path identifier may be added to the message as it is passed between nodes, and the path identifier may be used by a subscribing node for identification of the information being received. When a subscriber notification is removed, the path may be deconstructed across multiple nodes. The nodes may be arranged such that each node is agnostic to any connections past the nodes to which it is connected, and may allow any node to subscribe to any information published within the network.

Abstract: Files on a computing device are defined to include data and metadata relating to the data. Data from each file has been removed therefrom and stored at an alternate location and the file is in a reduced, ghosted form. Each of at least some ghosted files has been fully or partially reconstituted for use by retrieving the data thereof from the alternate location and associating such retrieved data with such ghosted file to form the reconstituted file. Upon receiving a trigger based on a triggering event, files are selected from among the fully and partially reconstituted files and never-ghosted files based on first predetermined selection criteria, and each of at least some of the selected files are re-ghosted.

Abstract: Aspects of the subject matter described herein relate to resource replication systems. In aspects, a mechanism is described that detects when local resources are stale. Local resources may be stale when the time between a last successful synchronization activity and a current time exceeds a staleness value. If the local resources are determined to be stale, the local member may refrain from certain synchronization activities until the local member is allowed to resume these certain synchronization activities. If the local resources are not stale, additional synchronization activities including synchronizing resources between the member and an upstream or downstream partner may be performed.

Abstract: A backup file is generated to capture the current state of a computer. The computer state may be restored to the computer in a hybrid manner at a later time by accessing some files and/or data included in the backup file and downloading other files contained in a list in the backup file. By listing some files rather than including the actual files in the backup file, the backup file may be generated faster and require less processing and memory resources. When the computer state is restored, secondary files and computer state data contained in the backup file are installed to the computer. A list of primary files in the backup file is accessed, each primary file is retrieved from one or more remote publishers over a network, and the retrieved primary files are installed.

Abstract: Aspects of the subject matter described herein relate to replicating initial content in resource replication systems. In aspects, each member participating in a replica group obtains a content set state from a directory service. The content set state indicates whether the member is allowed to synchronize resources with another member participating in the replica group. If the member is designated as a primary member, the member may replicate out resources to its downstream partners. If a member is not designated as a primary member, the member may not replicate out resources to its downstream partners until it has successfully synchronized resources with an upstream partner. Fence values may be set which control which resources win (and are replicated out) during synchronization.

Abstract: Aspects of the subject matter described herein relate to shutdown recovery for resource replication systems. In aspects, a mechanism is described in which a machine having replicated data thereon can recover from a dirty shutdown. First, the machine determines whether a dirty shutdown has occurred. If so, the machine automatically performs shutdown recovery by causing resource metadata stored by the machine to be consistent with resource data stored by the machine. This may involve fixing the resource metadata for updates to the resource data that were not flushed to disk or may involve deleting the resource metadata and restoring it from another machine replicating the data.