| Patent application number | Description | Published |
|---|
| 20100202448 | ROUTING-BASED PROXIMITY FOR COMMUNICATION NETWORKS - A node in an overlay network requests a ranked list of other nodes in the overlay network that can provide a desired piece of content or service to the requesting node. A separate node such as a router generates the ranked list using a routing algorithm, returning the list to the requesting node so that the requesting node may acquire the desired content or service from the nearest node in the overlay network. | 08-12-2010 |
| 20100226374 | HIERARCHICAL FLOODING AMONG PEERING OVERLAY NETWORKS - In a tiered system of networks capable of processing distributed hash table (DHT) Put and Get messages, if a sending network of a Put or Get is at a tier below a subject tier at which a subject network receiving the message is located, the message is forwarded to networks at tiers below the subject tier. On the other hand, if the sending network is at a tier equal to or above the subject tier, the message is forwarded to all networks in the system other than the sending network. | 09-09-2010 |
| 20100293295 | LIMITED BROADCAST, PEERING AMONG DHTs, BROADCAST PUT OF LIMITED CONTENT ONLY - In system of networks that are not fully meshed with each other and that are capable of processing distributed hash table (DHT) Put and Get messages, message flooding of GET messages is limited by maintaining a list of DHTs the GET has visited. Also, PUT messages include not only the storage location key in the home network but also a list of networks that the PUT has visited, in essence establishing a dynamically changing path within the PUT back to the home network. | 11-18-2010 |
| 20100309789 | ROUTING-BASED PROXIMITY FOR COMMUNICATION NETWORKS - A node in an overlay network requests a ranked list of other nodes in multiple areas of the overlay network that can provide a desired piece of content or service to the requesting node. A separate node such as a router generates the ranked list using a routing algorithm, returning the list to the requesting node so that the requesting node may acquire the desired content or service from the nearest node in the overlay network. | 12-09-2010 |
| 20110145376 | Modifying Operation of Peer-to-Peer Networks Based on Integrating Network Routing Information - A data processing method comprising establishing a first node in a peer-to-peer data communications network, wherein the node is configured as a supernode in conformance with a peer-to-peer communications protocol, wherein the first node is configured as an active listener to one or more network routing protocols executing at a network router; receiving a routing information message from one of the network routing protocols; modifying an operational characteristic of the first node in response to the routing information message; receiving a request from a second node in the peer-to-peer network for a resource that is known to the first node; and responding to the request based on the modified operational characteristic. For example, a peer-to-peer node may be configured as a network-aware BitTorrent Tracker, Gnutella supernode, etc., and can use IGP and BGP information from a router to determine how the node behaves. | 06-16-2011 |
| 20110228782 | Method for Performing Protocol Translation in a Network Switch - A system and method are disclosed for processing a packet. Processing the packet comprises receiving the packet; translating the packet from a first protocol-specific format to a canonical packet format; translating the packet from the canonical packet format to a second protocol-specific format; and forwarding the packet. | 09-22-2011 |
| 20110295942 | APPLICATION-LAYER TRAFFIC OPTIMIZATION SERVICE MAP UPDATES - Using the ALTO Service, networking applications can request through the ALTO protocol information about the underlying network topology from the ISP or Content Provider. The ALTO Service provides information such as preferences of network resources with the goal of modifying network resource consumption patterns while maintaining or improving application performance. This document describes, in one example, an ALTO server that implements enhancements to the ALTO service to enable initiating incremental updates of network and cost maps to ALTO clients upon receiving status information from a content delivery network (CDN) node. | 12-01-2011 |
| 20110295983 | APPLICATION-LAYER TRAFFIC OPTIMIZATION SERVICE ENDPOINT TYPE ATTRIBUTE - Using the ALTO Service, networking applications can request through the ALTO protocol information about the underlying network topology from the ISP or Content Provider. The ALTO Service provides information such as network resource preferences with the goal of modifying network resource consumption patterns while maintaining or improving application performance. This document describes, in one example, an ALTO server that implements enhancements to the ALTO service to assign a PID-type attribute to each of a set of one or more PIDs each associated with a subset of one or more endpoints of a network, wherein a PID-type attribute specifies a type for the subset of endpoints associated with the PID. The ALTO server generates an ALTO network map that includes a PID entry to describe each of the PIDs, wherein each PID entry includes a PID-type field that stores the assigned PID-type attribute for the PID described by the PID entry. | 12-01-2011 |
| 20110296053 | APPLICATION-LAYER TRAFFIC OPTIMIZATION SERVICE SPANNING MULTIPLE NETWORKS - Using the ALTO Service, networking applications can request through the ALTO protocol information about the underlying network topology from the ISP or Content Provider. The ALTO Service provides information such as preferences of network resources with the goal of modifying network resource consumption patterns while maintaining or improving application performance. This document describes, in one example, an ALTO server that intersects network and cost maps for a first network with network and cost maps for a second network to generate a master cost map that includes one or more master cost entries that each represent a cost to traverse a network from an endpoint in the first network to an endpoint in the second network. Using the master cost map, a redirector may select a preferred node in the first network with which to service a content request received from a host in the second network. | 12-01-2011 |
