Abstract:
In one method embodiment, providing a multiplex of compressed versions of a first video stream and a first audio stream, each corresponding to an audiovisual (A/V) program, the first video stream and the first audio stream each corresponding to a first playout rate and un-synchronized with each other for an initial playout portion; and providing a compressed version of a second audio stream, the second audio stream corresponding to a pitch-preserving, second playout rate different than the first playout rate, the second audio stream synchronized to the initial playout portion of the first video stream when the first video stream is played out at the second playout rate, the first audio stream replaceable by the second audio stream for the initial playout portion.
Abstract:
The Real-time Transport Protocol (RTP) and its related standards define a retransmission packet format and a way to give feedback via Negative ACKnowledge (NACK) packets for data that has been lost. In one embodiment, a unicast RTP repair session is associated with a main Source Specific Multicast (SSM) multicast session. Real-time Transport Control Protocol (RTCP) NACK packets are then used for feedback to a SSM feedback target address. This dynamically instantiates unicast RTP repair for multicast sessions. The repair scheme can be used for repairing multicast channels or joining new multicast channels. In another embodiment, a media transmission device shares an IP address with one or more other media transmission devices. The shared IP address can also be used to route multiple identical multicast media streams to different media stream receivers.
Abstract:
A technique efficiently selects a path computation element (PCE) to compute a path between nodes of a computer network. The PCE selection technique is illustratively based on dynamic advertisements of the PCE's available path computation resources, namely a predictive response time (PRT). To that end, the novel technique enables one or more PCEs to dynamically send (advertise) their available path computation resources to one or more path computation clients (PCCs). In addition, the technique enables the PCC to efficiently select a PCE (or set of PCEs) to service a path computation request based upon those available resources.
Abstract:
One embodiment includes receiving a notification at a communications network node; determining a lowest cost path for implementing a next hop for the notification; determining a best alternate path for the next hop; comparing a cost of the best alternate path with a value stored in a notification header field; updating the header field value to equal the cost of the best alternate path if the cost of the best alternate path is less than the header field value; and forwarding the notification along the lowest cost path. Some embodiments include receiving a NACK at the node; comparing a cost of the best alternate path with a NACK header field value; and retransmitting the notification along the best alternate path if the NACK header field value is greater than or equal to the cost of the best alternate path.
Abstract:
A technique efficiently selects a path computation element (PCE) to compute a path between nodes of a computer network. The PCE selection technique is illustratively based on dynamic advertisements of the PCE's available path computation resources, namely a predictive response time (PRT). To that end, the novel technique enables one or more PCEs to dynamically send (advertise) their available path computation resources to one or more path computation clients (PCCs). In addition, the technique enables the PCC to efficiently select a PCE (or set of PCEs) to service a path computation request based upon those available resources.
Abstract:
Techniques are provided for optimizing quality in adaptive streaming, where information is obtained relating to encoding bitrates and content quality scores for content segments of a content stream. The content segments of the content stream are provided by a content server and downloaded by a computing device. For each content segment, an encoding bitrate is determined for downloading the content segment from the content server, where determining the encoding bitrate for a current content segment is based upon an estimated current network bandwidth, constraints of a buffer into which downloaded content segments are stored, and also upon quality scores associated with content segments within a selected horizon extending from the current content segment to a future content segment in the content stream at an endpoint of the horizon. Each content segment with the determined bitrate for the content segment is downloaded from the content server.
Abstract:
A technique efficiently selects a path computation element (PCE) to compute a path between nodes of a computer network. The PCE selection technique is illustratively based on dynamic advertisements of the PCE's available path computation resources, namely a predictive response time (PRT). To that end, the novel technique enables one or more PCEs to dynamically send (advertise) their available path computation resources to one or more path computation clients (PCCs). In addition, the technique enables the PCC to efficiently select a PCE (or set of PCEs) to service a path computation request based upon those available resources.
Abstract:
Content is received within a network by a content receiver based upon fetch requests by the content receiver to a content source, where the fetch requests for content are based upon a first adaptation logic scheme to fill a buffer of the content receiver at a selected rate and to download segments of content at selected encoding rates. A network priority is detected at the content receiver that includes an observed download rate at the content receiver that is greater than a fair share rate for other content receivers in the network. Fetch requests for content are revised in response to detection of the network priority, where the revised fetch requests are based upon a priority adaptation scheme that results in at least one of filling the buffer at a faster rate and downloading segments of content at higher encoding rates compared with the first adaptation logic scheme.
Abstract:
Techniques are provided for optimizing quality in adaptive streaming, where information is obtained relating to encoding bitrates and content quality scores for content segments of a content stream. The content segments of the content stream are provided by a content server and downloaded by a computing device. For each content segment, an encoding bitrate is determined for downloading the content segment from the content server, where determining the encoding bitrate for a current content segment is based upon an estimated current network bandwidth, constraints of a buffer into which downloaded content segments are stored, and also upon quality scores associated with content segments within a selected horizon extending from the current content segment to a future content segment in the content stream at an endpoint of the horizon. Each content segment with the determined bitrate for the content segment is downloaded from the content server.
Abstract:
In one embodiment, path routing in a node fabric of an information-centric network (ICN) includes transmitting a request from a source application to an upstream node via node faces of nodes in the node fabric along a path encoded in a Path Steering Value (PSV); and receiving at the source application from the upstream node a reply that travels along a return path encoded in the PSV. The PSV is generated by pairwise encoding pairs of node faces successively traversed by the reply and is represented by a deterministically decodable pairing function. Node face identifiers can be deterministically, i.e., uniquely, decoded from the PSV. The deterministically decodable pairing function is selected from a Cantor function, a Hopcroft and Ullman variant of the Cantor function, Hilbert curve algorithm, Morton code, and a bitwise pairing function.