US5675573A
Expired / Lapsed
US
⏱️ 0.0 years remaining
Delay-minimizing system with guaranteed bandwidth delivery for real-time traffic
Assignee: Nokia of America Corp
•
Filing: 1995-03-22
•
Granted: 1997-10-07
•
Expires: 2015-03-22
Abstract
Abstract A bandwidth allocation system allows packets or cells within traffic flows from different sources contending for access to a shared processing fabric to get access to that fabric in an order that is determined primarily on individual guaranteed bandwidth requirements associated with each traffic flow, and secondarily on overall system criteria, such as a time of arrival, or due date of packets or cells within traffic flows.
Inventors
- 👤 Mark John Karol
- 👤 Pramod Pancha
Bibliographic Details
Application Number
—
Jurisdiction
US
Data Source
google_patents
Last Synchronized
2026-11-02 00:26
CPC Classifications
H; H04; H04L; H04L49/00; H04L49/30; H04L12/00; H04L12/54; H04L12/56; H04L12/5601; H04L12/5602; H04L49/25; H04L49/253; H04L49/254; H04L49/3081; H04L2012/5638; H04L2012/5646; H04L2012/5649; H04L2012/5651; H04L2012/5678; H04L2012/5679; H04L49/20; H04L49/205
Claims Analysis
Total Claims: 20
Claim 1
Independent Claim
135 words
A method of allocating bandwidth within a contention cycle to information packets originating from traffic sources competing for access to a data network, the method comprising the steps of: receiving the information packets from the traffic sources and storing the information packets in one or more source queues, each of the stored information packets having a respective predefined quality of service parameter, assigning any information packet stored in one of the source queues and having a quality of service parameter greater than a predetermined value to a guaranteed service queue; allocating bandwidth of the data network to at least one of the information packets assigned to the guaranteed service queue; and if the guaranteed service queue is empty, allocating the bandwidth to the information packets stored in the source queue according to a predetermined criterion.
Claim 2
Independent Claim
135 words
A method of allocating bandwidth within a contention cycle to information packets originating from traffic sources competing for access to a data network, the method comprising the steps of: receiving the information packets from the traffic sources and storing the information packets in one or more source queues, each of the stored information packets having a respective predefined quality of service parameter, assigning any information packet stored in one of the source queues and having a quality of service parameter greater than a predetermined value to a guaranteed service queue; allocating bandwidth of the data network to at least one of the information packets assigned to the guaranteed service queue; and if the guaranteed service queue is empty, allocating the bandwidth to the information packets stored in the source queue according to a predetermined criterion.
Claim 3
Dependent Claim
15 words
The method of claim 1 wherein said predetermined criterion is determined on a first-come-first-serve basis.
Claim 4
Dependent Claim
12 words
The method of claim 1 wherein said traffic sources are respective sub-networks.
Claim 5
Independent Claim
226 words
A method of allocating bandwidth within a contention cycle to information packets originating from traffic sources competing for access to a data network, the method comprising the steps of: receiving the information packets from the traffic sources and storing the information packets in one or more source queues, each of the stored information packets having a respective predefined quality of service parameter; assigning any information packet having a quality of service parameter greater than a predetermined value to a guaranteed service queue; allocating bandwidth of the data network to one of the information packets assigned to the guaranteed service queue; if the guaranteed service queue is empty, allocating the bandwidth to the remaining information packets according to a predetermined criterion; assigning a counter of a predetermined value to each traffic source; decrementing said counter by a counter rate determined as a function of the data network bandwidth that is to be allocated to the traffic source to satisfy the quality of service assigned to the traffic source, said decrementing step taking place only when a contending information packet from one of said traffic sources cannot be allocated bandwidth of the data network within a time slot; and allocating said bandwidth to an information packet received from one of the traffic sources if the counter assigned to that traffic source is less than or equal to zero.
Claim 6
Independent Claim
226 words
A method of allocating bandwidth within a contention cycle to information packets originating from traffic sources competing for access to a data network, the method comprising the steps of: receiving the information packets from the traffic sources and storing the information packets in one or more source queues, each of the stored information packets having a respective predefined quality of service parameter; assigning any information packet having a quality of service parameter greater than a predetermined value to a guaranteed service queue; allocating bandwidth of the data network to one of the information packets assigned to the guaranteed service queue; if the guaranteed service queue is empty, allocating the bandwidth to the remaining information packets according to a predetermined criterion; assigning a counter of a predetermined value to each traffic source; decrementing said counter by a counter rate determined as a function of the data network bandwidth that is to be allocated to the traffic source to satisfy the quality of service assigned to the traffic source, said decrementing step taking place only when a contending information packet from one of said traffic sources cannot be allocated bandwidth of the data network within a time slot; and allocating said bandwidth to an information packet received from one of the traffic sources if the counter assigned to that traffic source is less than or equal to zero.
Claim 7
Dependent Claim
40 words
The invention of claim 4 further comprising the step of: resetting the counter assigned to a respective one of the traffic sources to a predetermined value when said bandwidth is allocated to an information packet originating from that traffic source.
Claim 8
Dependent Claim
13 words
The invention of claim 1 wherein said data network is a switching system.
Claim 9
Dependent Claim
118 words
A communications apparatus comprising: a plurality of queuing means for storing information packets received from a plurality of traffic sources contending for access to a shared fabric; means for reassigning one of said stored information packets to a guaranteed service queue for as-soon as possible access to the shared fabric, the selection being based on a predetermined service guarantee associated with that one of said traffic sources from which said one of said information packets was received; means, responsive to a signal indicative of unused bandwidth on the shared fabric after said one of said information packets has accessed the shared fabric, for allocating bandwidth to another one of the stored information packets based on a predetermined criterion.
Claim 10
Dependent Claim
118 words
A communications apparatus comprising: a plurality of queuing means for storing information packets received from a plurality of traffic sources contending for access to a shared fabric; means for reassigning one of said stored information packets to a guaranteed service queue for as-soon as possible access to the shared fabric, the selection being based on a predetermined service guarantee associated with that one of said traffic sources from which said one of said information packets was received; means, responsive to a signal indicative of unused bandwidth on the shared fabric after said one of said information packets has accessed the shared fabric, for allocating bandwidth to another one of the stored information packets based on a predetermined criterion.
Claim 11
Dependent Claim
25 words
The invention of claim 7 wherein said predetermined criterion is selected from a group consisting of a first-come-first-serve criterion and earliest-due-date of information packet criterion.
Claim 12
Dependent Claim
19 words
The invention of claim 7 wherein said traffic sources are subnetworks and said shared fabric is a backbone network.
Claim 13
Dependent Claim
230 words
A communications apparatus comprising: a plurality of queuing means for storing information packets received from a plurality of traffic sources contending for access to a shared fabric; means for reassigning one of said stored information packets to a guaranteed service queue for as-soon as possible access to the shared fabric, the selection being based on a predetermined service guarantee associated with that one of said traffic sources from which said one of said information packets was received; means, responsive to a signal indicative of unused bandwidth on the shared fabric after said one of said information packets has accessed the shared fabric, for allocating bandwidth to another one of the stored information packets based on a predetermined criterion; means for assigning a counter of a predetermined value to each of said traffic sources; means for decrementing said counter by a counter rate that is determined as a function of the bandwidth that needs to be allocated to the respective traffic source to satisfy the associated service guarantee, said decrementing means being operative only when a contending information packet from another one of said traffic sources cannot granted access to the shared fabric within a time slot; and allocating said bandwidth of the shared fabric to an information packet received from one of the traffic sources if the counter for that traffic source is a less than or equal to zero.
Claim 14
Dependent Claim
230 words
A communications apparatus comprising: a plurality of queuing means for storing information packets received from a plurality of traffic sources contending for access to a shared fabric; means for reassigning one of said stored information packets to a guaranteed service queue for as-soon as possible access to the shared fabric, the selection being based on a predetermined service guarantee associated with that one of said traffic sources from which said one of said information packets was received; means, responsive to a signal indicative of unused bandwidth on the shared fabric after said one of said information packets has accessed the shared fabric, for allocating bandwidth to another one of the stored information packets based on a predetermined criterion; means for assigning a counter of a predetermined value to each of said traffic sources; means for decrementing said counter by a counter rate that is determined as a function of the bandwidth that needs to be allocated to the respective traffic source to satisfy the associated service guarantee, said decrementing means being operative only when a contending information packet from another one of said traffic sources cannot granted access to the shared fabric within a time slot; and allocating said bandwidth of the shared fabric to an information packet received from one of the traffic sources if the counter for that traffic source is a less than or equal to zero.
Claim 15
Dependent Claim
42 words
The invention of claim 10 further comprising means for resetting the counter assigned to a respective one of the traffic sources to the predetermined value when the bandwidth of the shared fabric is allocated to an information packet from that traffic source.
Claim 16
Independent Claim
135 words
A method of allocating bandwidth of a shared fabric to information packets within traffic flows, said information packets being received from respective traffic sources contending for access to the shared fabric, the method comprising the steps of: storing the information packets in data queues as they are received from said sources, evaluating contending stored information packets received within a traffic flow from respective traffic sources in which said evaluating is based on predetermined bandwidth guarantees associated with said traffic flow; allocating bandwidth to at least one stored information packet based on said evaluation by associating the at least one stored information packet with a guaranteed service queue; and if unused bandwidth is still available on said shared fabric allocating bandwidth to at least one other stored information packet based on at least one predetermined criterion.
Claim 17
Independent Claim
135 words
A method of allocating bandwidth of a shared fabric to information packets within traffic flows, said information packets being received from respective traffic sources contending for access to the shared fabric, the method comprising the steps of: storing the information packets in data queues as they are received from said sources, evaluating contending stored information packets received within a traffic flow from respective traffic sources in which said evaluating is based on predetermined bandwidth guarantees associated with said traffic flow; allocating bandwidth to at least one stored information packet based on said evaluation by associating the at least one stored information packet with a guaranteed service queue; and if unused bandwidth is still available on said shared fabric allocating bandwidth to at least one other stored information packet based on at least one predetermined criterion.
Claim 18
Independent Claim
150 words
A method of allocating bandwidth of a shared fabric to information packets within traffic flows, said information packets being received from respective traffic sources contending for access to the shared fabric, the method comprising the steps of: evaluating contending information packets received within a traffic flow from respective traffic sources in which said evaluating is based on predetermined bandwidth guarantees associated with said traffic flow; allocating bandwidth to at least one information packet based on said evaluation; if unused bandwidth is still available on said shared fabric allocating bandwidth to at least one other information packet based on at least one predetermined criterion; determining a value of a counter associated with each of said traffic sources; and allocating bandwidth to a contending information packet if said counter for the respective one of said traffic sources from which said contending information packet was received is less than or equal to zero.
Claim 19
Independent Claim
150 words
A method of allocating bandwidth of a shared fabric to information packets within traffic flows, said information packets being received from respective traffic sources contending for access to the shared fabric, the method comprising the steps of: evaluating contending information packets received within a traffic flow from respective traffic sources in which said evaluating is based on predetermined bandwidth guarantees associated with said traffic flow; allocating bandwidth to at least one information packet based on said evaluation; if unused bandwidth is still available on said shared fabric allocating bandwidth to at least one other information packet based on at least one predetermined criterion; determining a value of a counter associated with each of said traffic sources; and allocating bandwidth to a contending information packet if said counter for the respective one of said traffic sources from which said contending information packet was received is less than or equal to zero.
Claim 20
Dependent Claim
48 words
The method of claim 13 further comprising the step of: decrementing the counter for said respective source traffic source by a counter rate that is determined as a function of the bandwidth that needs to be allocated to that traffic source to satisfy the associated bandwidth service guarantees.
References Cited (Backward Citations)
US5140584A
Cited
US5050161A
Cited
US5231633A
Cited
US5150358A
Cited
US5390176A
Cited
US5268900A
Cited
US5432790A
Cited
US5499238A
Cited
USPTO Annuity & Maintenance Windows
| Annuity Stage | Window Opens | Payment Deadline | Surcharge Period Until | Estimated Fee | Status |
|---|---|---|---|---|---|
| 3.5 Years (Year 4) | 2000-10-06 | 2001-04-07 | 2001-10-07 | $2000.00 | Window Closed / Lapsed |
| 7.5 Years (Year 8) | 2004-10-06 | 2005-04-07 | 2005-10-07 | $3760.00 | Window Closed / Lapsed |
| 11.5 Years (Year 12) | 2008-10-06 | 2009-04-07 | 2009-10-07 | $7700.00 | Window Closed / Lapsed |