Abstract: Aspects of the subject disclosure may include, for example, a method including providing a video presentation to user devices. A latency related to the video presentation is determined for each device; a high-latency user device is identified having greater latency than other, low-latency devices. Field of view information is analyzed for each of the low-latency devices; based on the analyzing, a field of view of the high-latency user device is predicted. In accordance with the predicting, a predicted viewing map for the high-latency user device is generated. The video presentation for the high-latency user device is adjusted based on the predicted viewing map. Other embodiments are disclosed.

Abstract: Various exemplary embodiments relate to a method and related network node including one or more of the following: receiving a request message, the request message including a pointer; determining whether the network node is associated with the pointer; and if the network node is associated with the pointer: determining a label associated with the pointer, modifying the request message to produce a modified message, the modified message including the label, and transmitting the modified message to at least one other network node. Various embodiments additionally or alternatively relate a method and related network node including one or more of the following receiving a publish message, wherein the publish message includes a pointer; generating a label to be associated with the pointer; modifying the publish message to produce a modified message, wherein the modified message includes the label; and transmitting the modified message to at least one other network node.

Abstract: A method, a system and computer program products for securely enabling in-network functionality over encrypted data sessions, the method involving establishing an encrypted data session between a client communication application (100) and a server communication application (200) over a communication network; receiving and/or transmitting, by the client communication application (100), in the established encrypted data session, at least one encrypted communication data (D) from/to the server communication application (200) through a computing network element (M); and performing, by the computing network element (M), different actions other than data packet forwarding from one communication application to the other on the encrypted communication data (D). The encrypted communication data (D) has a plurality of data portions, or contexts, (CTX), each encrypted by a context key, and the different actions being specific for the computing network element (M) and for one or more of the contexts (CTX_X).

Abstract: Various exemplary embodiments relate to a method and related network node including one or more of the following: receiving, at the first network device, a message to be forwarded; determining a destination address for the message; determining whether the destination address is assigned to the first network device; if the destination address is not assigned to the first network device, querying a second network device for a next hop of the destination address; receiving, in response to the query, an indication of the next hop for the destination address; and forwarding, by the first network device in response to the indication of the next hop, the message to the next hop.

Abstract: A capability is provided for reducing the costs of data transfers for networks using pricing heterogeneity. For data to be transferred between an application of a first network and a user device, the data may be transferred directly without using a second network or indirectly using a second network including a transfer of the data between the first network and the second network. In a network-based file system, a first network is primarily used for write requests and a second network is primarily used for read requests, and a data block is transferred from the first network to the second network based on a determination that a threshold number of read requests for the data block have been received. The determination as to when to transfer data between networks may be determined based on various costs associated with the networks.

Abstract: A capability is provided for reducing the costs of data transfers for networks using pricing heterogeneity. For data to be transferred between an application of a first network and a user device, the data may be transferred directly without using a second network or indirectly using a second network including a transfer of the data between the first network and the second network. In a network-based file system, a first network is primarily used for write requests and a second network is primarily used for read requests, and a data block is transferred from the first network to the second network based on a determination that a threshold number of read requests for the data block have been received. The determination as to when to transfer data between networks may be determined based on various costs associated with the networks.

Abstract: A packet classification capability is presented herein. The packet classification capability enables improvements in packet classification via use of a combination of a primary processing unit and a secondary processing unit where the secondary processing unit is configured to perform packet classification functions in parallel based on distribution of packet classification information across processing blocks of the secondary processing unit. The processing blocks of the secondary processing unit may be supported using a set of processing elements, where each of the processing elements may include a shared memory, respectively. The secondary processing unit may be configured to use a linear search process, a tuple search process, a Bloom search process, or the like. The primary processing unit may be a Central Processing Unit (CPU) and the secondary processing unit may be a Graphics Processing Unit (GPU).

Abstract: A capability is provided for reducing the costs of data transfers for networks using pricing heterogeneity. For data to be transferred between an application of a first network and a user device, the data may be transferred directly without using a second network or indirectly using a second network including a transfer of the data between the first network and the second network. In a network-based file system, a first network is primarily used for write requests and a second network is primarily used for read requests, and a data block is transferred from the first network to the second network based on a determination that a threshold number of read requests for the data block have been received. The determination as to when to transfer data between networks may be determined based on various costs associated with the networks.

Abstract: Methods and apparatus are provided for identifying participants in a peer-to-peer network, such as an Ares™ network. Peers are identified by sending a bootstrap request message to at least one peer; receiving a response from the at least one peer to the bootstrap request, wherein the response identifies one or more additional peers; and repeating the sending and receiving steps for the one or more additional peers until the bootstrap response satisfies one or more predefined criteria. The predefined criteria can be that the bootstrap response does not identify at least one new peer within a predefined period of time, or that the bootstrap response does not identify at least one new peer at all. The bootstrap requests are generally sent only to peers that have not been previously contacted. The bootstrap request message may comprise, for example, only one packet and requests that the recipient identify a predefined number of random peers.

Abstract: Various exemplary embodiments relate to a method and related network node including one or more of the following: receiving, at a first input line card of the network device, a message, the message including a destination address; transmitting the message, by the first input line card, to the second input line card based on the determination that the second input line card is configured with routing information related to the destination address; determining, by the second input line card and based on the routing information related to the destination address, that the message should be forwarded via a first output line card of the network device to another network device; transmitting the message, by the second input line card, to the first output line card based on the determination that the message should be forwarded; and transmitting the message, by the first output line card, to another network device.

Abstract: A method is intended for verifying storage of contents into communication equipments connected to at least one communication network.

Abstract: A packet classification capability is presented herein. The packet classification capability enables improvements in packet classification via use of a combination of a primary processing unit and a secondary processing unit where the secondary processing unit is configured to perform packet classification functions in parallel based on distribution of packet classification information across processing blocks of the secondary processing unit. The processing blocks of the secondary processing unit may be supported using a set of processing elements, where each of the processing elements may include a shared memory, respectively. The secondary processing unit may be configured to use a linear search process, a tuple search process, a Bloom search process, or the like. The primary processing unit may be a Central Processing Unit (CPU) and the secondary processing unit may be a Graphics Processing Unit (GPU).

Abstract: A data matching capability is presented herein. The data matching capability may be configured to support matching of a set of values of a set of data fields to a corresponding set of values of a corresponding set of data fields. The data matching capability may be configured to support matching of a set of values of a set of data fields to a corresponding set of values of a corresponding set of data fields based on use of the set of values of the set of data fields as an input and based on a hash table representation of a hash table storing the corresponding set of values of the corresponding set of data fields. The data matching capability may be used within various contexts including packet classification within telecommunication networks.

Abstract: Provided is a method for localizing content in a peer-to-peer network. The method includes receiving a message announcing first content. Storing a <key, value> pair in a table based on the message. The key represents content information and the value represents node information. The node information identifies a node announcing the content, and the content information identifying the content. Storing a plurality of first variation keys in the table. Each of the plurality of first variation keys being a variation of the stored first key. The method further includes intercepting a request message and sending a response to a sender of the request message. The response message including the list of nodes, the list of nodes based on a key based on a destination address of the request message and the table.

Abstract: Provided is a method for content popularity extraction from a distributed hash table (DHT). The method includes receiving, by a first node, a request message from a second node of a peer-to-peer network. Accessing, by the first node, information associated with the request message, the information indicating a content item and a content demand. And determining, by the first node, a content popularity of a plurality of content items based on the information.

Abstract: Various embodiments provide a method and apparatus for providing queries in an information-centric network. In particular, the content is identified by a name that includes discrete components that identify the participating caching nodes within a network. Caching nodes store a reference to the content and are configured to provide the address of the node(s) providing the requested content.

Abstract: A multi-layer peer-to-peer (P2P) capability is provided. A multi-layer P2P system includes a plurality of P2P networks associated with a plurality of hierarchical layers. For example, a first hierarchical layer may include a first P2P network including all peer nodes of the P2P system, and a second hierarchical layer may include a plurality of second P2P networks where the second P2P networks of the second hierarchical layer include respective subsets of the peer nodes of the first P2P network. The second P2P networks of the second hierarchical layer may be organized based on one or more characteristics (e.g., the geographic locations of the peer nodes, the Internet Service Providers (ISPs) with which the peer nodes are associated, and the like). A node participating in the P2P system joins the first P2P network of the P2P system and one of the second P2P networks of the P2P system.

Abstract: Various embodiments relate to a method performed by a router. The method may include: receiving, at a first line card of the router, a request for content having a content identifier; determining a second line card that is responsible for the content identifier; switching the request for content to the second line card; and updating a pending interest table at the second line card based on the request for content. Various embodiments relate to a router for content based routing that receives a plurality of requests for contents including a content identifier. The router may include: a fabric switch; and a plurality of line cards interconnected by the fabric switch, each line card includes a network processor and a pending interest table configured to store entries for a subset of the requests defined by the content identifier.

Abstract: A method for increasing localization of P2P traffic for content distribution includes distributing named content from hosting peers to requesting peers in conjunction with tracking nodes using fingerprint chunk messages that carry fingerprint names and data chunks. The named content is divisible into data chunks identified by fingerprint names such that a content fingerprint list for named content identifies the fingerprint name for each data chunk. Fingerprint names are based on content data in the data chunk such that data chunks with the same content data are represented by the same fingerprint name and data chunks with different content data are represented by different fingerprint names. When a data chunk is available from multiple hosting peers, selection of a hosting peer is based on comparing localization characteristics for the requesting peer to localization characteristics for the multiple hosting peers with preference to the hosting peer that localizes P2P traffic.

Abstract: A method and apparatus to manage allocation of data to peers in a peer-to-peer network, where the peers in the peer-to-peer network use distributed hash tables for addressing the peers, the peers associated with bit addresses, including dividing a virtual scene into a plurality of cells, each cell associated with a bit identifier, neighboring cells of the virtual scene associated with bit identifiers which differ from each other by one bit and allocating data in each cell of the virtual scene to peers whose bit address is closest to the bit identifier of the cells.