Apparatus, system, and method for multi-bitrate content streaming

Information

  • Patent Grant
  • 11991234
  • Patent Number
    11,991,234
  • Date Filed
    Wednesday, December 21, 2022
    a year ago
  • Date Issued
    Tuesday, May 21, 2024
    6 months ago
Abstract
An apparatus for multi-bit rate content streaming includes a receiving module configured to capture media content, a streamlet module configured to segment the media content and generate a plurality of streamlets, and an encoding module configured to generate a set of streamlets. The system includes the apparatus, wherein the set of streamlets comprises a plurality of streamlets having identical time indices and durations, and each streamlet of the set of streamlets having a unique bit rate, and wherein the encoding module comprises a master module configured to assign an encoding job to one of a plurality of host computing modules in response to an encoding job completion bid. A method includes receiving media content, segmenting the media content and generating a plurality of streamlets, and generating a set of streamlets.
Description
BACKGROUND OF THE INVENTION
Field of the Invention

The invention relates to video streaming over packet switched networks such as the Internet, and more particularly relates to adaptive-rate shifting of streaming content over such networks.


Description of the Related Art

The Internet is fast becoming a preferred method for distributing media files to end users. It is currently possible to download music or video to computers, cell phones, or practically any network capable device. Many portable media players are equipped with network connections and enabled to play music or videos. The music or video files (hereinafter “media files”) can be stored locally on the media player or computer, or streamed or downloaded from a server.


“Streaming media” refers to technology that delivers content at a rate sufficient for presenting the media to a user in real time as the data is received. The data may be stored in memory temporarily until played and then subsequently deleted. The user has the immediate satisfaction of viewing the requested content without waiting for the media file to completely download. Unfortunately, the audio/video quality that can be received for real time presentation is constrained by the available bandwidth of the user's network connection. Streaming may be used to deliver content on demand (previously recorded) or from live broadcasts.


Alternatively, media files may be downloaded and stored on persistent storage devices, such as hard drives or optical storage, for later presentation. Downloading complete media files can take large amounts of time depending on the network connection. Once downloaded, however, the content can be viewed repeatedly anytime or anywhere. Media files prepared for downloading usually are encoded with a higher quality audio/video than can be delivered in real time. Users generally dislike this option, as they tend to want to see or hear the media file instantaneously.


Streaming offers the advantage of immediate access to the content but currently sacrifices quality compared with downloading a file of the same content. Streaming also provides the opportunity for a user to select different content for viewing on an ad hoc basis, while downloading is by definition restricted to receiving a specific content selection in its entirety or not at all. Downloading also supports rewind, fast forward, and direct seek operations, while streaming is unable to fully support these functions. Streaming is also vulnerable to network failures or congestion.


Another technology, known as “progressive downloads,” attempts to combine the strengths of the above two technologies. When a progressive download is initiated, the media file download begins, and the media player waits to begin playback until there is enough of the file downloaded that playback can begin with the hope that the remainder of the file will be completely downloaded before playback “catches up.” This waiting period before playback can be substantial depending on network conditions, and therefore is not a complete or fully acceptable solution to the problem of media presentation over a network.


Generally, three basic challenges exist with regard to data transport streaming over a network such as the Internet that has a varying amount of data loss. The first challenge is reliability. Most streaming solutions use a TCP connection, or “virtual circuit,” for transmitting data. A TCP connection provides a guaranteed delivery mechanism so that data sent from one endpoint will be delivered to the destination, even if portions are lost and retransmitted. A break in the continuity of a TCP connection can have serious consequences when the data must be delivered in real-time. When a network adapter detects delays or losses in a TCP connection, the adapter “backs off” from transmission attempts for a moment and then slowly resumes the original transmission pace. This behavior is an attempt to alleviate the perceived congestion. Such a slowdown is detrimental to the viewing or listening experience of the user and therefore is not acceptable.


The second challenge to data transport is efficiency. Efficiency refers to how well the user's available bandwidth is used for delivery of the content stream. This measure is directly related to the reliability of the TCP connection. When the TCP connection is suffering reliability problems, a loss of bandwidth utilization results. The measure of efficiency sometimes varies suddenly, and can greatly impact the viewing experience.


The third challenge is latency. Latency is the time measure form the client's point-of-view, of the interval between when a request is issued and the response data begins to arrive. This value is affected by the network connection's reliability and efficiency, and the processing time required by the origin to prepare the response. A busy or overloaded server, for example, will take more time to process a request. As well as affecting the start time of a particular request, latency has a significant impact on the network throughput of TCP.


From the foregoing discussion, it should be apparent that a need exists for an apparatus, system, and method that alleviate the problems of reliability, efficiency, and latency. Additionally, such an apparatus, system, and method would offer instantaneous viewing along with the ability to fast forward, rewind, direct seek, and browse multiple streams. Beneficially, such an apparatus, system, and method would utilize multiple connections between a source and destination, requesting varying bitrate streams depending upon network conditions.


SUMMARY OF THE INVENTION

The present invention has been developed in response to the present state of the art, and in particular, in response to the problems and needs in the art that have not yet been fully solved by currently available content streaming systems. Accordingly, the present invention has been developed to provide an apparatus, system, and method for adaptive-rate content streaming that overcome many or all of the above-discussed shortcomings in the art.


The apparatus for adaptive-rate content streaming is provided with a logic unit containing a plurality of modules configured to functionally execute the necessary steps. These modules in the described embodiments include a receiving module configured to receive media content, a streamlet module configured to segment the media content and generate a plurality of sequential streamlets, and an encoding module configured to encode each streamlet as a separate content file.


The encoding module is further configured to generate a set of streamlets for each of the sequential streamlets. Each streamlet may comprise a portion of the media content having a predetermined length of time. The predetermined length of time may be in the range of between about 0.1 and 5 seconds.


In one embodiment, a set of streamlets comprises a plurality of streamlets having identical time indices, and each streamlet of the set of streamlets has a unique bitrate. The receiving module is configured to convert the media content to raw audio or raw video. The encoding module may include a muster module configured to assign an encoding job to one of a plurality of host computing modules in response to an encoding job completion bid. The job completion bid may be based on a plurality of computing variables selected from a group consisting of current encoding job completion percentage, average encoding job completion time, processor speed, and physical memory capacity.


A system of the present invention is also presented for adaptive-rate content streaming. In particular, the system, in one embodiment, includes a receiving module configured to receive media content, a streamlet module configured to segment the media content and generate a plurality of sequential streamlets, each streamlet comprising a portion of the media content having a predetermined length of time, and an encoding module configured to encode each streamlet as a separate content file and generate a set of streamlets.


The system also includes a plurality of streamlets having identical time indices and each streamlet of the set of streamlets having a unique bitrate. The encoding module comprises a master module configured to assign an encoding job to one of a plurality of host computing modules in response to an encoding job completion bid.


A method of the present invention is also presented for adaptive-rate content steaming. In one embodiment, the method includes receiving media content, segmenting the media content and generating a plurality of sequential streamlets, and encoding each streamlet as a separate content file.


The method also includes segmenting the media content into a plurality of streamlets, each streamlet comprising a portion of the media content having a predetermined length of time. In one embodiment, the method includes generating a set of streamlets comprising a plurality of streamlets having identical time indices, and each streamlet of the set of streamlets having a unique bitrate.


Furthermore, the method may include converting the media content to raw audio or raw video, and segmenting the content media into a plurality of sequential streamlets. The method further comprises assigning an encoding job to one of a plurality of host computing modules in response to an encoding job completion bid, and submitting an encoding job completion bid based on a plurality of computing variables.


Reference throughout this specification to features, advantages, or similar language does not imply that all of the features and advantages that may be realized with the present invention should be or are in any single embodiment of the invention. Rather, language referring to the features and advantages is understood to mean that a specific feature, advantage, or characteristic described in connection with an embodiment is included in at least one embodiment of the present invention. Thus, discussion of the features and advantages, and similar language, throughout this specification may, but do not necessarily, refer to the same embodiment.


Furthermore, the described features, advantages, and characteristics of the invention may be combined in any suitable manner in one or more embodiments. One skilled in the relevant art will recognize that the invention may be practiced without one or more of the specific features or advantages of a particular embodiment. In other instances, additional features and advantages may be recognized in certain embodiments that may not be present in all embodiments of the invention.


These features and advantages of the present invention will become more fully apparent from the following description and appended claims, or may be learned by the practice of the invention as set forth hereinafter.





BRIEF DESCRIPTION OF THE DRAWINGS

In order that the advantages of the invention will be readily understood, a more particular description of the invention briefly described above will be rendered by reference to specific embodiments that are illustrated in the appended drawings.


Understanding that these drawings depict only typical embodiments of the invention and are not therefore to be considered to be limiting of its scope, the invention will be described and explained with additional specificity and detail through the use of the accompanying drawings, in which:



FIG. 1 is a schematic block diagram illustrating one embodiment of a system for dynamic rate shifting of streaming content in accordance with the present invention:



FIG. 2a is a schematic block diagram graphically illustrating one embodiment of a media content file;



FIG. 2b is a schematic block diagram illustrating one embodiment of a plurality of streams having varying degrees of quality and bandwidth;



FIG. 3a is a schematic block diagram illustrating one embodiment of a stream divided into a plurality of source streamlets;



FIG. 3b is a schematic block diagram illustrating one embodiment of sets of streamlets in accordance with the present invention;



FIG. 4 is a schematic block diagram illustrating in greater detail one embodiment of the content module in accordance with the present invention;



FIG. 5a is a schematic block diagram illustrating one embodiment of an encoder module in accordance with the present invention;



FIG. 5b is a schematic block diagram illustrating one embodiment of parallel encoding of streamlets in accordance with the present invention;



FIG. 6a is a schematic block diagram illustrating one embodiment of a virtual timeline in accordance with the present invention;



FIG. 6b is a schematic block diagram illustrating an alternative embodiment of a VT in accordance with the present invention;



FIG. 6c is a schematic block diagram illustrating one embodiment of a QMX in accordance with the present invention;



FIG. 7 is a schematic block diagram graphically illustrating one embodiment of a client module in accordance with the present invention;



FIG. 8 is a schematic flow chart diagram illustrating one embodiment of a method for processing content in accordance with the present invention;



FIG. 9 is a schematic flow chart diagram illustrating one embodiment of a method for viewing a plurality of streamlets in accordance with the present invention; and



FIG. 10 is a schematic flow chart diagram illustrating one embodiment of a method for requesting streamlets within an adaptive-rate shifting content streaming environment in accordance with the present invention.





DETAILED DESCRIPTION OF THE INVENTION

Many of the functional units described in this specification have been labeled as modules, in order to more particularly emphasize their implementation independence.


For example, a module may be implemented as a hardware circuit comprising custom VLSI circuits or gate arrays, off-the-shelf semiconductors such as logic chips, transistors, or other discrete components. A module may also be implemented in programmable hardware devices such as field programmable gate arrays, programmable array logic, programmable logic devices or the like.


Modules may also be implemented in software for execution by various types of processors. An identified module of executable code may, for instance, comprise one or more physical or logical blocks of computer instructions which may, for instance, be organized as an object, procedure, or function. Nevertheless, the executables of an identified module need not be physically located together, but may comprise disparate instructions stored in different locations which, when joined logically together, comprise the module and achieve the stated purpose for the module.


Indeed, a module of executable code may be a single instruction, or many instructions, and may even be distributed over several different code segments, among different programs, and across several memory devices. Similarly, operational data may be identified and illustrated herein within modules, and may be embodied in any suitable form and organized within any suitable type of data structure. The operational data may be collected as a single data set, or may be distributed over different locations including over different storage devices, and may exist, at least partially, merely as electronic signals on a system or network.


Reference throughout this specification to “one embodiment,” “an embodiment,” or similar language means that a particular feature, structure, or characteristic described in connection with the embodiment is included in at least one embodiment of the present invention. Thus, appearances of the phrases “in one embodiment,” “in an embodiment,” and similar language throughout this specification may, but do not necessarily, all refer to the same embodiment.


Reference to a signal bearing medium may take any form capable of generating a signal, causing a signal to be generated, or causing execution of a program of machine-readable instructions on a digital processing apparatus. A signal bearing medium may be embodied by a transmission line, a compact disk, digital-video disk, a magnetic tape, a Bernoulli drive, a magnetic disk, a punch card, flash memory, integrated circuits, or other digital processing apparatus memory device. In one embodiment, a computer program product including a computer useable medium having a computer readable program of computer instructions stored thereon that when executed on a computer causes the computer to carry out operations for multi-bitrate content streaming as described herein.


Furthermore, the described features, structures, or characteristics of the invention may be combined in any suitable manner in one or more embodiments. In the following description, numerous specific details are provided, such as examples of programming, software modules, user selections, network transactions, database queries, database structures, hardware modules, hardware circuits, hardware chips, etc., to provide a thorough understanding of embodiments of the invention. One skilled in the relevant art will recognize, however, that the invention may be practiced without one or more of the specific details, or with other methods, components, materials, and so forth. In other instances, well-known structures, materials, or operations are not shown or described in detail to avoid obscuring aspects of the invention.



FIG. 1 is a schematic block diagram illustrating one embodiment of a system 100 for dynamic rate shifting of streaming content in accordance with the present invention. In one embodiment, the system 100 comprises a content server 102 and an end user station 104. The content server 102 and the end user station 104 may be coupled by a data communications network. The data communications network may include the Internet 106 and connections 108 to the Internet 106. Alternatively, the content server 102 and the end user 104 may be located on a common local area network, wireless area network, cellular network, virtual local area network, or the like. The end user station 104 may comprise a personal computer (PC), an entertainment system configured to communicate over a network, or a portable electronic device configured to present content. For example, portable electronic devices may include, but are not limited to, cellular phones, portable gaming systems, and portable computing devices.


In the depicted embodiment, the system 100 also includes a publisher 110, and a web server 116. The publisher 110 may be a creator or distributor of content. For example, if the content to be streamed were a broadcast of a television program, the publisher 110 may be a television or cable network channel such as NBC®, or MTV®. Content may be transferred over the Internet 106 to the content server 102, where the content is received by a content module 112. The content module 112 may be configured to receive, process, and store content. In one embodiment, processed content is accessed by a client module 114 configured to play the content on the end user station 104. In a further embodiment, the client module 114 is configured to receive different portions of a content stream from a plurality of locations simultaneously. For example, the client module 114 may request and receive content from any of the plurality of web servers 116.


Content from the content server 102 may be replicated to other web servers 116 or alternatively to proxy cache servers 118. Replicating may occur by deliberate forwarding from the content server 102, or by a web, cache, or proxy server outside of the content server 102 asking for content on behalf of the client module 114. In a further embodiment, content may be forwarded directly to web 116 or proxy 118 servers through direct communication channels 120 without the need to traverse the Internet 106.



FIG. 2a is a schematic block diagram graphically illustrating one embodiment of a media content (hereinafter “content”) file 200. In one embodiment, the content file 200 is distributed by the publisher 110. The content file 200 may comprise a television broadcast, sports event, movie, music, concert, etc. The content file 200 may also be live or archived content. The content file 200 may comprise uncompressed video and audio, or alternatively, video or audio. Alternatively, the content file 200 may be compressed using standard or proprietary encoding schemes. Examples of encoding schemes capable of use with the present invention include, but are not limited to, DivX®, Windows Media Video®, Quicktime Sorenson 3®, On2, OGG Vorbis, MP3, or Quicktime 6.5/MPEG-4® encoded content.



FIG. 2b is a schematic block diagram illustrating one embodiment of a plurality of streams 202 having varying degrees of quality and bandwidth. In one embodiment, the plurality of streams 202 comprises a low quality stream 204, a medium quality stream 206, and a high quality stream 208. Each of the streams 204, 206, 208 is a copy of the content file 200 encoded and compressed to varying bit rates. For example, the low quality stream 204 may be encoded and compressed to a bit rate of 100 kilobits per second (kbps), the medium quality stream 206 may be encoded and compressed to a bit rate of 200 kbps, and the high quality stream 208 may be encoded and compressed to 600 kbps.



FIG. 3a is a schematic block diagram illustrating one embodiment of a stream 302 divided into a plurality or source streamlets 303. As used herein, streamlet refers to any sized portion of the content file 200. Each streamlet 303 may comprise a portion of the content contained in stream 302, encapsulated as an independent media object. The content in a streamlet 303 may have a unique time index in relation to the beginning of the content contained in stream 302. In one embodiment, the content contained in each streamlet 303 may have a duration of two seconds. For example, streamlet 0 may have a time index of 00:00 representing the beginning of content playback, and streamlet 1 may have a time index of 00:02, and so on. Alternatively, the time duration of the streamlets 304 may be any duration smaller than the entire playback duration of the content in stream 302. In a further embodiment, the streamlets 303 may be divided according to file size instead of a time index and duration.



FIG. 3b is a schematic block diagram illustrating one embodiment of sets 306 of streamlets in accordance with the present invention. As used herein, the term “set” refers to a group of streamlets having identical time indices and durations but varying bitrates. In the depicted embodiment, the set 306a encompasses all streamlets having a time index of 00:00. The set 306a includes encoded streamlets 304 having low, medium, and high 204, 206, 208 bitrates. Of course each set 306 may include more than the depicted three bitrates which are given by way of example only. One skilled in the art will recognize that any number of streams having different bitrates may be generated from the original content 200.


As described above, the duration of one streamlet 304 may be approximately two seconds. Likewise each set 306 may comprise a plurality of streamlets 304 where each streamlet 304 has a playable duration of two seconds. Alternatively, the duration of the streamlet 304 may be predetermined or dynamically variable depending upon a variety of factors including, but not limited to, network congestion, system specifications, playback resolution and quality, etc. In the depicted embodiment, the content 200 may be formed of the plurality of sets 306. The number of sets 306 may depend on the length of the content 200 and the length or duration of each streamlet 304.



FIG. 4 is a schematic block diagram illustrating in greater detail one embodiment of the content module 112 in accordance with the present invention. The content module 112 may comprise a capture module 402, a streamlet module 404, an encoder module 406, a streamlet database 408, and the web server 116. In one embodiment, the capture module 402 is configured to receive the content file 200 from the publisher 110. The capture module 402 may be configured to “decompress” the content file 200. For example, if the content file 200 arrives having been encoded with one of the above described encoding schemes, the capture module 402 may convert the content file 200 into raw audio and/or video. Alternatively, the content file 200 may be transmitted by the publisher in a format 110 that does not require decompression.


The capture module 402 may comprise a capture card configured for TV and/or video capture. One example of a capture card suitable for use in the present invention is the DRC-2500 by Digital Rapids of Ontario, Canada. Alternatively, any capture card capable of capturing audio and video may be utilized with the present invention. In a further embodiment, the capture module 402 is configured to pass the content file to the streamlet module 404.


The streamlet module 404, in one embodiment, is configured to segment the content file 200 and generate source streamlets 303 that are not encoded. As used herein, the term “segment” refers to an operation to generate a streamlet of the content file 200 having a duration or size equal to or less than the duration or size of the content file 200.


The streamlet module 404 may be configured to segment the content file 200 into streamlets 303 each having an equal duration. Alternatively, the streamlet module 404 may be configured to segment the content file 200 into streamlets 303 having equal file sizes.


The encoding module 406 is configured to receive the source streamlets 303 and generate the plurality of streams 202 of varying qualities. The original content file 200 from the publisher may be digital in form and may comprise content having a high bit rate such as, for example, 2 mbps. The content may be transferred from the publisher 110 to the content module 112 over the Internet 106. Such transfers of data are well known in the art and do not require further discussion herein. Alternatively, the content may comprise a captured broadcast.


In a further embodiment, the encoding module 406 is configured to generate a plurality of sets 306 of streamlets 304. The sets 306, as described above with reference to FIG. 3b, may comprise streamlets having an identical time index and duration, and a unique bitrate. As with FIG. 3b, the sets 306 and subsequently the plurality of streams 202 may comprise the low quality stream 204, the medium quality stream 206, and the high quality stream 208. Alternatively, the plurality of streams 202 may comprise any number of streams deemed necessary to accommodate end user bandwidth.


The encoder module 406 is further configured to encode each source streamlet 303 into the plurality of streams 202 and streamlet sets 306 and store the streamlets in the streamlet database 408. The encoding module 406 may utilize encoding schemes such as DivX®, Windows Media Video 9®, Quicktime 6.5 Sorenson 3®, or Quicktime 6.5/MPEG-4®. Alternatively, a custom encoding scheme may be employed.


The content module 112 may also include a metadata module 412 and a metadata database 414. In one embodiment, metadata comprises static searchable content information. For example, metadata includes, but is not limited to, air date of the content, title, actresses, actors, length, and episode name. Metadata is generated by the publisher 110, and may be configured to define an end user environment. In one embodiment, the publisher 100 may define an end user navigational environment for the content including menus, thumbnails, sidebars, advertising, etc. Additionally, the publisher 110 may define functions such as fast forward, rewind, pause, and play that may be used with the content file 200. The metadata module 412 is configured to receive the metadata from the publisher 110 and store the metadata in the metadata database 414. In a further embodiment, the metadata module 412 is configured to interface with the client module 114, allowing the client module 114 to search for content based upon at least one of a plurality of metadata criteria. Additionally, metadata may be generated by the content module 112 through automated process(es) or manual definition.


Once the streamlets 304 have been received and processed, the client module 114 may request streamlets 304 using HTTP from the web server 116. Using a standard protocol such as HTTP eliminates the need for network administrators to configure firewalls to recognize and pass through network traffic for a new, specialized protocol. Additionally, since the client module 114 initiates the request, the web server 116 is only required to retrieve and serve the requested streamlet 304. In a further embodiment, the client module 114 may be configured to retrieve streamlets 304 from a plurality of web servers 116.


Each web server 116 may be located in various locations across the Internet 106. The streamlets 304 may essentially be static files. As such, no specialized media server or server-side intelligence is required for a client module 114 to retrieve streamlets 304. Streamlets 304 may be served by the web server 116 or cached by cache servers of Internet Service Providers (ISPs), or any other network infrastructure operators, and served by the cache server. Use of cache servers is well known to those skilled in the art, and will not be discussed further herein. Thus, a highly scalable solution is provided that is not hindered by massive amounts of client module 114 requests to the web server 116 at any specific location, especially the web server 116 most closely associated with or within the content module 112



FIG. 5a is a schematic block diagram illustrating one embodiment of an encoder module 406 in accordance with the present invention. In one embodiment, the encoder module 406 may include a master module 502 and a plurality of host computing modules (hereinafter “host”) 504. The hosts 504 may comprise personal computers, servers, etc. In a further embodiment, the hosts 504 may be dedicated hardware, for example, cards plugged into a single computer.


The master module (hereinafter “master”) 502 is configured to receive streamlets 303 from the streamlet module 404 and stage the streamlet 303 for processing. In one embodiment, the master 502 may decompress each source streamlet 303 to produce a raw streamlet. As used herein, the term “raw streamlet” refers to a streamlet 303 that is uncompressed or lightly compressed to substantially reduce size with no significant loss in quality. A lightly compressed raw streamlet can be transmitted more quickly and to more hosts. Each host 504 is coupled with the master 502 and configured to receive a raw streamlet from the master 502 for encoding. The hosts 504, in one example, generate a plurality of streamlets 304 having identical time indices and durations, and varying bitrates. Essentially each host 504 may be configured to generate a set 306 from the raw streamlet 503 sent from the master 502. Alternatively, each host 504 may be dedicated to producing a single bitrate in order to reduce the time required for encoding.


Upon encoding completion, the host 504 returns the set 306 to the master 502 so that the encoding module 406 may store the set 306 in the streamlet database 408. The master 502 is further configured to assign encoding jobs to the hosts 504. Each host is configured to submit an encoding job completion bid (hereinafter “bid”). The master 502 assigns encoding jobs depending on the bids from the hosts 504. Each host 504 generates a bid depending upon a plurality of computing variables which may include, but are not limited to, current encoding job completion percentage, average job completion time, processor speed and physical memory capacity.


For example, a host 504 may submit a bid that indicates that based on past performance history the host 504 would be able to complete the encoding job in 15 seconds. The master 502 is configured to select from among a plurality of bids the best bid and subsequently submit the encoding job to the host 504 with the best bid. As such, the described encoding system does not require that each host 504 have identical hardware but beneficially takes advantage of the available computing power of the hosts 504. Alternatively, the master 502 selects the host 504 based on a first come first serve basis, or some other algorithm deemed suitable for a particular encoding job.


The time required to encode one streamlet 304 is dependent upon the computing power of the host 504, and the encoding requirements of the content file 200. Examples of encoding requirements may include, but are not limited to, two or multi-pass encoding, and multiple streams of different bitrates. One benefit of the present invention is the ability to perform two-pass encoding on a live content file 200. Typically, in order to perform two-pass encoding prior art systems must wait for the content file to be completed before encoding.


The present invention, however, segments the content file 200 into source streamlets 303 and the two-pass encoding to a plurality of streams 202 may be performed on each corresponding raw streamlet without waiting for a TV show to end, for example. As such, the content module 112 is capable of streaming the streamlets over the Internet shortly after the content module 112 begins capture of the content file 200. The delay between a live broadcast transmitted from the publisher 110 and the availability of the content depends on the computing power of the hosts 504.



FIG. 5b is a schematic block diagram illustrating one embodiment of parallel encoding of streamlets in accordance with the present invention. In one example, the capture module 402 (of FIG. 4) begins to capture the content file and the streamlet module 404 generates a first streamlet 303a and passes the streamlet to the encoding module 406. The encoding module 406 may take 10 seconds, for example, to generate the first set 306a of streamlets 304a (304a1, 304a2, 304a3, etc. represent streamlets 304 of different bitrates). FIG. 5b illustrates the encoding process generically as block 502 to graphically illustrate the time duration required to process a raw or lightly encoded streamlet 303 as described above with reference to the encoding module 406. The encoding module 406 may simultaneously process more than one streamlet 303, and processing of streamlets will begin upon arrival of the streamlet from the capture module 402.


During the 10 seconds required to encode the first streamlet 303a, the streamlet module 404 has generated five additional 2-second streamlets 303b, 303c. 303d, 303e, 303f, for encoding and the master 502 has prepared and staged the corresponding raw streamlets. Two seconds after the first set 306a is available the next set 306b is available, and so on. As such, the content file 200 is encoded for streaming over the Internet and appears live. The 10 second delay is given herein by way of example only. Multiple hosts 504 may be added to the encoding module 406 in order to increase the processing capacity of the encoding module 406. The delay may be shortened to an almost unperceivable level by the addition of high CPU powered systems, or alternatively multiple low powered systems.


A system as described above beneficially enables multi-pass encoding of live events. Multi-pass encoding systems of the prior art require that the entire content be captured (or be complete) because in order to perform multi-pass encoding the entire content must be scanned and processed more than once. This is impossible with prior art systems because content from a live event is not complete until the event is over. As such, with prior art systems, multi-pass encoding can only be performed once the event is over. Streamlets, however, may be encoded as many times as is deemed necessary. Because the streamlet is an encapsulated media object of 2 seconds (for example), multi-pass encoding may begin on a live event once the first streamlet is captured. Shortly after multi-pass encoding of the first streamlet 303a is finished, multi-pass encoding of the second streamlet 303b finishes, and as such multi-pass encoding is performed on a live event and appears live to a viewer.


Any specific encoding scheme applied to a streamlet may take longer to complete than the time duration of the streamlet itself, for example, a very high quality encoding of a 2-second streamlet may take 5 seconds to finish. Alternatively, the processing time required for each streamlet may be less than the time duration of a streamlet. However, because the offset parallel encoding of successive streamlets are encoded by the encoding module at regular intervals (matching the intervals at which the those streamlets are submitted to the encoding module 406, for example 2 seconds) the output timing of the encoding module 406 does not fall behind the real-time submission rate of the unencoded streamlets. Conversely, prior art encoding systems rely on the very fastest computing hardware and software because the systems must generate the output immediately in lock-step with the input. A prior art system that takes 2.1 seconds to encode 2 seconds worth of content is considered a failure. The present invention allows for slower than real-time encoding processes yet still achieves a real-time encoding effect due to the parallel offset pipes.


The parallel offset pipeline approach described with reference to FIG. 5b beneficially allows for long or short encoding times without “falling behind” the live event. Additionally, arbitrarily complex encoding of streamlets to multiple profiles and optimizations only lengthens the encoding time 502 without a perceptible difference to a user because the sets 306 of streamlets 304 are encoded in a time-selective manner so that streamlets are processed at regular time intervals and transmitted at these time intervals.


Returning now to FIG. 5a as depicted, the master 502 and the hosts 504 may be located within a single local area network, or in other terms, the hosts 504 may be in close physical proximity to the master 502. Alternatively, the hosts 504 may receive encoding jobs from the master 502 over the Internet or other communications network. For example, consider a live sports event in a remote location where it would be difficult to setup multiple hosts. In this example, a master performs no encoding or alternatively light encoding before publishing the streamlets online. The hosts 504 would then retrieve those streamlets and encode the streamlets into the multiple bitrate sets 306 as described above.


Furthermore, hosts 504 may be dynamically added or removed from the encoding module without restarting the encoding job and/or interrupting the publishing of streamlets. If a host 504 experiences a crash or some failure, its encoding work is simply reassigned to another host.


The encoding module 406, in one embodiment, may also be configured to produce streamlets that are specific to a particular playback platform. For example, for a single raw streamlet, a single host 504 may produce streamlets for different quality levels for personal computer playback, streamlets for playback on cell phones with a different, proprietary codec, a small video-only streamlet for use when playing just a thumbnail view of the stream (like in a programming guide), and a very high quality streamlet for use in archiving.



FIG. 6a is a schematic block diagram illustrating one embodiment of a virtual timeline 600 in accordance with the present invention. In one embodiment, the virtual timeline 600 comprises at least one quantum media extension 602. The quantum media extension (hereinafter “QMX”) 602 describes an entire content file 200. Therefore, the virtual timeline (hereinafter “VT”) 600 may comprise a file that is configured to define a playlist for a user to view. For example, the VT may indicate that the publisher desires a user to watch a first show QMX 602a followed by QMX 602b and QMX 602c. As such, the publisher may define a broadcast schedule in a manner similar to a television station.



FIG. 6b is a schematic block diagram illustrating an alternative embodiment of a VT 600 in accordance with the present invention. In the depicted embodiment, the VT 600 may include a single QMX 602 which indicates that the publisher desires the same content to be looped over and over again. For example, the publisher may wish to broadcast a never-ending infomercial on a website.



FIG. 6c is a schematic block diagram illustrating one embodiment of a QMX 602 in accordance with the present invention. In one embodiment, the QMX 602 contains a multitude of information generated by the content module 112 configured to describe the content file 200. Examples of information include, but are not limited to, start index 604, end index 606, whether the content is live 608, proprietary publisher data 610, encryption level 612, content duration 614 and bitrate values 616. The bitrate values 616 may include frame size 618, audio channel 620 information, codecs 622 used, sample rate 624, and frames parser 626.


A publisher may utilize the QVT 600 together with the QMX 602 in order to prescribe a playback order for users, or alternatively selectively edit content. For example, a publisher may indicate in the QMX 602 that audio should be muted at time index 10:42 or video should be skipped for 3 seconds at time index 18:35. As such, the publisher may selectively skip offensive content without the processing requirements of editing the content.



FIG. 7 is a schematic block diagram graphically illustrating one embodiment of a client module 114 in accordance with the present invention. The client module 114 may comprise an agent controller module 702, a streamlet cache module 704, and a network controller module 706. In one embodiment, the agent controller module 702 is configured to interface with a viewer 708, and transmit streamlets 304 to the viewer 708. Alternatively, the agent controller module 702 may be configured to simply reassemble streamlets into a single file for transfer to an external device such as a portable video player.


In a further embodiment, the client module 114 may comprise a plurality of agent controller modules 702. Each agent controller module 702 may be configured to interface with one viewer 708. Alternatively, the agent controller module 702 may be configured to interface with a plurality of viewers 708. The viewer 708 may be a media player (not shown) operating on a PC or handheld electronic device.


The agent controller module 702 is configured to select a quality level of streamlets to transmit to the viewer 708. The agent controller module 702 requests lower or higher quality streams based upon continuous observation of time intervals between successive receive times of each requested streamlet. The method of requesting higher or lower quality streams will be discussed in greater detail below with reference to FIG. 10.


The agent controller module 702 may be configured to receive user commands from the viewer 708. Such commands may include play, fast forward, rewind, pause, and stop. In one embodiment, the agent controller module 702 requests streamlets 304 from the streamlet cache module 704 and arranges the received streamlets 304 in a staging module 709. The staging module 709 may be configured to arrange the streamlets 304 in order of ascending playback time. In the depicted embodiment, the streamlets 304 are numbered 0, 1, 2, 3, 4, etc. However, each streamlet 304 may be identified with a unique filename.


Additionally, the agent controller module 702 may be configured to anticipate streamlet 304 requests and pre-request streamlets 304. By pre-requesting streamlets 304, the user may fast-forward, skip randomly, or rewind through the content and experience no buffering delay. In a further embodiment, the agent controller module 702 may request the streamlets 304 that correspond to time index intervals of 30 seconds within the total play time of the content. Alternatively, the agent controller module 702 may request streamlets at any interval less than the length of the time index. This enables a “fast-start” capability with no buffering wait when starting or fast-forwarding through content file 200. In a further embodiment, the agent controller module 702 may be configured to pre-request streamlets 304 corresponding to specified index points within the content or within other content in anticipation of the end user 104 selecting new content to view. In one embodiment, the streamlet cache module 704 is configured to receive streamlet 304 requests from the agent controller module 702. Upon receiving a request, the streamlet cache module 704 first checks a streamlet cache 710 to verify if the streamlet 304 is present. In a further embodiment, the streamlet cache module 704 handles streamlet 304 requests from a plurality of agent controller modules 702. Alternatively, a streamlet cache module 704 may be provided for each agent controller module 702. If the requested streamlet 304 is not present in the streamlet cache 410, the request is passed to the network controller module 706. In order to enable fast forward and rewind capabilities, the streamlet cache module 704 is configured to store the plurality of streamlets 304 in the streamlet cache 710 for a specified time period after the streamlet 304 has been viewed. However, once the streamlets 304 have been deleted, they may be requested again from the web server 116.


The network controller module 706 may be configured to receive streamlet requests from the streamlet cache module 704 and open a connection to the web server 116 or other remote streamlet 304 database (not shown). In one embodiment, the network controller module 706 opens a TCP/IP connection to the web server 116 and generates a standard HTTP GET request for the requested streamlet 304. Upon receiving the requested streamlet 304, the network controller module 706 passes the streamlet 304 to the streamlet cache module 704 where it is stored in the streamlet cache 710. In a further embodiment, the network controller module 706 is configured to process and request a plurality of streamlets 304 simultaneously. The network controller module 706 may also be configured to request a plurality of streamlets, where each streamlet 304 is subsequently requested in multiple parts.


In a further embodiment, streamlet requests may comprise requesting pieces of any streamlet file. Splitting the streamlet 304 into smaller pieces or portions beneficially allows for an increased efficiency potential, and also eliminates problems associated with multiple full-streamlet requests sharing the bandwidth at any given moment. This is achieved by using parallel TCP/IP connections for pieces of the streamlets 304. Consequently, efficiency and network loss problems are overcome, and the streamlets arrive with more useful and predictable timing.


In one embodiment, the client module 114 is configured to use multiple TCP connections between the client module 114 and the web server 116 or web cache. The intervention of a cache may be transparent to the client or configured by the client as a forward cache. By requesting more than one streamlet 304 at a time in a manner referred to as “parallel retrieval,” or more than one part of a streamlet 304 at a time, efficiency is raised significantly and latency is virtually eliminated. In a further embodiment, the client module allows a maximum of three outstanding streamlet 304 requests. The client module 114 may maintain additional open TCP connections as spares to be available should another connection fail. Streamlet 304 requests are rotated among all open connections to keep the TCP flow logic for any particular connection from falling into a slow-start or close mode. If the network controller module 706 has requested a streamlet 304 in multiple parts, with each part requested on mutually independent TCP/IP connections, the network controller module 706 reassembles the parts to present a complete streamlet 304 for use by all other components of the client module 114.


When a TCP connection fails completely, a new request may be sent on a different connection for the same streamlet 304. In a further embodiment, if a request is not being satisfied in a timely manner, a redundant request may be sent on a different connection for the same streamlet 304. If the first streamlet request's response arrives before the redundant request response, the redundant request can be aborted. If the redundant request response arrives before the first request response, the first request may be aborted.


Several streamlet 304 requests may be sent on a single TCP connection, and the responses are caused to flow back in matching order along the same connection. This eliminates all but the first request latency. Because multiple responses are always being transmitted, the processing latency of each new streamlet 304 response after the first is not a factor in performance. This technique is known in the industry as “pipelining.” Pipelining offers efficiency in request-response processing by eliminating most of the effects of request latency. However, pipelining has serious vulnerabilities. Transmission delays affect all of the responses. If the single TCP connection fails, all of the outstanding requests and responses are lost. Pipelining causes a serial dependency between the requests.


Multiple TCP connections may be opened between the client module 114 and the web server 116 to achieve the latency-reduction efficiency benefits of pipelining while maintaining the independence of each streamlet 304 request. Several streamlet 304 requests may be sent concurrently, with each request being sent on a mutually distinct TCP connection. This technique is labeled “virtual pipelining” and is an innovation of the present invention. Multiple responses may be in transit concurrently, assuring that communication bandwidth between the client module 114 and the web server 116 is always being utilized. Virtual pipelining eliminates the vulnerabilities of traditional pipelining. A delay in or complete failure of one response does not affect the transmission of other responses because each response occupies an independent TCP connection. Any transmission bandwidth not in use by one of multiple responses (whether due to delays or TCP connection failure) may be utilized by other outstanding responses.


A single streamlet 304 request may be issued for an entire streamlet 304, or multiple requests may be issued, each for a different part or portion of the streamlet. If the streamlet is requested in several parts, the parts may be recombined by the client module 114 streamlet.


In order to maintain a proper balance between maximized bandwidth utilization and response time, the issuance of new streamlet requests must be timed such that the web server 116 does not transmit the response before the client module 114 has fully received a response to one of the previously outstanding streamlet requests. For example, if three streamlet 304 requests are outstanding, the client module 114 should issue the next request slightly before one of the three responses is fully received and “out of the pipe.” In other words, request timing is adjusted to keep three responses in transit. Sharing of bandwidth among four responses diminishes the net response time of the other three responses. The timing adjustment may be calculated dynamically by observation, and the request timing adjusted accordingly to maintain the proper balance of efficiency and response times.


The schematic flow chart diagrams that follow are generally set forth as logical flow chart diagrams. As such, the depicted order and labeled steps are indicative of one embodiment of the presented method. Other steps and methods may be conceived that are equivalent in function, logic, or effect to one or more steps, or portions thereof, of the illustrated method. Additionally, the format and symbols employed are provided to explain the logical steps of the method and are understood not to limit the scope of the method. Although various arrow types and line types may be employed in the flow chart diagrams, they are understood not to limit the scope of the corresponding method. Indeed, some arrows or other connectors may be used to indicate only the logical flow of the method. For instance, an arrow may indicate a waiting or monitoring period of unspecified duration between enumerated steps of the depicted method. Additionally, the order in which a particular method occurs may or may not strictly adhere to the order of the corresponding steps shown.



FIG. 8 is a schematic flow chart diagram illustrating one embodiment of a method 800 for processing content in accordance with the present invention. In one embodiment the method 800 starts 802, and the content module 112 receives 804 content from the publisher 110. Receiving content 804 may comprise receiving 804 a digital copy of the content file 200, or digitizing a physical copy of the content file 200. Alternatively, receiving 804 content may comprise capturing a radio, television, cable, or satellite broadcast. Once received 804, the streamlet module 404 generates 808 a plurality of source streamlets 303 each having a fixed duration. Alternatively, the streamlets 303 may be generated with a fixed file size.


In one embodiment, generating 808 streamlets comprises dividing the content file 200 into a plurality of two second streamlets 303. Alternatively, the streamlets may have any length less than or equal to the length of the stream 202. The encoder module 406 then encodes 810 the streamlets 303 into sets 306 of streamlets 304, in a plurality of streams 202 according to an encoding scheme. The quality may be predefined, or automatically set according to end user bandwidth, or in response to pre-designated publisher guidelines


In a further embodiment, the encoding scheme comprises a proprietary codec such as WMV9®. The encoder module 406 then stores 812 the encoded streamlets 304 in the streamlet database 408. Once stored 812, the web server 116 may then serve 814 the streamlets 304. In one embodiment, serving 814 the streamlets 304 comprises receiving streamlet requests from the client module 114, retrieving the requested streamlet 304 from the streamlet database 408, and subsequently transmitting the streamlet 304 to the client module 114. The method 800 then ends 816.



FIG. 9 is a schematic flow chart diagram illustrating one embodiment of a method 900 for viewing a plurality of streamlets in accordance with the present invention. The method 90 starts and an agent controller module 702 is provided 904 and associated with a viewer 708 and provided with a staging module 709. The agent controller module 702 then requests 906 a streamlet 304 from the streamlet cache module 704. Alternatively, the agent controller module 702 may simultaneously request 906 a plurality of streamlets 304 the streamlet cache module 704. If the streamlet is stored 908 locally in the streamlet cache 710, the streamlet cache module 704 retrieves 910 the streamlet 304 and sends the streamlet to the agent controller module 702. Upon retrieving 910 or receiving a streamlet, the agent controller module 702 makes 911 a determination of whether or not to shift to a higher or lower quality stream 202. This determination will be described below in greater detail with reference to FIG. 10.


In one embodiment, the staging module 709 then arranges 912 the streamlets 304 into the proper order, and the agent controller module 702 delivers 914 the streamlets to the viewer 708. In a further embodiment, delivering 914 streamlets 304 to the end user comprises playing video and or audio streamlets on the viewer 708. If the streamlets 304 are not stored 908 locally, the streamlet request is passed to the network controller module 706. The network controller module 706 then requests 916 the streamlet 304 from the web server 116. Once the streamlet 304 is received, the network controller module 706 passes the streamlet to the streamlet cache module 704. The streamlet cache module 704 archives 918 the streamlet. Alternatively, the streamlet cache module 704 then archives 918 the streamlet and passes the streamlet to the agent controller module 702, and the method 900 then continues from operation 910 as described above.


Referring now to FIG. 10, shown therein is a schematic flow chart diagram illustrating one embodiment of a method 1000 for requesting streamlets 304 within an adaptive-rate shifting content streaming environment in accordance with the present invention. The method 1000 may be used in one embodiment as the operation 911 of FIG. 9. The method 1000 starts and the agent controller module 702 receives 1004 a streamlet 304 as described above with reference to FIG. 9. The agent controller module 702 then monitors 1006 the receive time of the requested streamlet. In one embodiment, the agent controller module 702 monitors the time intervals A between successive receive times for each streamlet response. Ordering of the responses in relation to the order of their corresponding requests is not relevant.


Because network behavioral characteristics fluctuate, sometimes quite suddenly, any given Δ may vary substantially from another. In order to compensate for this fluctuation, the agent controller module 702 calculates 1008 a performance ratio r across a window of n samples for streamlets of playback length S. In one embodiment, the performance ratio r is calculated using the equation:






r
=

S



n







i
=
1

n



Δ
i



.






Due to multiple simultaneous streamlet processing, and in order to better judge the central tendency of the performance ratio r, the agent controller module 702 may calculate a geometric mean, or alternatively an equivalent averaging algorithm, across a window of size m, and obtain a performance factor φ:







φ
current

=


(




j
=
1

m



r
j


)


1
m






The policy determination about whether or not to upshift 1010 playback quality begins by comparing φcurrent with a trigger threshold Θup. If φcurrent≥Θup, then an up shift to the next higher quality stream may be considered 1016. In one embodiment, the trigger threshold Θup is determined by a combination of factors relating to the current read ahead margin (i.e. the amount of contiguously available streamlets that have been sequentially arranged by the staging module 709 for presentation at the current playback time index), and a minimum safety margin. In one embodiment, the minimum safety margin may be 24 seconds. The smaller the read ahead margin, the larger Θup is to discourage upshifting until a larger read ahead margin may be established to withstand network disruptions. If the agent controller module 702 is able to sustain 1016 upshift quality, then the agent controller module 702 will upshift 1017 the quality and subsequently request higher quality streams. The determination of whether use of the higher quality stream is sustainable 1016 is made by comparing an estimate of the higher quality stream's performance factor, φhigher, with Θup. If φhigher≥Θup then use of the higher quality stream is considered sustainable. If the decision of whether or not the higher stream rate is sustainable 1016 is “no.” the agent controller module 702 will not attempt to upshift 1017 stream quality. If the end of the stream has been reached 1014, the method 1000 ends 1016.


If the decision on whether or not to attempt upshift 1010 is “no”, a decision about whether or not to down shift 1012 is made. In one embodiment, a trigger threshold Θdown is defined in a manner analogous to Θup. If φcurrentdown then the stream quality may be adequate, and the agent controller module 702 does not downshift 1018 stream quality. However, if φcurrent≤Θdown, the agent controller module 702 does downshift 1018 the stream quality. If the end of the stream has not been reached 1014, the agent controller module 702 begins to request and receive 1004 lower quality streamlets and the method 1000 starts again. Of course, the above described equations and algorithms are illustrative only, and may be replaced by alternative streamlet monitoring solutions.


The present invention may be embodied in other specific forms without departing from its spirit or essential characteristics. The described embodiments are to be considered in all respects only as illustrative and not restrictive. The scope of the invention is, therefore, indicated by the appended claims rather than by the foregoing description. All changes which come within the meaning and range of equivalency of the claims are to be embraced within their scope. However, if φcurrent≤Θdown, the agent controller module 702 does downshift 1018 the

Claims
  • 1. An end user station for adaptive-rate content streaming of digital content comprising: a client module configured to be connected to a network having at least one server and further configured to request digital content over the network via at least one transmission control protocol (TCP) connection, wherein at least two different copies of the digital content are each encoded at different bit rates and stored on the at least one server, wherein each copy of the digital content is divided into a plurality of streamlets, each of the plurality of streamlets of a corresponding copy comprising a different portion of the digital content during presentation, wherein corresponding streamlets across the at least two different copies comprise the same corresponding portions of the digital content during presentation, and wherein the client module streams the digital content by:requesting a first streamlet from the at least one server;automatically requesting from the at least one server subsequent portions of the digital content by requesting for each subsequent portion one of the streamlets from the different copies of the digital content dependent upon successive determinations by the client module to change a currently requested bit rate to a higher or lower bit rate, the automatically requesting including repeatedly generating a factor indicative of a current ability to receive digital content at a rate sufficient for presenting the digital content as the digital content is received;making the successive determinations to change the digital content bit rate based on the factor using the streamlets of one of the different copies of the digital content having the highest bit rate determined receivable for presentation so that the client module selects a higher bit rate one of the different copies when the factor is greater than a first threshold and selects a lower bit rate one of the different copies when the factor is less than a second threshold; andarranging the streamlets requested from the at least one server in order of ascending presentation time for output to a presentation device.
  • 2. The end user station of claim 1, wherein at least some streamlets are requested from the at least one server via a hypertext transfer protocol (HTTP) GET request.
  • 3. The end user station of claim 1, wherein the at least one server comprises at least two servers and wherein at least one streamlet is requested from a first of the at least one server and at least one other streamlet is requested from a second server of the at least one server other than the first server.
  • 4. The end user station of claim 1, wherein the client module repeatedly generates the factor based on a moving time window.
  • 5. The end user station of claim 1, wherein the client module generates the factor based on a current read ahead margin.
  • 6. The end user station of claim 1, wherein a first streamlet of each copy of the digital content has the same first duration and corresponds to a same first temporal portion of the digital content, wherein a second streamlet of each copy of the digital content have the same second duration and correspond to a same second temporal portion of the digital content.
  • 7. The end user station of claim 6, wherein the first and second duration of the first streamlets of each copy are different from the durations of the second streamlets of each copy.
  • 8. The end user station of claim 6, wherein each of the first streamlets has a first duration that is a range of 0.1 to 5 seconds.
  • 9. The end user station of claim 1, wherein the client module is further configured to transmit at least one virtual timeline request to retrieve a virtual timeline corresponding to the digital content and to receive the virtual timeline from the at least one server, and arrange the streamlets requested from the at least one server using the virtual timeline.
  • 10. The end user station of claim 1, wherein the client module is further configured to output the streamlets requested from the at least one server to the presentation device in the order of ascending presentation time.
  • 11. The end user station of claim 1, further comprising the presentation device to display the streamlets in the order of ascending presentation time.
  • 12. A method executable by a client device to output rate-adaptive streams received via at least one transmission control protocol (RCP) connection with at least one server over a network, the method comprising: receiving, by the client device, digital content from the at least one server via the at least one TCP connection over the network, wherein multiple different copies of the digital content encoded at different bit rates are stored as individually-requestable portions on the at least one server, wherein each of the individually-requestable portions of a corresponding copy of the digital content is a different portion of the digital content during presentation, wherein the individually-requestable portions across the different copies yield the same portions of the digital content upon presentation, and wherein the receiving comprises:requesting by the client device a plurality of sequential individually-requestable portions of one of the copies from the at least one server;automatically requesting by the client device from the at least one server subsequent portions of the digital content by requesting for each such portion one of the individually-requestable portions from one of the copies dependent upon successive determinations by the client device to change a requested bit rate to a higher or lower bit rate one of the different copies, the automatically requesting including repeatedly generating a factor indicative of a current ability to receive the digital content at a rate sufficient for presenting the digital content as the digital content is received, individually-requestable wherein the factor relates to a performance of the network; andmaking the successive determinations whether to change the requested bit rate based on the factor to achieve continuous presentation of the digital content using the individually-requestable portions of the highest bit rate one of the copies determined receivable at that time at a rate sufficient for presenting the digital content as the individually-requestable portions of the digital content are received, wherein the making of the successive determinations to change the requested bit rate comprises:requesting a subsequent individually-requestable portion from a higher bit rate one of the different copies than a currently requested one of the different copies when the at least one factor is greater than a first threshold; andrequesting a subsequent individually-requestable portion from a lower bit rate one of the different copies than the currently requested one of the different copies when the at least one factor is less than a second threshold; andarranging the individually-requestable portions requested from the at least one server in order of ascending presentation time for output to a presentation device.
  • 13. The method of claim 12, wherein the automatically requesting comprises requesting at least some individually-requestable portions via a hypertext transfer protocol (HTTP) GET request.
  • 14. The method of claim 12, wherein the at least one server comprises at least two servers and wherein the client device requests at least one streamlet from a first server of the at least two servers and at least one other streamlet from a second server of the at least two servers other than the first server.
  • 15. The method of claim 12, wherein the digital content is stored on the at least one server in a plurality of streamlets, each of the plurality of streamlets corresponding to a different temporal portion of said digital content and wherein each of the individually-requestable portions is requestable by the client device without regard to whether the client device has previously requested other individually-requestable portions of the digital content.
  • 16. The method of claim 12, wherein the at least one TCP connection comprises a plurality of different TCP connections, and wherein the requesting of the plurality of sequential individually-requestable portions includes requesting sub-pars of the individually-requestable portions over different ones of the plurality of different TCP connections, and wherein the arranging includes reassembling the individually-requestable portions from the requested sub-parts.
  • 17. The method of claim 12, wherein the making the successive determinations to change the requested bit rate comprises: determining if the higher bit rate one of the different copies can be received at a rate sufficient for presenting the digital content as the digital content is received.
  • 18. The method of claim 12, wherein the factor is indicative of a delay or a loss in one or more of the at least one TCP connections.
  • 19. The method of claim 12, wherein the at least one server comprises a cache server of a network infrastructure operator.
  • 20. The method of claim 12, further comprising: outputting the received content to the presentation device.
CROSS-REFERENCES TO RELATED APPLICATIONS

This application is a continuation of U.S. patent application Ser. No. 17/962,231 filed on Oct. 7, 2022, which is a continuation of U.S. patent application Ser. No. 16/876,579 filed on May 18, 2020 (now U.S. Pat. No. 11,470,138), which is a continuation of Ser. No. 16/004,056 filed on Jun. 8, 2018 (now U.S. Pat. No. 10,659,513), which is a continuation of U.S. patent application Ser. No. 15/414,025 (now U.S. Pat. No. 9,998,516) filed on Jan. 24, 2017, which is a continuation of U.S. patent application Ser. No. 14/719,122 filed on May 21, 2015 (now U.S. Pat. No. 9,571,551), which is a continuation of U.S. patent application Ser. No. 14/106,051 filed on Dec. 13, 2013 (now U.S. Pat. No. 9,071,668), which is a continuation of U.S. patent application Ser. No. 13/617,114, filed on Sep. 14, 2012 (now U.S. Pat. No. 8,612,624), which is a continuation of U.S. patent Ser. No. 12/906,940 filed on Oct. 18, 2010 (now U.S. Pat. No. 8,402,156), which is a continuation of U.S. patent application Ser. No. 11/673,483, filed on Feb. 9, 2007 (now U.S. Pat. No. 7,818,444), which is a continuation-in-part of application Ser. No. 11/116,783, filed on Apr. 28, 2005 (now U.S. Pat. No. 8,868,772), which claims the benefit of U.S. Provisional Application No. 60/566,831, filed on Apr. 30, 2004, all of which are incorporated herein by reference.

US Referenced Citations (869)
Number Name Date Kind
4535355 Arn et al. Aug 1985 A
4760442 O'Connell Jul 1988 A
4761684 Clark Aug 1988 A
4816905 Tweedy Mar 1989 A
4862264 Wells Aug 1989 A
4931950 Isle Jun 1990 A
4949169 Lumelsky Aug 1990 A
4949248 Caro Aug 1990 A
4963995 Lang Oct 1990 A
5014125 Pocock May 1991 A
5019900 Clark May 1991 A
5025457 Ahmed Jun 1991 A
5043885 Robinson Aug 1991 A
5050161 Golestani Sep 1991 A
5057932 Lang Oct 1991 A
5088107 Piasecki Feb 1992 A
5089885 Clark Feb 1992 A
5109281 Kobori Apr 1992 A
5119474 Beitel Jun 1992 A
5130792 Tindell Jul 1992 A
5132964 Esaki Jul 1992 A
5132992 Yurt Jul 1992 A
5164839 Lang Nov 1992 A
5168353 Walker Dec 1992 A
5168356 Acampora et al. Dec 1992 A
5172413 Bradley Dec 1992 A
5208665 McCalley May 1993 A
5208810 Park May 1993 A
5214768 Martin May 1993 A
5231599 Peters Jul 1993 A
5245430 Nishimura Sep 1993 A
5247347 Litteral Sep 1993 A
5253275 Yurt et al. Oct 1993 A
5262875 Mincer Nov 1993 A
5267334 Normille et al. Nov 1993 A
5274758 Beitel Dec 1993 A
5307456 MacKay Apr 1994 A
5313454 Bustini May 1994 A
5325525 Shan Jun 1994 A
5341477 Pitkin Aug 1994 A
5359593 Derby Oct 1994 A
5361096 Ohki et al. Nov 1994 A
5404446 Bowater et al. Apr 1995 A
5408448 Carman Apr 1995 A
5408465 Gusella Apr 1995 A
5410326 Goldstein Apr 1995 A
5414455 Hooper et al. May 1995 A
5414644 Seaman May 1995 A
5422674 Hooper Jun 1995 A
5424455 Yamamoto et al. Jun 1995 A
5428782 White Jun 1995 A
5434848 Chimento, Jr. Jul 1995 A
5440334 Walters Aug 1995 A
5442389 Blahut Aug 1995 A
5455910 Johnson Oct 1995 A
5463422 Simpson Oct 1995 A
5467413 Barrett Nov 1995 A
5477397 Naimpally Dec 1995 A
5481312 Cash Jan 1996 A
5485211 Kuzma Jan 1996 A
5487167 Dinallo Jan 1996 A
5490247 Tung et al. Feb 1996 A
5490252 Macera Feb 1996 A
5504670 Barth Apr 1996 A
5504744 Adams Apr 1996 A
5508942 Agarwal Apr 1996 A
5513181 Bresalier Apr 1996 A
5513314 Kandasamy Apr 1996 A
5519435 Anderson May 1996 A
5519438 Elliott et al. May 1996 A
5519701 Colmant May 1996 A
5524193 Covington Jun 1996 A
5533021 Branstad Jul 1996 A
5537408 Branstad Jul 1996 A
5539479 Bertram Jul 1996 A
5543850 Pratt Aug 1996 A
5544170 Kasahara Aug 1996 A
5544318 Schmitz et al. Aug 1996 A
5544327 Dan Aug 1996 A
5548724 Akizawa Aug 1996 A
5550982 Long Aug 1996 A
5555244 Gupta Sep 1996 A
5566175 Davis Oct 1996 A
5568181 Greenwood Oct 1996 A
5572260 Onishi Nov 1996 A
5574724 Bales Nov 1996 A
5574861 Lorvig Nov 1996 A
5577258 Cruz Nov 1996 A
5583561 Baker Dec 1996 A
5583868 Rashid Dec 1996 A
5583937 Ullrich Dec 1996 A
5583980 Anderson Dec 1996 A
5586264 Belknap Dec 1996 A
5594911 Cruz Jan 1997 A
5600775 King Feb 1997 A
5602582 Wanderscheid Feb 1997 A
5602992 Danneels Feb 1997 A
5603058 Belknap Feb 1997 A
5606359 Youden Feb 1997 A
5606693 Nilsen Feb 1997 A
5610653 Abecassis Mar 1997 A
5612742 Krause Mar 1997 A
5615362 Jensen Mar 1997 A
5617142 Hamilton Apr 1997 A
5619249 Billock Apr 1997 A
5619733 Noe Apr 1997 A
5621728 Lightfoot Apr 1997 A
5623690 Palmer Apr 1997 A
5623699 Blakeslee Apr 1997 A
5625407 Biggs Apr 1997 A
5630007 Kobayashi May 1997 A
5631693 Wunderlich May 1997 A
5633810 Mandal May 1997 A
5633859 Jain May 1997 A
5659539 Porter Aug 1997 A
5663952 Gentry, Jr. Sep 1997 A
5666487 Goodman Sep 1997 A
5671225 Hooper Sep 1997 A
5675732 Majeti Oct 1997 A
5682597 Ganek Oct 1997 A
5687095 Haskell et al. Nov 1997 A
5694334 Donahue Dec 1997 A
5701316 Alferness Dec 1997 A
5706053 Urano Jan 1998 A
5717691 Dighe Feb 1998 A
5719786 Nelson et al. Feb 1998 A
5732183 Sugiyama Mar 1998 A
5732218 Bland Mar 1998 A
5737747 Vishlitzky Apr 1998 A
5742343 Haskell Apr 1998 A
5742610 Natarajan Apr 1998 A
5754784 Garland May 1998 A
5767907 Pearlstein Jun 1998 A
5768527 Zhu et al. Jun 1998 A
5768539 Metz Jun 1998 A
5774668 Choquier Jun 1998 A
5778143 Boyce Jul 1998 A
5778181 Hidary Jul 1998 A
5787472 Dan Jul 1998 A
5790543 Cloutier Aug 1998 A
5796724 Rajamani Aug 1998 A
5799185 Watanabe Aug 1998 A
5802311 Wronski Sep 1998 A
5812786 Seazholtz Sep 1998 A
5812788 Agarwal Sep 1998 A
5815492 Berthaud Sep 1998 A
5815505 Mills Sep 1998 A
5818438 Howe Oct 1998 A
5818439 Nagasaka Oct 1998 A
5822524 Chen Oct 1998 A
5822528 Amano Oct 1998 A
5822537 Katseff Oct 1998 A
5825771 Cohen Oct 1998 A
5835495 Ferriere Nov 1998 A
5835667 Wactlar Nov 1998 A
5838683 Corley Nov 1998 A
5841432 Carmel et al. Nov 1998 A
5844620 Coleman Dec 1998 A
5852565 Demos Dec 1998 A
5854887 Kindell Dec 1998 A
5854894 Lancaster Dec 1998 A
5859667 Kondo Jan 1999 A
5864682 Porter Jan 1999 A
5867230 Wang et al. Feb 1999 A
5870146 Zhu Feb 1999 A
5877755 Hellhake Mar 1999 A
5881050 Chevalier Mar 1999 A
5884056 Steele Mar 1999 A
5884298 Smith, II Mar 1999 A
5886733 Zdepski Mar 1999 A
5886995 Arsenault Mar 1999 A
5890010 Nishigami Mar 1999 A
5892549 Feng Apr 1999 A
5900868 Duhault May 1999 A
5907683 Engelsiepen et al. May 1999 A
5913038 Griffiths Jun 1999 A
5914711 Mangerson et al. Jun 1999 A
5916307 Piskiel Jun 1999 A
5917488 Anderson Jun 1999 A
5918002 Klemets Jun 1999 A
5918020 Blackard Jun 1999 A
5920705 Lyon Jul 1999 A
5923814 Boyce Jul 1999 A
5926205 Krause Jul 1999 A
5926226 Proctor Jul 1999 A
5931961 Ranganathan Aug 1999 A
5933500 Blatter Aug 1999 A
5933603 Vahalia et al. Aug 1999 A
5940072 Jahanghir Aug 1999 A
5941951 Day et al. Aug 1999 A
5953506 Kalra et al. Sep 1999 A
5956088 Shen Sep 1999 A
5958010 Agarwal Sep 1999 A
5959674 Jang Sep 1999 A
5960452 Chi Sep 1999 A
5963202 Polish Oct 1999 A
5966015 Horii Oct 1999 A
5966025 Beffa Oct 1999 A
5966122 Itoh Oct 1999 A
5978544 Shimada Nov 1999 A
5978567 Rebane Nov 1999 A
5982436 Balakrishnan Nov 1999 A
5983005 Monteiro Nov 1999 A
5983263 Rothrock Nov 1999 A
5991306 Burns et al. Nov 1999 A
5991307 Komuro Nov 1999 A
5995155 Schindler Nov 1999 A
5995650 Migdal Nov 1999 A
5996015 Day Nov 1999 A
5996025 Day et al. Nov 1999 A
5999906 Mercs Dec 1999 A
6002440 Dalby et al. Dec 1999 A
6003030 Kenner et al. Dec 1999 A
6005621 Linzer Dec 1999 A
6006241 Purnaveja et al. Dec 1999 A
6011776 Berthaud Jan 2000 A
6012100 Frailong Jan 2000 A
6014694 Aharoni Jan 2000 A
6014706 Cannon Jan 2000 A
6018359 Kermode Jan 2000 A
6018768 Ullman Jan 2000 A
6026439 Chowdhury Feb 2000 A
6031960 Lane Feb 2000 A
6041345 Levi Mar 2000 A
6047304 Ladwig Apr 2000 A
6054943 Lawrence Apr 2000 A
6061056 Menard May 2000 A
6061504 Tzelnic May 2000 A
6084885 Scott Jul 2000 A
6085193 Malkin Jul 2000 A
6085221 Graf Jul 2000 A
6091775 Hibi et al. Jul 2000 A
6091777 Guetz et al. Jul 2000 A
6098082 Gibbon Aug 2000 A
6098096 Tsirigotis Aug 2000 A
6104334 Allport Aug 2000 A
6104441 Wee Aug 2000 A
6108382 Gringeri Aug 2000 A
6111567 Savchenko Aug 2000 A
6112239 Kenner et al. Aug 2000 A
6118450 Proehl Sep 2000 A
6118817 Wang Sep 2000 A
6119154 Weaver Sep 2000 A
6120149 Hosoi Sep 2000 A
6122660 Baransky et al. Sep 2000 A
6134243 Jones Oct 2000 A
6134559 Brumme Oct 2000 A
6139197 Banks Oct 2000 A
6141447 Linzer Oct 2000 A
6141686 Jackowski Oct 2000 A
6144375 Jain Nov 2000 A
6148005 Paul Nov 2000 A
6151632 Chaddha Nov 2000 A
6154489 Kleider Nov 2000 A
6154600 Newman Nov 2000 A
6154744 Kenner et al. Nov 2000 A
6154771 Rangan Nov 2000 A
6161137 Ogdon Dec 2000 A
6161201 Payne Dec 2000 A
6172672 Ramasubramanian et al. Jan 2001 B1
6173317 Chaddha Jan 2001 B1
6181711 Zhang Jan 2001 B1
6181867 Kenner et al. Jan 2001 B1
6185573 Angelucci Feb 2001 B1
6185625 Tso Feb 2001 B1
6185736 Ueno Feb 2001 B1
6188398 Collins-Rector Feb 2001 B1
6195680 Goldszmidt et al. Feb 2001 B1
6195692 Hsu Feb 2001 B1
6209041 Shaw Mar 2001 B1
6216163 Bharali Apr 2001 B1
6219339 Doshi Apr 2001 B1
6226328 Assuncao May 2001 B1
6236395 Sezan May 2001 B1
6240105 Zetts May 2001 B1
6263371 Geagan Jul 2001 B1
6266813 Ihara Jul 2001 B1
6269374 Chen Jul 2001 B1
6269394 Kenner Jul 2001 B1
6271892 Gibbon Aug 2001 B1
6272148 Takagi Aug 2001 B1
6275507 Anderson Aug 2001 B1
6281940 Sciammarella Aug 2001 B1
6282206 Hindus Aug 2001 B1
6292383 Worley Sep 2001 B1
6292466 Droz Sep 2001 B1
6292512 Radha Sep 2001 B1
6292834 Ravi et al. Sep 2001 B1
6292880 Mattis Sep 2001 B1
6304295 Krishnamurthy Oct 2001 B1
6308222 Krueger Oct 2001 B1
6311251 Merritt Oct 2001 B1
6314492 Allen Nov 2001 B1
6327421 Tiwari Dec 2001 B1
6329165 Chattoraj Dec 2001 B1
6339619 Sugiyama Jan 2002 B1
6342904 Vasudevan Jan 2002 B1
6349410 Lortz Feb 2002 B1
6351471 Robinett Feb 2002 B1
6351474 Robinett Feb 2002 B1
6351767 Batchelder Feb 2002 B1
6356565 Bouyer Mar 2002 B1
6366614 Pian et al. Apr 2002 B1
6366888 Kroon Apr 2002 B1
6366970 Wolff Apr 2002 B1
6374289 Delaney et al. Apr 2002 B2
6378129 Zetts Apr 2002 B1
6388992 Aubert May 2002 B2
6388999 Gorsuch May 2002 B1
6389467 Eyal May 2002 B1
6389473 Carmel et al. May 2002 B1
6393060 Jeong May 2002 B1
6401085 Gershman Jun 2002 B1
6405371 Oosterhout Jun 2002 B1
6407680 Lai Jun 2002 B1
6408005 Fan Jun 2002 B1
6412092 Raghunath Jun 2002 B1
6414725 Clarin Jul 2002 B1
6415326 Gupta Jul 2002 B1
6421706 McNeill Jul 2002 B1
6421733 Tso Jul 2002 B1
6424624 Galand Jul 2002 B1
6430354 Watanabe Aug 2002 B1
6434195 Luthra Aug 2002 B1
6434197 Wang Aug 2002 B1
6441754 Wang Aug 2002 B1
6449608 Morita Sep 2002 B1
6449719 Baker Sep 2002 B1
6463508 Wolf Oct 2002 B1
6470378 Tracton Oct 2002 B1
6473778 Gibbon Oct 2002 B1
6473902 Noritomi Oct 2002 B1
6473903 Balakrishnan Oct 2002 B2
6483851 Neogi Nov 2002 B1
6484199 Eyal Nov 2002 B2
6484212 Markowitz Nov 2002 B1
6486803 Luby et al. Nov 2002 B1
6490250 Hinchley Dec 2002 B1
6490320 Vetro Dec 2002 B1
6490627 Kalra Dec 2002 B1
6493386 Vetro Dec 2002 B1
6493748 Nakayama Dec 2002 B1
6496980 Tillman Dec 2002 B1
6498897 Nelson et al. Dec 2002 B1
6502135 Munger Dec 2002 B1
6502139 Birk Dec 2002 B1
6505169 Bhagavath Jan 2003 B1
6509908 Croy Jan 2003 B1
6510553 Hazra Jan 2003 B1
6516361 Lym Feb 2003 B2
6526022 Chiu Feb 2003 B1
6529475 Wan Mar 2003 B1
6535556 Kato Mar 2003 B1
6535639 Uchihachi Mar 2003 B1
6542546 Vetro Apr 2003 B1
6552227 Mendelovici Apr 2003 B2
6553376 Lewis Apr 2003 B1
6567980 Jain May 2003 B1
6570922 Wang May 2003 B1
6574279 Vetro Jun 2003 B1
6574591 Kleiman et al. Jun 2003 B1
6580437 Liou Jun 2003 B1
6588018 James Jul 2003 B1
6593860 Lai Jul 2003 B2
6594751 Leivent Jul 2003 B1
6601103 Goldschmidt Iki Jul 2003 B1
6604118 Klleiman et al. Aug 2003 B2
6609253 Swix Aug 2003 B1
6611530 Apostolopoulos Aug 2003 B1
6611868 Arutyunov Aug 2003 B1
6611898 Slattery Aug 2003 B1
6614763 Kikuchi Sep 2003 B1
6615252 Oka Sep 2003 B1
6618752 Moore et al. Sep 2003 B1
6622171 Gupta Sep 2003 B2
6625643 Colby et al. Sep 2003 B1
6625656 Goldhor Sep 2003 B2
6629153 Gupta Sep 2003 B1
6631523 Matthews Oct 2003 B1
6637031 Chou Oct 2003 B1
6643259 Borella Nov 2003 B1
6643821 Karim Nov 2003 B2
6650705 Vetro Nov 2003 B1
6651103 Markowitz Nov 2003 B1
6654790 Ogle Nov 2003 B2
6665726 Leighton et al. Dec 2003 B1
6665755 Modelski Dec 2003 B2
6668377 Dunn Dec 2003 B1
6671724 Pandya Dec 2003 B1
6675199 Mohammed Jan 2004 B1
6690646 Fichou Feb 2004 B1
6691312 Sen Feb 2004 B1
6697072 Russell Feb 2004 B2
6697819 Boudreau Feb 2004 B2
6701528 Arsenault Mar 2004 B1
6708213 Bommaiah et al. Mar 2004 B1
6710822 Walker Mar 2004 B1
6711622 Fuller et al. Mar 2004 B1
6711741 Yeo Mar 2004 B2
6714976 Wilson Mar 2004 B1
6721723 Gibson et al. Apr 2004 B1
6721850 Hofmann Apr 2004 B2
6725333 Degenaro Apr 2004 B1
6731600 Patel et al. May 2004 B1
6732183 Graham May 2004 B1
6732329 Bace May 2004 B2
6735634 Geagan May 2004 B1
6741552 McCrosky May 2004 B1
6742082 Lango May 2004 B1
6744763 Jones Jun 2004 B1
6745391 Macrae Jun 2004 B1
6747991 Hemy Jun 2004 B1
6748481 Parry Jun 2004 B1
6757255 Aoki Jun 2004 B1
6757796 Hofmann Jun 2004 B1
6757907 Schumacher Jun 2004 B1
6760749 Dunlap Jul 2004 B1
6760765 Asai Jul 2004 B1
6760772 Zou et al. Jul 2004 B2
6760916 Holtz Jul 2004 B2
6765878 Carlson Jul 2004 B1
6766407 Lisitsa et al. Jul 2004 B1
6769127 Bonomi Jul 2004 B1
6771652 Aydemir Aug 2004 B1
6771703 Oguz Aug 2004 B1
6772375 Banga Aug 2004 B1
6785288 Enns Aug 2004 B1
6788882 Geer Sep 2004 B1
6789106 Eyer Sep 2004 B2
6792449 Colville Sep 2004 B2
6795863 Doty, Jr. Sep 2004 B1
6801947 Li Oct 2004 B1
6813690 Lango Nov 2004 B1
6820233 Johansson Nov 2004 B2
6822940 Zavalkovsky Nov 2004 B1
6829781 Bhagavath Dec 2004 B1
6831949 Brightwell Dec 2004 B1
6839865 Gould Jan 2005 B2
6845107 Kitazawa et al. Jan 2005 B1
6848004 Chang et al. Jan 2005 B1
6850965 Allen Feb 2005 B2
6859839 Zahorjan et al. Feb 2005 B1
6870573 Yeo Mar 2005 B2
6874015 Kaminsky et al. Mar 2005 B2
6877010 Smith-Semedo Apr 2005 B2
6877134 Fuller Apr 2005 B1
6879634 Oz Apr 2005 B1
6880017 Marce Apr 2005 B1
6880018 Kajiki Apr 2005 B1
6880171 Ahmad Apr 2005 B1
6882793 Fu Apr 2005 B1
6885471 Minowa Apr 2005 B1
6891694 Hetzler May 2005 B2
6910079 Zimmermann Jun 2005 B2
6918132 Gargi Jul 2005 B2
6938208 Reichardt Aug 2005 B2
6940904 Chen Sep 2005 B2
6956573 Bergen Oct 2005 B1
6956869 Kato Oct 2005 B1
6961954 Maybury Nov 2005 B1
6963972 Chang Nov 2005 B1
6965724 Boccon-Gibod Nov 2005 B1
6968387 Lanphear Nov 2005 B2
6976090 Ben-Shaul et al. Dec 2005 B2
6985932 Glaser Jan 2006 B1
6986018 O+3 Rourke Jan 2006 B2
6988235 Brown Jan 2006 B2
6990512 Major Jan 2006 B1
6992981 Morikawa Jan 2006 B2
7003794 Arye Feb 2006 B2
7020087 Steinberg Mar 2006 B2
7024480 Weik Apr 2006 B2
7031700 Weaver Apr 2006 B1
7042898 Blightman May 2006 B2
7043560 Coulombe May 2006 B2
7046805 Fitzhardinge May 2006 B2
7046910 Chen May 2006 B2
7047307 Li May 2006 B2
7051110 Hagai May 2006 B2
7054365 Kim et al. May 2006 B2
7054774 Batterberry et al. May 2006 B2
7054911 Lango et al. May 2006 B1
7054949 Jennings May 2006 B2
7065250 Lennon Jun 2006 B1
7073028 Lango Jul 2006 B2
7073127 Zhao Jul 2006 B2
7075986 Girod et al. Jul 2006 B2
7076560 Lango Jul 2006 B1
7093001 Yang et al. Aug 2006 B2
7096271 Omoigui et al. Aug 2006 B1
7099954 Li et al. Aug 2006 B2
7107532 Billmaier Sep 2006 B1
7111044 Lee Sep 2006 B2
7116894 Chatterton Oct 2006 B1
7124164 Chemtob Oct 2006 B1
7133451 Kim Nov 2006 B2
7133881 Sirivara Nov 2006 B2
7155531 Lango Dec 2006 B1
7174385 Li Feb 2007 B2
7174512 Martin Feb 2007 B2
7176957 Ivashin Feb 2007 B2
7177642 Sanchez Herrero Feb 2007 B2
7178107 Sezan Feb 2007 B2
7185082 Val Feb 2007 B1
7190670 Varsa Mar 2007 B2
7194549 Lee et al. Mar 2007 B1
7200857 Rodriguez Apr 2007 B1
7237254 Omoigui Jun 2007 B1
7240100 Wein et al. Jul 2007 B1
7257407 Dacosta Aug 2007 B2
7260640 Kramer et al. Aug 2007 B1
7274740 van Beek et al. Sep 2007 B2
7293280 Gupta Nov 2007 B1
7295520 Lee et al. Nov 2007 B2
7301944 Redmond Nov 2007 B1
7308487 Dansie et al. Dec 2007 B1
7310678 Gunaseelan Dec 2007 B2
7313236 Amini Dec 2007 B2
7313808 Gupta Dec 2007 B1
7324523 Dacosta Jan 2008 B2
7325073 Shao et al. Jan 2008 B2
7325199 Reid Jan 2008 B1
7328243 Yaeger et al. Feb 2008 B2
7330908 Jungek Feb 2008 B2
7334044 Allen Feb 2008 B1
7349358 Hennessey et al. Mar 2008 B2
7349976 Glaser et al. Mar 2008 B1
7363228 Wyss Apr 2008 B2
7369610 Xu et al. May 2008 B2
7376747 Hartop May 2008 B2
7386627 Lango et al. Jun 2008 B1
7391717 Kiemets et al. Jun 2008 B2
7401351 Boreczky Jul 2008 B2
7408984 Lu et al. Aug 2008 B2
7412531 Lango et al. Aug 2008 B1
7463736 Tagashira Dec 2008 B2
7477688 Zhang et al. Jan 2009 B1
7523181 Swildens et al. Apr 2009 B2
7526565 Amini Apr 2009 B2
7529541 Cho May 2009 B2
7529806 Shteyn May 2009 B1
7536469 Chou May 2009 B2
7546355 Kalnitsky Jun 2009 B2
7555464 Candelore Jun 2009 B2
7558472 Locket Jul 2009 B2
7558869 Leon et al. Jul 2009 B2
7567746 Saeki Jul 2009 B2
7577750 Shen et al. Aug 2009 B2
7593333 Li et al. Sep 2009 B2
7599307 Seckni et al. Oct 2009 B2
7609652 Kellerer et al. Oct 2009 B2
7631039 Eisenberg Dec 2009 B2
7653735 Mandato et al. Jan 2010 B2
7657644 Zheng Feb 2010 B1
7660906 Armour Feb 2010 B1
7707303 Albers et al. Apr 2010 B2
7719985 Lee et al. May 2010 B2
7733830 Curcio Jun 2010 B2
7760801 Ghanbari et al. Jul 2010 B2
7761609 Srinivasan Jul 2010 B1
7779135 Hudson Aug 2010 B2
7788395 Bowra Aug 2010 B2
7797439 Cherkasova et al. Sep 2010 B2
7817985 Moon Oct 2010 B2
7818444 Brueck et al. Oct 2010 B2
7873040 Karlsgodt Jan 2011 B2
7925781 Chan et al. Apr 2011 B1
7934159 Rahman Apr 2011 B1
7974200 Walker et al. Jul 2011 B2
7996450 Lee Aug 2011 B1
8036265 Reynolds et al. Oct 2011 B1
8091112 Elliott Jan 2012 B1
8135852 Nilsson Mar 2012 B2
8209429 Jacobs Jun 2012 B2
8321584 Dobbins Nov 2012 B2
8370514 Hurst Feb 2013 B2
8402156 Brueck Mar 2013 B2
8521836 Kewalramani et al. Aug 2013 B2
8612624 Frueck Dec 2013 B2
8667158 Jin Mar 2014 B2
8683066 Hurst Mar 2014 B2
8686066 Kwampian et al. Apr 2014 B2
8711701 Ju Apr 2014 B2
8818127 Hayata et al. Aug 2014 B2
8868772 Major Oct 2014 B2
8880721 Hurst Nov 2014 B2
9344496 Hurst et al. May 2016 B2
9407564 Major et al. Aug 2016 B2
9462074 Guo et al. Oct 2016 B2
10469554 Brueck et al. Nov 2019 B2
10469555 Brueck et al. Nov 2019 B2
10757156 Major et al. Aug 2020 B2
10951680 Brueck et al. Mar 2021 B2
11470138 Brueck et al. Oct 2022 B2
20010003193 Woodring Jun 2001 A1
20010013128 Hagai et al. Aug 2001 A1
20010017849 Campanella Aug 2001 A1
20010018673 Goldband Aug 2001 A1
20010025315 Jolitz Sep 2001 A1
20010029548 Srikantan Oct 2001 A1
20010034786 Baumeister Oct 2001 A1
20010038649 Hagai Nov 2001 A1
20010040871 Abrahamsson Nov 2001 A1
20010047423 Shao et al. Nov 2001 A1
20010049826 Wilf Dec 2001 A1
20020002708 Arye Jan 2002 A1
20020007417 Taylor Jan 2002 A1
20020007494 Hodge Jan 2002 A1
20020016969 Kimble Feb 2002 A1
20020023267 Hoang Feb 2002 A1
20020029274 Allen Mar 2002 A1
20020029282 Buddhikot Mar 2002 A1
20020040479 Ehrman Apr 2002 A1
20020044528 Pogrebinsky et al. Apr 2002 A1
20020048448 Daniels Apr 2002 A1
20020052968 Bonefas May 2002 A1
20020056098 White May 2002 A1
20020056126 Srikantan May 2002 A1
20020073167 Powell et al. Jun 2002 A1
20020077900 Thompson Jun 2002 A1
20020078176 Nomura Jun 2002 A1
20020080286 Dagtas Jun 2002 A1
20020080877 Lu Jun 2002 A1
20020087634 Ogle Jul 2002 A1
20020091840 Pulier et al. Jul 2002 A1
20020097750 Gunaseelan et al. Jul 2002 A1
20020100052 Daniels Jul 2002 A1
20020103938 Brooks Aug 2002 A1
20020116473 Gemmell Aug 2002 A1
20020116585 Scherr Aug 2002 A1
20020118809 Eisenberg Aug 2002 A1
20020122491 Karczewicz Sep 2002 A1
20020129159 Luby Sep 2002 A1
20020131496 Vasudevan et al. Sep 2002 A1
20020133547 Lin Sep 2002 A1
20020136164 Fukuda Sep 2002 A1
20020136298 Anantharamu Sep 2002 A1
20020136406 Fitzhardinge Sep 2002 A1
20020138619 Ramaley Sep 2002 A1
20020138641 Taylor Sep 2002 A1
20020144276 Radford et al. Oct 2002 A1
20020146102 Lang Oct 2002 A1
20020147980 Satoda Oct 2002 A1
20020152317 Wang et al. Oct 2002 A1
20020152318 Menon et al. Oct 2002 A1
20020154694 Birch Oct 2002 A1
20020154703 Kubota Oct 2002 A1
20020156912 Hurst et al. Oct 2002 A1
20020159457 Zhang Oct 2002 A1
20020161847 Weigand Oct 2002 A1
20020161898 Hartop et al. Oct 2002 A1
20020161908 Benitez et al. Oct 2002 A1
20020161911 Pinckney, III et al. Oct 2002 A1
20020162047 Peters Oct 2002 A1
20020164024 Arakawa Nov 2002 A1
20020169926 Pinckney, III et al. Nov 2002 A1
20020170062 Chen et al. Nov 2002 A1
20020170067 Norstrom Nov 2002 A1
20020170068 Rafey Nov 2002 A1
20020172368 Peterka Nov 2002 A1
20020174434 Lee et al. Nov 2002 A1
20020176418 Hunt Nov 2002 A1
20020178138 Ender Nov 2002 A1
20020178330 Schlowsky-Fischer et al. Nov 2002 A1
20020181506 Loguinov Dec 2002 A1
20020184391 Phillips Dec 2002 A1
20020188745 Hughes et al. Dec 2002 A1
20020194151 Fenton Dec 2002 A1
20020194608 Goldhor Dec 2002 A1
20020196760 Malomsoky et al. Dec 2002 A1
20030005455 Bowers Jan 2003 A1
20030007464 Balani Jan 2003 A1
20030009578 Apostolopoulos et al. Jan 2003 A1
20030014684 Kashyap Jan 2003 A1
20030018966 Cook et al. Jan 2003 A1
20030021166 Soloff Jan 2003 A1
20030021282 Hospodor Jan 2003 A1
20030037103 Salmi Feb 2003 A1
20030037158 Yano Feb 2003 A1
20030051159 Mccown Mar 2003 A1
20030055995 Ala-Honkola Mar 2003 A1
20030061305 Copley et al. Mar 2003 A1
20030061369 Aksu Mar 2003 A1
20030065803 Heuvelman Apr 2003 A1
20030066085 Boyer Apr 2003 A1
20030067872 Harrell et al. Apr 2003 A1
20030067875 Yoshida et al. Apr 2003 A1
20030072376 Krishnamachari et al. Apr 2003 A1
20030078972 Tapissier Apr 2003 A1
20030081582 Jain et al. May 2003 A1
20030093790 Logan et al. May 2003 A1
20030093802 Cho May 2003 A1
20030099364 Thompson May 2003 A1
20030103524 Hasegawa Jun 2003 A1
20030103571 Meehan Jun 2003 A1
20030107994 Jacobs et al. Jun 2003 A1
20030110505 De Vos Jun 2003 A1
20030115219 Chadwick Jun 2003 A1
20030120793 Marjola Jun 2003 A1
20030135631 Li et al. Jul 2003 A1
20030135863 Schaar Jul 2003 A1
20030140159 Campbell et al. Jul 2003 A1
20030145101 Mitchell Jul 2003 A1
20030151753 Li et al. Aug 2003 A1
20030152036 Quigg Brown et al. Aug 2003 A1
20030154239 Davis et al. Aug 2003 A1
20030195977 Liu et al. Oct 2003 A1
20030198184 Huang Oct 2003 A1
20030204519 Sirivara et al. Oct 2003 A1
20030204602 Hudson et al. Oct 2003 A1
20030217113 Katz Nov 2003 A1
20030217362 Summers Nov 2003 A1
20030220972 Montet Nov 2003 A1
20030233464 Walpole et al. Dec 2003 A1
20030236902 Weiss Dec 2003 A1
20030236904 Walpole et al. Dec 2003 A1
20030236906 Klemets et al. Dec 2003 A1
20030236912 Klemets Dec 2003 A1
20040003101 Roth et al. Jan 2004 A1
20040010613 Apostolopoulos et al. Jan 2004 A1
20040015995 Shao Jan 2004 A1
20040028227 Yu Feb 2004 A1
20040030547 Leaning et al. Feb 2004 A1
20040030599 Sie et al. Feb 2004 A1
20040030797 Akinlar et al. Feb 2004 A1
20040031054 Dankworth et al. Feb 2004 A1
20040039837 Gupta Feb 2004 A1
20040049780 Gee Mar 2004 A1
20040054551 Ausubel et al. Mar 2004 A1
20040064207 Zacks Apr 2004 A1
20040071209 Burg et al. Apr 2004 A1
20040073693 Slater Apr 2004 A1
20040073934 Deshpande Apr 2004 A1
20040083283 Sundaram et al. Apr 2004 A1
20040093420 Gamble May 2004 A1
20040098748 Bo May 2004 A1
20040103444 Weinberg et al. May 2004 A1
20040117427 Allen et al. Jun 2004 A1
20040117831 Ellis Jun 2004 A1
20040133639 Shuang Jul 2004 A1
20040136327 Sitaraman et al. Jul 2004 A1
20040143672 Padmanabham et al. Jul 2004 A1
20040153458 Noble Aug 2004 A1
20040168052 Clisham et al. Aug 2004 A1
20040170392 Lu et al. Sep 2004 A1
20040172478 Jacobs Sep 2004 A1
20040177063 Weber Sep 2004 A1
20040179032 Huang Sep 2004 A1
20040190528 Dacosta Sep 2004 A1
20040192322 Dacosta Sep 2004 A1
20040196842 Dobbins Oct 2004 A1
20040199472 Dobbins Oct 2004 A1
20040199604 Dobbins Oct 2004 A1
20040199655 Davies et al. Oct 2004 A1
20040199667 Dobbins Oct 2004 A1
20040202109 Akiyama et al. Oct 2004 A1
20040210948 Jin Oct 2004 A1
20040220926 Lamkin et al. Nov 2004 A1
20040221088 Lisitsa Nov 2004 A1
20040249965 Huggins Dec 2004 A1
20040260701 Lehikoinen et al. Dec 2004 A1
20040260827 Wang Dec 2004 A1
20040267954 Shen Dec 2004 A1
20040267956 Leon et al. Dec 2004 A1
20050009520 Herrero Jan 2005 A1
20050015509 Sitaraman Jan 2005 A1
20050021814 Wang Jan 2005 A1
20050024487 Chen Feb 2005 A1
20050028194 Elenbaas Feb 2005 A1
20050028208 Ellis Feb 2005 A1
20050033855 Moradi et al. Feb 2005 A1
20050033856 Li Feb 2005 A1
20050050152 Penner Mar 2005 A1
20050055425 Lango et al. Mar 2005 A1
20050066063 Grigorovitch et al. Mar 2005 A1
20050071496 Singal Mar 2005 A1
20050076136 Cho et al. Apr 2005 A1
20050084166 Bonch et al. Apr 2005 A1
20050097217 Val May 2005 A1
20050108414 Taylor et al. May 2005 A1
20050120107 Kagan et al. Jun 2005 A1
20050123058 Greenbaum et al. Jun 2005 A1
20050138655 Zimler Jun 2005 A1
20050165828 Lango Jul 2005 A1
20050177618 Zimler et al. Aug 2005 A1
20050185578 Padmanabham et al. Aug 2005 A1
20050188051 Sneh Aug 2005 A1
20050204046 Watanabe Sep 2005 A1
20050204385 Sull Sep 2005 A1
20050207569 Zhang et al. Sep 2005 A1
20050223087 Van Der Stok Oct 2005 A1
20050229213 Ellis Oct 2005 A1
20050232180 Toporek Oct 2005 A1
20050240961 Jerding Oct 2005 A1
20050251832 Chiueh Nov 2005 A1
20050254508 Aksu Nov 2005 A1
20050256941 Armstrong Nov 2005 A1
20050262257 Major et al. Nov 2005 A1
20050262261 Deshpande Nov 2005 A1
20060010003 Kruse Jan 2006 A1
20060047779 Deshpande Mar 2006 A1
20060053253 Rot Mar 2006 A1
20060059223 Klemets Mar 2006 A1
20060064500 Roth Mar 2006 A1
20060075446 Klemets et al. Apr 2006 A1
20060080718 Gray et al. Apr 2006 A1
20060130118 Damm Jun 2006 A1
20060133809 Chow et al. Jun 2006 A1
20060165166 Chou et al. Jul 2006 A1
20060168290 Doron Jul 2006 A1
20060168295 Batterberry et al. Jul 2006 A1
20060168524 Saeki Jul 2006 A1
20060184688 Ganguly Aug 2006 A1
20060206246 Walker Sep 2006 A1
20060218264 Ogawa Sep 2006 A1
20060236219 Grigorovitch et al. Oct 2006 A1
20060242315 Nichols Oct 2006 A1
20060270404 Tuohino Nov 2006 A1
20060277564 Jarman Dec 2006 A1
20060282540 Tanimoto Dec 2006 A1
20060288099 Jefferson Dec 2006 A1
20070008884 Tang Jan 2007 A1
20070024705 Richter et al. Feb 2007 A1
20070030833 Pirzada et al. Feb 2007 A1
20070037599 Tillet Feb 2007 A1
20070067480 Beek et al. Mar 2007 A1
20070078768 Dawson Apr 2007 A1
20070079325 de Heer Apr 2007 A1
20070094405 Zhang Apr 2007 A1
20070174471 Van Rossum Jul 2007 A1
20070204310 Hua et al. Aug 2007 A1
20070280255 Tsang et al. Dec 2007 A1
20080022343 Hodzic et al. Jan 2008 A1
20080028428 Jeong et al. Jan 2008 A1
20080037527 Chan et al. Feb 2008 A1
20080046939 Lu et al. Feb 2008 A1
20080056373 Newlin et al. Mar 2008 A1
20080060029 Park Mar 2008 A1
20080086570 Dey et al. Apr 2008 A1
20080091838 Miceli Apr 2008 A1
20080104647 Hannuksela May 2008 A1
20080120330 Reed et al. May 2008 A1
20080120342 Reed et al. May 2008 A1
20080133766 Luo Jun 2008 A1
20080162713 Bowra et al. Jul 2008 A1
20080184688 Daly et al. Aug 2008 A1
20080195744 Bowra et al. Aug 2008 A1
20080195745 Bowra Aug 2008 A1
20080205291 Li et al. Aug 2008 A1
20080219151 Ma et al. Sep 2008 A1
20080222235 Hurst et al. Sep 2008 A1
20080225959 Lu Sep 2008 A1
20080263180 Hurst et al. Oct 2008 A1
20080281803 Gentric Nov 2008 A1
20090006538 Risney, Jr. Jan 2009 A1
20090043906 Hurst et al. Feb 2009 A1
20090049186 Agnihotri Feb 2009 A1
20090055417 Hannuksela Feb 2009 A1
20090055471 Kozat et al. Feb 2009 A1
20090055547 Hudson Feb 2009 A1
20090132599 Soroushian May 2009 A1
20090132721 Soroushian May 2009 A1
20090210549 Hudson Aug 2009 A1
20100098103 Xiong et al. Apr 2010 A1
20100158101 Wu Jun 2010 A1
20100262711 Bouazizi Oct 2010 A1
20110307545 Bouazizi Dec 2011 A1
20140207966 Hurst Jul 2014 A1
20150058496 Hurst Feb 2015 A1
Foreign Referenced Citations (41)
Number Date Country
2466482 May 2003 CA
10101075.3 Jan 2001 DE
0365683 May 1990 EP
0695094 Jan 1996 EP
0711077 Aug 1996 EP
0919952 Jun 1999 EP
1202487 May 2002 EP
1298931 Apr 2003 EP
139497 Mar 2004 EP
1395014 Mar 2004 EP
1641271 Mar 2006 EP
1202487 May 2006 EP
1670256 Jun 2006 EP
1777969 Apr 2007 EP
1394973 May 2010 EP
2367219 Mar 2002 GB
2000-201343 Jul 2000 JP
200192752 Apr 2001 JP
2004295569 Oct 2004 JP
2011004225 Jan 2011 JP
2005000116 Jan 2005 KR
1997044942 Nov 1997 WO
1997004942 Nov 1997 WO
2000067469 Nov 2000 WO
2001067264 Sep 2001 WO
2002045372 Jun 2002 WO
20020049343 Jun 2002 WO
0245372 Sep 2002 WO
20020075482 Sep 2002 WO
2003009581 Jan 2003 WO
WO-03003760 Jan 2003 WO
WO-03027876 Apr 2003 WO
03041413 May 2003 WO
2003041413 May 2003 WO
2003042856 May 2003 WO
2004021668 Mar 2004 WO
2004025405 Mar 2004 WO
WO-2004036824 Apr 2004 WO
2004057832 Jul 2004 WO
2006010113 Jan 2006 WO
2006086717 Aug 2006 WO
Non-Patent Literature Citations (251)
Entry
Muntean, G-M., “A New Adaptive Multimedia Streaming System for All-iP Multi-Service Networks”, IEEE Trans. on Broadcasting, Mar. 2004, pp. 1-10, vol. 50, No. 1.
Akamai buys InterVu, Feb. 7, 2000.
Akamai, Akamai Completes Acquisition of Speedera Networks.
Bill Gates Unveils the Next Wave of Digital Media with Windows Media 9 Series, Sep. 3, 2002.
Darwin Steaming Server Source Code Developer Notes, Jun. 15, 2021, Darwin Steaming Server 2.
IBM Goes Straight to Video—CNET, Jun. 15, 2021.
News in Brief: IBM VideoCharger, Dec. 18, 1996.
Birney, “Intelligent Streaming”, May 21, 2021.
InterVu & Excalibur Partner to Deliver Live Internet Newscasts—Bloomberg, Dec. 9, 1999.
Introduction to Streaming Media with RealOne Player, Oct. 1, 2002.
Macromedia Delivers Macromedia Flash Communication Server MX Breakthrough server unifies communications and applications to deliver live, human interactions on the Internet, Jul. 9, 2002.
Press Releases: Macromedia Flash Media Server 2 Now Available. Flash Media Server 2 Brings the Power of the Flash Platform to Web Video.
Move Networks: The Story of a Failure—GigaOm.
QuickTime 6: Summary of Changes and Enhancements.
Chou, et al., “Rate-Distortion Optimized Receiver-Driven Streaming over Best-Effort Networks”, IEEE Fourth Workshop on Multimedia Signal Processing, Oct. 3, 2001, pp. 1-10.
Festa P., RealNetworks tests G2, Jul. 13, 1998.
RealNetworks Production Guide, with RealOne Player, Oct. 1, 2002.
RealSystem G2 Production Guide BETA 1 Release.
Sandpiper Networks Signs Partner Deals—InternetNews, Oct. 7, 1999.
Topic, M. “Streaming Media Demystified”, McGraw-Hill TELECOM, 2002.
Gallagher, B., “Streaming Video From End to End”, ITProToday, Compute Engines, Feb. 28, 1999.
Move Networks: The Fall of Move Networks, Jan. 26, 2010.
Conklin, G.J., et al. “Video Coding for Streaming Media Delivery on the Internet”, IEEE Trans. on Circuits and Systems for Video Technology, Mar. 3, 2001, pp. 281, vol. 11. No 3.
Claim Chart Against U.S. Pat. No. 9,407,564 (“'564 patent”) Akiyama et al.
Claim Chart Against U.S. Pat. No. 9,407,564 (“'564 patent”) Arye et al.
Claim Chart Against U.S. Pat. No. 9,407,564 (“'564 patent”) Carmel et al.
Claim Chart Against U.S. Pat. No. 9,407,564 (“'564 patent”) Chou et al.
Claim Chart Against U.S. Pat. No. 9,407,564 (“'564 patent”) Durrant et al.
Claim Chart Against U.S. Pat. No. 9,407,564 (“'564 patent”) Gentric.
Claim Chart Against U.S. Pat. No. 9,407,564 (“'564 patent”) Kitamura.
Claim Chart Against U.S. Pat. No. 9,407,564 (“'564 patent”) Klemets et al.
Claim Chart Against U.S. Pat. No. 9,407,564 (“'564 patent”) Oplayo et al.
Claim Chart Against U.S. Pat. No. 9,407,564 (“'564 patent”) QOAS.
Claim Chart Against U.S. Pat. No. 9,407,564 (“'564 patent”) QuickTime Changes.
Claim Chart Against U.S. Pat. No. 9,407,564 (“'564 patent”) QuickTime.
Claim Chart Against U.S. Pat. No. 9,407,564 (“'564 patent”) Ravi.
Claim Chart Against U.S. Pat. No. 9,407,564 (“'564 patent”) RealOne Player.
Claim Chart Against U.S. Pat. No. 9,407,564 (“'564 patent”) Walker.
Claim Chart Against U.S. Pat. No. 9,407,564 (“'564 patent”) Wang.
Claim Chart Against U.S. Pat. No. 9,407,564 (“'564 patent”) Wu.
Claim Chart Against U.S. Pat. No. 9,407,564 (“'564 patent”) RealSystem G2.
Claim Chart Against U.S. Pat. No. 10,469,554 (“'554 patent”) Akiyama et al.
Claim Chart Against U.S. Pat. No. 10,469,554 (“'554 patent”) Ayre.
Claim Chart Against U.S. Pat. No. 10,469,554 (“'554 patent”) Carmel et al.
Claim Chart Against U.S. Pat. No. 10,469,554 (“554 patent”) Chou et al.
Claim Chart Against U.S. Pat. No. 10,469,554 (“'554 patent”) Durrant et al.
Claim Chart Against U.S. Pat. No. 10,469,554 (“'554 patent”) Gentric.
Claim Chart Against U.S. Pat. No. 10,469,554 (“554 patent”) Kitamura.
Claim Chart Against U.S. Pat. No. 10,469,554 (“554 patent”) Klemets.
Claim Chart Against U.S. Pat. No. 10,469,554 (“'554 patent”) Oplayo.
Claim Chart Against U.S. Pat. No. 10,469,554 (“'554 patent”) QOAS.
Claim Chart Against U.S. Pat. No. 10,469,554 (“'554 patent”) QuickTime Changes.
Claim Chart Against U.S. Pat. No. 10,469,554 (“'554 patent”) QuickTime.
Claim Chart Against U.S. Pat. No. 10,469,554 (“554 patent”) Ravi.
Claim Chart Against U.S. Pat. No. 10,469,554 (“'554 patent”) RealOne Player.
Claim Chart Against U.S. Pat. No. 10,469,554 (“'554 patent”) Walker.
Claim Chart Against U.S. Pat. No. 10,469,554 (“554 patent”) Wang.
Claim Chart Against U.S. Pat. No. 10,469,554 (“554 patent”) Wu.
Claim Chart Against U.S. Pat. No. 10,469,554 (“'554 patent”) Dey.
Claim Chart Against U.S. Pat. No. 10,469,554 (“554 patent”) Microsoft.
Dish—Respondent's Joint Disclosure of Supplemental Invalidity Contentions in Response to Individual Interrogatories.
Mirror—Respondents Lululemon Athletica Inc. and Curiouser Products Inc. d/b/a Mirror First Amended Response To Complaint Under Section 337 of the Tariff Act of 1930, as Amended, Statement of Public Interest and Notice of Institution of Investigation.
Peloton—Respondent Peloton Interactive, Inc.'s First Amended Response to Complaint and to Notice of Investigation.
Icon—Respondents' Joint Disclosure of Initial Invalidity Contentions in Response to Individual Interrogatories.
Respondents' Notice of Prior Art.
Icon and Free Motion Fitness, Inc. Verified Response of Icon Health & Fitness, Inc., Free Motion Fitness, Inc., and Nordictrack, Inc. to Complaint of Dish DBS Corporation, Dish Technologies L.L.C., and Sling TV L.L.C. and to Notice of Investigation.
Appendix H, Appendix H to Expert Report of Dr. Iain Richardson on Invalidity: Public Use (40 pages).
The Wayback Machine, dated Nov. 8, 2021 (1 page).
In the Matter of: Certain Fitness Devices, Videotaped Deposition of BYU Broadcasting, Mark Mitchell, dated Dec. 2, 2021 (123 pages).
The Wayback Machine, bates labeled RESP-PA06323, dated Dec. 7, 2021 (1 page).
The Wayback Machine, bates labeled RESP-PA06257, dated Nov. 8, 2021 (1 page).
The Wayback Machine, bates labeled RESP-PA06256, dated Nov. 8, 2021 (1 page).
Move Media, bates labeled RESP-PA06253, dated Nov. 8, 2021 (1 page).
The Wayback Machine, bates labeled RESP-PA06252, dated Nov. 8, 2021 (1 page).
BYU Television, bates labeled RESP-PA06247 to RESP-PA06248, dated Nov. 8, 2021 (2 pages).
Mitchell Exhibit 13, BYU-TV Live, FAQ, bates labeled RESP-PA06275to RESP-PA06276, dated Dec. 2, 2021 (2 pages).
Mitchell Exhibit 12, BYU Television, The Wayback Machine, bates labeled RESP-PA06268- to RESP-PA06269, dated Dec. 2, 2021 (2 pages).
Mitchell Exhibit 11, BYU Television, The Wayback Machine, bates labeled RESP-PA06272 to RESP-PA06274, dated Dec. 2, 2021 (3 pages).
Mitchell Exhibit 10, BYU Television, The Wayback Machine, bates labeled RESP-PA06266 to RESP-PA06267, dated Dec. 2, 2021 (2 pages).
Mitchell Exhibit 7, BYU Television, The Wayback Machine, bates labeled RESP-PA06270 to RESP-PA06271, dated Dec. 2, 2021 (2 pages).
Mitchell Exhibit 6, bates labeled BYU000012-BYU000013, dated Dec. 2, 2021 (2 pages).
Mitchell Exhibit 5, BYU Television, The Wayback Machine, bates labeled RESP-PA06263 to RESP-PA06264, dated Dec. 2, 2021 (2 pages).
Mitchell Exhibit 4, BYU Television, The Wayback Machine, bates labeled RESP-PA06261 to RESP-PA06262, dated Dec. 2, 2021 (2 pages).
Mitchell Exhibit 3, BYU Television, The Wayback Machine, bates labeled BYU000001, dated Dec. 2, 2021 (1 page).
Mitchell Exhibit 2, Conference Summary for the 175th Semiannual General Conference, dated Dec. 2, 2021 (3 pages).
Major Exhibit 62, Official Report of the One Hundred Seventy-fifth Semiannual General Conference of the Church of Jesus Christ of Latter-day Saints, dated Nov. 5, 2021 (128 pages).
In the Matter of: In Re Certain Fitness Devices, Videotaped Deposition of Peloton Interactive, Inc., Drew Major, dated Dec. 17, 2021 (72 pages).
In the Matter of: In Re Certain Fitness Devices and Systems Containing Same, Videotaped Deposition of John Edwards, dated Nov. 12, 2021 (191 pages).
In the Matter of: In Re Certain Fitness Devices and Systems Containing Same, Videotaped Deposition of Robert Drew Major, dated Nov. 5, 2021 (268 pages).
Uncertified Rough Draft Transcript, Deposition of Mark Hurst, vol. 2, dated Dec. 3, 2021 (51 pages).
Hurst Exhibit 68, Move Media, dated Nov. 19, 2021 (1 page).
Bates labeled RESP-PA06326 to RESP-PA06337, dated Dec. 7, 2021 (12 pages).
Bates labeled RESP-PA06255 (1 page).
Bates labeled RESP-PA06254 (1 page).
International Search Report for EP application 20216568.4 dated Apr. 19, 2021 (15 pages).
Response to International Search Report filed with EP application 20216568.4 on Nov. 19, 2021 (41 pages).
Respondents' Post-Hearing Brief (Redacted) dated Mar. 29, 2022 (321 pages).
Complainants' Post-Hearing Reply Brief (Redacted) dated Apr. 7, 2022 (105 pages).
Commission Investigative Staff's Post-Hearing Reply Brief (Redacted) dated Apr. 13, 2022 (42 pages).
Commission Investigative Staff's Post-Hearing Brief (Redacted) dated Apr. 1, 2022 (311 pages).
Respondents' Reply Post-Hearing Brief (Redacted) dated Apr. 7, 2022 (106 pages).
Complainants' Post-Hearing Brief (Redacted) dated Mar. 29, 2022 (326 pages).
Respondents' Reply to the Commission's Nov. 18, 2022 Request for Written Submissions on the Issues Under Review and on Remedy, the Public Interest, and Bonding (Redacted) dated Dec. 9, 2022 (52 pages).
[Public Version] Response of the Office of Unfair Import Investigations to the Commission's Request for Written Submissions on the Issues Under Review and on Remedy, Bonding, and the Public Interest (Redacted) dated Dec. 2, 2022 (65 pages).
Notice of Commission Determination to Review the Final Initial Determination in Part; Request for Written Submissions on the Issues Under Review and on Remedy, the Public Interest, and Bonding dated Nov. 18, 2022 (6 pages).
Complainants' Opening Submission on the Issues Under Review and on Remedy, the Public Interest, and Bonding (Redacted) dated Dec. 2, 2022 (59 pages).
Respondents' Response to the Commission's Nov. 18, 2022 Request for Written Submissions on the Issues Under Review and on Remedy, the Public Interest and Bonding (Redacted) dated Dec. 2, 2022 (63 pages).
Complainants' Reply Submission to the Commission's Questions on the Issues Under Review and on Remedy, the Public Interest, and Bonding (Redacted) dated Dec. 9, 2022 (31 pages).
Fujisawa, Hiroshi et al. “Implementaton of Efficient Access Mechanism for Multiple Mirror-Servers” IPSJ SIG Technical Report, vol. 2004, No. 9, Jan. 30, 2004, Information Processing Society of Japan, pp. 37-42.
Liu, Jiangchuan et al. “Adaptive Video Multicast Over the Internet” IEEE Computer Society, 2003.
“The meaning of performance factor—English-Japanese Weblio Dictionary”, [online], Feb. 24, 2012, [searched on Feb. 24, 2012], the Internet <URL:http://ejje.weblio.jp/content/performance+factor>.
Tsuru, et al. “Recent evolution of the Internet measurement and inference techniques”, IEICE Technical Report, vol. 103, No. 123, pp. 37-42, Jun. 12, 2003.
Rejaie, Reza et al. “Architectural Considerations for Playback of Quality Adaptive Video OVer the Internet” University of Southern California, Information Sciences Institute, 1998.
Roy, Sumit et al. “A System Architecture for Managing Mobile Streaming Media Services” Streaming Media Systems Group, Hewlett-Packard Laboratories, 2003.
Xu, Dongyan et al. “On Peer-to-Peer Media Streaming” Department of Computer Sciences, Purdue University, 2002.
Kozamerink, Franc “Media Streaming Over the Internet—An Over of Delivery Technologies” EBU Technical Review, Oct. 2002.
Lienhart, Rainer et al. “Challenges in Distributed Video Management and Delivery” Intel Corporation, EECS Dept., UC Berkeley, 2000-2002.
Zhang, Xinyan et al. “CoolStreaming/DONet: A Data-Driven Overlay Network for Peer-to-Peer Live Media Streaming” IEEE 2005.
Guo, Yang “DirectStream: A Directory-Based Peer-to-Peer Video Streaming Service” LexisNexis, Elsevier B.V. 2007.
Roy, S., et al., “Architecture of a Modular Streaming Media Server for Content Delivery Networks, ” 2002 IEEE. Published in the 2003 International Conference on Multimedia and Expo ICME 2003.
Bommaiah, E., et al., “Design and Implementation of a Caching System for Streaming Media over the Internet,” 2000 IEEE. Published in RTAS '00 Proceedings of the Sixth IEEE Real Time Technology and Applications Symposium (RTAS 2000), p. 111.
Defendant Jadoo TV, Inc.'S Disclosure of Invalidity Contentions, U.S. N. Dist. Ca. Case No. 5:18-cv-05214-EJD dated Sep. 22, 2020.
Defendant Jadoo TV, Inc.'s Disclosure of Invalidity Contentions Appendix A, U.S. N. Dist. Ca. Case No. 5:18-cv-05214-EJD dated Sep. 22, 2020.
Balk et al., Adaptive Video Streaming: Pre-Encoded MPEG-4 with Bandwidth Scaling, 44 Computer Networks 415 (Mar. 2004).
RealPlayer Plus™ G2 Manual, RealNetworks Inc., Seattle, WA (1998-1999), pp. 1-77.
Kontothanassis, L. et al., “A Transport Layer for Live Streaming in a Content Delivery Network,” Proceedings of the IEEE, 2004. pp. 1408-1419. (Retrieved Aug. 18, 2021 from https://www.akamai.com/it/it/multimedia/documents/technical-publication/a-transport-layer-forlive-streaming-in-a-content-delivery-network-technical-publication.pdf).
Dawson, F. “Improving Quality May Help to Boost Streaming Media,” Multichannel News, Dec. 19, 1999. pp. 1-17 (retrieved Aug. 18, 2021 from https://www.nexttv.com/news/improving-quality-may-help-boost-streaming- media-143325).
“InterVu Granted Key Internet Patent,” Bloomberg Business, Dec. 16, 1999 pp. 1-3 (retrieved Aug. 18, 2021 from https://www.bloomberg.com/press-releases/1999-12-16/intervu-granted-key-internet-patent).
“InterVu Streams Ahead Behind the Scenes”, Paul Festa, cnet, Jan. 2, 2002 (retrieved Aug. 18, 2021 from https://www.cnet.com/news/intervu-streams-ahead-behind-the-scenes/).
“Microsoft Announces Beta Release of Windows Media Technologies 4.0,” Apr. 13, 1999, pp. 1-5 (retrieved Aug. 18, 2021 from https://news.microsoft.com/1999/04/13/microsoft-announcesbeta-release-of-windows-media-technologies-4-0/).
“Sandpiper Adds RealSystem G2 to its Content Delivery Network,” CBR Staff, Aug. 4, 1999, pp. 1-4 (retrieved Aug. 18, 2021 from https://techmonitor.ai/techonology/sandpiper_adds_realsystem_g2_to_its_content_delivery_nnetwork.
“Speedera Posts Another Record Fiscal Year, Revenue Jumps 60 Percent,” BusinessWire Digital Commerce 360, Jul. 14, 2004, pp. 1-5 (retrieved Aug. 18, 2021 from https://www.digitalcommerce360.com/2004/07/14/speedera-posts-another-record-fiscal-yearrevenue-jumps-60-perc/).
“Developer Documentation QuickTime 6”, Apple Computer Inc., Cupertino, CA (2002), pp. 1-240.
“IBM Digital Library Version 2 Expands Its Comprehensive Solution Framework”, Software Announcement, Aug. 12, 1997, pp. 1-26 (retrieved Aug. 18, 2021 from https://www-01.ibm.com/common/ssi/ShowDoc.wss?docURL=/common/ssi/rep_ca/2/897/ENUS297-312/index.html&request_locale=en).
“Fresh Approach: Axient founder finds another way to make networking pay off”, Y. Tara Teichgraeber, Phoenix Business Journal, Jan. 13, 2002, pp. 1-6 (retrieved Aug. 18, 2021 from https://www.bizjournals.com/phoenix/stories/2002/01/14/story6.html).
Mac OS X Server QuickTime Streaming Server 5.0 Administration, Apple Computer Inc., Cupertino, CA (2003), pp. 1-65.
Respondents Lululemon Athletica Inc. and Curiouser Products Inc. Response to Complaint US Int'l Trade Commission Investigation. No. 337-TA-1265.
Respondent Peloton Interactive, Inc.'s Response to Complaint US Int'l Trade Commission Investigation. No. 337-TA-1265.
Verified Response of Icon Health & Fitness, Inc., Free Motion Fitness, Inc., and Nordictrack, Inc. to Complaint US Int'l Trade Commission Investigation. No. 337-TA-1265.
Investigation No. 337-TA-1265: Appendix a to Expert Report of Dr. Iain Richardson on Invalidity: Anticipation and Obviousness Over Carmel.
Investigation No. 337-TA-1265: Appendix B to Expert Report of Dr. Iain Richardson On Invalidity: Anticipation and Obviousness Over Akiyama.
Investigation No. 337-TA-1265: Appendix C-1 to Expert Report of Dr. Iain Richardson on Invalidity: Anticipation and Obviousness Over Realnetworks.
Investigation No. 337-TA-1265: Appendix C-2 to Expert Report of Dr. Iain Richardson on Invalidity: Realnetworks Experimentation.
Investigation No. 337-TA-1265: Appendix D to Expert Report of Dr. Iain Richardson on Invalidity: Anticipation and Obviousness Over Klemets.
Investigation No. 337-TA-1265: Exhibit E to Expert Report of Dr. Iain Richardson on Invalidity: Anticipation and Obviousness Over Oplayo.
Investigation No. 337-TA-1265: Appendix F to Expert Report of Dr. Iain Richardson on Invalidity: Anticipation and Obviousness Over Kikuchi.
Investigation No. 337-TA-1265: Appendix G to Expert Report of Dr. Iain Richardson on Invalidity: Anticipation and Obviousness Over Takemura.
Investigation No. 337-TA-1265: Appendix H to Expert Report of Dr. Iain Richardson on Nvalidity: Public Use [Redacted].
Investigation No. 337-TA-1265: Exhibit 1 Dr. Iain Richardson curriculum vitae Dec. 21.
Investigation No. 337-TA-1265: Richardson Report Exhibit 3: Materials Considered.
Investigation No. 337-TA-1265: Appendix a to Supplemental Expert Report if Dr. Iain Richardson [Redacted].
Investigation No. 337-TA-1265: Supplemental Expert Report of Robert L. Stoll.
Investigation No. 337-TA-1265: Supplemental Expert Report of Dr. Iain Richardson on Invalidity [Redacted].
Investigation No. 337-TA-1265: Supplemental Rebuttal Expert Report of Kevin Jeffay, Phd, Regarding Validity [Redacted].
Investigation No. 337-TA-1265: Supplemental Rebuttal Expert Report of Teresa Stanek Rea [Redacted].
Investigation No. 337-TA-1265: Redacted Rebuttal Expert Report of Teresa Stanek Rea.
Investigation No. 337-TA-1265: Redacted Rebuttal Expert Report of Kevin Jeffay, Phd., Regarding Validity.
Investigation No. 337-TA-1265: Redacted Expert Report of Dr. Iain Richardson on Invalidity.
Investigation No. 33T-TA-1265: Redacted Expert Report of Robert L. Stoll.
Initial Determination on Violation of Section 337 and Recommended Determination on Remedy and Bond US Int'l Trade Commission Investigation No. 337-TA-1265 (Sep. 9, 2022).
Krasic et al., Quality-Adaptive Media Streaming By Priority Drop, Oregon Graduate Institute, 2001.
Krasic et al., QoS Scalability for Streamed Media Delivery, Oregon Graduate Institute School of Science & Engineering Technical Report CSE 99-011, Sep. 1999.
Huang et al., Adaptive Live Video Streaming By Priority Drop, Portland State University PDXScholar, Jul. 21, 2003.
Walpole et al., A Player for Adapctive MPEG Video Streaming Over the Internet, Oregon Graduate Institute of Science and Technology, Oct. 25, 2012.
Albanese, Andrew et al. “Priority Encoding Transmission”, TR-94-039, Aug. 1994, 36 pgs, International Computer Science Institute, Berkeley, CA.
Birney, Bill “Intelligent Streaming”, May 2003, Microsoft.
Goyal, Vivek K. “Multiple Description Coding: Compression Meets the Network,” Sep. 2001, pp. 74-93, IEEE Signal Processing Magazine.
ON2 Technologies, Inc. “TrueMotion VP7 Video Codec” White Paper, Document Version 1.0, Jan. 10, 2005.
Pathan, Al-Mukaddim et al. “A Taxonomy and Survey of Content Delivery Networks” Australia, Feb. 2007, available at http://www.gridbus.org/reports/CDN-Taxonomy.pdf.
Puri, Rohit et al. “Multiple Description Source Coding Using Forward Error Correction Codes,” Oct. 1999, 5 pgs., Department of Electrical Engineering and Computer Science, University of California, Berkeley, CA.
Wicker, Stephen B. “Error Control Systems for Digital Communication and Storage,” Prentice-Hall, Inc., New Jersey, USA, 1995, parts 1-6.
Liu, Jiangchuan et al. “Opportunities and Challenged of Peer-to-Peer Internet Video Broadcast,” School of Computing Science, Simon Fraser University, British Columbia, Canada.
Clement, B. “Move Networks closes $11.3 Million on First Round VC Funding,” Page One PR, Move Networks, Inc. Press Releases, Feb. 7, 2007, http://www.move.tv/press/press20070201.html.
Move Networks, Inc. “The Next Generation Video Publishing System,” Apr. 11, 2007; http://www.movenetworks.com/wp-content/uploads/move-networks-publishing-system.pdf.
Yoshimura, Takeshi et al. “Mobile Streaming Media CDN Enabled by Dynamic Smil”, NTT DoComo, Multimedia Laboratories and Hewlett-Packard Laboratories, dated May 7-11, 2002, ACM 1-58113-449-5/02/0005; http://www2002.org/CDROM/refereed/515/.
Nguyen, T. et al., Multiple Sender Distributed Video Streaming, IEEE Transactinos on Multimedia, IEEE Service Center, Piscataway, NJ, US, vol. 6, No. 2, Apr. 1, 2004, pp. 315-326, XP011109142, ISSN: 1520-9210, DOI: 10.1109/TMM,2003.822790.
Commission Opinion in the Matter of Certain Fitness Devices, Streaming Components Thereof, and Systems Containing Same [Public Version] dated Mar. 23, 2023 (96 pages).
DISH Technologies et al. v. IFIT Health & Fitness, Case 1:23-cv-00963-GBW, “Defendant IFIT Health and Fitness, Inc.'s Motion to Dismiss the First Amended Complaint Pursuant to Fed. R. Civ. P. 12(b)(6)” dated Oct. 27, 2023 (3 pages).
DISH Technologies et al. v. IFIT Health & Fitness, Case 1:23-cv-00963-GBW, “Opening Brief in Support of Defendant IFIT's Motion to Dismiss Plaintiffs' First Amended Complaint” dated Oct. 27, 2023 (30 pages).
AYLO Freesites LTD v. DISH Technologies L.L.C., Inter Partes Review No. IPR2024-00147, “Petition for Inter Partes Review of U.S. Pat. No. 10,757,156 Challenging Claims 1-17 Under 35 U.S.C. §§ 311-319 and 37 C.F.R. § 42.1 et seq.” dated Nov. 7, 2023 (85 pages).
AYLO Freesites LTD v. DISH Technologies L.L.C., Inter Partes Review No. IPR2024-00146, “Petition for Inter Partes Review of U.S. Pat. No. 10,469,555 Challenging Claims 1, 3-5, 7-11, 13-20, and 22-27 Under 35 U.S.C. §§ 311-319 and 37 C.F.R. § 42.1 et seq.” dated Nov. 7, 2023 (86 pages).
Fielding et al., “Hypertext Transfer Protocol—HTTP/1.1,” The Internet Society, dated Jun. 1999 (152 pages).
“Enforcement Complaint of DISH DBS Corporation et al.,” Investigation No. 337-TA-1265 (Enforcement Proceeding) dated Sep. 11, 2023 (43 pages).
AYLO Freesites LTD v. DISH Technologies L.L.C., Inter Partes Review No. IPR2024-00147, “Declaration of Henry Houh, Ph.D. in Support of Petition for Inter Partes Review of U.S. Pat. No. 10,757,156” executed Nov. 2, 2023 (97 pages).
Civanlar et al. “A practical system for MPEG-2 based video-on-demand over ATM packet networks and the WWW.” Signal Processing: Image Communication 8, at 221-27, 1996.
Claim Chart Against U.S. Pat. No. 9,407,564 (“'564 patent”) “Microsoft Windows Media Technologies” as described by Birney, “Intelligent Streaming” (May 2003) (“Birney”).
IPR2024-00043 filed on U.S. Pat. No. 11,677,798.
IPR2024-00044 filed on U.S. Pat. No. 11,470,138.
IPR2024-00045 filed on U.S. Pat. No. 10,469,554.
IPR2024-00046 filed on U.S. Pat. No. 10,951,680.
IPR2024-00047 filed on U.S. Pat. No. 9,407,564.
IPR2024-00048 filed on U.S. Pat. No. 8,868,772.
Declaration of Dr. Henry Houh including Curriculum Vitae (“Houh”) in IPR2024-00043.
Declaration of Dr. Henry Houh including Curriculum Vitae (“Houh”) in IPR2024-00044.
Declaration of Dr. Henry Houh including Curriculum Vitae (“Houh”) in IPR2024-00045.
Declaration of Dr. Henry Houh including Curriculum Vitae (“Houh”) in IPR2024-00046.
Declaration of Dr. Henry Houh including Curriculum Vitae (“Houh”) in IPR2024-00047.
Declaration of Dr. Henry Houh including Curriculum Vitae (“Houh”) in IPR2024-00048.
337-TA-1265 ITC Sep. 11, 2023 Enforcement Complaint.
Internet Archive Affidavit, Nathaniel E Frank-White for URLs (“SMIL”).
“Synchronized Multimedia Integration Language (SMIL 2.0) (“SMIL2.0”)”.
U.S. Appl. No. 60/041,770 (Ogdon).
“Exhibit 4—Declaration of Dr. Henry Houh, Ph.D. in Support of Aylopremium Ltd and Aylo Billing Limited's Response Toplaintiffs' Motion for Preliminary Injunction (DC Utah, Case No. 2:23-cv-552-BSJ)”.
Houh Exhibit A—CV of Henry H. Houh.
Houh Exhibit B—List of Materials Considered.
Houh Exhibit C—U.S. Pat. No. 10,469,554.
Houh Exhibit D—U.S. Pat. No. 11,470,138.
Houh Exhibit E—U.S. Pat. No. 11,677,798.
Houh Exhibit F—U.S. Pat. No. 8,868,772.
Houh Exhibit G—U.S. Pat. No. 9,407,564.
Houh Exhibit H—U.S. Pat. No. 10,951,680.
Houh Exhibit I—Claim Chart of U.S. Pat. No. 10,469,554 and Ogdon.
Houh Exhibit J—Claim Chart of U.S. Pat. No. 10,469,554 and Shteyn.
Houh Exhibit K—Claim Chart of U.S. Pat. No. 11,470,138 and Ogdon.
Houh Exhibit L—Claim Chart of U.S. Pat. No. 11,470,138 and Shteyn.
Houh Exhibit M—Claim Chart of U.S. Pat. No. 11,677,798 and Ogdon.
Houh Exhibit O—Claim Chart of U.S. Pat. No. 8,868,772 and Ogdon.
Houh Exhibit P—Claim Chart of U.S. Pat. No. 8,868,772 and Shteyn.
Houh Exhibit Q—Claim Chart of U.S. Pat. No. 9,407,564 and Ogdon.
Houh Exhibit R—Claim Chart of U.S. Pat. No. 9,407,564 and Shteyn.
Houh Exhibit S—Claim Chart of U.S. Pat. No. 10,951,680 and Ogdon.
Houh Exhibit T—Claim Chart of U.S. Pat. No. 10,951,680 and Shteyn.
Wu, Dapeng et al., Streaming Video over the Internet: Approaches and Directions, IEEE Transactions on Circuits and Systems for Video Technology, vol. 11, No. 3, Mar. 2001.
RealNetworks Production Guide with RealOne Player (2002).
RealSystem G2 Production Guide (1998).
Darwin Streaming Server (1999).
Houh Exhibit N—Claim Chart of U.S. Pat. No. 11,677,798 and Shteyn.
AYLO Freesites LTD v. DISH Technologies L.L.C., Inter Partes Review No. IPR2024-00146, “Declaration of Henry Houh, Ph.D. in Support of Petition for Inter Partes Review of U.S. Pat. No. 10,469,555” executed Oct. 24, 2023 (96 pages).
Internet Archive Affidavit, Nathaniel E Frank-White for URLs (“SMIL”) (335 pages).
IFIT, Inc., FreeMotion Fitness, Inc., and NordicTrack, Inc. (Appellants) v. United States International Trade. Commission (Appellee) and DISH DBS Corporation; DISH Technologies, L.L.C.; Sling TV L.L.C. (Intervenors), Appeal from the United States International Trade Commission in Investigation No. 337-TA-1265, “Appellants'Opening Brief (Non-Confidential Version)” filed Nov. 21, 2023 (89 pages).
AYLO Freesites LTD v. DISH Technologies L.L.C., Inter Partes Review No. IPR2024-00512, “Petition for Inter Partes Review of U.S. Pat. No. 11,470,138” executed Jan. 30, 2024 (89 pages).
AYLO Freesites LTD v. DISH Technologies L.L.C., Inter Partes Review No. IPR2024-00513, “Petition for Inter Partes Review of U.S. Pat. No. 10,757,156” executed Jan. 30, 2024 (81 pages).
AYLO Freesites LTD v. DISH Technologies L.L.C., Inter Partes Review No. IPR2024-00514, “Petition for Inter Partes Review of U.S. Pat. No. 10,469,554” executed Jan. 30, 2024 (87 pages).
AYLO Freesites LTD v. DISH Technologies L.L.C., Inter Partes Review No. IPR2024-00515, “Petition for Inter Partes Review of U.S. Pat. No. 10,469,555” executed Jan. 30, 2024 (82 pages).
AYLO Freesites LTD v. DISH Technologies L.L.C., Inter Partes Review No. IPR2024-00516, “Petition for Inter Partes Review of U.S. Pat. No. 10,951,680” executed Jan. 30, 2024 (85 pages).
AYLO Freesites LTD v. DISH Technologies L.L.C., Inter Partes Review No. IPR2024-00517, “Petition for Inter Partes Review of U.S. Pat. No. 11,677,798” executed Jan. 30, 2024 (88 pages).
AYLO Freesites LTD v. DISH Technologies L.L.C., Inter Partes Review No. IPR2024-00518, “Petition for Inter Partes Review of U.S. Pat. No. 9,407,564” executed Jan. 30, 2024 (86 pages).
AYLO Freesites LTD v. DISH Technologies L.L.C., Inter Partes Review No. IPR2024-00519, “Petition for Inter Partes Review of U.S. Pat. No. 8,868,772” executed Jan. 30, 2024 (85 pages).
AYLO Freesites LTD v. DISH Technologies L.L.C., Inter Partes Review No. IPR2024-00512, “Declaration of Henry Houh, Ph.D. in Support of Petition for Inter Partes Review of U.S. Pat. No. 11,470,138” executed Jan. 29, 2024 (89 pages).
“Synchronized Multimedia Integration Language (SMIL 2.0)” dated Aug. 7, 2001 (364 pages).
United States International Trade Commission In the Matter of: Certain Fitness Devices, Streaming Components Thereof, and Systems Containing Same (Investigation No. 337-TA-1265), “Initial Determination on Violation of Section 337 and Recommended Determination on Remedy and Bond” dated Sep. 9, 2022 (269 pages).
United States International Trade Commission In the Matter of: Certain Fitness Devices, Streaming Components Thereof, and Systems Containing Same (Investigation No. 337-TA-1265), “Enforcement Complaint of DISH DBS Corporation et al.” dated Sep. 11, 2023 (43 pages).
Internet Archive Affidavit, Nathaniel E Frank-White for URLs (“SMIL”) (335 pages broken into six parts—pp. 1-50, 51-90, 91-130, 131-170, 171-210, and 211-335).
AYLO Freesites LTD v. DISH Technologies L.L.C., Inter Partes Review No. IPR2024-00513, “Declaration of Henry Houh, Ph.D. in Support of Petition for Inter Partes Review of U.S. Pat. No. 10,757,156” executed Jan. 29, 2024 (85 pages).
The Internet Society “Hypertext Transfer Protocol—HTTP/1.1” dated Jun. 1999 (152 pages).
AYLO Freesites LTD v. DISH Technologies L.L.C., Inter Partes Review No. IPR2024-00514, “Declaration of Henry Houh, Ph.D. in Support of Petition for Inter Partes Review of U.S. Pat. No. 10,469,554” executed Jan. 28, 2024 (87 pages).
AYLO Freesites LTD v. DISH Technologies L.L.C., Inter Partes Review No. IPR2024-00515, “Declaration of Henry Houh, Ph.D. in Support of Petition for Inter Partes Review of U.S. Pat. No. 10,469,555” executed Jan. 28, 2024 (82 pages).
AYLO Freesites LTD v. DISH Technologies L.L.C., Inter Partes Review No. IPR2024-00516, “Declaration of Henry Houh, Ph.D. in Support of Petition for Inter Partes Review of U.S. Pat. No. 10,951,680” executed Jan. 29, 2024 (87 pages).
AYLO Freesites LTD v. DISH Technologies L.L.C., Inter Partes Review No. IPR2024-00517, “Declaration of Henry Houh, Ph.D. in Support of Petition for Inter Partes Review of U.S. Pat. No. 11,470,138” executed Jan. 28, 2024 (94 pages).
AYLO Freesites LTD v. DISH Technologies L.L.C., Inter Partes Review No. IPR2024-00518, “Declaration of Henry Houh, Ph.D. in Support of Petition for Inter Partes Review of U.S. Pat. No. 9,407,564” executed Jan. 29, 2024 (93 pages).
AYLO Freesites LTD v. DISH Technologies L.L.C., Inter Partes Review No. IPR2024-00519, “Declaration of Henry Houh, Ph.D. in Support of Petition for Inter Partes Review of U.S. Pat. No. 8,868,772” executed Jan. 29, 2024 (99 pages).
Related Publications (1)
Number Date Country
20230128962 A1 Apr 2023 US
Provisional Applications (1)
Number Date Country
60566831 Apr 2004 US
Continuations (9)
Number Date Country
Parent 17962231 Oct 2022 US
Child 18069450 US
Parent 16876579 May 2020 US
Child 17962231 US
Parent 16004056 Jun 2018 US
Child 16876579 US
Parent 15414025 Jan 2017 US
Child 16004056 US
Parent 14719122 May 2015 US
Child 15414025 US
Parent 14106051 Dec 2013 US
Child 14719122 US
Parent 13617114 Sep 2012 US
Child 14106051 US
Parent 12906940 Oct 2010 US
Child 13617114 US
Parent 11673483 Feb 2007 US
Child 12906940 US
Continuation in Parts (1)
Number Date Country
Parent 11116783 Apr 2005 US
Child 11673483 US