← Back to Patent Explorer
US6167050A Expired / Lapsed US ⏱️ 0.0 years remaining

User traffic control apparatus for asynchronous transfer mode networks

Assignee: Samsung Electronics Co Ltd
•
Filing: 1998-04-08
•
Granted: 2000-12-26
•
Expires: 2018-04-08
📄 Original PDF 🌐 Google Patents 🔄 Sync Now

Abstract

Abstract An ATM user traffic control apparatus adopts an MBEA (most behind expected arrival) multiplexing mechanism for UNI (User-to-Network Interface) and adaptively controls ATM traffic streams that a plurality of traffic sources send into a UPC (Usage Parameter Control) unit of an ATM network in consideration of traffic priorities of the traffic streams. The traffic control apparatus is provided with a plurality of small leaky bucket buffers and a plurality of virtual bucket buffers corresponding to the leaky buckets, respectively. A pair of leaky and virtual buckets are provided for each traffic source. The apparatus also includes a detection unit that detects whether the cells drained from the leaky buckets are conforming cells and provides information regarding the traffic streams where there exist conforming cells. A calculation unit for calculating the values of priority functions of the traffic streams with the conforming cells, and a priority determination unit for determining a top priority traffic stream by comparing the priority function values are provided for the apparatus. An ATM service multiplexer sends the top priority traffic stream to the UPC unit in preference to the other streams.

Inventors

  • 👤 Jun-gun Chung

Bibliographic Details

Application Number —
Jurisdiction US
Data Source google_patents
Last Synchronized 2026-11-07 18:14
CPC Classifications
H; H04; H04L; H04L12/00; H04L12/28; H04L12/42; H04L12/427; H04L12/433; H04Q; H04Q11/00; H04Q11/04; H04Q11/0428; H04Q11/0478; H04L12/54; H04L12/56; H04L12/5601; H04L2012/5629; H04L2012/5631; H04L2012/5636; H04L2012/5637; H04L2012/5638; H04L2012/5646; H04L2012/5651

Claims Analysis

Total Claims: 7
Claim 1
Independent Claim 311 words
An apparatus for controlling asynchronous transfer mode (ATM) traffic streams that a plurality of traffic sources (TS1, TS2, . . . , and TSn) send into a UPC (Usage Parameter Control) unit of an ATM network the apparatus, comprising: a plurality of leaky bucket buffers (LB1, LB2, . . . , and LBn) each being filled with incoming ATM cells from a corresponding traffic source (TSi) (where, i=1, 2, . . . , or n) but, at the same time, draining an average number of cells per a given time slot, wherein said each leaky bucket (LBi) has a bucket level L i (t) (where, t represents an arbitrary time) proportional to the number of the ATM cells filled therein; a plurality of virtual bucket buffers (VB1, VB2, . . . , and VBn) corresponding to said leaky buckets (LB1, LB2, . . . , and LBn), respectively, wherein said each virtual bucket (VBi) has a bucket level R i (t) of a maximum value while a corresponding leaky bucket (LBi) is filled with at least one ATM cell and has the bucket level R i (t) of a value less than the maximum value thereof and inversely proportional to a time having been elapsed since said corresponding leaky bucket (LBi) has been empty; detection means for detecting whether the cells drained from said leaky buckets are the conforming cells and for providing information regarding traffic streams where there exist conforming cells; calculation means for calculating a value of priority function η i (t) corresponding to the traffic streams having the conforming cells by η i (t)=L i (t)-R i (t); priority determination means for determining a top priority traffic stream by comparing the priority function values η i (t); and ATM multiplexing means for sending the top priority traffic stream to said UPC unit in preference to the other streams.
Claim 2
Independent Claim 311 words
An apparatus for controlling asynchronous transfer mode (ATM) traffic streams that a plurality of traffic sources (TS1, TS2, . . . , and TSn) send into a UPC (Usage Parameter Control) unit of an ATM network the apparatus, comprising: a plurality of leaky bucket buffers (LB1, LB2, . . . , and LBn) each being filled with incoming ATM cells from a corresponding traffic source (TSi) (where, i=1, 2, . . . , or n) but, at the same time, draining an average number of cells per a given time slot, wherein said each leaky bucket (LBi) has a bucket level L i (t) (where, t represents an arbitrary time) proportional to the number of the ATM cells filled therein; a plurality of virtual bucket buffers (VB1, VB2, . . . , and VBn) corresponding to said leaky buckets (LB1, LB2, . . . , and LBn), respectively, wherein said each virtual bucket (VBi) has a bucket level R i (t) of a maximum value while a corresponding leaky bucket (LBi) is filled with at least one ATM cell and has the bucket level R i (t) of a value less than the maximum value thereof and inversely proportional to a time having been elapsed since said corresponding leaky bucket (LBi) has been empty; detection means for detecting whether the cells drained from said leaky buckets are the conforming cells and for providing information regarding traffic streams where there exist conforming cells; calculation means for calculating a value of priority function η i (t) corresponding to the traffic streams having the conforming cells by η i (t)=L i (t)-R i (t); priority determination means for determining a top priority traffic stream by comparing the priority function values η i (t); and ATM multiplexing means for sending the top priority traffic stream to said UPC unit in preference to the other streams.
Claim 3
Dependent Claim 51 words
The apparatus according to claim 1, wherein the maximum and the minimum values of the each virtual bucket level R i (t) are zero and a predetermined minus value, respectively; and said priority determination means takes a traffic stream with the smallest priority function value to be the top priority stream.
Claim 4
Dependent Claim 39 words
The apparatus according to claim 2, wherein said priority determination means determines the top priority stream by comparing the virtual bucket levels R i (t) when there are at least two traffic streams having the same priority function value.
Claim 5
Independent Claim 255 words
A method for controlling asynchronous transfer mode (ATM) traffic streams arriving at a usage parameter control (UPC) unit in an ATM network, the method comprising: buffering incoming ATM cells from each of a plurality of traffic sources producing ATM traffic streams into a corresponding leaky bucket buffer LB i ; draining an average number of cells from each bucket LB i during a given time slot, wherein each leaky bucket buffer LB i has a bucket level L i (t) proportional to a number of ATM cells present in the buffer LB i ; calculating a virtual bucket level R i (t) corresponding to each leaky bucket buffer LB i , where R i (t) is set to a predetermined maximum value when at least one cell is present in the corresponding leaky bucket LB i and where R i (t) is inversely proportional to an elapsed time since the corresponding leaky bucket buffer LB i has been empty when the bucket LB i is empty; detecting whether the ATM cells drained from each leaky bucket buffer LB i are conforming cells in order to identify traffic sources having conforming cells; calculating a value of priority function η i (t) corresponding to the identified traffic streams having conforming cells using the equation η i (t)=L i (t)-R i (t); determining a top priority traffic source by comparing the priority function values η i (t) of the identified traffic streams having conforming cells; and selecting the top priority traffic stream for routing to the UPC unit.
Claim 6
Independent Claim 255 words
A method for controlling asynchronous transfer mode (ATM) traffic streams arriving at a usage parameter control (UPC) unit in an ATM network, the method comprising: buffering incoming ATM cells from each of a plurality of traffic sources producing ATM traffic streams into a corresponding leaky bucket buffer LB i ; draining an average number of cells from each bucket LB i during a given time slot, wherein each leaky bucket buffer LB i has a bucket level L i (t) proportional to a number of ATM cells present in the buffer LB i ; calculating a virtual bucket level R i (t) corresponding to each leaky bucket buffer LB i , where R i (t) is set to a predetermined maximum value when at least one cell is present in the corresponding leaky bucket LB i and where R i (t) is inversely proportional to an elapsed time since the corresponding leaky bucket buffer LB i has been empty when the bucket LB i is empty; detecting whether the ATM cells drained from each leaky bucket buffer LB i are conforming cells in order to identify traffic sources having conforming cells; calculating a value of priority function η i (t) corresponding to the identified traffic streams having conforming cells using the equation η i (t)=L i (t)-R i (t); determining a top priority traffic source by comparing the priority function values η i (t) of the identified traffic streams having conforming cells; and selecting the top priority traffic stream for routing to the UPC unit.
Claim 7
Dependent Claim 89 words
The method of claim 4, wherein: the step of calculating a virtual bucket level R i (t) corresponding to each leaky bucket buffer LB i further comprises: setting the maximum value of the each virtual bucket level R i (t) to zero, and setting a minimum value of the each virtual bucket level R i (t) to a predetermined minus value; and the step of determining a top priority traffic source further comprises selecting the traffic stream having the smallest priority function value to be the top priority stream.

References Cited (Backward Citations)

US5295135A Cited
US5339332A Cited
US5381407A Cited
US5448567A Cited
US5526345A Cited
US5533020A Cited
US5559798A Cited
US5796719A Cited
US5596576A Cited
US5793747A Cited
US5745490A Cited
US5978356A Cited

USPTO Annuity & Maintenance Windows

Annuity Stage Window Opens Payment Deadline Surcharge Period Until Estimated Fee Status
3.5 Years (Year 4) 2003-12-26 2004-06-26 2004-12-26 $2000.00 Window Closed / Lapsed
7.5 Years (Year 8) 2007-12-26 2008-06-26 2008-12-26 $3760.00 Window Closed / Lapsed
11.5 Years (Year 12) 2011-12-26 2012-06-26 2012-12-26 $7700.00 Window Closed / Lapsed

Assigned Categories & Tags

No categories assigned to this patent yet.

Assign Category Tag