Adaptive Bitrate Server Video Data Multiplexing
Find Innovative SolutionsGenerate Solutions
Solution Overview
Problem
Existing systems face challenges in maintaining optimum video quality while multiplexing video services with data services in constrained delivery pipelines, such as DOCSIS service groups, due to fixed bandwidth constraints, leading to reduced video quality or inefficiency.
Innovation Solution
A method and system that generate a soft upper bound for video data bandwidth, allowing it to fluctuate within a schedule window while ensuring an average bandwidth does not exceed a hard upper bound, enabling efficient multiplexing of video and data services by adjusting the required video data bandwidth based on need parameter values and quality factors.
Engineering Contradictions & Design Principles
Engineering Contradiction Analysis
1Loss of energy
If video data bandwidth is constrained to a fixed hard upper bound, then bandwidth efficiency is improved, but video quality deteriorates when subscribers enter and leave the delivery pipeline
Solution Approach 1:
The patent applies dynamics by transitioning from a static hard bandwidth upper bound to a dynamic soft upper bound that adapts to changing subscriber conditions. The soft upper bound BWvideosoft(i) is recalculated for each schedule window based on current subscriber count and video complexity, allowing the system to respond dynamically to entering and leaving subscribers while maintaining overall bandwidth efficiency through the hard upper bound BVvideo constraint.
Solution Approach 2:
The patent changes the bandwidth parameter from a fixed hard upper bound to a variable soft upper bound that can fluctuate within defined constraints. By introducing the soft upper bound BWvideosoft(i) that varies with subscriber conditions and video complexity NPV(i), the system maintains video quality adaptability while the hard upper bound BVvideo ensures long-term bandwidth efficiency and prevents buffer overflow.
2Reliability
If video data bandwidth is allowed to fluctuate dynamically, then video quality is improved, but bandwidth management complexity increases
Solution Approach 1:
The patent implements feedback through the control loop that continuously monitors subscriber count, calculates video complexity NPV(i), and adjusts the soft upper bound BWvideosoft(i) accordingly. The system uses feedback from buffer status, subscriber changes, and video content characteristics to dynamically regulate bandwidth allocation, maintaining video quality while managing complexity through automated closed-loop control rather than manual intervention.
Solution Approach 2:
The patent applies preliminary action by pre-calculating the soft upper bound BWvideosoft(i) for each schedule window based on predicted subscriber conditions and video complexity. The system proactively adjusts bandwidth allocation before subscribers enter or leave, and before video complexity changes occur, using the formula BWvideosoft(i) = BWneed(i) + ΔBW(i) to prepare appropriate bandwidth levels in advance, reducing reactive complexity.
3Adaptability or versatility
If a soft upper bound is used instead of a hard upper bound, then adaptability to subscriber changes is improved, but risk of buffer overflow increases
Solution Approach 1:
The patent applies partial action by allowing the soft upper bound BWvideosoft(i) to temporarily exceed the long-term average hard upper bound BVvideo when conditions warrant (such as when subscribers leave or video complexity decreases). This controlled excessive action provides adaptability to changing conditions while the hard upper bound BVvideo acts as a safety constraint that prevents sustained buffer overflow, balancing adaptability with reliability through the relationship BWvideosoft(i) ≤ BVvideo on average.
Data Source
AI summary
A method is provided for multiplexing video services with data services in a constrained delivery pipeline. A soft upper bound for the video data bandwidth for a current schedule window BWvideosoft(i) is generated, wherein the soft upper bound for the video data bandwidth such that an average video data bandwidth over a time period T is no greater than a hard upper bound for the video data bandwidth BVvideo. The video data is then multiplexed with the other data according to the soft upper bound for the video data bandwidth BWvideosoft(i).