Abstract: A system manages network traffic in a distributed system comprising a plurality of network devices. The network devices are divided into a plurality of network slices, each of the network slices including a subset of the network devices such that there is no overlap of network devices between the network slices. Individual network slices are associated with individual slice controllers, and an individual slice controller is configured to manage network routing of an individual network slice. Each of the individual slice controllers route the network traffic within each respective individual network slice. The network traffic is independently routed based on expected network conditions for each respective individual network slice, and data defining routing decisions is contained within each network slice to limit fault effects between the network slices.

Abstract: A system manages network traffic in a distributed system comprising a plurality of network devices. The network devices are divided into a plurality of network slices, each of the network slices including a subset of the network devices such that there is no overlap of network devices between the network slices. Individual network slices are associated with individual slice controllers, and an individual slice controller is configured to manage network routing of an individual network slice. Each of the individual slice controllers route the network traffic within each respective individual network slice. The network traffic is independently routed based on expected network conditions for each respective individual network slice, and data defining routing decisions is contained within each network slice to limit fault effects between the network slices.

Abstract: A network verification system uses general-purpose programming language to create network verification tests. A test orchestrator builds a model of the network only using data from the network verification test. An optimization testing manager creates symbolic packets for verification tests using assertions based on a packet library embedded into the testing manager and the general-purpose programming language.

Abstract: A system manages network traffic in a distributed system comprising a plurality of network devices. The network devices are divided into a plurality of network slices, each of the network slices including a subset of the network devices such that there is no overlap of network devices between the network slices. Individual network slices are associated with individual slice controllers, and an individual slice controller is configured to manage network routing of an individual network slice. Each of the individual slice controllers route the network traffic within each respective individual network slice. The network traffic is independently routed based on expected network conditions for each respective individual network slice, and data defining routing decisions is contained within each network slice to limit fault effects between the network slices.

Abstract: A network verification system uses general-purpose programming language to create network verification tests. A test orchestrator builds a model of the network only using data from the network verification test. An optimization testing manager creates symbolic packets for verification tests using assertions based on a packet library embedded into the testing manager and the general-purpose programming language.

Abstract: The present technology is generally directed to updating a cloud network. This technology may include generating a set is inequalities based network topology information, shared risk link group information, demand information, and traffic solver parameters. The set of inequalities may also be based upon a model of traffic routing that is based on selection of routes based on dynamic and global traffic engineering. A capacity plan may also be generated based on the set of inequalities and at least one objective. The capacity plan may include a target capacity for each link of the plurality of links in the network.

Abstract: The present technology is generally directed to updating a cloud network. This technology may include generating a set is inequalities based network topology information, shared risk link group information, demand information, and traffic solver parameters. The set of inequalities may also be based upon a model of traffic routing that is based on selection of routes based on dynamic and global traffic engineering. A capacity plan may also be generated based on the set of inequalities and at least one objective. The capacity plan may include a target capacity for each link of the plurality of links in the network.

Abstract: A computer management system may track services on multiple computers executing the same workload. Various performance counters may be retrieved from the computers and analyzed to identify those with low deviations and low mean deviations. Statistical tests may then be used to compare the values of a particular computer to the deviation of the group of computers to identify outliers, which may indicate degraded performance and imminent failure of the computer. The management system may analyze any collectable performance related parameter to identify outlying systems.

Abstract: A computer management system may track services on multiple computers executing the same workload. Various performance counters may be retrieved from the computers and analyzed to identify those with low deviations and low mean deviations. Statistical tests may then be used to compare the values of a particular computer to the deviation of the group of computers to identify outliers, which may indicate degraded performance and imminent failure of the computer. The management system may analyze any collectable performance related parameter to identify outlying systems.

Abstract: A computer management system may track services on multiple computers executing the same workload. Various performance counters may be retrieved from the computers and analyzed to identify those with low deviations and low mean deviations. Statistical tests may then be used to compare the values of a particular computer to the deviation of the group of computers to identify outliers, which may indicate degraded performance and imminent failure of the computer. The management system may analyze any collectable performance related parameter to identify outlying systems.

Abstract: A computer management system may track services on multiple computers executing the same workload. Various performance counters may be retrieved from the computers and analyzed to identify those with low deviations and low mean deviations. Statistical tests may then be used to compare the values of a particular computer to the deviation of the group of computers to identify outliers, which may indicate degraded performance and imminent failure of the computer. The management system may analyze any collectable performance related parameter to identify outlying systems.

Abstract: Relevancy propagation for efficient theory combination is described. In one implementation, an efficient SMT solver dynamically applies relevancy propagation to limit propagation of unnecessary constraints in a DPLL-based solver. This provides a drastic increase in speed and performance over conventional DPLL-based solvers. The relevancy propagation is guided by relevancy rules, which in one implementation emulate Tableau rules for limiting constraint propagation, while maintaining the performance of efficient DPLL-based solvers. An exemplary solver propagates truth assignments to constraints of a formula, and tracks which truth assignments are relevant for determining satisfiability of the formula. The solver propagates truth assignments that were marked relevant to a theory solver, while avoiding propagation of irrelevant truth assignments.

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.

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: Various embodiments introduce the notion of a replication entity which implements a highly scalable file replication system. In one embodiment, the replication entity resides in the form of a scalable replication service. In at least some embodiments, the replication service provides a “drive in the sky” facility that can be used by individuals, such as subscribers, to synchronize their individual machines, such that their files are automatically replicated to a safe and always-on location. Alternatively or additionally, individuals such as subscribers can also access their files via a web-based interface when they are away from their machines.

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: Aspects of the subject matter described herein relate to resource replication systems. In aspects, a mechanism is described that maintains replicated resources on a slave member that participates in a replica group. The slave member detects that a local resource has been updated locally. If the resource was created locally in the update, the slave member deletes the local resource. Otherwise, the slave member determines an upstream partner from which to install a replacement resource and then installs the replacement resource. In aspects, this behavior undoes local updates to local resources that occur on the slave member.

Abstract: Aspects of the subject matter described herein relate to replicating resources across machines participating in a replica set. In aspects, a downstream machine requests that an upstream machine notify the downstream machine when updates to resources of the replica set occur. When such updates occur, the upstream machine notifies the downstream machine. In response thereto, the downstream machine requests resource meta-data and may include a limit as to how much resource meta-data may be sent. The upstream machine responds with the requested resource meta-data. Thereafter, the downstream machine determines which data associated with the updated resources to request and requests such data.

Abstract: A computing device has a file stored on a storage volume by a file system and accessed through such file system. The file is defined to include data and metadata relating to the data, and at least a portion of the data of the file is removed from the file and stored at an alternate location such that the data does not occupy substantially any space on the volume and the file is in a reduced, ghosted form. The ghosted file is reconstituted for use by retrieving the data from the alternate location and associating such retrieved data with such ghosted file to form the reconstituted file.

Abstract: Remote differential compression is integrated within applications. Objects are updated between two or more computing devices using remote differential compression (RDC) techniques such that required data transfers are minimized. An algorithm provides enhanced efficiencies for allowing the receiver to locate a set of objects that are similar to the object that needs to be transferred from the sender. Once this set of similar objects has been found, the receiver may reuse any chunks from these objects during the RDC algorithm.