Abstract: A technique for performing adaptive rate limiting of flow probes is described. The technique includes sending a plurality of flow probes from a first service engine to at least one other service engine. The flow probes are sent at a rate that does not exceed a rate limit. A flow probe of the plurality of flow probes is generated in response to the first service engine receiving a mid-flow packet for a flow that is not recognized by the first service engine. A recipient service engine of the flow probe responds with a success indicator if the recipient service engine recognizes the flow. The technique also includes determining a success rate associated with success indicators received from the at least one other service engine and comparing the success rate with a first threshold. The rate limit is adjusted in response to a comparison result.

Abstract: In one example, a method for writing data includes receiving a write request and performing a first type of logging process in connection with the write request, and creating a corresponding first logging record. Additionally, a second type of logging process is performed in connection with the write request, and a corresponding second logging record created, where the second type of logging process is different from the first type of logging process. Next, a determination is made, as between the two logging records, which of the logging records requires the least amount of non-volatile random access memory (NVRAM), and the logging record that requires the least amount of NVRAM is written to the NVRAM.

Abstract: In some embodiments, a method inserts, by a first computing device, a first value for a capability in a first message that is used in a process to automatically exchange capability values with a second computing device. The first value for the capability indicates the first computing device requires a default route to reach the second computing device as a next hop for sending a packet to a destination. The first computing device sends the first message to the second computing device; and receives a second value for the capability in a second message from the second computing device. The second value indicating the second computing device will send the default route to reach the second computing device. When the default route is received from the second computing device, the first computing device stores the default route from the second computing device in a route table.

Abstract: Some embodiments include processing data via an executable file on a monitor to reduce the dimensionality of the data being transmitted over the wireless network. The output of the executable file also encrypts the data before being transmitted wireless to a remote server. The remote server receives the transmitted data and makes likelihood inferences based on the recorded data.

Abstract: Some embodiments include processing data via an executable file on a monitor to reduce the dimensionality of the data being transmitted over the wireless network. The output of the executable file also encrypts the data before being transmitted wireless to a remote server. The remote server receives the transmitted data and makes likelihood inferences based on the recorded data.

Abstract: An intelligent method of handling incremental backups concurrent with load balancing movement. The file system uses placement tags, incremental backup requests and capacity balancing data movement to make intelligent decision to avoid affecting any backup windows for clients or backup apps. The file system tracks capacity balancing file movements inside the cluster. When switching locations of files in a cluster from one node to another, it is performed as an atomic change of switching inode attributes by the file system after the contents of the file have been copied over to the new node. During the file movement for capacity balancing, the file system handles requests for full backups differently than requests for incremental backups. The file system continues to handle virtual systhesis and fastcopy requests on the node that hosts the previous backup to ensure that the incremental backup succeeds with the expected smaller backup window from the client.

Abstract: A technique for performing adaptive rate limiting of flow probes is described. The technique includes sending a plurality of flow probes from a first service engine to at least one other service engine. The flow probes are sent at a rate that does not exceed a rate limit. A flow probe of the plurality of flow probes is generated in response to the first service engine receiving a mid-flow packet for a flow that is not recognized by the first service engine. A recipient service engine of the flow probe responds with a success indicator if the recipient service engine recognizes the flow. The technique also includes determining a success rate associated with success indicators received from the at least one other service engine and comparing the success rate with a first threshold. The rate limit is adjusted in response to a comparison result.

Abstract: A method for maintaining a replica of a primary storage on a secondary storage, when the primary storage includes data stored in a plurality of nodes. When at least one node or disk has failed, the method takes partial snapshot that excludes the failed node or disk. A diff file is created by the differences between the partial snapshot and a snapshot taken immediately prior to the failure. The diff is applied to the replica. When the failed node or disk comes back online, the method takes a snapshot prior to allowing any write operation. A diff file of the new snapshot is generated by comparing the new snapshot to the snapshot taken immediately prior to the failure. The new diff is applied to the replica.

Abstract: Embodiments for enabling snapshot backups in a global name space of a cluster network, by representing the name space of cluster network in an MTree, storing data files organized in a B+ Tree format on one or more data nodes, storing name specific information of the data files in a B+ Tree format in a meta node, wherein a B+ Tree of the meta node accesses each corresponding B+ Tree in each of the one or more data nodes. The process takes snapshot backups of individual MTree limbs, and links the limbs of each snapshot into groups based on a cluster identifier and snapshot identifier.

Abstract: The present invention relates to a non-invasive cardiac monitoring device that records cardiac data to infer physiological characteristics of a human, such as cardiac arrhythmia. Some embodiments of the invention allow for long-term monitoring of physiological signals. Further embodiments allow for processing of the detected cardiac rhythm signals partially on the wearable cardiac monitor device, and partially on a remote computing system. Some embodiments include a wearable cardiac monitor device for long-term adhesion to a mammal for prolonged detection of cardiac rhythm signals.

Abstract: Some embodiments include processing data via an executable file on a monitor to reduce the dimensionality of the data being transmitted over the wireless network. The output of the executable file also encrypts the data before being transmitted wireless to a remote server. The remote server receives the transmitted data and makes likelihood inferences based on the recorded data.

Abstract: Some embodiments include processing data via an executable file on a monitor to reduce the dimensionality of the data being transmitted over the wireless network. The output of the executable file also encrypts the data before being transmitted wireless to a remote server. The remote server receives the transmitted data and makes likelihood inferences based on the recorded data.

Abstract: Disclosed herein are techniques for generating fractional checkpoints on a distributed file system by snapshotting subcomponents referred to as “file sets.” The techniques include capturing a present time; calculating from configured parameters a future wakeup time for a subsequent set of checkpoints from the present time; walking a database of meta file set objects to locate at least one meta file set object; calculating a retention period for a snapshot that is being created; and generating a global data-less snapshot for the meta file set object and remote data file set objects associated with the meta file set object, and then repeating the process for subsequent file set objects in the database.

Abstract: Described is a system for reclaiming unused storage space when distributing backup data to storage performance-based tiers within a clustered storage environment. The clustered storage environment may organize nodes into storage performance tiers, and each node within a tier may be tuned for a particular type of workload. Accordingly, the system implements a file system that provides the ability to reclaim unused storage space (e.g. perform garbage collection) for specific nodes or tiers independently despite implementing a global namespace. The global namespace may group (or co-locate) aspects of file information with the backup files. For example, file information may be stored on the same node that stores the associated backup files. Accordingly, the system may reclaim unused storage space for each node, or set of nodes forming a storage performance tier, independently and efficiently.

Abstract: This disclosure describes methods to distribute intrusion detection in a network across multiple devices in the network, such as across routing/switching or other infrastructure devices. For example, as a packet is routed through a network infrastructure, an overlay mechanism may be utilized to indicate which of a total set of intrusion detection rules have been applied to the packet. Each infrastructure device may evaluate which rules have already been applied to the packet, using a result of the evaluation to determine where to route the packet in the network infrastructure for application of additional intrusion detection rules. Additionally, each infrastructure device may record a result of its application of the portion of intrusion detection rules directly into the packet.

Abstract: A method for planning a building system includes incorporating user requirements into a floor plan accessed through a mobile device. An installation map is generated of locations for components corresponding to the user requirements. The placement of components is displayed on the floor plan based on specifications of the components and the user requirements.

Abstract: Distributed deduplication wherein runtime performance of dedup pipelines in all nodes is monitored. The bottleneck for each pipeline is identified and machine resources from different nodes are reallocated to seek to balance the costs of each stage of each task in each of the pipelines. While the overall cost for each task may remain the same, stalls may be eliminated such that the total cost to complete all the tasks is reduced. The global dedup ratio and the local compression ratio may be used to weight certain stage costs.

Abstract: A technique for performing adaptive rate limiting of flow probes is described. The technique includes sending a plurality of flow probes from a first service engine to at least one other service engine. The flow probes are sent at a rate that does not exceed a rate limit. A flow probe of the plurality of flow probes is generated in response to the first service engine receiving a mid-flow packet for a flow that is not recognized by the first service engine. A recipient service engine of the flow probe responds with a success indicator if the recipient service engine recognizes the flow. The technique also includes determining a success rate associated with success indicators received from the at least one other service engine and comparing the success rate with a first threshold. The rate limit is adjusted in response to a comparison result.

Abstract: Embodiments for optimizing file lookups after a file or directory rename operation. Files are defined using inode, dirent, and hash entries, and the name space of the files are stored in a B-Tree using file system conventions in which the inode, dirent, and hash values are referenced by the directory first followed by the inode number, as in a first data structure denoted [directory:inode]. Upon a rename of a file, the old inode, dirent, and hash entries are deleted, and a reference is created to the old name using the inode number first followed by the old directory, as in a second data structure denoted [inode:old_directory], and this reference is used as a forward link to the new file under the new directory name.

Abstract: A method of sensor node position determination for a sensor network is provided. A coverage distribution is defined based on a number of sensor nodes and sensor footprints of the sensor nodes. A desired position for each of the sensor nodes is determined based on the coverage distribution and a prior probability distribution defined on a bounded domain for the number of sensor nodes as a minimization of a distance between the coverage distribution and the prior probability distribution. The desired position to configure the sensor nodes is output.