# US 12,114,026 B2 · System for queuing flows to channels > Agents: this data is available as JSON from the patentgrep API and MCP server — see https://patentgrep.com/llms.txt - Number: US 12,114,026 B2 - Document ID: US12114026B2 - Status: Granted - Kind: B2 - Application number: 18/378,109 - Filed: 2023-10-09 - Published: 2024-05-30 - Granted: 2024-10-08 - Earliest claimed: 2021-04-14 - Assignees: ARRIS Enterprises LLC - Applicants: ARRIS Enterprises LLC - Inventors: Cillian O′Tuama; Anthony J. Cotter; Tony O′Brien - Web page: https://patentgrep.com/patent/US12114026B2 ## CPC - H04N 21/2385: Channel allocation (H04N21/266 takes precedence); Bandwidth allocation (H04N21/24 takes precedence {; allocation of channels according to the instantaneous demands of the users in time-division multiplex systems H04J3/1682; admission control, resource allocation in open networks H04L12/5692; arrangements for maintenance or administration in data switching networks involving bandwidth and capacity management H04L41/0896; negotiating bandwidth in wireless networks H04W28/16}) - H04L 47/24: Traffic characterised by specific attributes, e.g. priority or QoS - H04L 47/50: Queue scheduling - H04N 7/17309: {Transmission or handling of upstream communications} - H04N 21/6118: {involving cable transmission, e.g. using a cable modem} - H04N 21/6168: {involving cable transmission, e.g. using a cable modem} - H04N: PICTORIAL COMMUNICATION, e.g. TELEVISION - H04L: TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION (arrangements common to telegraphic and telephonic communication H04M) ## Abstract A system for queuing flows to channels. ## Claims ### Claim 1 A system for queuing service flows for a cable system comprising: (a) a head end connected to a plurality of customer devices through a transmission network that includes a remote fiber node that converts received data to analog data suitable to be provided on a coaxial cable for said plurality of customer devices, where said head end includes at least one processor; (b) said head end queuing a service flow to a group of a plurality of channels, which is less than all available said channels; (c) said head end free from queueing said service flow individually to said plurality of channels; (d) said head end reading bits of a matrix and based upon said reading of said bits dequeuing said service flow based upon data indicating said group of said plurality of channels; (e) providing said dequeued service flow to one of said plurality of customer devices; (f) wherein said queuing said service flow to said group of said plurality of channels by said head end is based upon said matrix represented as a series of consecutive bits for a single service flow for a plurality of channels, where each bit is representative of a different channel and the series of consecutive bits is representative of said service flow for said plurality of channels. ### Claim 2 (depends on 1) The system of claim 1 wherein said group of said plurality of channels is all channels of a Media Access Control domain. ### Claim 3 (depends on 1) The system of claim 1 wherein said group of said plurality of channels is all channels of between said head end and a remote phy device, where said remote phy device is not part of said head end. ### Claim 4 (depends on 1) The system of claim 1 wherein said group of said plurality of channels is all channels of between a remote mac phy device and one or more of said plurality of customer devices, where said remote mac phy device is part of said head end. ### Claim 5 A system for queuing service flows for a cable system comprising: (a) a head end connected to a plurality of customer devices through a transmission network that includes a remote fiber node that converts received data to analog data suitable to be provided on a coaxial cable for said plurality of customer devices, where said head end includes at least one processor; (b) said head end queuing a plurality of service flows to a plurality of channels; (c) said queuing including a matrix representing service flows and downstream channels; (d) said matrix representing a series of bits forming a word suitable to be written to memory as a series of consecutive bits for a single service flow for a plurality of channels, where each bit is representative of a different channel and the series of consecutive bits is representative of said service flow for said plurality of channels; (e) said head end reading said bits of said matrix and based upon said reading of said bits dequeuing said service flows based upon said matrix to one of said plurality of customer devices. ### Claim 6 (depends on 5) The system of claim 5 wherein said group of said plurality of channels is all channels of a Media Access Control domain. ### Claim 7 (depends on 5) The system of claim 5 wherein said group of said plurality of channels is all channels of between said head end and a remote phy device, where said remote phy device is not part of said head end. ### Claim 8 (depends on 5) The system of claim 5 wherein said group of said plurality of channels is all channels of between a remote mac phy device and one or more of said plurality of customer devices, where said remote mac phy device is part of said head end. ### Claim 9 (depends on 6) The system of claim 6 wherein said matrix includes a plurality of said series of bits each of which representing a different channel. ### Claim 10 (depends on 6) The system of claim 6 wherein said matrix includes a value for a bit of said series of bits forming said word representative of an absence of a corresponding said service flow. ### Claim 11 (depends on 7) The system of claim 7 wherein said matrix includes a value of zero for services flow not assigned to one of said channels. ### Claim 12 (depends on 5) The system of claim 5 wherein an additional service flow is appended to said series of consecutive bits at a tail end. ### Claim 13 (depends on 5) The system of claim 5 wherein said series of consecutive bits is used as a circular queue. ### Claim 14 A system for queuing service flows comprising: (a) a data source device that includes at least one processor providing data to a plurality of receiving devices each of which includes at least one processor through a transmission network; (b) said data source device queuing a service flow to a group of a plurality of channels, which is less than all available said channels; (c) said data source device free from queueing said service flow individually to said plurality of channels; (d) said data source device reading bits of a matrix and based upon said reading of said bits dequeuing said service flow based upon data indicating said group of said plurality of channels; (e) providing said dequeued service flow to one of said plurality of receiving devices (f) wherein said queuing said service flow to said group of said plurality of channels by said data source is based upon said matrix represented as a series of consecutive bits for a single service flow for a plurality of channels, where each bit is representative of a different channel and the series of consecutive bits is representative of said service flow for said plurality of channels. ### Claim 15 (depends on 14) The system of claim 14 wherein said group of said plurality of channels is all channels of a Media Access Control domain. ### Claim 16 (depends on 14) The system of claim 14 wherein said group of said plurality of channels is all channels of between said data source device and a remote phy device, where said remote phy device is not part of said data source device. ### Claim 17 (depends on 14) The system of claim 14 wherein said group of said plurality of channels is all channels of between a remote mac phy device and one or more of said plurality of receiving devices, where said remote mac phy device is part of said data source device. ### Claim 18 A system for queuing service flows comprising: (a) a data source device that includes at least one processor providing data to a plurality of receiving devices each of which includes at least one processor through a transmission network; (b) said data source device queuing a plurality of service flows to a plurality of channels; (c) said queuing including a matrix representing service flows and downstream channels; (d) said matrix representing a series of bits forming a word suitable to be written to memory as a series of consecutive bits for a single service flow for a plurality of channels, where each bit is representative of a different channel and the series of consecutive bits is representative of said service flow for said plurality of channels; (e) said data source device reading said bits of said matrix and based upon said reading of said bits dequeuing said service flows based upon said matrix to one of said plurality of receiving devices. ### Claim 19 (depends on 18) The system of claim 18 wherein said group of said plurality of channels is all channels of a Media Access Control domain. ### Claim 20 (depends on 18) The system of claim 18 wherein said matrix includes a plurality of said series of bits each of which representing a different channel.