Abstract: In some aspects, a computing system may generate a content-defined tree. A content-defined tree may be a tree of cryptographic hashes where each leaf is a hash of a chunk (e.g., data chunk) of a data object, and each parent node (e.g., interior node) is the hash of a concatenation of the hashes of the parent's children nodes. To create parent nodes for the leaf nodes, a computing system may group leaf nodes together based on a rolling hash (e.g., a rolling hash of the hashes of the leaf nodes) satisfying a condition. Each parent node may include a hash that represents the concatenation of the hashes of the leaf nodes that fall under the corresponding parent node.

Abstract: In some aspects, a computing system may generate a content-defined tree. A content-defined tree may be a tree of cryptographic hashes where each leaf is a hash of a chunk (e.g., data chunk) of a data object, and each parent node (e.g., interior node) is the hash of a concatenation of the hashes of the parent's children nodes. To create parent nodes for the leaf nodes, a computing system may group leaf nodes together based on a rolling hash (e.g., a rolling hash of the hashes of the leaf nodes) satisfying a condition. Each parent node may include a hash that represents the concatenation of the hashes of the leaf nodes that fall under the corresponding parent node.

Abstract: In some aspects, a computing system may generate a content-defined tree. A content-defined tree may be a tree of cryptographic hashes where each leaf is a hash of a chunk (e.g., data chunk) of a data object, and each parent node (e.g., interior node) is the hash of a concatenation of the hashes of the parent's children nodes. To create parent nodes for the leaf nodes, a computing system may group leaf nodes together based on a rolling hash (e.g., a rolling hash of the hashes of the leaf nodes) satisfying a condition. Each parent node may include a hash that represents the concatenation of the hashes of the leaf nodes that fall under the corresponding parent node.

Abstract: The subject technology generates a dataset based at least in part on a set of files. The subject technology generates, utilizing a machine learning model, a set of labels corresponding to the dataset. The subject technology filters the dataset using a set of conditions to generate at least a subset of the dataset. The subject technology generates a virtual object based at least in part on the subset of the dataset and the set of labels, where the virtual object corresponds to a selection of data from the dataset. The subject technology trains a second machine learning model using the virtual object and at least the subset of the dataset, where training the second machine learning model includes utilizing streaming file input/output (I/O), the streaming file I/O providing access to at least the subset of the dataset during training.

Abstract: A cache or other cluster is configuration-aware such that initialization and changes to the underlying structure of the cluster can be dynamically updated for use by a client. A client may use a client driver as an intermediary that is responsible for managing the communication with the cluster. For example, a client driver may resolve an alias from a static configuration endpoint to a storage node. The client driver may request an initial configuration from the storage node and then update configuration from one or more storage nodes that store current configuration of the cluster.

Abstract: A management system may enable and monitor a cache or other cluster to make the cluster configuration-aware such that initialization and changes to the underlying structure of the cluster can be dynamically updated. For example, a distributed memory caching system may provide initial configuration to a client from a memory caching node referenced by an alias provided by a configuration endpoint. Updates of configuration may be retrieved from memory caching nodes, each storing current configuration of the cache cluster. A management system monitors changes to the cache cluster, such as provisioning of new caching nodes, and updates the configuration stored in the caching nodes for retrieval by a client.

Abstract: A cache or other cluster is configuration-aware such that initialization and changes to the underlying structure of the cluster can be dynamically updated for use by a client. A client may use a client driver as an intermediary that is responsible for managing the communication with the cluster. For example, a client driver may resolve an alias from a static configuration endpoint to a storage node. The client driver may request an initial configuration from the storage node and then update configuration from one or more storage nodes that store current configuration of the cluster.

Abstract: A cache or other cluster is configuration-aware such that initialization and changes to the underlying structure of the cluster can be dynamically updated for use by a client. A client may use a client driver as an intermediary that is responsible for managing the communication with the cluster. For example, a client driver may resolve an alias from a static configuration endpoint to a storage node. The client driver may request an initial configuration from the storage node and then update configuration from one or more storage nodes that store current configuration of the cluster.

Abstract: A cache or other cluster is configuration-aware such that initialization and changes to the underlying structure of the cluster can be dynamically updated. For example, a client may resolve an alias from a static configuration endpoint to a node in a cluster. The client may request initial configuration from the node and then update configuration from nodes that store the current configuration of the cluster.

Abstract: A cache cluster is configuration-aware such that client initialization, access to replicated cached data and changes to the underlying structure of the cache cluster can be dynamically updated. For example, a management system monitoring a cache cluster notices a large number of requests for a key that causes a significant load on a first memory caching node. To reduce the load on the first memory caching node, the management system may cause cached data related to the key to be replicated to a second memory caching node. A configuration stored in one or more of the memory caching nodes may be updated by the management system to allow both memory caching nodes to serve the requests for the key to clients.

Abstract: A method, device, and non-transitory computer readable medium for determining and representing one or more authentication requirements for at least one valid service flow of one or more information centric network (ICN) based services. This technique involves capturing service specification and storing it in a repository. Then, one or more possible service flows are generated and represented based on the nature of contents, delivery options and preferred architecture. This representation is again modified based on the trust level among functional entities and authentication scope which are inferred from the service specification. The final representation of the service flow shows only the valid inter-connections and operations among functional entities and the service flow is constrained by authentication requirement.

Abstract: Embodiments describe enhancing bi-directional communication in an information centric computer network through a piggyback session, which comprises mapping requests for data received to content, sending at least one piggyback packet to a remote node, wherein a piggyback packet is a data packet comprising a request field and a content field, receiving at least one piggyback packet from the remote node, and processing the piggyback packets. Processing may comprise splitting the request field and the content field in at least one received piggyback packet, sending the content extracted from the received piggyback packet to a client application running on the computing apparatus and setting one or more events to trigger the processing of at least one piggyback packet. Additional embodiments describe the structure of a piggyback packet and the management of a piggyback session at a router device by validating incoming piggyback packets and determining a recipient accordingly.

Abstract: A method, device, and non-transitory computer readable medium for determining and representing one or more authentication requirements for at least one valid service flow of one or more information centric network (ICN) based services. This technique involves capturing service specification and storing it in a repository. Then, one or more possible service flows are generated and represented based on the nature of contents, delivery options and preferred architecture. This representation is again modified based on the trust level among functional entities and authentication scope which are inferred from the service specification. The final representation of the service flow shows only the valid inter-connections and operations among functional entities and the service flow is constrained by authentication requirement.

Abstract: Embodiments describe enhancing bi-directional communication in an information centric computer network through a piggyback session, which comprises mapping requests for data received to content, sending at least one piggyback packet to a remote node, wherein a piggyback packet is a data packet comprising a request field and a content field, receiving at least one piggyback packet from the remote node, and processing the piggyback packets. Processing may comprise splitting the request field and the content field in at least one received piggyback packet, sending the content extracted from the received piggyback packet to a client application running on the computing apparatus and setting one or more events to trigger the processing of at least one piggyback packet. Additional embodiments describe the structure of a piggyback packet and the management of a piggyback session at a router device by validating incoming piggyback packets and determining a recipient accordingly.