Abstract: Disclosed are various embodiments for a flexible hydration sensor that can be implemented in a wearable device. A hydration monitoring device can include at least one flexible electrode comprising a plurality of silver nanowires embedded within a polydimethylsiloxane (PDMS) substrate. Processing circuitry can be configured to measure a hydration level of an individual wearing the hydration monitoring device based at least in part on a measurement of a skin impedance of the individual. In some embodiments, the hydration monitoring device can also generate a hydration metric based on the level of hydration and display the hydration metric.

Abstract: Methods of manufacturing produce metal implants having nano-modified surfaces that contain antimicrobial properties. The methods may include immersing the implant in an acid, rinsing the acid-treated implant in an aqueous cleaner, and thereafter heating the rinsed implant. The nano-modified implants described herein may contain an increased surface roughness; surface features with increased width or height; and/or decreased surface energy. The implants that result from these methods contain a nano-modified surface that is resistant to microbial cell adhesion and ultimately reduce biomaterials-related infections at the implant site.

Abstract: A rate matching technique may be configured to adjust a rate of cleaning of one or more selected segments of the storage array to accommodate a variable rate of incoming workload processed by a storage input/output (I/O) stack executing on one or more nodes of a cluster. An extent store layer of the storage I/O stack may clean a segment in accordance with segment cleaning which, illustratively, may be embodied as a segment cleaning process. The rate matching technique may be implemented as a feedback control mechanism configured to adjust the segment cleaning process based on the incoming workload. Components of the feedback control mechanism may include one or more weight schedulers and various accounting data structures, e.g., counters, configured to track the progress of segment cleaning and free space usage. The counters may also be used to balance the rates of segment cleaning and incoming I/O workload, which may change depending upon an incoming I/O rate.

Abstract: An optimized segment cleaning technique is configured to efficiently clean one or more selected portions or segments of a storage array coupled to one or more nodes of a cluster. A bottom-up approach of the segment cleaning technique is configured to read all blocks of a segment to be cleaned (i.e., an “old” segment) to locate extents stored on the SSDs of the old segment and examine extent metadata to determine whether the extents are valid and, if so, relocate the valid extents to a segment being written (i.e., a “new” segment). A top-down approach of the segment cleaning technique obviates reading of the blocks of the old segment to locate the extents and, instead, examines the extent metadata to determine the valid extents of the old segment.

Abstract: A system and method for handling un-partitioning of a computer network are disclosed. Routing information may be stored on a first node in the network when the network is partitioned into a first group of nodes and a second group of nodes, where the first node is in the first group of nodes. Storing the routing information on the first node may include storing information usable to route messages to nodes in the first group of nodes. A technique for determining when the second group of nodes has become un-partitioned from the first group of nodes (i.e., for determining when the partition has been repaired) may be employed. In response to determining that the second group of nodes has become un-partitioned from the first group of nodes, the routing information on the first node may be modified. Modifying the routing information on the first node may include storing information useable to route messages to nodes in the second group of nodes.

Abstract: A set of probabilities may indicate the chance of finding the latest version of a data item in any particular data image layer of a data image. A client may use the set of probabilities to request the data item from one or more layers that have a higher probability of having that version of the data item. A client may query more recently created layers to determine whether they have a version of the data item. If any of the more recently created data image layers has a version of the data item, a client may request the data item from the most recent of the more recently created layers and may discard any data returned from the originally requested layer. A client may update the historical probabilities based on which layers contain versions of the data item.

Abstract: A system and method for detecting mirror inconsistencies in a distributed storage environment. Inconsistencies between mirrors may be detected by comparing session tags among individual storage devices. Each data write may include a tag and storage devices may calculate session tags from the write tags. Additionally, a storage device may keep a history including tags from recent writes. When a client sessions ends, a metadata server may compare the respective session tags from different storage devices to determine whether the mirrors are synchronized. If the session tags do not match, the metadata server may examine the metadata histories from the storage devices to determine a cause for the discrepancy in the session tags. If examining the session histories fails to reveal the discrepancy's source, a metadata server may request individual data block checksums from storage devices to attempt a re-synchronization of the mirrored storage devices.

Abstract: Various embodiments of a system and method related to a topology and routing model for a peer-to-peer network are disclosed. A plurality of nodes may be coupled to each other to form a peer-to-peer network. A routing table may be created on each node in the peer-to-peer network. Each node may be operable to route messages to other nodes in the peer-to-peer network using information stored in the routing table. Messages may be propagated among nodes in the peer-to-peer network in a decentralized manner. For example, the peer-to-peer network may not utilize centralized servers of any kind. Each node in the peer-to-peer network may perform substantially the same routing functionality.

Abstract: A method, system and computer accessible medium for expiring access tokens in preparation for freezing file images. A metadata server may maintain a next scheduled quiesce time and may issue access tokens configured to expire before the next scheduled quiesce time. A metadata server may set an access token's expiration time to a maximum expiration time indicated by the next scheduled quiesce time or may set an access token's expiration time to a default expiration time if the default expiration time is earlier than the maximum expiration time. A storage device may recognize and enforce the access token's expiration time.

Abstract: A method and system for implementing a global name space service. The method may include receiving a file system unique identifier corresponding to a particular file and a human-readable name corresponding to the same file. The method may further include binding the human-readable name to the file system unique identifier, thereby creating a mapping between the human-readable name and the file system unique identifier. The system may include a processor coupled to a memory and to a global name space service manager. The global name space service manager may be configured to receive a file system unique identifier corresponding to a particular file and a human-readable name corresponding to the same file. The global name space service manager may be further configured to bind the human-readable name to the file system unique identifier, thereby creating a mapping between the human-readable name and the file system unique identifier.

Abstract: A system and method supporting communication sessions for nodes in a network. A sender node may initiate a send operation to send a message to one or more receiver nodes. For each receiver node, the message may pass from the sender node to the receiver node via a path including a plurality of nodes. At each node through which the message passes, the node may store state information regarding the message. The state information may include information specifying a link via which the message was received. Each receiver node may issue one or more replies to the message. The replies from each receiver node may pass from the receiver node to the sender node via the same path by which the message reached the respective receiver node. This may be accomplished using the state information stored on each node in the path.

Abstract: A file system may save dirty file information indicating portions of files, residing on a storage system, to be modified corresponding data modification requests received by the file system. The file system may update the saved dirty file information to indicate successful modification of the files across redundant storage of the storage system and may track redundancy consistency recovery information on a file-by-file basis or on a file portion basis. A file system may also retrieve saved dirty file information and recover redundancy consistency for portions of files determined, based on the saved dirty file information, not to have redundancy consistency on the storage system. Recovering redundancy consistency may include copying, either directly to via a storage system mechanism, portions of files between redundant storage of the storage system. The redundancy consistency for the saved dirty file information may be recovered prior to recovering redundancy consistency for individual files.

Abstract: A method and system for externally managed file versions. In shared storage environments file versions may be managed utilizing sparse data objects in storage devices. A file version may comprise a chain of one or more sparse data objects, where each object may represent changes compared to the data in other objects of the chain. New, empty sparse data objects may be attached to existing object chains to create new file versions. When providing file version metadata, a metadata server may provide information for the entire object chain. Write permission may be granted only for the front-most object in a chain, while all other objects in the chain may be write-protected. A storage device may expose the presence of holes in sparse data objects to help locate information in the object chain.

Abstract: A system and method for re-mapping location-independent addresses in a computer network. A first node may send a first message addressed to a location-independent address, where the first message comprises a request to host an instance of the location-independent address. A second node with which the location-independent address is associated may receive the first message, possibly after the first message was propagated through a path of intermediate nodes. The second node may send a response message to the first node, where the response message indicates whether the second node is granting permission to the first node to host an instance of the location-independent address. The response message may also specify whether the second node is giving up its own instance of the location-independent address.

Abstract: Coaxial and twisted pair conductive yarn structures reduce signal crosstalk between adjacent lines in woven electrical networks. A coaxial conductive yarn structure includes an inner conductive yarn having a plurality of conductive strands twisted together. An outer conductive yarn is wrapped around the inner conductive yarn. An insulating layer separates the inner and outer yarns. A twisted pair conductive yarn structure includes first and second conductive yarns, each including a plurality of conductive strands being twisted together. The first and second conductive yarns are twisted together to form a helical structure. In a woven electrical network, at least one conductor of adjacent conductive yarn structures is connected to ground to reduce signal crosstalk. Coaxial and twisted pair yarn structures may also be formed simultaneously with weaving or knitting the threads that make up the structures into a fabric.

Abstract: A file system may selectively perform redundancy consistency recovery and synchronization of mirrors and may store dirty file information in a log or journal that indicates the modification of a file. A file system may update saved dirty file information to indicate successful modification of data across mirrors and may keep track of redundancy consistency recovery information on a file-by-file basis or may track the redundancy consistency of portions of files. A file system may also instruct an underlying storage system not to track data modifications, possibly selectively for each I/O request. During synchronization the file system may synchronize its log and use saved dirty file information to determine files to be synchronized. A file system may selectively use file system logging for individual data modification requests and may expose an API allowing applications to specify a redundancy consistency mechanism.

Abstract: Various embodiments of a system and method related to location-independent message addressing for a computer network are disclosed. According to one embodiment, a plurality of nodes, e.g., computer systems, may be connected to a network. The plurality of nodes may include a first node which is operable to send a message addressed using a “role”. The role may be associated with one or more other nodes coupled to the network. The message may be sent to each of the one or more nodes with which the role is associated without specifying locations of the one or more nodes. For example, the role may have an associated name, and the message may be addressed using the role name.

Abstract: A method and system for creating a peer-to-peer overlay network. The method includes discovering a set of node characteristics for each of a subset of existing nodes of a network. The method also includes scaling each of the discovered set of node characteristics to a value which is within a predetermined range of values. The method also includes generating a set of weighted values for each of the subset of nodes by applying a weighting function to each of the scaled values. In addition, the method includes generating a node rank value for each of the subset of nodes by summing the weighted values of each respective set of weighted values. Further, the method includes determining whether to connect to any of the subset of nodes based upon the node rank value.

Abstract: In-line fiber optic structure devices for use as environmental sensors and methods of fabricating in-line fiber optic structures as environmental sensors are disclosed and provided. According to some embodiments, fiber optic sensor devices can utilize the interaction of surface plasmons or evanescent waves with a surrounding environment. Fiber optic sensors according to some embodiments of the present invention provide an optical fiber with a long environmental interaction length having improved structural integrity. Graded-index optical fiber elements can be used as lenses and a coreless optical fiber element can act as an environmental interaction or sensing area. Graded-index and coreless optical elements can be fused to provide a continuous fiber optic sensing system. Other various embodiments are also claimed and described.

Abstract: Coaxial and twisted pair conductive yarn structures reduce signal crosstalk between adjacent lines in woven electrical networks. A coaxial conductive yarn structure includes an inner conductive yarn having a plurality of conductive strands twisted together. An outer conductive yarn is wrapped around the inner conductive yarn. An insulating layer separates the inner and outer yarns. A twisted pair conductive yarn structure includes first and second conductive yarns, each including a plurality of conductive strands being twisted together. The first and second conductive yarns are twisted together to form a helical structure. In a woven electrical network, at least one conductor of adjacent conductive yarn structures is connected to ground to reduce signal crosstalk. Coaxial and twisted pair yarn structures may also be formed simultaneously with weaving or knitting the threads that make up the structures into a fabric.