Obviousness

Based on the provided prior art, here is an analysis of the obviousness of U.S. Patent No. 11,470,138 ("the '138 patent") under 35 U.S.C. § 103.

Obviousness Analysis Under 35 U.S.C. § 103

A patent claim is unpatentable under 35 U.S.C. § 103 if the differences between the claimed invention and the prior art are such that the subject matter as a whole would have been obvious at the time the invention was made to a person having ordinary skill in the art (a "POSITA"). This analysis considers whether a POSITA would have been motivated to combine the teachings of multiple prior art references to arrive at the claimed invention with a reasonable expectation of success.

The independent claims of the '138 patent generally recite a system and method for creating adaptive bitrate media streams by:

1. Segmenting media content into "streamlets."
2. Encoding these streamlets into sets, where each set corresponds to a specific time index and contains versions at multiple, unique bitrates.
3. Using a master/host distributed architecture for the encoding process.
4. Assigning encoding jobs based on a "completion bid" from the host modules to dynamically balance the workload.

The combination of these elements, particularly the distributed encoding architecture managed by a bidding system, would have been obvious to a POSITA at the time of the invention (priority date April 30, 2004). This can be demonstrated by combining the teachings of U.S. Patent Application Pub. No. 2003/0055986 A1 (Zaslavsky) with well-established principles of distributed computing and load balancing that would have been known to a POSITA.

---

Proposed Combination of References

A strong case for obviousness can be made by combining:

• Zaslavsky (US 2003/0055986 A1) as the primary reference, which teaches the fundamental concepts of multi-bitrate adaptive streaming.
• The established and well-known principles of distributed computing architectures (e.g., master/worker or "farm" systems) and dynamic load balancing, which represent common knowledge for a POSITA in the relevant field of computer science and network systems.

1. Base Teachings from Zaslavsky

Zaslavsky discloses a system for "fast-start, variable-rate streaming of media over a network." Its teachings directly cover the first two core elements of the '138 patent's claims:

• Multi-Bitrate Encoding: Zaslavsky explicitly teaches encoding a media file at multiple bitrates to create a "multi-rate" file. This is the same concept as the '138 patent's "set of streamlets" having unique bitrates.
• Adaptation and Segmentation: Zaslavsky describes a server sending initial portions of content at a low bitrate and then switching to higher or lower bitrates based on network conditions. This inherently implies that the media file is structured or can be accessed in segments or portions corresponding to different quality levels, which is analogous to the '138 patent's "streamlets" with identical time indices.

Zaslavsky establishes the "why" and "what" of adaptive bitrate streaming but does not specify the underlying server-side architecture for how the computationally-intensive encoding is performed. A POSITA, tasked with building a scalable system based on Zaslavsky's teachings, would immediately face the problem of how to efficiently generate these multi-rate media files for a large content library or for live events.

2. Motivation to Combine with Distributed Computing Principles

The '138 patent's claimed solution to the encoding challenge—a distributed master/host system with a bidding mechanism—is not a novel concept but rather the application of standard, well-known computer science principles to the problem disclosed by Zaslavsky.

• Motivation for a Master/Host Architecture: Video encoding is a notoriously CPU-intensive and time-consuming process. By 2004, it was a common and obvious practice to parallelize such "embarrassingly parallel" tasks across multiple computers to improve speed and throughput. Using a "farm" of encoder machines (the "hosts") managed by a central controller (the "master") was a standard architecture for tasks like 3D rendering, scientific computing, and large-scale data processing. A POSITA tasked with building a robust encoding system as required by Zaslavsky's method would have been motivated to use a distributed master/host architecture for the predictable benefits of:

  • Scalability: Easily add more host machines to increase encoding capacity.
  • Speed: Encode a single piece of content into multiple bitrates simultaneously, or process multiple content files in parallel.
  • Reliability: If one host fails, the master can reassign its job to another, as described in the '138 patent's specification (FIG. 5a).

• Motivation for a "Completion Bid" Mechanism: Once a master/host architecture is chosen, the question of how to assign jobs becomes paramount. The hosts in an encoding farm may be heterogeneous (different processor speeds, memory) or may have varying dynamic workloads. A simple round-robin assignment would be inefficient. A POSITA would have been well-aware of dynamic load-balancing techniques to solve this exact problem.

  The "encoding job completion bid" is a specific implementation of a well-known dynamic load-balancing strategy. In this strategy, worker nodes (hosts) provide the master with information about their current state, such as CPU load, available memory, or an estimate of how long a given task will take. The master uses this information to dispatch jobs to the most suitable host. The '138 patent's description of a bid based on "current encoding job completion percentage, average job completion time, processor speed, and physical memory capacity" is a textbook example of the factors used in such load-balancing algorithms.

  A POSITA would have been motivated to implement this type of bidding or status-reporting mechanism for the obvious and predictable benefit of maximizing the encoding farm's overall efficiency and throughput. It is a straightforward engineering choice, not an inventive leap.

Conclusion

The independent claims of the '138 patent appear obvious over Zaslavsky in view of the general knowledge of a Person of Ordinary Skill in the Art regarding distributed computing and dynamic load balancing.

1. Zaslavsky teaches the core concept of creating multi-bitrate media files that are implicitly segmented for adaptive streaming.
2. A POSITA, seeking to implement Zaslavsky's system on a large scale, would have found it obvious to use a standard master/host distributed architecture to handle the computationally expensive encoding process for reasons of speed, scalability, and reliability.
3. To optimize the performance of such a distributed system, the POSITA would have found it obvious to implement a dynamic load-balancing mechanism, such as the claimed "completion bid," to intelligently distribute encoding jobs to the most available or powerful hosts.

Combining these known elements would have yielded the system described in the '138 patent with a high degree of predictability and a reasonable expectation of success. Therefore, the claimed invention would have been obvious under 35 U.S.C. § 103.