Akamai Technologies, Inc.

Verivue, Inc.

Verlvue, Inc.

Christopher Lawler

Michael G Hluchyj

Santosh Krishnan

Craig R Frink

Qin-Fan Zhu

Robert Ryan

Ganesh Pai

Umamaheswar Reddy

Daniel Pond

Described are computer-based methods and apparatuses, including computer program products, for deterministically skewing synchronized events for content streams. A first content stream comprising at least one content processing location is buffered in a first buffer, wherein the first buffer is associated with a first processing delay parameter. A second content stream is buffered in a second buffer, the second content stream comprising at least one content processing location, the second buffer being associated with a second processing delay parameter that is different from the first processing delay parameter. The first content stream is processed at the at least one content processing location of the first content stream at a first content processing time based on the first processing delay parameter. The second content stream is processed at the at least one content processing location of the second content stream at a second content processing time based on the second processing delay parameter.

Deterministically skewing synchronized events for content streams

Described are computer-based methods and apparatuses, including computer program products, for deterministically skewing transmission of content streams. A content stream comprising one or more video frames is received. The content stream is buffered in a buffer, wherein the buffer allows simultaneous read access to the content stream at a plurality of locations. One or more video frames of the content stream are transmitted from the buffer to a first device associated with a first subscriber beginning at a first location in the buffer based on a first transmission delay parameter. One or more video frames of the content stream are transmitted from the buffer to a second device associated with a second subscriber beginning at a second location in the buffer based on a second transmission delay parameter.

Deterministically skewing transmission of content streams

In one example, multimedia content is requested from a plurality of storage modules. Each storage module retrieves the requested parts, which are typically stored on a plurality of storage devices at each storage module. Each storage module determines independently when to retrieve the requested parts of the data file from storage and transmits those parts from storage to a data queue. Based on a capacity of a delivery module and/or the data rate associated with the request, each storage module transmits the parts of the data file to the delivery module. The delivery module generates a sequenced data segment from the parts of the data file received from the plurality of storage modules and transmits the sequenced data segment to the requester.

Storage of data utilizing scheduling queue locations associated with different data rates

Asynchronous and distributed storage of data

Described are computer-based methods and apparatuses, including computer program products, for dynamic rate adjustment to splice video streams. A splicer receives a first compressed video stream of bits and buffers the first video stream of bits in a first buffer. The splicer receives a second compressed video stream of bits to splice into the first compressed video stream. The splicer buffers the second compressed video stream of bits in a second buffer. The splicer determines a departure time for a splice in-point of the second compressed video stream of bits. The splicer adjusts a rate of the first compressed video stream of bits, a rate of the second compressed video stream of bits, or both to achieve the departure time.

Dynamic rate adjustment to splice compressed video streams

Described are computer-based methods and apparatuses, including computer program products, for statistical multiplexing of compressed video streams. A deadline of a packet of a compressed video stream is computed based on a program clock reference value of the packet. A plurality of packets, which includes the packet, is sorted based on deadlines corresponding to the packets. A next packet from the sorted plurality of packets is selected, the next packet having a corresponding deadline nearest to a system clock time. The next packet is transmitted.

Growing community of inventors

Wellesley, MA, United States of America

Christopher Lawler