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.

Abstract: A system includes a virtual private network (VPN) gateway and a client device. The VPN gateway receives a domain name system response through a physical coding sublayer. The VPN gateway fetches a fully qualified domain name corresponding to the domain name system response, and fetches one or more access control list rules from an access control list table for a specific user account. The VPN gateway installs an Internet protocol (IP) address in the access control list table for each access control list rule and handles requested data traffic to the IP address. The client device creates a virtual tunnel interface route with a port of a transmission control protocol (TCP) listener device and parses the domain name system response. The client device updates a domain name system cache with the fully qualified domain name and the IP address and sends unencrypted network traffic over the virtual tunnel interface route.

Abstract: The distribution of global namespace to achieve performance and capacity linear scaling in cluster filesystems. Specifically, the disclosure entails the distribution of files, tracked in namespace trees, among various cluster nodes while linking the namespace trees through a centralized access point, thus providing a global namespace abstraction for the distributed cluster.

Abstract: Embodiments are directed to a load balancer process for use in a deduplication backup process implemented in a cluster system that provides ideal placement of the Mtrees on the expanded capacity by monitoring the available capacity and providing recommendations on the best node to place newly created Mtrees. Continuous monitoring of the capacity and activity level of the nodes helps identify the appropriate node to place a new Mtree. The monitoring of existing node in the cluster and balancing capacity by recommending migration of files from heavily-utilized nodes to under-utilized nodes produces an overall increase in cluster performance.

Abstract: Embodiments are described for performing a storage tier-specific file system operation in a file system that comprises a namespace that spans multiple tiers of storage. A file system command can be a tier-specific deletion of files in a multi-tier file system, or a move data operation from a first tier of storage to a second tier of storage, affecting both the first and second tier of storage. The file system command can generate a copy of the namespace for the first tier of storage and a snapshot of the data of the first tier of storage referenced in the file system operation. Functionality may be performed using one or more storage appliances, each of which can have its open processing system, memory and storage device(s). Storage tiers can include active tier, cloud tier, and remote or archive storage tier.

Abstract: The distribution of global namespace to achieve performance and capacity linear scaling in cluster filesystems. Specifically, the disclosure entails the distribution of files, tracked in namespace trees, among various cluster nodes while linking the namespace trees through a centralized access point, thus providing a global namespace abstraction for the distributed cluster.

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 one example, a method includes receiving metadata in the form of a modification to metadata represented by a file system namespace abstraction, wherein the file system namespace abstraction corresponds to less than an entire file system namespace, and the file system namespace abstraction includes one or more pages, and one of the pages corresponds to a particular cached block, updating the file system namespace abstraction based on the received metadata, determining if caching is enabled for the file system namespace abstraction, when caching is enabled for the file system namespace abstraction, caching the updated file system namespace abstraction in SSD storage that includes the cached block, and maintaining a status of the cached block in a Dtable of the SSD storage.

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 one example, a method includes receiving metadata in the form of a modification to metadata represented by a file system namespace abstraction, and the file system namespace abstraction corresponds to less than the entire file system namespace. Next, the file system namespace abstraction is updated based on the received metadata. Next, a determination is made whether or not caching is enabled for the file system namespace abstraction. If caching is enabled for the file system namespace abstraction, the updated file system namespace abstraction is cached in SSD storage.

Abstract: Embodiments are described for a method and system for improving B+Tree scan performance by receiving a data access instruction that specifies pages to be accessed in a data store utilizing a B+Tree data structure; defining a read-ahead context comprising an array of page numbers corresponding to the specified pages; loading the read-ahead context array into a read-ahead cache; and reading the first page of the read-ahead context in a synchronous manner, and each of the subsequent pages of the read-ahead context in an asynchronous manner.

Abstract: A data management device includes a buffer and a processor. The processor may select an unprocessed full key and generate a buffer entry based on a difference between an entry of a local snapshot specified by the unprocessed full key and an entry of a previous local snapshot specified by the unprocessed full key. The processor may make a first determination that a lookup key entry associated with the unprocessed full key is different than a lookup key entry associated with a processed full key. The process may add the generated buffer entry to the buffer after processing the buffer in response to the first determination.

Abstract: A computer system is provided that generates a Graphical User Interface indicating one or more intruder threat levels for a building. The computer system includes a processor, which upon execution of stored instructions is configured to access a building floor plan having one or more entry and exit points and to access an intruder threat level associated with each of the one or more entry and exit points; to perform threat modeling to determine intruder threat levels at a plurality of locations within the building, contingent upon the building floor plan and the intruder threat level associated with the one or more building entry and exit points; and to provide a GUI on a display indicating, relative to the building floor plan, the determined intruder threat level within the building, at the plurality of points within the building and at the one or more entry and exit points.

Abstract: Embodiments are described for repairing the locality of a namespace index on a deduplication storage device. A namespace index is selected from a plurality of namespace indices, each of which is mountable on the storage system. The selected namespace index is traversed and divided into regions, each of which was stored in one or more storage containers. Locality information for each region is generated, including a density metric and a distribution metric. If either metric is below a threshold value for the metric, then the region is enqueued for namespace locality repair. A region can be repaired by reading the region into memory and flushing the memory to co-located containers on the storage system.

Abstract: In one example, a method includes receiving metadata in the form of a modification to metadata represented by a file system namespace abstraction, and the file system namespace abstraction corresponds to less than the entire file system namespace. Next, the file system namespace abstraction is updated based on the received metadata. Next, a determination is made whether or not caching is enabled for the file system namespace abstraction. If caching is enabled for the file system namespace abstraction, the updated file system namespace abstraction is cached in SSD storage.

Abstract: In one or more embodiments, an information handling system may be communicatively coupled to a pointing device that communicates interaction data via a first bus via a first data format and may include a controller that receives the interaction data via the first bus and transforms the interaction data into a second data format and communicates the interaction data to a second bus via the second data format. If a status of a resource associated with the pointing device is queried, the controller may be instructed to cease transforming the interaction data from the pointing device, permitting another device to receive the interaction data and provide the interaction data to a processor of the information handling system. As the other device receives the interaction data and provides the interaction data to the processor, additional and/or full functionality of the pointing device may be realized and/or accomplished.

Abstract: In one example, a method includes receiving metadata in the form of a modification to metadata represented by a file system namespace abstraction, and the file system namespace abstraction corresponds to less than the entire file system namespace. Next, the file system namespace abstraction is updated based on the received metadata. Next, a determination is made whether or not caching is enabled for the file system namespace abstraction. If caching is enabled for the file system namespace abstraction, the updated file system namespace abstraction is cached in SSD storage.

Abstract: In one or more embodiments, an information handling system may be communicatively coupled to a pointing device that communicates interaction data via a first bus via a first data format and may include a controller that receives the interaction data via the first bus and transforms the interaction data into a second data format and communicates the interaction data to a second bus via the second data format. If a status of a resource associated with the pointing device is queried, the controller may be instructed to cease transforming the interaction data from the pointing device, permitting another device to receive the interaction data and provide the interaction data to a processor of the information handling system. As the other device receives the interaction data and provides the interaction data to the processor, additional and/or full functionality of the pointing device may be realized and/or accomplished.