Abstract: 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.

Abstract: In general, techniques are described for using routing information obtained by operation of network routing protocols to dynamically generate network and cost maps for an application-layer traffic optimization (ALTO) service. For example, an ALTO server of an autonomous system (AS) receives routing information from routers of the AS by listening for routing protocol updates outputted by the routers and uses the received topology information to dynamically generate a network map of PIDs that reflects a current topology of the AS and/or of the broader network that includes the AS. Additionally, the ALTO server dynamically calculates inter-PID costs using received routing information that reflects current link metrics. The ALTO server then assembles the inter-PID costs into a cost map that the ALTO server may provide, along with the network map, to clients of the ALTO service.

Abstract: A software reload is executed. The hardware associated with the network device continues to forward network traffic during the software reload. Also, a kernel of the network device operates unaffected in a protected address space throughout the software reload. Further, the kernel preserves local checkpointed and shared memory data. Application processes running on the network node are shut down gracefully. The reloaded software is brought up and the network device is resynchronized.

Abstract: 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.

Abstract: 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.

Abstract: 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.

Abstract: 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.

Abstract: 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.

Abstract: 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.

Abstract: 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.

Abstract: 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.

Abstract: 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.

Abstract: A system and method are disclosed for establishing a connection between a first endpoint participating in a first protocol and a second endpoint participating in a second protocol. Establishing a connection includes establishing a virtual service endpoint participating in the first protocol on a network device that is connected to the first endpoint and the second endpoint and forwarding to the second endpoint communication directed from the first endpoint to the virtual service endpoint.

Abstract: 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.

Abstract: 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.

Abstract: 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.

Abstract: 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.

Abstract: A method of protecting a protected link is disclosed. The method includes connecting traffic from a service module to a first physical module having a link layer framer that is connected to a protected egress link. The traffic is connected through the first physical module through a pooling switch to a second physical module that is connected to an alternate egress link.

Abstract: Technology is disclosed for directing data through a network switch. One version of a network switch employs a mid-plane architecture that allows data to be directed between any link interface and any processing engine. Each time slot of data from an ingress link interface can be separately directed to any ingress processing engine. Each time slot of data from an egress processing engine can be separately directed to any egress link interface that supports the lower level protocol for the data. In one version of the switch, each processing engine in the network switch has the ability to service all of the protocols from the layers of the OSI model that are supported by the switch and not handled on the link interfaces. This allows the switch to allocate processing engine resources, regardless of the protocols employed in the data passing through the switch.

Abstract: A method and apparatus are described for status enquiry between sending and receiving nodes in a network. For the sending node, the method comprises sending a bulk status enquiry message to inquire status of a plurality of calls to the receiving node. The bulk status enquiry message conforms to a bulk status enquiry format. For the receiving node, the method comprises sending a bulk status enquiry response message in response to a bulk status enquiry message inquiring status of a plurality of calls from the sending network node. The bulk status enquiry message conforms to a bulk status enquiry format and the bulk status enquiry response message conforms to a bulk status enquiry response format.