Abstract: Route changes are processed and filtered to notify a client of those routing updates of interest to a client. In one configuration, a set of network addresses are received from a client indicating route updates of interest to the client and a set of types of routing changes that are of interest. One or more data structures are accordingly populated with this information. In response to receiving a route update, one or more lookup operations are performed on the data structure to identify whether this particular route is of interest to a particular client and/or whether any route dependent on the particular route are of interest to a client. The client is notified of the changes of interest. In one embodiment, the type of change to a route is also matched against a set of types of routing changes that are of interest, and a client is only notified if the change to a route of interest also matches a type of routing change of interest.

Abstract: A block-request streaming system provides for improvements in the user experience and bandwidth efficiency of such systems, typically using an ingestion system that generates data in a form to be served by a conventional file server (HTTP, FTP, or the like), wherein the ingestion system intakes content and prepares it as files or data elements to be served by the file server, which might or might not include a cache. A client device can be adapted to take advantage of the ingestion process as well as including improvements that make for a better presentation independent of the ingestion process. In the block-request streaming system, the an ingestion system generates data according to erasure codes and the client device, through various selection and timing of requests for media data and redundant data, can efficiently decode media to provide for presentations.

Abstract: A block-request streaming system provides for improvements in the user experience and bandwidth efficiency of such systems, typically using an ingestion system that generates data in a form to be served by a conventional file server (HTTP, FTP, or the like), wherein the ingestion system intakes content and prepares it as files or data elements to be served by the file server. The system might include controlling the sequence, timing and construction of block requests, time based indexing, variable block sizing, optimal block partitioning, control of random access point placement, including across multiple presentation versions, dynamically updating presentation data, and/or efficiently presenting live content and time shifting.

Abstract: A block-request streaming system provides for improvements in the user experience and bandwidth efficiency of such systems, typically using an ingestion system that generates data in a form to be served by a conventional file server (HTTP, FTP, or the like), wherein the ingestion system intakes content and prepares it as files or data elements to be served by the file server. A client device can be adapted to take advantage of the ingestion process. The client device might be configured to optimize use of resources, given the information available to it from the ingestion system. This may include configurations to determine the sequence, timing and construction of block requests based on monitoring buffer size and rate of change of buffer size, use of variable sized requests, mapping of block requests to underlying transport connections, flexible pipelining of requests, and/or use of whole file requests based on statistical considerations.

Abstract: A block-request streaming system provides for improvements in the user experience and bandwidth efficiency of such systems, typically using an ingestion system that generates data in a form to be served by a conventional file server (HTTP, FTP, or the like), wherein the ingestion system intakes content and prepares it as files or data elements to be served by the file server, which might include a cache. A client device can be adapted to take advantage of the ingestion process as well as improvements that make for a better presentation independent of the ingestion process. The client devices and ingestion system can be coordinated to have a predefined mapping and template for making block requests to HTTP file names that a conventional file server can accept through the use of URL construction rules. Segment size might be specified in an approximate manner for more efficient organization.

Abstract: Combining parallel Hypertext Transfer Protocol (HTTP) connections and pipelining overcomes an impact of increasing Round Trip Time (RTT) by varying in real time the number of parallel connections and pipelined requests such that the number of outstanding requests is minimal and the link remains fully utilized. Optimal construction and scheduling of requests and connections in an HTTP stack improves page load time and also provides for greater responsiveness to changes in object priorities. Multi-homing and mobility at the application layer for HTTP are addressed. Multi-homing provides for simultaneous use of multiple interfaces, for example WWAN and WLAN interfaces which improves download time, especially in the case that the available bandwidth the interfaces is of the same order of magnitude. Mobility provides for switching connections as the device moves. In combination they provide for smoother mobility. Mobility can be provided this way without server or network support.

Abstract: Disclosed are systems, methods and computer program products for preemptive DNS resolution. A DNS proxy is provided for inspecting data packets transmitted to a client device on a first communication link. The proxy identifies one or more host device names embedded in the inspected data packets and resolves IP addresses associated with the embedded host device names. The proxy device transmits the inspected data packets to the client device without alterations on a second communication link. The second communication link has significantly higher propagation latency than the first communication link. The proxy then transmits to the client device, independent of the inspected data packets, the one or more host device names and the associated resolved IP addresses for use by the client device to establish connections to the host devices identified in the inspected data packet.

Abstract: Facilitating Bi-Directional PIM communication between hosts in different multicast domains. A first rendezvous point (RP) router contained in a first multicast domain receives a first control packet. The first control packet includes a first multicast destination address G1. In response to receiving the first control packet, the first RP router generates a second control packet. This second control packet includes a second multicast destination address G2, wherein the second multicast destination address G2 is distinct from the first multicast IP address G1. After the second control packet is generated, the first RP router transmitting the second control packet toward a second RP router contained in a second multicast domain. The second control packet initiates a distribution tree building process between the first and second RP routers. This distribution tree can be used to transmit multicast data packets between the first and second RP routers.

Abstract: A mechanism to dynamically map a multicast session to a transport tree to reduce flooding of egress routers on the transport tree is provided. A mechanism to reduce the length of time in which transient flooding can occur while the transport tree is being chosen or configured is also provided. The disclosed dynamic mapping mechanisms avoid interruption of an established multicast session. One mechanism disclosed provides for remapping of a multicast session by cloning an original transport tree with which the multicast session is associated, associating the multicast session with the cloned transport tree, and then reconfiguring the cloned transport tree in accord with edge egress routers that have subscribers to that multicast session.

Abstract: Improved systems and methods for implementing data-driven protocols are provided. In one embodiment, improved implementations of multicast routing protocols are provided. Separation between multicast forwarding and control elements are provided by use of a powerful yet simple application program interface (API) for inter-module communication. The API is multicast-routing-protocol-independent and can be used to express the forwarding state of any existing multicast protocol. Efficient platform-specific implementations are facilitated.

Abstract: Improved systems and methods for implementing data-driven protocols are provided. In one embodiment, improved implementations of multicast routing protocols are provided. Separation between multicast forwarding and control elements are provided by use of a powerful yet simple application program interface (API) for inter-module communication. The API is multicast-routing-protocol-independent and can be used to express the forwarding state of any existing multicast protocol. Efficient platform-specific implementations are facilitated.

Abstract: A multi-party reliable transport protocol for use by a higher layer application. A single session source distributes database updates to multiple receivers via a distribution tree. A node desiring to join a session selects a directly-connected node on a path upstream to a source by accessing unicast routing protocol information and sends a “Join” message to this upstream neighbor. Each node participating in the scheme handles retransmission requests from its directly-connected downstream neighbors. A supported application provides storage of previously transmitted information for potential retransmission.

Abstract: A communications system can provide methods of dynamically interleaving streams, including methods for dynamically introducing greater amounts of interleaving as a stream is transmitted independently of any source block structure to spread out losses or errors in the channel over a much larger period of time within the original stream than if interleaving were not introduced, provide superior protection against packet loss or packet corruption when used with FEC coding, provide superior protection against network jitter, and allow content zapping time and the content transition time to be reduced to a minimum and minimal content transition times. Streams may be partitioned into sub-streams, delivering the sub-streams to receivers along different paths through a network and receiving concurrently different sub-streams at a receiver sent from potentially different servers.

Abstract: A multi-party reliable transport protocol for use by a higher layer application. A single session source distributes database updates to multiple receivers via a distribution tree. A node desiring to join a session selects a directly-connected node on a path upstream to a source by accessing unicast routing protocol information and sends a “Join” message to this upstream neighbor. Each node participating in the scheme handles retransmission requests from its directly-connected downstream neighbors. A supported application provides storage of previously transmitted information for potential retransmission.

Abstract: A method of routing multicast traffic in a computer network is disclosed. The method comprises associating a plurality of multicast group addresses on a network device with respective multicast routing topologies. A network device and a network are also disclosed.

Abstract: A system and method to facilitate Bi-Directional PIM communication between hosts in different multicast domains. In one embodiment of the method, a first rendezvous point (RP) router contained in a first multicast domain receives a first control packet. The first control packet includes a first multicast destination address G1. In response to receiving the first control packet, the first RP router generates a second control packet. This second control packet includes a second multicast destination address G2, wherein the second multicast destination address G2 is distinct from the first multicast IP address G1. After the second control packet is generated, the first RP router transmitting the second control packet toward a second RP router contained in a second multicast domain. In one embodiment, the second control packet initiates a distribution tree building process between the first and second RP routers.

Abstract: A mechanism to dynamically map a multicast session to a transport tree to reduce flooding of egress routers on the transport tree is provided. A mechanism to reduce the length of time in which transient flooding can occur while the transport tree is being chosen or configured is also provided. The disclosed dynamic mapping mechanisms avoid interruption of an established multicast session. One mechanism disclosed provides for remapping of a multicast session by cloning an original transport tree with which the multicast session is associated, associating the multicast session with the cloned transport tree, and then reconfiguring the cloned transport tree in accord with edge egress routers that have subscribers to that multicast session.

Abstract: The invention provides a convenient and expandable method for transmitting one or more loss rate statistics determined in a distributed manner from a multicast distribution tree to a source computer. First, the loss rate statistics are collected in a distributed manner from target receiver stations, and from routers in the multicast distribution tree. Second, there is a distributed calculation of statistics on loss rate by routers in the multicast distribution tree. Third, there is transportation of the loss rate statistics back to the source computer in reverse along the multicast distribution tree. For example, congestion information is collected by routers, and the congestion information is sent upstream to the multicast source station in fields of NAK messages. A router may receive a NAK packet in transit from an intended destination station to a source station, the NAK packet indicating loss of a data packet.

Abstract: Route changes are processed and filtered to notify a client of those routing updates of interest to a client. In one configuration, a set of network addresses are received from a client indicating route updates of interest to the client and a set of types of routing changes that are of interest. One or more data structures are accordingly populated with this information. In response to receiving a route update, one or more lookup operations are performed on the data structure to identify whether this particular route is of interest to a particular client and/or whether any route dependent on the particular route are of interest to a client. The client is notified of the changes of interest. In one embodiment, the type of change to a route is also matched against a set of types of routing changes that are of interest, and a client is only notified if the change to a route of interest also matches a type of routing change of interest.

Abstract: Improved systems and methods for implementing data-driven protocols are provided. In one embodiment, improved implementations of multicast routing protocols are provided. Separation between multicast forwarding and control elements are provided by use of a powerful yet simple application program interface (API) for inter-module communication. The API is multicast-routing-protocol-independent and can be used to express the forwarding state of any existing multicast protocol. Efficient platform-specific implementations are facilitated.