Abstract: Techniques to adjust clock approximations are described, which may be used to synchronize content output at a client. In an implementation, timestamps derived from a universal time source are allocated to respective program clock reference (PCR) timestamps in content received by a network operator during an interval of time to form ordered pairs of timestamps. An approximation is computed of a plurality of the ordered pairs of timestamps for the interval and the approximation is adjusted using an ordered pair of timestamps taken from a previous approximation.

Abstract: Displaying a video stream when constrained by system memory and connection bandwidth. When the resources and/or memory of a client are insufficient to decode and process a video stream, the client only decodes and processes key frames of the video stream. The other frames are discarded by the client. By decoding and processing key frames, the memory and resource requirements of the video stream are reduced. The client is also able to negotiate with the video stream source such that only key frames are downloaded. Bandwidth limitations can thus be accommodated because downloading only key frames requires less bandwidth.

Abstract: Techniques to adjust clock approximations are described, which may be used to synchronize content output at a client. In an implementation, timestamps derived from a universal time source are allocated to respective program clock reference (PCR) timestamps in content received by a network operator during an interval of time to form ordered pairs of timestamps. An approximation is computed of a plurality of the ordered pairs of timestamps for the interval and the approximation is adjusted using an ordered pair of timestamps taken from a previous approximation.

Abstract: Tiered command distribution is described. In an embodiment, a pipeline architecture includes processor chains of data processors that process control events received from an application interface control. A tier assignment algorithm determines the longest path of data processors through the processor chains to determine a tier allocation for each data processor in the set of processor chains. Each tier includes a data processor from one or more of the processor chains where a first set of data processors in a first tier each receive a control event and process the control event and/or process the data according to the control event before a second set of data processors in a second tier each receive the control event.

Abstract: Tiered command distribution is described. In an embodiment, a pipeline architecture includes processor chains of data processors that process control events received from an application interface control. A tier assignment algorithm determines the longest path of data processors through the processor chains to determine a tier allocation for each data processor in the set of processor chains. Each tier includes a data processor from one or more of the processor chains where a first set of data processors in a first tier each receive a control event and process the control event and/or process the data according to the control event before a second set of data processors in a second tier each receive the control event.

Abstract: Displaying a video stream when constrained by system memory and connection bandwidth. When the resources and/or memory of a client are insufficient to decode and process a video stream, the client only decodes and processes key frames of the video stream. The other frames are discarded by the client. By decoding and processing key frames, the memory and resource requirements of the video stream are reduced. The client is also able to negotiate with the video stream source such that only key frames are downloaded. Bandwidth limitations can thus be accommodated because downloading only key frames requires less bandwidth.