Patent Grant
8929441
The invention relates generally to the field of streaming media, and more particularly to the streaming of live media in a scalable and flexible manner.
Available bandwidth in the internet can vary widely. For mobile networks, the limited bandwidth and limited coverage, as well as wireless interference can cause large fluctuations in available bandwidth which exacerbate the naturally bursty nature of the internet. When congestion occurs, bandwidth can degrade quickly. For streaming media, which require long lived connections, being able to adapt to the changing bandwidth can be advantageous. This is especially so for streaming which requires large amounts of consistent bandwidth.
In general, interruptions in network availability where the usable bandwidth falls below a certain level for any extended period of time can result in very noticeable display artifacts or playback stoppages. Adapting to network conditions is especially important in these cases. The issue with video is that video is typically compressed using predictive differential encoding, where interdependencies between frames complicate bit rate changes. Video file formats also typically contain header information which describe frame encodings and indices; dynamically changing bit rates may cause conflicts with the existing header information. This is further complicated in live streams where the complete video is not available to generate headers from.
Frame-based solutions like RTSP/RTP solve the header problem by only sending one frame at a time. In this case, there is no need for header information to describe the surrounding frames. However RTSP/RTP solutions can result in poorer quality due to UDP frame loss and require network support for UDP firewall fixups, which may be viewed as network security risks. More recently segment-based solutions like HTTP Live Streaming allow for the use of the ubiquitous HTTP protocol which does not have the frame loss or firewall issues of RTSP/RTP, but does require that the client media player support the specified m3 u8 playlist polling. For many legacy mobile devices that support RTSP, and not m3 u8 playlists, a different solution is required.
A method and apparatus are disclosed for delivering live content (live video and/or audio) as streaming media over the Internet to mobile devices in a device- and operator-agnostic manner. Currently, mobile video broadcasting either uses a built-in capability which is specific to a particular cell network operator or requires a device-specific application download. The disclosed technique may be used with a standard web-browser and delivered via the Internet to any mobile device in a manner that is independent of any particular cell network operator. The technique can efficiently scale horizontally to a large number of endpoints (mobile devices). In addition, a capability for automatically saving and viewing earlier segments of the stream is also provided. Overall, the disclosed method and apparatus provide the ability to deliver, in a scalable and cost-effective manner, live and time-shifted streaming of content over the Internet to mobile endpoints.
In one general respect, a disclosed system includes functions of recording, transcoding, and distributing live content or media. A recording system captures the live stream and transcodes it to various mobile device formats such as 3gpp, WMV, MOV, etc. and may dynamically segment a copy of the live stream into “chapters” for time-shifted viewing. Segments may also be used to support downloading at selectable data rates. The transcoded data is stored in a file system. A distribution subsystem provides distribution to a large number of endpoints in a highly scalable manner. In particular, a distribution tree may be employed for which the number N of endpoints is less than or equal to Fh, where F is the “fanout” or number of branches exiting each node and h is the height (number of levels) of the tree. Note that h grows only logarithmically in relation to N.
In another respect, the disclosed system records data into segments, in a plurality of encodings in a plurality of formats, to support a plurality of heterogeneous client devices. In one embodiment, the source video is transcoded into a plurality of different bit rate encodings, which are written into separate files in segments. In one embodiment, each bit rate encoding may be stored in a plurality of file formats. Each format is written to a separate segment file. The different bit rates may be used to support heterogeneous client devices generally, as well as provide the ability for adaptive adjustment of the bandwidth required for downloading to tailor operation to changing network conditions, improving overall system performance.
The foregoing and other objects, features and advantages will be apparent from the following description of particular embodiments of the invention, as illustrated in the accompanying drawings in which like reference characters refer to the same parts throughout the different views. The drawings are not necessarily to scale, emphasis instead being placed upon illustrating the principles of various embodiments of the invention.
A scalable live streaming system is used to deliver live event to large mobile audiences. The system generally provides mobile users with interactive and “snackable” access to the content, i.e., the ability to view selected portions of the content, along with metadata associated within a live event. The system supports the following major live streaming features:
Live streaming provides real time live streaming functionality. In one embodiment, the system receives the live feed as a live stream from a content delivery network (CDN). In another embodiment, the system receives the live feed as a direct stream from an attached recording device (e.g. a web-cam). The stream is recorded into a media file and re-streamed out with different encoding formats to support different mobile audiences.
In one embodiment, the system provides near-live interactive streaming functionality for a live feed. A mobile user can navigate the live event and play interesting video chunks in near real time while the live event is ongoing. In one embodiment, the system supports redirecting from a near live chunk to the live streaming to allow a mobile user to “tune” in the live event directly.
This feature allows an end-user to tune in the live streaming event anywhere from the beginning of live event to near the present time.
In one embodiment, the live event is recorded by the system. The recorded file can be further transcoded into multiple media formats to provide Video on Demand (VoD) replay functionality after the live event is over.
As used herein, “near-live” refers to the presence of certain latencies in the system, such as recording the live stream(s), transcoding the live media, relaying an intermediate stream, chopping into video chunks, extracting image “tiles”, and transferring the video chunks to a content delivery network. The particular constituents and amounts of these delays will necessarily vary among different embodiments.
The system may also provide a desktop graphical user interface (GUI) to control operation such as starting and stopping a stream.
In another aspect, the disclosed system records data into segments, in a plurality of encodings in a plurality of formats, to support a plurality of heterogeneous client devices. In one embodiment, the source video is transcoded into a plurality of different bit rate encodings. The plurality of encodings are written into separate files, in segments. In one embodiment, each bit rate encoding may be stored in a plurality of file formats. Each format is written to a separate segment file. In one embodiment, the segment files adhere to a file naming convention which specifies the bit rate and format in the name, to simplify segment retrieval. The segment-based technique may be one general method by which the live stream is downloaded to the mobile endpoint devices (which are also referred to as “clients” herein).
In one embodiment, the segments contain recorded and transcoded video data. In another embodiment, the segments may contain non-video data which has been compressed and encrypted using different encoding methods to produce a plurality of encodings. The different compression and encryption methods may require different levels of complexity and different amounts of client resources to reconstruct. Different compression and encryption schemes provide different levels of quality (i.e. higher or lower compression and higher or lower security); they also have different types of framing and format organization, the details of which should be known to those skilled in the art.
In one embodiment, the segments are all of a fixed duration. In another embodiment, the segments may all be of a fixed size. In one embodiment, video segments are packed to integer time boundaries. In another embodiment compressed and/or encrypted segments are padded out to round numbered byte boundaries. This can help simplify byte-based offset calculations. It also can provide a level of size obfuscation, for security purposes. In another embodiment the segments may be of variable duration or size. In one embodiment, video segments are packed based on key frame or group of frame counts.
In one embodiment, the segments are served from standard HTTP servers. In another embodiment, the segments may be served from an optimized caching infrastructure. The segments are designed to be usable with existing infrastructure. They do not require special servers for delivery and they do not require decoding for delivery. They also do not require custom rendering engines for displaying the content.
The live streaming system provides the following functionality:
The live streaming system is designed to be flexible and easily expandable to support large mobile audiences.
Live Streaming Monitor and Control
The live streaming monitor 11 consists of scripts running in the background to monitor incoming stream properties, the status of an RTMP connection, and the status of the Root Streamer 13 and Branch Streamers 14. Additionally, a Web-based interface is provided in the system to be used by a customer to send stream properties before the live event starts or end of the live event. In one embodiment, the Web-based interface is implemented as a CGI script. In another embodiment, the Web-based interface is implemented as a RESTful Web Service. A desktop GUI may be provided to control the live streaming server by calling the Web-based interface. An example CGI interface may be the following:
These scripts control the whole live streaming system to start, stop, and terminate automatically based on stream properties and network connection status. A system administrator can also control the system through GUI.
Live Streaming Recorder
In one embodiment, the Live Stream Recorder 12 is used to capture a live stream via the RTMP protocol and save the stream into a local file. In another embodiment, the Live Stream Recorder 12 is used to capture a live stream via the MMS protocol and save the stream to a local file. In another embodiment, the Live Stream Recorder 12 is used to capture a live stream via the RTP protocol and save the stream to a local file. The local file can be one of a number of valid container formats (e.g. FLV, MP4, 3 GP, MOV, WMV, etc.) which should be known to those skilled in the art. The local file is then transcoded and streamed out through the Streaming Tree (described below). The Live Stream Recorder 12 is also responsible for notifying the Live Stream Monitor of streaming protocol specific events which affect the state of the stream (e.g. stream start, stream stop, and stream errors).
Video on Demand
The live event is recorded by the Live Streaming Recorder 12 into a recorded media file. This media file can be further transcoded into multiple transcoded media files in different formats. These transcoded media files can be used by the system to provide Video on Demand (VoD) functionality after the live event is over.
Live Event Metadata and Database (shown as “DB” in
While a live event is ongoing, multiple metadata associated with the live event are created and stored in the central database 16. These metadata can be used to describe the properties of each specific live event. By using these metadata entries in the database, each live event is searchable.
Streaming Tree
A Streaming Tree contains at least one Root Streamer 13 and multiple Streaming Servers 15. One or more intermediate Branch Streamers 14 are generally also employed, although for sufficiently small audiences it may be possible for the Root Streamer 13 to provide its streams directly to Streaming Servers 15. Each Streaming Tree is used to deliver one live event. The Branch Streamers 14 and Streaming Server 15 receive streams from their parents and replicate the stream to multiple children. Within one Streaming Tree, more Branch Streamers 14 and Streaming Servers 15 can be added into the Streaming Tree to accommodate the mobile audience scale. A Streaming Tree is one specific type of stream distribution subsystem. For VoD or chunk content, the Streaming Tree may function more as a hierarchical caching infrastructure with push-based distribution of live recorded files. In one embodiment, Streaming Tree distribution is performed by unicast connections between parents and children. In another embodiment, Streaming Tree distribution is performed via IP multicast.
Multiple Live Events
The system can be easily expanded to support concurrent live events. The system can be configured to have multiple Streaming Trees each delivering a different live event. Multiple Streaming Trees may also be used to provide different encodings of a single live event. For VoD or chunk content, a single distribution tree may be used to support multiple encoding or live events.
Encoding Parameters Configuration
When a live event is starting, a set of encoding parameters, such as, video format, video bit rate, audio format, audio bit rate, frame rate, etc., can be configured to deliver specific streams to mobile audiences based on targeted mobile phones and wireless network bandwidth. These encoding parameters have been configured to support various mobile phones and wireless carrier networks.
Load Balancing
The system can provide load balancing functionality to deliver the live stream to mobile users. The plurality of Streaming Servers 15 may be distributed across multiple data centers, in which case DNS load balancing may be used to map the closest data center. Within a single data center, the plurality of Streaming Servers 15 may also be load balanced by a server load balancer to distribute load.
Live Streaming Navigation
The system may enable a user to watch a live event in two different ways. One is to watch the real time live event in the normal linear fashion (beginning to end). Another way is to allow the user to navigate into the live event to find interesting points and watch “snackable” portions or clips. These snackable clips are produced by the Live Streaming Chopper (see below) dynamically while the live event is ongoing.
Root Streamer
The Root Streamer 13 is the streaming source of the live streaming system. It transcodes the recorded 1 file and streams out multiple streams to either the intermediate Branch Streamers 14 or the Streaming Servers 15 directly. In one embodiment, the Root Streamer 13 uses RTP streams to distribute live content. The Root Streamer 13 also streams the live content to the chopper 17. The Root Streamer 13 also sets the event metadata to database so that the GUI can display the event status to mobile audiences.
There may be multiple Root Streamers 13 in the system in case of supporting multiple live streaming channels or multiple live stream encodings for one customer or many customers. By supporting multiple Root Streamers 13 and intermediate Branch Streamers 14, the system can support multiple customers and expand to support large audiences.
Branch Streamer
The Branch Streamer 14 is the intermediate streamer in the system. It takes the incoming RTP stream and relays the stream to a next level of the Branch Streamers 14 or to the Streaming Servers 15. The Branch Streamers 14 are used to expand the system to support large mobile audiences.
Streaming Server
The Streaming Servers 15 are the front end of the live streaming system to deliver the stream(s) to mobile audiences. They receive the streams from the Root Streamer 13 or Branch Streamers 14 and relay the streams to mobile audiences to watch the live event. The system may support a variety of streaming protocols, including but not limited to HTTP Live Streaming, RTSP and MMS. The number of Streaming Servers 15 used will generally depend on how many concurrent clients are supported by the live streaming system. Additional Streaming Servers 15 may also be used to provide physical distribution over a wider geographical area. Increasing distribution allows for lower latency when streaming to mobile clients in a specific region. The streams delivered to the client devices by the Streaming Servers are referred to as “distributed streams”.
Live Streaming Chopper
The Live Streaming Chopper 17 is used for the interactive Near-Live Streaming. It receives the stream from Root Streamer 13, transcodes and saves the stream to many N-minute video chunks, chops the N-minute video chunks into smaller video chunks based on a default definition file and extracts image tiles. In one embodiment, the Chopper 17 uploads chunks and tiles to a CDN for distribution to clients. In another embodiment, the Chopper 17 uses the Streaming Tree as a distribution path for video chunks. In one embodiment the chunks are distributed using reliable multicast to the Branch Streamers (or proxy caches in this case) 14, through to the Streaming Servers 15. In one embodiment, the user can play the snackable chunks through an interactive GUI such as described in PCT patent application PCT/US09/32565 entitled “Media Navigation System”, published Aug. 6, 2009 as WO/2009/097492. In another embodiment, the user can play the chunks using an HTTP Live Streaming compatible media player. In another embodiment, the user can play the chunks using a method in accordance with various provisions of this invention.
The client 108 connects to a standard HTTP server 106 to retrieve segments. The segments are stored on a storage device 104. The storage may be local or remote and may use any of a number of storage technologies, as should be known to those skilled in the art. The segments are generated by the R/S server 102. The R/S server 102 is responsible for recording the live stream and transcoding it into a plurality of encodings, where each encoding uses a different bit rate. In one embodiment, default encoding parameters are provided in a configuration file. In another embodiment, default encoding parameters are provided at invocation. In one embodiment, individual source files may override default encoding parameters via an accompanying configuration file. In another embodiment, individual source files may override default encoding parameters using parameters provided at invocation. The R/S server 102 writes the transcoded data into segments then uploads the segments to the storage device 104. In one embodiment the recoding and segmentation may be invoked manually. In another embodiment, the recording and segmentation may be asynchronously invoked programmatically, based on pre-scheduled live events. The R/S server 102 is also responsible for segment encryption. In one embodiment, segments are encrypted before being uploaded to the storage device 104.
The stream recorder 202 passes recorded data to a stream transcoder 204 as it is received. The stream transcoder 204 is responsible for decoding the input stream and re-encoding the output video frames in the proper output codecs. The stream transcoder 204 passes the re-encoded frames to the output framer 206. The output framer 206 is responsible for packing the encoded frames into the proper container format. In one embodiment, the stream transcoder 204 and output framer 206 support the H.264, H263, MPEG2, MPEG4, and WVM, video codecs and the MP3, AAC, AMR, and WMA audio codecs, along with the FLV, MOV, 3 GP, MPEG2-TS and ASF container formats. In another embodiment, the stream transcoder 204 and output framer 206 may support other standard or proprietary codecs and container formats. There are numerous video and audio codecs and container formats, as should be known to those skilled in the art, of which any would be suitable for the stream transcoder 204 and output framer 206. In one embodiment, the output framer 206 also supports the proprietary container format shown in
The output framer 206 writes the formatted data into segment files in the media storage 216. The output framer 206 is responsible for enforcing segment boundaries and durations. When the segments are complete, the output framer 206 notifies the segment encryptor 208. If segment encryption is required, the segment encryptor 208 reads the segment from the media storage 216, encrypts the segment, writes the encrypted segment back out to the media storage 216, and notifies the segment uploader 210 that the segment is ready for upload to the storage device 104. If no encryption is required, the segment encryptor 208 just notifies the segment uploader 210 that the segment is ready for upload to the storage device 104.
The segment uploader 210 uploads the finished segments to the storage device 104 (
The frame payload 308 contains further video frame encapsulation. In one embodiment, the encapsulation may be the further frame encapsulation may be for the RTP protocol. In another embodiment, the further frame encapsulation may be for the RTMP protocol. There are numerous video delivery protocols with different frame encapsulation formats, as should be known to those skilled in the art, which would be suitable for inclusion in the frame payload 308. In diagram 300, the further frame encapsulation shown is for the RTP protocol. The video frame is further encapsulated by the RTP packet header 314. The RTP payload 316 contains the actual video frame plus RTP padding 318. In one embodiment, RTP protocol padding 318 is used to pad the RTP payload 316 out to a 4 or 8 byte boundary, to ensure that the frame header 306 is 4 or 8 byte aligned, respectively. In another embodiment, custom padding may be added, outside of the protocol-specific frame encapsulation.
In one embodiment, the client contains a downloader 402. The downloader 402 is responsible for interacting with the HTTP server 106 (
RTSP requires separate frame based delivery for audio and video tracks. The RTP segments retrieved use the format 300 detailed in
In one embodiment, the client contains a downloader 402. The downloader 402 is responsible for interacting with the HTTP server 106 (
In the case of the HTTP Live Streaming client, MPEG2-TS format segments are retrieved. HTTP Live Streaming supports direct download of segments, as pointed to by an m3 u8 playlist file. The playlist generator 506 is passed the file location, in the media buffer, by the segment decryptor 404. The playlist generator 506 updates the existing playlist adding the new segment and removing the oldest segment and passes the updated playlist to the HTTP server 508. The playlist generator 506 is also responsible for purging old segments from the media buffer 420. In one embodiment, segments are purged from the media buffer 420 as segments are removed from the playlist. In another embodiment, segments are only purged once the media buffer 420 is full, to support the largest possible rewind buffer.
The HTTP server 508 responds to playlist polling requests from the media player 510 with the current playlist provided by the playlist generator 506. The HTTP server 508 responds to segment requests from the media player 510 by retrieving the segment from the media buffer 420 and delivering it to the media player 510. The media player 510 connects to the HTTP server 508 though a local host HTTP connection 516.
For the clients in both
The above can also be stated as, a bit rate switch is initiated when the download time required for a segment exceeds the duration of the segment. In one embodiment, a multiplier, less than one, is applied to detect network underruns before they occur:
In this scheme, the average network bandwidth is unable to sustain the video playout rate and a playback stoppage is imminent once the buffer runs out. This scheme requires relatively few calculations to determine when to switch encodings. However, it also has relatively low capability for predicting when a stoppage will occur. The encoding to switch to is the next lowest bit rate encoding whose bit rate is less than the average network bandwidth. Switching encodings to one of higher bit rate is initiated when the buffer occupancy of the media buffer 420 has reached its capacity and the average bandwidth exceeds the encoding bit rate of another encoding:
The encoding to switch to is the highest bit rate encoding whose bit rate is less than the average network bandwidth. This is an optimistic approach which assumes no further degradation in bit rate and works well when connected to a reliable, high bandwidth network. In another embodiment predictive bandwidth schemes may also be used to optimize rate adaptation for other environments.
The stream transcoder 204 processing begins in step 606, once data has been queued by the stream recorder 202. In step 606, the stream transcoder 204 starts by decoding individual frames from the recorded data. In step 608, the stream transcoder 204 re-encodes each frame based on the output configuration. In step 610, the stream transcoder 204 passes the encoded frame to the output framer 206. In step 612, the stream transcoder 204 determines if additional encodings of the current frame are needed. If another encoding is required, processing proceeds back to step 608 where the current frame is encoded into another encoding. If no additional encodings are required, processing proceeds back to step 606, where the next frame is decoded. In one embodiment, the stream transcoder supports generating a plurality of different bit rate encodings, as well as using a plurality of different codecs. The stream transcoder 204 encodes frames into a full permutation of bitrates and codecs. Steps 608, 610, and 612 are repeated for each encoding, on a given frame.
The output framer 206 processing begins in step 614 when frames are enqueued by the stream transcoder 204. The stream transcoder 204 produces multiple output frames for each input frame. In step 614, the output framer 206 maps each output frame to a specific output segment file, creating a new segment file in the media storage 216 if necessary. The output framer 206 synchronizes encoding configurations with unique segment files. In one embodiment, the output framer 206 also packs each frame into a plurality of segment file formats. In one embodiment, the frame formats include MPEG-TS and the custom frame format 300. In another embodiment, the frame format may include FLV or any other suitable container format, as should be known to those skilled in the art.
In step 616, the output framer 206 checks to see if the custom frame format for the RTP protocol 300 is required. If the custom frame format for the RTP protocol 300 is not required, then processing continues to step 620. If the custom frame format for the RTP protocol 300 is required, then processing proceeds to step 618 where the RTP packet headers 314, RTP padding 318, and the segment frame header 306 are added to the frame. The frame is then appended to the appropriate segment file, stored in the media storage 216, and processing continues to step 620. In one embodiment, only the custom format for the RTP protocol is required. In another embodiment, additional custom formats for RTMP or other protocols may be required. Steps 616 and 618 should be repeated for each additional custom frame format required.
In step 620, the output framer 206 checks to see if the MPEG-TS format is required. If the MPEG-TS format is not required, then processing continues to step 624. If the MPEG-TS format is required, then processing proceeds to step 622 where the frame and MPEG metadata headers are added to the appropriate segment file, stored in the media storage 216, and processing continues to step 624. In step 624, the output framer 206 checks to see if the segments are complete. In one embodiment, the segments are of a fixed duration, measured in seconds S. Given the constant frame rate R of the stream transcoder 204 output, the segments each contain a fixed number of frames F, where F=S*R. If the segment is not yet complete, processing proceeds back to step 614. If the segment(s) are complete, processing proceeds to step 626.
In step 626, the output framer performs any file post-processing. In one embodiment, file header reordering may be used to optimize the segment for client parsing. In another embodiment, additional hint tracks may be added to aid in client parsing. In another embodiment, additional compression may be applied to optimize segment delivery. Once the post-processing is complete, the output framer 206 notifies the segment encryptor 208 that the new segment(s) is available. The output framer 206 proceeds back to step 614, while the segment encryptor 208 proceeds to step 628.
In step 628, the segment encryptor 208 checks to see if encryption is required. If encryption is not required, processing continues to step 632. If encryption is required, processing continue to step 630 where the segment encryptor 208 reads the segment(s) from the media storage 218, encrypts the segment(s), and writes the segment(s) back out to the media storage 218, before continuing on to step 632. In step 632, the segment encryptor 208 notifies the segment uploader 210 that the new segment(s) is available. The segment encryptor 208 proceeds back to step 628 to wait for the next segment. The segment upload proceeds to step 634 where the segment is uploaded to the network storage 104.
In step 706, the downloader 402 checks to see if a bit rate change is required. Given the fixed segment duration of S seconds, download of live segments must take less than S seconds. If the download time for the previous segment exceeded some threshold T, where T<S, then a transition to a lower bit rate is required. If the download time for the previous segment was below a alternate threshold T′, where T′<<S, then a transition to a higher bit rate may be required. In one embodiment, given three bit rate encodings, encoded at bitrates: B, B′, B″, where B<B′<B″, the threshold T, for switching from B′ to B, would be: T=C*S, where C is a constant multiplier and C<1.0 (e.g. C=0.8). In one embodiment, given three bit rate encodings, encoded at bitrates: B, B′, B″, where B<B′<B″, the threshold T′, for switching from B′ to B″ would be: T′=(C*S)*(B′/B″), where C is a constant multiplier and C<1.0 (e.g. C=0.8) and B′/B″ represents the ratio of additional bandwidth required to support the new bit rate. In another embodiment, different thresholds may be used to favor upward or downward transitions. In deployments where high bandwidth and high network availability is expected, upward transitions may be favored. In deployments where network interruption is likely, downward transitions may be favored. In one embodiment, historical average segment download times are used to account for hysteresis. If the download time for the previous segment was between T′ and T, then no action is needed, and processing continues to step 708. If a bit rate change is required, processing continues to step 708, where the new bit rate is chosen, then proceeds to step 710.
In step 710, the downloader 402 determines file name of the next segment. In one embodiment, the file names follow a well known naming convention such that bit rate and sequence number are embedded in the file name. In another embodiment, the file names may be retrieved from a Web service interface. The downloader 402 then begins polling for the next segment. In one embodiment, the downloader 402 calculates the time when the next segment will be available and waits until then to poll. In another embodiment, the downloader 402 may discount the segment availability time by the round trip delay for requesting the segment. In another embodiment, the downloader 402 begins polling immediately but uses an exponential decay algorithm to poll faster as the next segment availability time gets nearer. Once a new segment is retrieved, the downloader 402 returns to step 704.
In step 714, the segment decryptor 404 checks to see if the segment is encrypted. If the segment is not encrypted, then processing continues to step 718. If the segment is encrypted, processing continues to step 716, where the segment decryptor 404 reads in the segment from the media buffer 420, decrypts the segment, and writes the segment back out to the media buffer 420, then continues to step 718. In step 718, the segment decryptor 404 notifies the segment parser 406 that the new segment is available. The segment decryptor 404 returns to step 714, while the segment parser 406 proceeds to step 720.
In step 720, the segment parser 406 begins processing the custom segments 302 by extracting the next RTP packet 308. The custom segments 302 are parsed sequentially, using the payload lengths 312 to determine frame 304 boundaries. Each RTP packet 308 processed individually. The segment parser 406 queues the packet to the RTSP server 410, in step 722. In step 724, the segment parser 406 checks to see if the current frame is the last frame in the segment. If the current frame is not the last frame, the segment parser 406 proceeds back to step 720 to process the next frame. If the current frame is the last frame, the segment parser 406 proceeds to step 726 where it purges the segment, then continues back to step 720 to wait for the next segment. In one embodiment, segments are immediately purged by the segment parser 406. In another embodiment, the segment parser 406 waits until the media buffer 420 is full, before purging segments. If the mobile client 108 has limited memory immediate purging may be required, to make room for new segments in the media buffer 420. If the network is expected to have high error rates, immediate purging also frees up cache space in the media buffer 420, allowing more segments to be prefetched, which helps protect against future network errors. If the client application wishes to support rewind capabilities, delayed purging allows the media buffer 420 to cache previous segments for immediate access, when requested by the media player 410, rather than having to delay while the segment is re-downloaded.
The RTSP server 408 processes requests from the media player 410 asynchronously from the segment retrieval. Once the media player 410 negotiates the RTP connections 416 and 418 for the streaming session, the RTSP server 408 sends RTP packets 308 in a paced fashion, as dictated by timestamps in the RTP headers 314, as should be known to those skilled in the art. Step 728 shows the RTSP server 408 sending RTP packets to the media player 410. The RTSP server 408 maintains separate queues and separate timers for audio and video RTP packets to simplify parsing and delivery.
In step 806, the downloader 402 checks to see if a bit rate change is required. Given the fixed segment duration of S seconds, download of live segments must take less than S seconds. If the download time for the previous segment exceeded some threshold T, where T<S, then a transition to a lower bit rate is required. If the download time for the previous segment was below a alternate threshold T′, where T′<<S, then a transition to a higher bit rate may be required. In one embodiment, given three bit rate encodings, encoded at bitrates: B, B′, B″, where B<B′<B″, the threshold T, for switching from B′ to B, would be: T=C*S, where C is a constant multiplier and C<1.0 (e.g. C=0.8). In one embodiment, given three bit rate encodings, encoded at bitrates: B, B′, B″, where B<B′<B″, the threshold T′, for switching from B′ to B″ would be: T′=(C*S)*(B′/B″), where C is a constant multiplier and C<1.0 (e.g. C=0.8) and B′/B″ represents the ratio of additional bandwidth required to support the new bit rate. In another embodiment, different thresholds may be used to favor upward or downward transitions. In deployments where high bandwidth and high network availability is expected, upward transitions may be favored. In deployments where network interruption is likely, downward transitions may be favored. In one embodiment, historical average segment download times are used to account for hysteresis. If the download time for the previous segment was between T′ and T, then no action is needed, and processing continues to step 808. If a bit rate change is required, processing continues to step 806, where the new bit rate is chosen, then proceeds to step 808.
In step 808, the downloader 402 determines file name of the next segment. In one embodiment, the file names follow a well known naming convention such that bit rate and sequence number are embedded in the file name. In another embodiment, the file names may be retrieved from a Web service interface. The downloader 402 then begins polling for the next segment. In one embodiment, the downloader 402 calculates the time when the next segment will be available and waits until then to poll. In another embodiment, the downloader 402 may discount the segment availability time by the round trip delay for requesting the segment. In another embodiment, the downloader 402 begins polling immediately but uses an exponential decay algorithm to poll faster as the next segment availability time gets nearer. Once a new segment is retrieved, the downloader 402 returns to step 804.
In step 814, the segment decryptor 404 checks to see if the segment is encrypted. If the segment is not encrypted, then processing continues to step 818. If the segment is encrypted, processing continues to step 816, where the segment decryptor 404 reads in the segment from the media buffer 420, decrypts the segment, and writes the segment back out to the media buffer 420, then continues to step 818. In step 818, the segment decryptor 404 notifies the playlist generator 506 that the new segment is available. The segment decryptor 404 returns to step 814, while the playlist generator 506 proceeds to step 820.
In step 820, the playlist generator 506 updates the current playlist adding the new segment and removing the oldest segment. Once segments have been removed from the playlist, the segments are no longer required in the media buffer 420. In one embodiment, segments are immediately purged by the playlist generator 506. In another embodiment, the playlist generator 506 waits until the media buffer 420 is full, before purging segments. If the mobile client 108 has limited memory immediate purging may be required, to make room for new segments in the media buffer 420. If the network is expected to have high error rates, immediate purging also frees up cache space in the media buffer 420, allowing more segments to be prefetched, which helps protect against future network errors. If the client application wishes to support rewind capabilities, delayed purging allows the media buffer 420 to cache previous segments for immediate access, when requested by the media player 510, rather than having to delay while the segment is re-downloaded.
The playlist generator 506 then notifies the HTTP Server 508 of the playlist update. Step 822 shows the HTTP server 508 getting the notification from the playlist generator 506, however, the HTTP server 508 processes requests from the media player 510 asynchronously from the segment retrieval. When the media player 510 requests playlists, the HTTP server 508 provides the most recent playlist made available by the playlist generator 506. When the media player 510 requests segments, the HTTP server 508 retrieves the segments from the media buffer 420 and returns them to the media player 510. The media player 510 should only request segments that are in the playlist. The playlist generator 506 ensures that segments in the playlist exist in the media buffer 420.
In the description herein for embodiments of the present invention, numerous specific details are provided, such as examples of components and/or methods, to provide a thorough understanding of embodiments of the present invention. One skilled in the relevant art will recognize, however, that an embodiment of the invention can be practiced without one or more of the specific details, or with other apparatus, systems, assemblies, methods, components, materials, parts, and/or the like. In other instances, well-known structures, materials, or operations are not specifically shown or described in detail to avoid obscuring aspects of embodiments of the present invention.
| Number | Name | Date | Kind |
|---|---|---|---|
| 7085843 | Buddhikot et al. | Aug 2006 | B2 |
| 20010014058 | Ando et al. | Aug 2001 | A1 |
| 20020023165 | Lahr | Feb 2002 | A1 |
| 20020174444 | Gatto et al. | Nov 2002 | A1 |
| 20030135631 | Li et al. | Jul 2003 | A1 |
| 20030149792 | Goldstein | Aug 2003 | A1 |
| 20040109137 | Bubie et al. | Jun 2004 | A1 |
| 20040117427 | Allen et al. | Jun 2004 | A1 |
| 20040196972 | Zhu et al. | Oct 2004 | A1 |
| 20040240390 | Seckin | Dec 2004 | A1 |
| 20060015637 | Chung | Jan 2006 | A1 |
| 20060184688 | Ganguly et al. | Aug 2006 | A1 |
| 20060294572 | Walter | Dec 2006 | A1 |
| 20070050828 | Renzi et al. | Mar 2007 | A1 |
| 20070106680 | Haot et al. | May 2007 | A1 |
| 20070250901 | McIntire et al. | Oct 2007 | A1 |
| 20080140719 | Cheney et al. | Jun 2008 | A1 |
| 20080195746 | Bowra et al. | Aug 2008 | A1 |
| 20080281977 | Branam et al. | Nov 2008 | A1 |
| 20090180484 | Igarashi | Jul 2009 | A1 |
| 20090300204 | Zhang et al. | Dec 2009 | A1 |
| 20120084404 | Haot et al. | Apr 2012 | A1 |
| Entry |
|---|
| Pantos, R., HTTP Live Streaming: http://tools.ietf.org/html/draft-pantos-http-live-streaming-04, Apple Inc., Jun. 5, 2010, 23 pages. |
| Zambelli, Alex, “Alex Zambelli's Microsoft Media Blog, Microsoft Media Platform, streaming video, Smooth Streaming, H.264, VC-1, Silverlight, Windows Media,” 21 pages, (c) 2012, Silverlight smooth streaming: http://alexzambelli.com/blog/2009/02/10/smooth-streaming-architecture/, Proudly powered by WordPress. 2010 Weaver by WPWeaver.info. |
| Schulzrine, H., Real Time Streaming Protocol (RTSP): RTSP—RFC2326: http://www.rfc-editor.org/rfc/rfc2326.txt, Columbia U., Apr. 1998, 82 pages. |
| Schulzrine, H., RTP: A Transport Protocol for Real-Time Applications: RTP—RFC3550: http://www.rfc-editor.org/rfc/rfc3550.txt, Columbia U., Jul. 2003, 93 pages. |
| Baugher, M., The Secure Real-time Transport Protocol (SRTP): SRTP—RFC3711: http://www.rfc-editor.org/rfc/rfc3711.txt, Cisco Systems, Inc., Mar. 2004, 50 pages. |
| Number | Date | Country | |
|---|---|---|---|
| 20120002717 A1 | Jan 2012 | US |
| Number | Date | Country | |
|---|---|---|---|
| 61161641 | Mar 2009 | US | |
| 61265391 | Dec 2009 | US |
| Number | Date | Country | |
|---|---|---|---|
| Parent | PCT/US2010/027893 | Mar 2010 | US |
| Child | 13233836 | US |
