A method includes identifying a plurality of local tracklets from a plurality of targets, creating a plurality of global tracklets from the plurality of local tracklets, wherein each global tracklet comprises a set of local tracklet of the plurality of local tracklets, wherein the set of local tracklet corresponds to a target of the plurality of targets; extracting motion features of the target from the each global tracklet of the plurality of global tracklets, wherein the motion features of each target of the plurality of targets from each global tracklet of the plurality of global tracklets are distinguishable from the motion features of remaining targets of the plurality of targets from remaining global tracklets; transforming the motion features into an address code by using a hashing process; and transmitting a plurality of address codes and a transformation parameter of the hashing process to a communication device.

Examples described herein relate to a network interface that includes an initiator device to determine a storage node associated with an access command based on an association between an address in the command and a storage node. The network interface can include a redirector to update the association based on messages from one or more remote storage nodes. The association can be based on a look-up table associating a namespace identifier with prefix string and object size. In some examples, the access command is compatible with NVMe over Fabrics. The initiator device can determine a remote direct memory access (RDMA) queue-pair (QP) lookup for use to perform the access command.

Example methods and computer systems for receive-side processing for encapsulated encrypted packets. One example may comprise: in response to receiving, over a tunnel, a first encapsulated encrypted packet that includes a first encrypted inner packet and a first outer header, generating a first decrypted inner packet by performing decryption and decapsulation; and based on content of the first decrypted inner packet, assigning the first decrypted inner packet to a first processing unit. The method may further comprise: in response to receiving, over the tunnel, a second encapsulated encrypted packet that includes a second encrypted inner packet and a second outer header, generating a second decrypted inner packet by performing decryption and decapsulation; and based on content of the second decrypted inner packet, assigning the second decrypted inner packet to a second processing unit, thereby distributing post-cryptography processing over multiple processing units.

The systems and methods described herein can enable the indirect transmission of session data between different domains. The system can pass the session data through a hashing function so that the data from a given domain remains private and secure to the specific domain. The system can generate clusters of associated domains for a given client device that the system can use to maintain a session between the client device and the domain.

The systems and methods described herein can enable the indirect transmission of session data between different domains. The system can pass the session data through a hashing function so that the data from a given domain remains private and secure to the specific domain. The system can generate clusters of associated domains for a given client device that the system can use to maintain a session between the client device and the domain.

System and techniques for a hierarchical resource constrained networks are described herein. Device participating in the network are divided into groups. These groups correspond to vertices in a routing graph. A leader is selected amongst the devices in each group to function as a routing node connecting to other vertices of the routing graph. Client devices attach to leaf vertices in the routing graph. To reduce overhead in placing devices into the routing pools, a distributed hash table (DHT) can be used. Here, the routing pools can be given DHT IDs based on, for example, a structure of the routing graph. Device DHT IDs are used to assign them to the routing pools based on a distance metric. Routing, in this arrangement, can use the DHT IDs to efficiently compute routing pool hops when routing messages. This arrangement works well for publication-subscription (pub-sub) services.

This document describes network filtering with private resolvable addresses in a wireless network. A source node in the wireless network hashes an identity resolving key and a value of a random number field to generate an address hash. The source node forms an advertisement address that includes a portion of the address hash and inserts the advertisement address in an advertising extension packet. The source node transmits the advertising extension packet over the wireless network, the address hash being usable by a destination node to filter the advertising extension packet.

This document describes network filtering with private resolvable addresses in a wireless network. A source node in the wireless network hashes an identity resolving key and a value of a random number field to generate an address hash. The source node forms an advertisement address that includes a portion of the address hash and inserts the advertisement address in an advertising extension packet. The source node transmits the advertising extension packet over the wireless network, the address hash being usable by a destination node to filter the advertising extension packet.

An apparatus is described. The apparatus includes queue assignment circuitry. The queue assignment circuitry includes first circuitry to select amongst multiple hash keys and second circuitry to hash content of a packet's header with a selected one of the hash keys.

An apparatus is described. The apparatus includes queue assignment circuitry. The queue assignment circuitry includes first circuitry to select amongst multiple hash keys and second circuitry to hash content of a packet's header with a selected one of the hash keys.