US5268900A
Expired / Lapsed
US
⏱️ 0.0 years remaining
Device and method for implementing queueing disciplines at high speeds
Assignee: Motorola Solutions Inc
•
Filing: 1991-07-05
•
Granted: 1993-12-07
•
Expires: 2011-07-05
Abstract
Abstract A device (800) and method (900) are included for providing a high-rate queueing discipline in an information network system having a plurality of traffic classes. The high-rate queueing discipline is based on a scan table-based dequeueing scheme having a scan table that is precomputed and stored in memory, thus facilitating rapid processing of different traffic class information. The device and method are particularly useful in a fast packet system.
Inventors
- 👤 Michael G. Hluchyj
- 👤 Amit Bhargava
Bibliographic Details
Application Number
—
Jurisdiction
US
Data Source
google_patents
Last Synchronized
2026-10-23 21:33
CPC Classifications
H; H04; H04L; H04L49/00; H04L49/50; H04L49/505; H04L12/00; H04L12/64; H04L12/6418; H04L49/10; H04L49/104; H04L49/105; H04L49/20; H04L49/30; H04L49/3081; H04Q; H04Q11/00; H04Q11/04; H04Q11/0428; H04Q11/0478; H04L12/54; H04L12/56; H04L12/5601; H04L2012/5638; H04L2012/5646; H04L2012/5651; H04L2012/5678; H04L2012/5679; H04L2012/5681; H04L2012/6464; H04L2012/6489; Y; Y10; Y10S; Y10S370/00; Y10S370/901; Y10S370/902
Claims Analysis
Total Claims: 83
Claim 1
Independent Claim
187 words
A device for implementing queueing disciplines at high speeds for a network having different traffic class information, comprising: A) at least a first input receiver, operably coupled to a network, for receiving first traffic class information from a plurality of first sources; B) at least a first prioritizer, operably coupled to the at least first input receiver, for prioritizing at least some of the first traffic class information pursuant to a first prioritization method for transmission; C) at least a second input receiver, operably coupled to an information network, for receiving second traffic class information from a plurality of second sources, which second traffic class is different from the first traffic class; D) at least a second prioritizer, operably coupled to the at least second input receiver, for prioritizing at least some of the second traffic class information for transmission pursuant to a second prioritization method that is different from the first prioritization method; E) a scan table-based dequeuer, operably coupled at least to the first prioritizer and the second prioritizer, for scan table-based dequeueing and transmission of at least the first and second traffic class information.
Claim 2
Independent Claim
187 words
A device for implementing queueing disciplines at high speeds for a network having different traffic class information, comprising: A) at least a first input receiver, operably coupled to a network, for receiving first traffic class information from a plurality of first sources; B) at least a first prioritizer, operably coupled to the at least first input receiver, for prioritizing at least some of the first traffic class information pursuant to a first prioritization method for transmission; C) at least a second input receiver, operably coupled to an information network, for receiving second traffic class information from a plurality of second sources, which second traffic class is different from the first traffic class; D) at least a second prioritizer, operably coupled to the at least second input receiver, for prioritizing at least some of the second traffic class information for transmission pursuant to a second prioritization method that is different from the first prioritization method; E) a scan table-based dequeuer, operably coupled at least to the first prioritizer and the second prioritizer, for scan table-based dequeueing and transmission of at least the first and second traffic class information.
Claim 3
Dependent Claim
37 words
The device of claim 1, wherein the scan table-based dequeuer comprises at least a queueing discipline based table, operably coupled at least to the first prioritizer and the second prioritizer for substantially determining bandwidth allocation for queues.
Claim 4
Dependent Claim
48 words
The device of claim 2, wherein the queueing discipline-based table comprises one of: A) a precomputed head-of-line queueing based scan table; B) a weighted round robin queueing based scan table; and C) a scan table based on a combination of precomputed head-of-line queueing and weighted round robin queueing.
Claim 5
Dependent Claim
90 words
The device of claim 1, further including: A) at least a third input receiver, operably coupled to the information network, for receiving third traffic class information from a plurality of third sources, which third traffic class is different from the first and second traffic classes; and B) at least a third prioritizer, operably coupled to the at least third input receiver, for prioritizing at least some of the third traffic class information for transmission pursuant to a third prioritization method that is different from the first and second prioritization methods.
Claim 6
Dependent Claim
36 words
The device of claim 4, wherein the scan table-based dequeuer is further coupled to the at least third prioritizer, for scan table-based dequeueing and transmission of at least the first, second, and third traffic class information.
Claim 7
Dependent Claim
13 words
The device of claim 4, wherein the first prioritizer comprises a head-of-line prioritizer.
Claim 8
Dependent Claim
14 words
The device of claim 4, wherein the second prioritizer includes a packet select discarder.
Claim 9
Dependent Claim
38 words
The device of claim 7, wherein the packet select discarder includes a discard priority selector for comparing a discard priority for a selected information of a selected information queue with queu depth of at least one information queue.
Claim 10
Dependent Claim
13 words
The device of claim 4, wherein the third prioritizer comprises a head-of-line prioritizer.
Claim 11
Independent Claim
132 words
A device for performing a high-rate trunk queueing discipline for different traffic classes in a fast packet network, comprising: A) at least a first receiver and a second receiver, each operably coupled to the fast packet network, each for receiving traffic information for a separate traffic class; B) at least a first prioritizer and a second prioritizer, each operably coupled to the at least first receiver and second receiver, respectively, each for prioritizing at least some of a received traffic class information for transmission pursuant at least to a first prioritization method and a second, different from the first, prioritization method; and C) a scan table-based bandwidth allocator, operably coupled to at least the first prioritizer and second prioritizer, for substantially obtaining a scan table-based bandwidth allocation for prioritized traffic class information.
Claim 12
Independent Claim
132 words
A device for performing a high-rate trunk queueing discipline for different traffic classes in a fast packet network, comprising: A) at least a first receiver and a second receiver, each operably coupled to the fast packet network, each for receiving traffic information for a separate traffic class; B) at least a first prioritizer and a second prioritizer, each operably coupled to the at least first receiver and second receiver, respectively, each for prioritizing at least some of a received traffic class information for transmission pursuant at least to a first prioritization method and a second, different from the first, prioritization method; and C) a scan table-based bandwidth allocator, operably coupled to at least the first prioritizer and second prioritizer, for substantially obtaining a scan table-based bandwidth allocation for prioritized traffic class information.
Claim 13
Dependent Claim
41 words
The device of claim 10, wherein the scan table-based bandwidth allocator comprises at least an allocator utilizing a queueing discipline based table, operably coupled at least to the first prioritizer and the second prioritizer for substantially determining bandwidth allocation for queues.
Claim 14
Dependent Claim
48 words
The device of claim 11, wherein the queueing discipline-based table comprises one of: A) a precomputed head-of-line queueing based scan table; B) a weighted round robin queueing based scan table; and C) a scan table based on a combination of precomputed head-of-line queueing and weighted round robin queueing.
Claim 15
Dependent Claim
26 words
The device of claim 10, further including a transmitter operably coupled to the scan table-based bandwidth allocator for transmitting prioritized traffic class information in allocated bandwidths.
Claim 16
Dependent Claim
55 words
The device of claim 10, wherein: A) at least the first prioritizer comprises a head-of-line prioritizer; and B) the scan table-based bandwidth allocator comprises at least a precomputed head-of-line-priority and weighted round-robin based scan table operably coupled at least to the first prioritizer and the second prioritizer for substantially determining bandwidth allocation for selected queues.
Claim 17
Independent Claim
200 words
A device in a multiplexer for performing a high-rate trunk queueing discipline for different traffic classes in an information network, comprising at least: A) a first receiver, operably coupled to the information network, for receiving substantially continuous bit-rate information from a plurality of first sources; B) a first prioritizer, operably coupled to the first receiver, for prioritizing at least some of the substantially continuous bit-rate information pursuant to a first prioritization method for transmission; C) a second receiver, operably coupled to the information network, for receiving speech information from a plurality of second sources; D) a second prioritizer, operably coupled to the second receiver, for prioritizing at least some of the speech information pursuant to a second prioritization method for transmission; E) a third receiver, operably coupled to the information network, for receiving framed data information from plurality of third sources; F) a third prioritizer, operably coupled to the third receiver, for prioritizing at least some of the framed data information pursuant to a third prioritization method for transmission; and G) a scan table-based dequeuer, operably coupled at least to first prioritizer, the second prioritizer, and the third prioritizer, to provide scan table-based dequeueing and transmission of the prioritized information.
Claim 18
Independent Claim
200 words
A device in a multiplexer for performing a high-rate trunk queueing discipline for different traffic classes in an information network, comprising at least: A) a first receiver, operably coupled to the information network, for receiving substantially continuous bit-rate information from a plurality of first sources; B) a first prioritizer, operably coupled to the first receiver, for prioritizing at least some of the substantially continuous bit-rate information pursuant to a first prioritization method for transmission; C) a second receiver, operably coupled to the information network, for receiving speech information from a plurality of second sources; D) a second prioritizer, operably coupled to the second receiver, for prioritizing at least some of the speech information pursuant to a second prioritization method for transmission; E) a third receiver, operably coupled to the information network, for receiving framed data information from plurality of third sources; F) a third prioritizer, operably coupled to the third receiver, for prioritizing at least some of the framed data information pursuant to a third prioritization method for transmission; and G) a scan table-based dequeuer, operably coupled at least to first prioritizer, the second prioritizer, and the third prioritizer, to provide scan table-based dequeueing and transmission of the prioritized information.
Claim 19
Dependent Claim
41 words
The device of claim 15, wherein the scan table-based dequeuer comprises at least a precomputed head-of-line-priority and weighted round-robin based scan table, operably coupled at least to the first prioritized and the second prioritizer for substantially determining bandwidth allocation for queues.
Claim 20
Dependent Claim
27 words
The device of claim 15, wherein at least one of: A) the first prioritizer comprises a head-of-line prioritizer; and B) the third prioritizer comprises a head-of-line prioritizer.
Claim 21
Dependent Claim
41 words
The device of claim 15, wherein at least some of the digitized speech information includes discard priority information, and wherein the second prioritizer includes at least a packet discarding protocol to utilize the discard priority information to identify packets to discard.
Claim 22
Independent Claim
201 words
A device in a packet switch for performing a high-rate trunk queueing discipline for different traffic classes in an information network, comprising at least: A) a first receiver, operably coupled to the information network, for receiving substantially continuous bit-rate information from a plurality of first sources; B) a first prioritizer, operably coupled to the first receiver, for prioritizing at least some of the substantially continuous bit-rate information pursuant to a first prioritization method for transmission; C) a second receiver, operably coupled to the information network, for receiving speech information from a plurality of second sources; D) a second prioritizer, operably coupled to the second receiver, for prioritizing at least some of the speech information pursuant to a second prioritization method for transmission; E) a third receiver, operably coupled to the information network, for receiving framed data information from plurality of third sources; F) a third prioritizer, operably coupled to the third receiver, for prioritizing at least some of the framed data information pursuant to a third prioritization method for transmission; and G) a scan table-based dequeuer, operably coupled at least to first prioritizer, the second prioritizer, and the third prioritizer, to provide scan table-based dequeueing and transmission of the prioritized information.
Claim 23
Independent Claim
201 words
A device in a packet switch for performing a high-rate trunk queueing discipline for different traffic classes in an information network, comprising at least: A) a first receiver, operably coupled to the information network, for receiving substantially continuous bit-rate information from a plurality of first sources; B) a first prioritizer, operably coupled to the first receiver, for prioritizing at least some of the substantially continuous bit-rate information pursuant to a first prioritization method for transmission; C) a second receiver, operably coupled to the information network, for receiving speech information from a plurality of second sources; D) a second prioritizer, operably coupled to the second receiver, for prioritizing at least some of the speech information pursuant to a second prioritization method for transmission; E) a third receiver, operably coupled to the information network, for receiving framed data information from plurality of third sources; F) a third prioritizer, operably coupled to the third receiver, for prioritizing at least some of the framed data information pursuant to a third prioritization method for transmission; and G) a scan table-based dequeuer, operably coupled at least to first prioritizer, the second prioritizer, and the third prioritizer, to provide scan table-based dequeueing and transmission of the prioritized information.
Claim 24
Dependent Claim
41 words
The device of claim 19, wherein the scan table-based dequeuer comprises at least a precomputed head-of-line-priority and weighted round-robin based scan table, operably coupled at least to the first prioritizer and the second prioritizer for substantially determining bandwidth allocation for queues.
Claim 25
Dependent Claim
27 words
The device of claim 19, wherein at least one of: A) the first prioritizer comprises a head-of-line prioritizer; and B) the third prioritizer comprises a head-of-line prioritizer.
Claim 26
Dependent Claim
41 words
The device of claim 19, wherein at least some of the digitized speech information includes discard priority information, and wherein the second prioritizer includes at least a packet discarding protocol to utilize the discard priority information to identify packets to discard.
Claim 27
Independent Claim
158 words
A device in a multiplexer for performing a high-rate trunk queueing discipline for different traffic classes in a fast packet network, comprising at least: A) a first receiver, operably coupled to the fast packet network, for receiving substantially continuous bit-rate fast packets from a plurality of first sources; B) a first prioritizer, operably coupled to the first receiver, for prioritizing at least some of the substantially continuous bit-rate fast packets pursuant to a first prioritization method for transmission; C) a second receiver, operably coupled to the fast packet network, for receiving framed data fast packets from plurality of second sources; D) a second prioritizer, operably coupled to the second receiver, for prioritizing at least some of the framed data fast packets pursuant to the first prioritization method for transmission; and E) a scan table-based dequeuer, operably coupled at least to first prioritizer and the second prioritizer, to provide scan table-based dequeueing and transmission of the prioritized fast packets.
Claim 28
Independent Claim
158 words
A device in a multiplexer for performing a high-rate trunk queueing discipline for different traffic classes in a fast packet network, comprising at least: A) a first receiver, operably coupled to the fast packet network, for receiving substantially continuous bit-rate fast packets from a plurality of first sources; B) a first prioritizer, operably coupled to the first receiver, for prioritizing at least some of the substantially continuous bit-rate fast packets pursuant to a first prioritization method for transmission; C) a second receiver, operably coupled to the fast packet network, for receiving framed data fast packets from plurality of second sources; D) a second prioritizer, operably coupled to the second receiver, for prioritizing at least some of the framed data fast packets pursuant to the first prioritization method for transmission; and E) a scan table-based dequeuer, operably coupled at least to first prioritizer and the second prioritizer, to provide scan table-based dequeueing and transmission of the prioritized fast packets.
Claim 29
Dependent Claim
13 words
The device of claim 23, wherein the first prioritizer comprises a head-of-line prioritizer.
Claim 30
Dependent Claim
42 words
The device of claim 23, wherein the scan table-based dequeuer comprises at least a precomputed head-of-line-priority and weighted round-robin based scan table, operably coupled at least to the first prioritizer and the second prioritizer for substantially determining bandwidth allocation for selected queues.
Claim 31
Dependent Claim
55 words
The device of claim 23, wherein: A) at least the first prioritizer comprises a head-of-line prioritizer; and B) the scan table-based bandwidth allocator comprises at least a precomputed head-of-line-priority and weighted round-robin based scan table, operably coupled at least to the first prioritizer and the second prioritizer for substantially determining bandwidth allocation for selected queues.
Claim 32
Independent Claim
159 words
A device in a packet switch for performing a high-rate trunk queueing discipline for different traffic classes in a fast packet network, comprising at least: A) a first receiver, operably coupled to the fast packet network, for receiving substantially continuous bit-rate fast packets from a plurality of first sources; B) a first prioritizer, operably coupled to the first receiver, for prioritizing at least some of the substantially continuous bit-rate fast packets pursuant to a first prioritization method for transmission; C) a second receiver, operably coupled to the fast packet network, for receiving framed data fast packets from plurality of second sources; D) a second prioritizer, operably coupled to the second receiver, for prioritizing at least some of the framed data fast packets pursuant to the first prioritization method for transmission; and E) a scan table-based dequeuer, operably coupled at least to first prioritizer and the second prioritizer, to provide scan table-based dequeueing and transmission of the prioritized fast packets.
Claim 33
Independent Claim
159 words
A device in a packet switch for performing a high-rate trunk queueing discipline for different traffic classes in a fast packet network, comprising at least: A) a first receiver, operably coupled to the fast packet network, for receiving substantially continuous bit-rate fast packets from a plurality of first sources; B) a first prioritizer, operably coupled to the first receiver, for prioritizing at least some of the substantially continuous bit-rate fast packets pursuant to a first prioritization method for transmission; C) a second receiver, operably coupled to the fast packet network, for receiving framed data fast packets from plurality of second sources; D) a second prioritizer, operably coupled to the second receiver, for prioritizing at least some of the framed data fast packets pursuant to the first prioritization method for transmission; and E) a scan table-based dequeuer, operably coupled at least to first prioritizer and the second prioritizer, to provide scan table-based dequeueing and transmission of the prioritized fast packets.
Claim 34
Dependent Claim
13 words
The device of claim 27, wherein the first prioritizer comprises a head-of-line prioritizer.
Claim 35
Dependent Claim
42 words
The device of claim 27, wherein the scan table-based dequeuer comprises at least a precomputed head-of-line-priority and weighted round-robin based scan table, operably coupled at least to the first prioritizer and the second prioritizer for substantially determining bandwidth allocation for selected queues.
Claim 36
Dependent Claim
55 words
The device of claim 27, wherein: A) at least the first prioritizer comprises a head-of-line prioritizer; and B) the scan table-based bandwidth allocator comprises at least a precomputed head-of-line-priority and weighted round-robin based scan table, operably coupled at least to the first prioritizer and the second prioritizer for substantially determining bandwidth allocation for selected queues.
Claim 37
Independent Claim
356 words
A device in a multiplexer for performing a high-rate trunk queueing discipline for different traffic classes in a fast packet network, comprising at least: A) a first receiver, operably coupled to the fast packet network, for receiving continuous bit-rate fast packets from a plurality of first sources; B) first storage means, operably coupled to the first receiver, for storing at least some of the substantially continuous bit-rate fast packets in at least a first queue and a second queue; C) a first prioritizer, operably coupled to the first storage means, for prioritizing at least some of the substantially continuous bit-rate fast packets as stored in the at least first and second queues pursuant to a first prioritization method for transmission; D) a second receiver, operably coupled to the fast packet network, for receiving digitized speech fast packets from a plurality of second sources; E) a second prioritizer, operably coupled to the second receiver, for discarding at least some of the digitized speech fast packets from time to time pursuant to a packet discarding protocol, to provide digitized speech fast packets for transmission; F) a third receiver, operably coupled to the fast packet network, for receiving data fast packets from a plurality of third sources; G) second storage means, operably coupled to the third receiver, for storing at least some of the framed data fast packets in at least a third queue and a fourth queue; H) a third prioritizer, operably coupled to the second storage means, for prioritizing at least some of the framed data fast packets aS stored in the at least third and fourth queues pursuant to a third prioritization method for transmission; I) a scan table-based dequeuer, operably coupled at least to first prioritizer, the second prioritizer, and the third prioritizer, to provide scan table-based dequeueing and transmission of at least substantially continuous bit-rate fast packet, digitized speech fast packets, and framed data fast packets utilizing at least a precomputed head-of-line-priority and weighted round-robin based scan table having scan table-based bandwidth allocation, wherein the scan table-based dequeuer includes a precomputed head-of-line-priority and weighted round-robin based scan table stored in a memory (RAM) device.
Claim 38
Independent Claim
356 words
A device in a multiplexer for performing a high-rate trunk queueing discipline for different traffic classes in a fast packet network, comprising at least: A) a first receiver, operably coupled to the fast packet network, for receiving continuous bit-rate fast packets from a plurality of first sources; B) first storage means, operably coupled to the first receiver, for storing at least some of the substantially continuous bit-rate fast packets in at least a first queue and a second queue; C) a first prioritizer, operably coupled to the first storage means, for prioritizing at least some of the substantially continuous bit-rate fast packets as stored in the at least first and second queues pursuant to a first prioritization method for transmission; D) a second receiver, operably coupled to the fast packet network, for receiving digitized speech fast packets from a plurality of second sources; E) a second prioritizer, operably coupled to the second receiver, for discarding at least some of the digitized speech fast packets from time to time pursuant to a packet discarding protocol, to provide digitized speech fast packets for transmission; F) a third receiver, operably coupled to the fast packet network, for receiving data fast packets from a plurality of third sources; G) second storage means, operably coupled to the third receiver, for storing at least some of the framed data fast packets in at least a third queue and a fourth queue; H) a third prioritizer, operably coupled to the second storage means, for prioritizing at least some of the framed data fast packets aS stored in the at least third and fourth queues pursuant to a third prioritization method for transmission; I) a scan table-based dequeuer, operably coupled at least to first prioritizer, the second prioritizer, and the third prioritizer, to provide scan table-based dequeueing and transmission of at least substantially continuous bit-rate fast packet, digitized speech fast packets, and framed data fast packets utilizing at least a precomputed head-of-line-priority and weighted round-robin based scan table having scan table-based bandwidth allocation, wherein the scan table-based dequeuer includes a precomputed head-of-line-priority and weighted round-robin based scan table stored in a memory (RAM) device.
Claim 39
Dependent Claim
34 words
The device of claim 31, wherein the substantially continuous bit-rate fast packets are stored in the first queue and the second queue as a function in part of a packetization time of CBO sources.
Claim 40
Dependent Claim
42 words
The device of claim 32, wherein the substantially continuous bit-rate fast packets from sources having a relatively small packetization time are stored in the first queue, and the fast packets having a relatively large packetization time are stored in the second queue.
Claim 41
Dependent Claim
34 words
The device of claim 33, wherein substaintially continuous bit-rate fast packets from sources with relatively medium packetization times are stored in additional queues that are served via HOLP with the first and second queues.
Claim 42
Dependent Claim
39 words
The device of claim 31, wherein, for the framed data fast packets, the third queue and the fourth queue for storage are determined as a function, at least in part, of the burst size of the framed data sources.
Claim 43
Dependent Claim
48 words
The device of claim 35, wherein, for framed data fast packets, the third queue is utilized for storage of fast packets from sources having a relatively small burst size, and the fourth queue is utilized for storage of fast packets from sources having a relatively large burst size.
Claim 44
Dependent Claim
33 words
The device of claim 36, wherein framed data fast packets from sources with relatively medium burst sizes are stored in additional queues that are served via HOLP with the third and fourth queues.
Claim 45
Independent Claim
357 words
A device in a packet switch for performing a high-rate trunk queueing discipline for different traffic classes in a fast packet network, comprising at least: A) a first receiver, operably coupled to the fast packet network, for receiving continuous bit-rate fast packets from a plurality of first sources; B) first storage means, operably coupled to the first receiver, for storing at least some of the substantially continuous bit-rate fast packets in at least a first queue and a second queue; C) a first prioritizer, operably coupled to the first storage means, for prioritizing at least some of the substantially continuous bit-rate fast packets as stored in the at least first and second queues pursuant to a first prioritization method for transmission; D) a second receiver, operably coupled to the fast packet network, for receiving digitized speech fast packets from a plurality of second sources; E) a second prioritizer, operably coupled to the second receiver, for discarding at least some of the digitized speech fast packets from time to time pursuant to a packet discarding protocol, to provide digitized speech fast packets for transmission; F) a third receiver, operably coupled to the fast packet network, for receiving data fast packets from a plurality of third sources; G) second storage means, operably coupled to the third receiver, for storing at least some of the framed data fast packets in at least a third queue and a fourth queue; H) a third prioritizer, operably coupled to the second storage means, for prioritizing at least some of the framed data fast packets as stored in the at least third and fourth queues pursuant to a third prioritization method for transmission; I) a scan table-based dequeuer, operably coupled at least to first prioritizer, the second prioritizer, and the third prioritizer, to provide scan table-based dequeueing and transmission of at least substantially continuous bit-rate fast packet, digitized speech fast packets, and framed data fast packets utilizing at least a precomputed head-of-line-priority and weighted round-robin based scan table having scan table-based bandwidth allocation, wherein the scan table-based dequeuer includes a precomputed head-of-line-priority and weighted round-robin based scan table stored in a memory (RAM) device.
Claim 46
Independent Claim
357 words
A device in a packet switch for performing a high-rate trunk queueing discipline for different traffic classes in a fast packet network, comprising at least: A) a first receiver, operably coupled to the fast packet network, for receiving continuous bit-rate fast packets from a plurality of first sources; B) first storage means, operably coupled to the first receiver, for storing at least some of the substantially continuous bit-rate fast packets in at least a first queue and a second queue; C) a first prioritizer, operably coupled to the first storage means, for prioritizing at least some of the substantially continuous bit-rate fast packets as stored in the at least first and second queues pursuant to a first prioritization method for transmission; D) a second receiver, operably coupled to the fast packet network, for receiving digitized speech fast packets from a plurality of second sources; E) a second prioritizer, operably coupled to the second receiver, for discarding at least some of the digitized speech fast packets from time to time pursuant to a packet discarding protocol, to provide digitized speech fast packets for transmission; F) a third receiver, operably coupled to the fast packet network, for receiving data fast packets from a plurality of third sources; G) second storage means, operably coupled to the third receiver, for storing at least some of the framed data fast packets in at least a third queue and a fourth queue; H) a third prioritizer, operably coupled to the second storage means, for prioritizing at least some of the framed data fast packets as stored in the at least third and fourth queues pursuant to a third prioritization method for transmission; I) a scan table-based dequeuer, operably coupled at least to first prioritizer, the second prioritizer, and the third prioritizer, to provide scan table-based dequeueing and transmission of at least substantially continuous bit-rate fast packet, digitized speech fast packets, and framed data fast packets utilizing at least a precomputed head-of-line-priority and weighted round-robin based scan table having scan table-based bandwidth allocation, wherein the scan table-based dequeuer includes a precomputed head-of-line-priority and weighted round-robin based scan table stored in a memory (RAM) device.
Claim 47
Dependent Claim
34 words
The device of claim 38, wherein the substantially continuous bit-rate fast packets are stored in the first queue and the second queue as a function in part of a packetization time of CBO sources.
Claim 48
Dependent Claim
42 words
The device of claim 39, wherein the substantially continuous bit-rate fast packets from sources having a relatively small packetization time are stored in the first queue, and the fast packets having a relatively large packetization time are stored in the second queue.
Claim 49
Dependent Claim
34 words
The device of claim 40, wherein substantially continuous bit-rate fast packets from sources with relatively medium packetization times are stored in additional queues that are served via HOLP with the first and second queues.
Claim 50
Dependent Claim
39 words
The device of claim 41, wherein, for the framed data fast packets, the third queue and the fourth queue for storage are determined as a function, at least in part, of the burst size of the framed data sources.
Claim 51
Dependent Claim
48 words
The device of claim 42, wherein, for framed data fast packets, the third queue is utilized for storage of fast packets from sources having a relatively small burst size, and the fourth queue is utilized for storage of fast packets from sources having a relatively large burst size.
Claim 52
Dependent Claim
33 words
The device of claim 43, wherein framed data fast packets from sources with relatively medium burst sizes are stored in additional queues that are served via HOLP with the third and fourth queues.
Claim 53
Independent Claim
123 words
A method of performing a high-rate trunk queueing discipline for a fast packet network having different traffic classes, comprising the steps of: A) receiving first traffic class fast packets from a plurality of first sources; B) prioritizing at least some of the first traffic class fast packets pursuant to a first prioritization method for transmission; C) receiving second traffic class fast packets from a plurality of second sources, which second traffic class is different from the first traffic class; D) prioritizing at least some of the second traffic class fast packets for transmission pursuant to a second prioritization method that is different from the first prioritization method; E) scan table-based dequeueing and transmitting at least the first and second traffic class fast packets.
Claim 54
Independent Claim
123 words
A method of performing a high-rate trunk queueing discipline for a fast packet network having different traffic classes, comprising the steps of: A) receiving first traffic class fast packets from a plurality of first sources; B) prioritizing at least some of the first traffic class fast packets pursuant to a first prioritization method for transmission; C) receiving second traffic class fast packets from a plurality of second sources, which second traffic class is different from the first traffic class; D) prioritizing at least some of the second traffic class fast packets for transmission pursuant to a second prioritization method that is different from the first prioritization method; E) scan table-based dequeueing and transmitting at least the first and second traffic class fast packets.
Claim 55
Dependent Claim
35 words
The method of claim 45, wherein the step of scan table-based dequeueing comprises at least a step of utilizing a precomputed head-of-line-priority and weighted round-robin based scan table for substantially determining bandwidth allocation for queues.
Claim 56
Dependent Claim
67 words
The method of claim 45, further including the step of: A) receiving third traffic class fast packets from a plurality of third sources, which third traffic class is different from the first and second traffic classes; and B) prioritizing at least some of the third traffic class fast packets for transmission pursuant to a third prioritization method that is different from the first and second prioritization methods.
Claim 57
Dependent Claim
15 words
The method of claim 45, wherein the first prioritization method includes a head-of-line prioritization method.
Claim 58
Dependent Claim
15 words
The method of claim 48, wherein the second prioritization method includes a packet discarding protocol.
Claim 59
Dependent Claim
39 words
The method of claim 49, wherein the packet discarding protocol includes the step of comparing a discard priority for a selected fast packet of a selected fast packet queue with queue depth of at least one fast packet queue.
Claim 60
Dependent Claim
15 words
The method of claim 47, wherein the third prioritization method includes a head-of-line prioritization method.
Claim 61
Independent Claim
93 words
A method for performing a high-rate trunk queueing discipline for different traffic classes in a fast packet network, comprising the steps of: A) receiving differing traffic class fast packets; B) prioritizing at least some of the fast packets for transmission as a function, at least in part, of a first prioritization method; and C) selecting at least some of the prioritized fast packets for transmission as a function, at least in part of a scan table-based bandwidth allocation method, different from the first prioritization method, to provide queued prioritized traffic class fast packets.
Claim 62
Independent Claim
93 words
A method for performing a high-rate trunk queueing discipline for different traffic classes in a fast packet network, comprising the steps of: A) receiving differing traffic class fast packets; B) prioritizing at least some of the fast packets for transmission as a function, at least in part, of a first prioritization method; and C) selecting at least some of the prioritized fast packets for transmission as a function, at least in part of a scan table-based bandwidth allocation method, different from the first prioritization method, to provide queued prioritized traffic class fast packets.
Claim 63
Dependent Claim
36 words
The method of claim 52, wherein the scan table-based bandwidth allocation method comprises at least the step of utilizing a precomputed head-of-line-priority and weighted round-robin based scan table for substantially determining bandwidth allocation for selected queues.
Claim 64
Dependent Claim
19 words
The method of claim 52, further including a step of transmitting prioritized traffic class fast packets in allocated bandwidths.
Claim 65
Dependent Claim
50 words
The method of claim 52, wherein: A) at least the first prioritization method includes a head-of-line prioritization method; and B) the scan table-based bandwidth allocation method includes a step of utilizing at least a precomputed head-of-line-priority and weighted round-robin based scan table for substantially determining bandwidth allocation for selected queues.
Claim 66
Independent Claim
153 words
A method in one of: a multiplexer and a packet switch, for performing a high-rate trunk queueing discipline for different traffic classes in a fast packet network, comprising at least the steps of: A) receiving at least some substantially continuous bit-rate fast packets from a plurality of first sources; B) prioritizing at least some of the substantially continuous bit-rate fast packets pursuant to a first prioritization method for transmission; C) receiving digitized speech fast packets from a plurality of second sources; D) prioritizing at least some of the digitized speech fast packets pursuant to a second prioritization method for transmission; E) receiving framed data fast packets from plurality of third sources; F) prioritizing at least some of the framed data fast packets pursuant to a third prioritization method for transmission; and G) scan table-based dequeueing and transmitting the prioritized substantially continuous bit-rate fast packets, digitized speech fast packets, and framed data fast packets.
Claim 67
Independent Claim
153 words
A method in one of: a multiplexer and a packet switch, for performing a high-rate trunk queueing discipline for different traffic classes in a fast packet network, comprising at least the steps of: A) receiving at least some substantially continuous bit-rate fast packets from a plurality of first sources; B) prioritizing at least some of the substantially continuous bit-rate fast packets pursuant to a first prioritization method for transmission; C) receiving digitized speech fast packets from a plurality of second sources; D) prioritizing at least some of the digitized speech fast packets pursuant to a second prioritization method for transmission; E) receiving framed data fast packets from plurality of third sources; F) prioritizing at least some of the framed data fast packets pursuant to a third prioritization method for transmission; and G) scan table-based dequeueing and transmitting the prioritized substantially continuous bit-rate fast packets, digitized speech fast packets, and framed data fast packets.
Claim 68
Dependent Claim
43 words
The method of claim 56, wherein the step of scan table-based dequeueing comprises at least a precomputed head-of-line-priority and weighted round-robin based scan table, operably coupled at least to the first prioritizer and the second prioritizer for substantially determining bandwidth allocation for queues.
Claim 69
Dependent Claim
31 words
The method of claim 56, wherein at least one of: A) the first prioritization method includes a head-of-line prioritization method; and B) the third prioritization method includes a head-of-line prioritization method.
Claim 70
Dependent Claim
42 words
The method of claim 56, wherein at least some of the digitized speech fast packets include discard priority information, and wherein the second prioritizer includes at least a packet discarding protocol to utilize the discard priority information to identify packets to discard.
Claim 71
Independent Claim
109 words
A method in a one of: a multiplexer and a packet switch, for performing a high-rate trunk queueing discipline for different traffic classes in a fast packet network, comprising at least the steps of: A) receiving substantially continuous bit-rate fast packets from a plurality of first sources; B) prioritizing at least some of the substantially continuous bit-rate fast packets pursuant to a first prioritization method for transmission; C) receiving framed data fast packets from plurality of second sources; D) prioritizing at least some of the framed data fast packets pursuant to the first prioritization method for transmission; and E) scan table-based dequeueing and transmission of the prioritized fast packets.
Claim 72
Independent Claim
109 words
A method in a one of: a multiplexer and a packet switch, for performing a high-rate trunk queueing discipline for different traffic classes in a fast packet network, comprising at least the steps of: A) receiving substantially continuous bit-rate fast packets from a plurality of first sources; B) prioritizing at least some of the substantially continuous bit-rate fast packets pursuant to a first prioritization method for transmission; C) receiving framed data fast packets from plurality of second sources; D) prioritizing at least some of the framed data fast packets pursuant to the first prioritization method for transmission; and E) scan table-based dequeueing and transmission of the prioritized fast packets.
Claim 73
Dependent Claim
15 words
The method of claim 60, wherein the first prioritization method includes a head-of-line prioritization method.
Claim 74
Dependent Claim
38 words
The method of claim 60, wherein the step of scan table-based dequeueing includes at least a step of utilizing at least a precomputed head-of-line-priority and weighted round-robin based scan table for substantially determining bandwidth allocation for selected queues.
Claim 75
Dependent Claim
51 words
The method of claim 60, wherein: A) at least the first prioritization method comprises a head-of-line prioritization method; and B) the scan table-based dequeueing step includes at least a step of utilizing at least a precomputed head-of-line-priority and weighted round-robin based scan table for substantially determining bandwidth allocation for selected queues.
Claim 76
Independent Claim
260 words
A method in one of: a multiplexer and a packet switch, for performing a high-rate queueing discipline for different traffic classes in a fast packet network, comprising at least the steps of: A) receiving continuous bit-rate fast packets from a plurality of first sources; B) storing at least some of the substantially continuous bit-rate fast packets in at least a first queue and a second queue; C) prioritizing at least some of the substantially continuous bit-rate fast packets as stored in the at least first and second queues pursuant to a first prioritization method for transmission; D) receiving digitized speech fast packets from a plurality of second sources; E) discarding at least some of the digitized speech fast packets from time to time pursuant to a packet discarding protocol, to provide digitized speech fast packets for transmission; F) receiving data fast packets from a plurality of third sources; G) storing at least some of the framed data fast packets in at least a third queue and a fourth queue; H) prioritizing at least some of the framed data fast packets as stored in the at least third and fourth queues pursuant to a third prioritization method for transmission; I) scan table-based dequeueing and transmitting at least substantially continuous bit-rate fast packets, digitized speech fast packets, and framed data fast packets utilizing at least a precomputed head-of-line-priority and weighted round-robin based scan table having scan table-based bandwidth allocation, wherein the step of scan table-based dequeueing utilizes a precomputed head-of-line-priority and weighted round-robin based scan table stored in a memory (RAM) device.
Claim 77
Independent Claim
260 words
A method in one of: a multiplexer and a packet switch, for performing a high-rate queueing discipline for different traffic classes in a fast packet network, comprising at least the steps of: A) receiving continuous bit-rate fast packets from a plurality of first sources; B) storing at least some of the substantially continuous bit-rate fast packets in at least a first queue and a second queue; C) prioritizing at least some of the substantially continuous bit-rate fast packets as stored in the at least first and second queues pursuant to a first prioritization method for transmission; D) receiving digitized speech fast packets from a plurality of second sources; E) discarding at least some of the digitized speech fast packets from time to time pursuant to a packet discarding protocol, to provide digitized speech fast packets for transmission; F) receiving data fast packets from a plurality of third sources; G) storing at least some of the framed data fast packets in at least a third queue and a fourth queue; H) prioritizing at least some of the framed data fast packets as stored in the at least third and fourth queues pursuant to a third prioritization method for transmission; I) scan table-based dequeueing and transmitting at least substantially continuous bit-rate fast packets, digitized speech fast packets, and framed data fast packets utilizing at least a precomputed head-of-line-priority and weighted round-robin based scan table having scan table-based bandwidth allocation, wherein the step of scan table-based dequeueing utilizes a precomputed head-of-line-priority and weighted round-robin based scan table stored in a memory (RAM) device.
Claim 78
Dependent Claim
48 words
The method of claim 64, wherein the step of storing at least some of the substantially continuous bit-rate fast packets utilizes a method of storing the fast packets in the first queue and the second queue as a function in part of a packetization time of CBO sources.
Claim 79
Dependent Claim
42 words
The method of claim 65, wherein the substantially continuous bit-rate fast packets from sources having a relatively small packetization time are stored in the first queue, and the fast packets having a relatively large packetization time are stored in the second queue.
Claim 80
Dependent Claim
34 words
The method of claim 66, wherein substantially continuous bit-rate fast packets from sources with relatively medium packetization times are stored in additional queues that are served via HOLP with the first and second queues.
Claim 81
Dependent Claim
47 words
The method of claim 64, wherein, for the step of storing at least some of the framed data fast packets, the third queue and the fourth queue for storage are determined as a function, at least in part, of the burst size of the framed data sources.
Claim 82
Dependent Claim
48 words
The method of claim 68, wherein, for framed data fast packets, the third queue is utilized for storage of fast packets from sources having a relatively small burst size, and the fourth queue is utilized for storage of fast packets from sources having a relatively large burst size.
Claim 83
Dependent Claim
33 words
The method of claim 69, wherein framed data fast packets from sources with relatively medium burst sizes are stored in additional queues that are served via HOLP with the third and fourth queues.
References Cited (Backward Citations)
US4623996A
Cited
US4771424A
Cited
US4901348A
Cited
US4868813A
Cited
US4862454A
Cited
US4914650A
Cited
US5001702A
Cited
US5128924A
Cited
USPTO Annuity & Maintenance Windows
| Annuity Stage | Window Opens | Payment Deadline | Surcharge Period Until | Estimated Fee | Status |
|---|---|---|---|---|---|
| 3.5 Years (Year 4) | 1996-12-06 | 1997-06-07 | 1997-12-07 | $2000.00 | Window Closed / Lapsed |
| 7.5 Years (Year 8) | 2000-12-06 | 2001-06-07 | 2001-12-07 | $3760.00 | Window Closed / Lapsed |
| 11.5 Years (Year 12) | 2004-12-06 | 2005-06-07 | 2005-12-07 | $7700.00 | Window Closed / Lapsed |