Patent application number | Description | Published |
20110219069 | METHOD FOR MANAGING THE ALLOCATION OF DATA INTO A PEER-TO-PEER NETWORK AND PEER IMPLEMENTING SUCH METHOD - 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. | 09-08-2011 |
20120084429 | Methods and Apparatus for Identifying Peers on a Peer-to-Peer Network - Methods and apparatus are provided for identifying participants in a peer-to-peer network, such as an Ares P2P 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. | 04-05-2012 |
20120185541 | Traffic Localization In Peer-To-Peer Networks - 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. | 07-19-2012 |
20120185595 | Traffic Localization Mechanism For Distributed Hash Table Based Peer-To-Peer Networks - Provided is a method for localizing peer-to-peer traffic. The method includes receiving, by a first node, a request message from a second node of a peer-to-peer network. The method includes accessing a table based on the request message to determine if the second node is associated with a local network. The table stores a plurality of keys and node information indicating a relationship between the first node and the local network. The node information is stored in relation to each of the plurality of keys. The method includes transmitting a response message to the second node if the second node is associated with the local network. | 07-19-2012 |
20120221692 | METHOD AND APPARATUS FOR LOCALIZATION IN PEER-TO-PEER SYSTEMS - 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. | 08-30-2012 |
20120311073 | ROUTING BY RESOLUTION - 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. | 12-06-2012 |
20120327931 | GATEWAYS INTEGRATING NAME-BASED NETWORKS WITH HOST-BASED NETWORKS - A method of retrieving content from a network with a host-based network and a name-based network includes receiving, at a network node, a first message including at least one of a first host-based request and a first name-based interest, and transmitting, from the network node, a second message based on the at least one of the first host-based request and the first name-based interest. | 12-27-2012 |
20130024510 | Content Popularity Extraction In Distributed Hash Table Based Peer-To-Peer Networks - 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. | 01-24-2013 |
20130242996 | METHOD AND SYSTEM FOR FAST AND LARGE-SCALE LONGEST PREFIX MATCHING - 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. | 09-19-2013 |
20130275618 | METHOD AND APPARATUS FOR REDUCING CONTENT REDUNDANCY IN CONTENT-CENTRIC NETWORKING - A method for reducing content redundancy in CCN includes distributing named media content or another type of content from sources to consumers through host devices and intermediate devices via a communication network using object messages that carry fingerprint names and data chunks. The named content is divisible into data chunks represented by fingerprint names such that a content fingerprint list for content identifies data chunks for the content using fingerprint names. The fingerprint names are based on content data in the data chunk such that data chunks with the same content data for the named content and for other content are represented by the same fingerprint name and data chunks with different content data are represented by different fingerprint names. A subsystem associated with the method includes consumer and source communication modules; a local storage device; message routing, fingerprint list processing, and object caching modules; and a message processing controller. | 10-17-2013 |
20140036918 | HIGH-SPEED CONTENT ROUTING - 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. | 02-06-2014 |
20140095605 | METHOD AND APPARATUS FOR INCREASING LOCALIZATION OF PEER-TO-PEER TRAFFIC FOR CONTENT DISTRIBUTION IN COMMUNICATION NETWORK - 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. | 04-03-2014 |
20140280823 | WIRE-SPEED PENDING INTEREST TABLE - 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. | 09-18-2014 |