Alcatel Lucent

Thomson Licensing

Alcatel-lucent USA Inc.

Matteo Varvello

Moritz M Steiner

Christophe Diot

Jairo Orlando Esteban

Diego Perino

Ivica Rimac

Krishna P Puttaswamy Naga

Murali Kodialam

Fabio Picconi

Rafael P Laufer

Kyung Hwa Kim

Ghulam Memon

Ernst W Biersack

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.

Routing by resolution

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.

Method and system for fast and large-scale longest prefix matching

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.

Reducing costs related to use of networks based on pricing heterogeneity

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).

Packet classification using multiple processing units

Methods and apparatus are provided for identifying participants in a peer-to-peer network, such as an Ares&#x2122; 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. A list of identified peers can be presented to a user, for example, based on one or more demographic criteria.

Methods and apparatus for identifying peers on a peer-to-peer network

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.

High-speed content routing

A method is intended for verifying storage of contents into communication equipments connected to at least one communication network. This method consists, when a first communication equipment stores a content and wants to verify that this content is still stored into a second communication equipment: i) in transmitting a first request, comprising at least an identifier of this content and first data representative of this content and requiring verification of the storage of this content into the second communication equipment, to an auxiliary communication equipment acting as an interface between the communication network and the second communication equipment, ii) in transmitting a second request, comprising at least the content identifier, to the second communication equipment, to require transmission of second data representative of the content to the auxiliary communication equipment, and in triggering a timeout having a chosen duration, and iii) if the auxiliary communication equipment has received the second data before expiration of this timeout, in comparing these received second data, possibly after having processed them, to the received first data, and in transmitting a message representative of the result of this comparison to the first communication equipment.

System and method for automatically verifying storage of redundant contents into communication equipments, by data comparison

Provided is a method for localizing content in a peer-to-peer network. The method includes receiving a message announcing first content. Storing a &#x3c;key, value&#x3e; 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.

Peer to peer localization for content in a distributed hash table

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.

Content popularity extraction in distributed hash table based peer-to-peer networks

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. The node may then interact with the first P2P network and/or the second P2P network for performing various functions within the P2P system.

Method and apparatus for localization in peer-to-peer systems

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.

Method for managing the allocation of data into a peer-to-peer network and peer implementing such method

Provided is a method for localizing peer-to-peer traffic. The method includes transmitting, by a first node of a peer-to-peer network, a first message to one or more other nodes associated with the peer-to-peer network. The message includes a request for content and a deadline for when the content is to be received by the first node.

Growing community of inventors

Port Monmouth, NJ, United States of America

Matteo Varvello