Eureka on the web
When you want the answer in the next five minutes.
The agent works the prompt against patents and technical literature, citing every source.
Run your analysis now →A patent landscape review of client-side adaptive bitrate algorithms using buffer occupancy: filing trends, technology composition, assignee concentration and white space across 125 records through 2026.
Filing growth = 2021 (30 records) → 2024 (5); 2024 is the last year we treat as complete. Top-5 share = the 5 largest assignees ÷ all 125 records in scope (CR5), not the ranked leaders only.
Client-side adaptive bitrate streaming relies on the player measuring how full its own buffer is and using that measurement to decide what to request next. Patent activity around this specific mechanism — buffer occupancy as the trigger for a bitrate or timing decision — is concentrated in video-delivery and network-transport classifications, and concentrated among a small number of filers who hold the large majority of records in scope. The representative filing here, from Cisco, shows how narrow a single claim in this space can be: it covers a buffer-level check paired with a randomized fetch delay, not buffer-based decision-making in general.
That narrowness matters for freedom-to-operate work. The field's density comes from many filers claiming slightly different combinations of the same basic elements — buffer level, threshold, timing adjustment, prediction layer — rather than one party owning the whole mechanism. Reading the composition and concentration data together shows where those combinations cluster and where they thin out.
The dataset covers 125 published records from 2015 through the 2026 cut-off, with filing activity concentrated in a handful of years and technology classes.
Filings rose from 4 in 2012 to a peak of 30 in 2021, then fell to 5 by 2024 — an 83% drop over that three-year span. Because publication lags filing by roughly 18 months, 2025 and 2026 figures are still incomplete and should not be read as a continued decline.
Publication lags filing by roughly 18 months, so 2025 onwards are still filling in. Growth rates on this page therefore end at 2024; running them to the last bar would understate the field.
H04N (pictorial communication / video) appears in 68.0% of the 125 records and H04L (digital information transmission) in 56.8%, confirming that most filings sit at the intersection of video delivery and network transport. Smaller shares in G06F, G06N, A63F, G01N, G11B and H04W mark adjacent branches with far less claim density.
Shares are the percentage of the 125 records in scope. A patent can carry several IPC classes, so the shares add up to more than 100%.
This page is one run against one query. Ask Eureka your own question about client-side adaptive bitrate algorithm using buffer occupancy patent landscape and every answer comes back with the patent numbers behind it.
Try EurekaA method is provided in one example embodiment and includes receiving video data at an adaptive bitrate (ABR) client that includes a buffer; determining whether a buffer level for the buffer is below a target buffer level; applying a random delay for a fetch interval associated with requesting the video data; and requesting a next segment of the video data after the random delay. The random delay can provide for a plurality of fetch times to become decorrelated from each other.Assigned to Cisco Technology, Inc.; published 2016-07-26.


When you want the answer in the next five minutes.
The agent works the prompt against patents and technical literature, citing every source.
Run your analysis now →When it has to run inside your own pipeline.
Patent search, landscape analysis and assignee resolution as MCP tools. Drop them into any agent framework, or call REST directly.
Browse MCP servers →Three figures from this dataset matter most for anyone deciding whether, and where, to file next in client-side buffer-based ABR.
Five assignees account for two-thirds of all 125 records in scope, with the single leader holding 36. New entrants filing on the basic buffer-threshold mechanism will run into this concentration almost immediately.
Filings dropped 83% from the 2021 peak of 30 to 5 in 2024. Because publication lags filing by about 18 months, the 2025–2026 tail in this dataset is incomplete and should not be read as the field cooling further.
H04N and H04L together anchor the large majority of filings, confirming that buffer-occupancy ABR is claimed primarily as a video-delivery and transport problem rather than a general computing one.
Games/interactive playback, material analysis, storage media and wireless signalling each carry only a few percent of records, marking the clearest under-claimed intersections with buffer-based ABR.
Eureka can read the same corpus for gaps instead of for coverage: under-claimed branches adjacent to client-side adaptive bitrate algorithm using buffer occupancy patent landscape, with the prior art for and against each one.
The figures above establish concentration and composition. The next layer of work is claim-level: what specific combinations the leading assignees hold, and which branches are still open.
Compare a specific client-side buffer-control design against the claims held by the leading assignees, who together account for 66.4% of the 125 records in scope, before committing engineering resources.
Start a claim check in EurekaBranches like wireless signalling, storage media and interactive playback each sit under 3.2% of records — worth a closer look before assuming the space is fully occupied.
Explore white space in EurekaRecent-year figures are incomplete due to publication lag; set up ongoing monitoring to catch new filings as they publish rather than relying on a single snapshot.
Set up monitoring in EurekaIt covers methods where a video player client measures how much video is currently buffered and uses that measurement, alone or combined with other signals, to decide the bitrate or timing of its next segment request. In this dataset that core idea sits mainly in IPC classes H04N and H04L, which together describe video pictorial communication and digital transmission. Claims range from simple threshold checks to more elaborate combinations with randomized timing, predicted throughput, or learned decision models, so the exact scope of any given patent depends heavily on what triggers the buffer-based decision and what the client does in response.
The assignee ranking returned by this dataset lists 19 companies, with the leader holding 36 of the 125 records in scope — meaning roughly three in ten records in this field trace to a single assignee. The top five combined account for 66.4% of all 125 records, and the top ten account for 88.0%, which is a strongly concentrated field rather than one with a long, even tail. Anyone entering this space should expect to run into the leading assignee's claims first, since they cover the largest single share of the prior art.
Filing activity peaked at 30 records in 2021 and had fallen to 5 by 2024, an 83% decline over that span, but this should not be read as the field going cold. Publication typically lags actual filing by about 18 months, so the 2025 and 2026 figures in this dataset are structurally incomplete and will rise as more applications publish. The more reliable read is that the field went through a filing surge around 2020–2021 and has since settled into a lower, still-active baseline rather than stopping.
The technology composition data shows video and transport classes (H04N, H04L) heavily claimed, while adjacent branches such as A63F (games/interactive playback), G01N (material or measurement analysis), G11B (storage media) and H04W (wireless network signalling) each account for only 2.4% to 3.2% of the 125 records. These lower-density branches represent combinations — buffer control tied to wireless link state, storage-tier awareness, or interactive playback contexts — that have far fewer prior filings to clear. That said, low density is not zero density, so a search against the specific assignees active in each branch is still necessary before drafting.
No. US9402114B2, assigned to Cisco Technology, Inc. and published 2016-07-26, claims a specific combination: checking whether buffer level is below a target and then applying a randomized delay before requesting the next segment, so that many clients' fetch times decorrelate from each other. It does not claim the general practice of using buffer occupancy to choose bitrate or timing. A client that uses a deterministic backoff, or that triggers timing changes from a different signal such as measured throughput, sits outside this specific claim's literal scope, though a full clearance should still review its dependent claims.
Go past this page: query the whole client-side adaptive bitrate algorithm using buffer occupancy patent landscape corpus yourself, in your own scope.
Every answer comes back with patent numbers you can open.
Disclaimer. This page is generated from Patsnap Eureka data drawn from a limited snapshot of global patent and scientific-literature records, and is provided for general information and reference only.
Patent data carries inherent limitations: recent filings (typically the most recent 18–24 months) are under-counted due to standard publication lag; counts may be reported at either a patent-family or a patent-record basis and are not always directly comparable; classification, applicant-name, and citation data may contain errors, duplicates, or omissions; and the underlying search query defines and constrains the scope shown. As a result, the analysis may be incomplete or inaccurate and may not reflect the full technology landscape.
Nothing on this page constitutes an exhaustive prior-art, novelty, freedom-to-operate, or validity search, nor does it constitute legal, financial, investment, or professional advice, and it should not be relied upon as such. Any patent, commercial, or strategic decision should be verified independently and reviewed with qualified patent, legal, and domain professionals. Patsnap makes no warranties, express or implied, as to the accuracy, completeness, or fitness for any particular purpose of the information presented.
Help us improve
Something wrong, out of date, or missing on this page? Tell us and it goes straight to the team that maintains it.
This page