US5581544A
Expired / Lapsed
US
⏱️ 0.0 years remaining
Method and apparatus for evaluating QOS in ATM multiplexing apparatus in which priority control is performed and for controlling call admissions and optimizing priority control on the basis of the evaluation
Assignee: Fujitsu Ltd
•
Filing: 1994-09-27
•
Granted: 1996-12-03
•
Expires: 2014-09-27
Abstract
Abstract A probability transition matrix S t is formulated that expresses a multiplexing process which includes nested threshold priority control and classified priority control. A state equation using the matrix S t is solved by substituting therein upper and lower bounds of a probability distribution of a cell arrival count a t in an average time series, to calculate a probability distribution of a cell length in a buffer. From the thus calculated cell length probability distribution, the QOS is evaluated on a priority class basis. Based on the QOS evaluation, optimization of call admission control and priority control is accomplished.
Inventors
- 👤 Takeo Hamada
- 👤 Takafumi Chujo
Bibliographic Details
Application Number
—
Jurisdiction
US
Data Source
google_patents
Last Synchronized
2026-10-24 08:19
CPC Classifications
H; H04; H04Q; H04Q11/00; H04Q11/04; H04Q11/0428; H04Q11/0478; H04J; H04J3/00; H04J3/24; H04J3/247; H04L; H04L12/00; H04L12/54; H04L12/56; H04L12/5601; H04L2012/5629; H04L2012/5631; H04L2012/5632; H04L2012/5638; H04L2012/564; H04L2012/5646; H04L2012/5651; H04L2012/5672
Claims Analysis
Total Claims: 20
Claim 1
Independent Claim
336 words
A method of controlling admission of a requested call in an ATM multiplexing apparatus in which priority control is performed, comprising the steps of: a) storing data concerning upper and lower bounds of a probability distribution of the number of arrivals for each of a plurality of values of an arrival rate; b) determining upper and lower bounds of a probability distribution of the arrival rate in a call admitted state where the requested call is added to already admitted calls; c) for each of a plurality of appearance values of the arrival rate, determining by reference to the data stored in step a) the upper and lower bounds of the probability distribution of the number of arrivals occurring along upper and lower bounds of an average time series averaged over possible time series from an average arrival rate to the appearance value; d) calculating upper and lower bounds of a probability distribution of a cell length corresponding to each of said plurality of appearance values of the arrival rate by solving a state equation formulating a cell multiplexing process including the priority control by substituting into said state equation the upper and lower bounds of the probability distribution of the number of arrivals determined in step c); e) calculating upper and lower limit values of QOS parameters for each of said plurality of appearance values of the arrival rate by using the upper and lower bounds of the cell length probability distribution calculated in step d); f) evaluating the QOS by calculating a weighted average of the upper and lower limit values calculated in step e) by using the upper and lower bounds of the arrival rate probability distribution determined in step b); g) judging whether to admit or reject the requested call on the basis of said evaluated QOS; h) rejecting the requested call when the requested call is judged to be rejected in step g); and i) admitting the requested call when the requested call is judged to be admitted in step g).
Claim 2
Independent Claim
336 words
A method of controlling admission of a requested call in an ATM multiplexing apparatus in which priority control is performed, comprising the steps of: a) storing data concerning upper and lower bounds of a probability distribution of the number of arrivals for each of a plurality of values of an arrival rate; b) determining upper and lower bounds of a probability distribution of the arrival rate in a call admitted state where the requested call is added to already admitted calls; c) for each of a plurality of appearance values of the arrival rate, determining by reference to the data stored in step a) the upper and lower bounds of the probability distribution of the number of arrivals occurring along upper and lower bounds of an average time series averaged over possible time series from an average arrival rate to the appearance value; d) calculating upper and lower bounds of a probability distribution of a cell length corresponding to each of said plurality of appearance values of the arrival rate by solving a state equation formulating a cell multiplexing process including the priority control by substituting into said state equation the upper and lower bounds of the probability distribution of the number of arrivals determined in step c); e) calculating upper and lower limit values of QOS parameters for each of said plurality of appearance values of the arrival rate by using the upper and lower bounds of the cell length probability distribution calculated in step d); f) evaluating the QOS by calculating a weighted average of the upper and lower limit values calculated in step e) by using the upper and lower bounds of the arrival rate probability distribution determined in step b); g) judging whether to admit or reject the requested call on the basis of said evaluated QOS; h) rejecting the requested call when the requested call is judged to be rejected in step g); and i) admitting the requested call when the requested call is judged to be admitted in step g).
Claim 3
Dependent Claim
86 words
A method according to claim 1, wherein said priority control is classified priority control using a plurality of buffers for storing cells on a priority class basis, said method further comprising the step of performing steps b) to f) on a set of calls belonging to each priority class, and said state equation includes the contribution of a probability distribution of the number of cells output from a buffer of a priority class higher than a priority class of calls on which the QOS is evaluated.
Claim 4
Dependent Claim
45 words
A method according to claim 2, wherein said probability distribution of the number of output cells is calculated recursively from a probability distribution of the number of output cells in a priority class higher than a priority class on which the probability distribution is calculated.
Claim 5
Dependent Claim
47 words
A method according to claim 1, wherein said priority control is nested threshold priority control using a single buffer with a plurality of threshold values corresponding to a plurality of priority classes, and said state equation formulates the cell multiplexing process including said nested threshold priority control.
Claim 6
Independent Claim
290 words
A method of optimizing priority control in an ATM multiplexing apparatus in which priority control is performed, comprising the steps of: a) storing data concerning upper and lower bounds of a probability distribution of the number of arrivals for each of a plurality of values of an arrival rate; b) determining upper and lower bounds of a probability distribution of the arrival rate; c) for each of a plurality of appearance values of the arrival rate, determining by reference to the data stored in step a) the upper and lower bounds of the probability distribution of the number of arrivals occurring along upper and lower bounds of an average time series averaged over possible time series from an average arrival rate to the appearance value; d) calculating upper and lower bounds of a probability distribution of a cell length corresponding to each of said plurality of appearance values of the arrival rate by solving a state equation formulating a cell multiplexing process including the priority control by substituting into said state equation the upper and lower bounds of the probability distribution of the number of arrivals determined in step c); e) calculating upper and lower limit values of QOS parameters for each of said plurality of appearance values of the arrival rate by using the upper and lower bounds of the cell length probability distribution calculated in step d); f) evaluating the QOS by calculating a weighted average of the upper and lower limit values calculated in step 3) by using the upper and lower bounds of the arrival rate probability distribution determined in step b); and g) changing means for changing control parameters of the priority control to optimize the priority control on the basis of said evaluated QOS.
Claim 7
Independent Claim
290 words
A method of optimizing priority control in an ATM multiplexing apparatus in which priority control is performed, comprising the steps of: a) storing data concerning upper and lower bounds of a probability distribution of the number of arrivals for each of a plurality of values of an arrival rate; b) determining upper and lower bounds of a probability distribution of the arrival rate; c) for each of a plurality of appearance values of the arrival rate, determining by reference to the data stored in step a) the upper and lower bounds of the probability distribution of the number of arrivals occurring along upper and lower bounds of an average time series averaged over possible time series from an average arrival rate to the appearance value; d) calculating upper and lower bounds of a probability distribution of a cell length corresponding to each of said plurality of appearance values of the arrival rate by solving a state equation formulating a cell multiplexing process including the priority control by substituting into said state equation the upper and lower bounds of the probability distribution of the number of arrivals determined in step c); e) calculating upper and lower limit values of QOS parameters for each of said plurality of appearance values of the arrival rate by using the upper and lower bounds of the cell length probability distribution calculated in step d); f) evaluating the QOS by calculating a weighted average of the upper and lower limit values calculated in step 3) by using the upper and lower bounds of the arrival rate probability distribution determined in step b); and g) changing means for changing control parameters of the priority control to optimize the priority control on the basis of said evaluated QOS.
Claim 8
Dependent Claim
97 words
A method according to claim 5, wherein said priority control is classified priority control using a plurality of buffers for storing cells on a priority class basis, said method further comprising the step of performing steps b) to f) on a set of calls belonging to each priority class, said state equation includes contribution of a probability distribution of the number of cells output from a buffer of a priority class higher than a priority class of calls on which the QOS is evaluated, and in step g), the control parameters are the length of the buffers.
Claim 9
Dependent Claim
44 words
A method according to claim 6, wherein said probability distribution of the number of output cells is calculated recursively from a probability distribution of the number of output cells in a priority class higher than a priority class on which the probability is calculated.
Claim 10
Dependent Claim
59 words
A method according to claim 5, wherein said priority control is nested threshold priority control using a single buffer with a plurality of threshold values corresponding to a plurality of priority classes, said state equation formulates the cell multiplexing process including said nested threshold priority control, and in step g), the control parameters are the values of the thresholds.
Claim 11
Independent Claim
365 words
An apparatus for controlling admission of a requested call in an ATM multiplexing apparatus in which priority control is performed, comprising: storing means for storing data concerning upper and lower bounds of a probability distribution of the number of arrivals for each of a plurality of values of an arrival rate; first determining means for determining upper and lower bounds of a probability distribution of arrival rate in a call admitted state where the requested call is added to already admitted calls; second determining means for determining, for each of a plurality of appearance values of the arrival rate by reference to the data stored in said storing means, the upper and lower bounds of the probability distribution of the number of arrivals occurring along upper and lower bounds of an average time series averaged over possible time series from an average arrival rate to the appearance value; first calculating means for calculating upper and lower bounds of a probability distribution of a cell length corresponding to each of said plurality of appearance values of the arrival rate by solving a state equation formulating a cell multiplexing process including the priority control by substituting into said state equation the upper and lower bounds of the probability distribution of the number of arrivals determined by said second determining means; second calculating means for calculating upper and lower limit values of QOS parameters for each of said plurality of appearance values of the arrival rate by using the upper and lower bounds of the cell length probability distribution calculated by the first calculating means; evaluating means for evaluating the QOS by calculating a weighted average of the upper and lower limit values calculated by said second calculating means by using the upper and lower bounds of the arrival rate probability distribution determined by said first determining means; judging means for judging whether to admit or reject the requested call on the basis of said evaluated QOS; rejecting means for rejecting the requested call when the requested call is judged to be rejected by the judging means; and admitting means for admitting the requested call when the requested call is judged to be admitted, by the judging means.
Claim 12
Independent Claim
365 words
An apparatus for controlling admission of a requested call in an ATM multiplexing apparatus in which priority control is performed, comprising: storing means for storing data concerning upper and lower bounds of a probability distribution of the number of arrivals for each of a plurality of values of an arrival rate; first determining means for determining upper and lower bounds of a probability distribution of arrival rate in a call admitted state where the requested call is added to already admitted calls; second determining means for determining, for each of a plurality of appearance values of the arrival rate by reference to the data stored in said storing means, the upper and lower bounds of the probability distribution of the number of arrivals occurring along upper and lower bounds of an average time series averaged over possible time series from an average arrival rate to the appearance value; first calculating means for calculating upper and lower bounds of a probability distribution of a cell length corresponding to each of said plurality of appearance values of the arrival rate by solving a state equation formulating a cell multiplexing process including the priority control by substituting into said state equation the upper and lower bounds of the probability distribution of the number of arrivals determined by said second determining means; second calculating means for calculating upper and lower limit values of QOS parameters for each of said plurality of appearance values of the arrival rate by using the upper and lower bounds of the cell length probability distribution calculated by the first calculating means; evaluating means for evaluating the QOS by calculating a weighted average of the upper and lower limit values calculated by said second calculating means by using the upper and lower bounds of the arrival rate probability distribution determined by said first determining means; judging means for judging whether to admit or reject the requested call on the basis of said evaluated QOS; rejecting means for rejecting the requested call when the requested call is judged to be rejected by the judging means; and admitting means for admitting the requested call when the requested call is judged to be admitted, by the judging means.
Claim 13
Dependent Claim
98 words
An apparatus according to claim 9, wherein said priority control is classified priority control using a plurality of buffers for storing cells on a priority class basis, said apparatus further comprises means for activating the first and the second determining means, the first and the second calculating means, and the evaluating means for a set of calls belonging to each priority class, and said state equation includes contribution of a probability distribution of the number of cells output from a buffer of a priority class higher than a priority class of calls on which the QOS is evaluated.
Claim 14
Dependent Claim
45 words
An apparatus according to claim 10, wherein said probability distribution of the number of output cells is calculated recursively from a probability distribution of the number of output cells in a priority class higher than a priority class on which the probability distribution is calculated.
Claim 15
Dependent Claim
47 words
An apparatus according to claim 9, wherein said priority control is nested threshold priority control using a single buffer with a plurality of threshold values corresponding to a plurality of priority classes, and said state equation formulates the cell multiplexing process including said nested threshold priority control.
Claim 16
Independent Claim
308 words
An apparatus for optimizing priority control in an ATM multiplexing apparatus in which priority control is performed, comprising: storing means for storing data concerning upper and lower bounds of a probability distribution of the number of arrivals for each of a plurality of values of an arrival rate; first determining means for determining upper and lower bounds of a probability distribution of arrival rate; second determining means for determining, for each of a plurality of appearance values of the arrival rate by reference to the data stored in said storing means, the upper and lower bounds of the probability distribution of the number of arrivals occurring along upper and lower bounds of an average time series averaged over possible time series from an average arrival rate to the appearance value; first calculating means for calculating upper and lower bounds of a probability of a cell length corresponding to each of said plurality of appearance values of the arrival rate by solving a state equation formulating a cell multiplexing process including the priority control by substituting into said state equation the upper and lower bounds of the probability distribution of the number of arrivals determined by said second determining means; second calculating means for calculating upper and lower limit values of QOS parameters for each of said plurality of appearance values of the arrival rate by using the upper and lower bounds of the cell length probability distribution calculated by first calculating means; evaluating means for evaluating the QOS by calculating a weighted average of the upper and lower limit values calculated by said second calculating means by using the upper and lower bounds of the arrival rate probability distribution determined by said first determining means; and changing means for changing control parameters of the priority control to optimize the priority control on the basis of said evaluated QOS.
Claim 17
Independent Claim
308 words
An apparatus for optimizing priority control in an ATM multiplexing apparatus in which priority control is performed, comprising: storing means for storing data concerning upper and lower bounds of a probability distribution of the number of arrivals for each of a plurality of values of an arrival rate; first determining means for determining upper and lower bounds of a probability distribution of arrival rate; second determining means for determining, for each of a plurality of appearance values of the arrival rate by reference to the data stored in said storing means, the upper and lower bounds of the probability distribution of the number of arrivals occurring along upper and lower bounds of an average time series averaged over possible time series from an average arrival rate to the appearance value; first calculating means for calculating upper and lower bounds of a probability of a cell length corresponding to each of said plurality of appearance values of the arrival rate by solving a state equation formulating a cell multiplexing process including the priority control by substituting into said state equation the upper and lower bounds of the probability distribution of the number of arrivals determined by said second determining means; second calculating means for calculating upper and lower limit values of QOS parameters for each of said plurality of appearance values of the arrival rate by using the upper and lower bounds of the cell length probability distribution calculated by first calculating means; evaluating means for evaluating the QOS by calculating a weighted average of the upper and lower limit values calculated by said second calculating means by using the upper and lower bounds of the arrival rate probability distribution determined by said first determining means; and changing means for changing control parameters of the priority control to optimize the priority control on the basis of said evaluated QOS.
Claim 18
Dependent Claim
109 words
An apparatus according to claim 13, wherein said priority control is classified priority control using a plurality of buffers for storing cells on a priority class basis, said apparatus further comprises means for activating the first and the second determining means, the first and the second calculating means, and the evaluating means for a set of calls belonging to each priority class, said state equation includes the contribution of a probability distribution of the number of cells output from a buffer of a priority class higher than a priority class of calls on which the QOS is evaluated, and said changing means changes the the lengths of the buffers.
Claim 19
Dependent Claim
44 words
An apparatus according to claim 14, wherein said probability distribution of the number of output cells is calculated recursively from a probability distribution of the number of output cells in a priority class higher than a priority class on which the probability is calculated.
Claim 20
Dependent Claim
56 words
An apparatus according to claim 13, wherein said priority control is nested threshold priority control using a single buffer with a plurality of threshold values corresponding to a plurality of priority classes, said state equation formulates the cell multiplexing process including said nested threshold priority control, and said changing means changes the values of the thresholds.
References Cited (Backward Citations)
US5224091A
Cited
US5231633A
Cited
US5280483A
Cited
US5268900A
Cited
US5313579A
Cited
WO1994021068A1
Cited
US5388097A
Cited
US5367523A
Cited
USPTO Annuity & Maintenance Windows
| Annuity Stage | Window Opens | Payment Deadline | Surcharge Period Until | Estimated Fee | Status |
|---|---|---|---|---|---|
| 3.5 Years (Year 4) | 1999-12-03 | 2000-06-03 | 2000-12-03 | $2000.00 | Window Closed / Lapsed |
| 7.5 Years (Year 8) | 2003-12-03 | 2004-06-03 | 2004-12-03 | $3760.00 | Window Closed / Lapsed |
| 11.5 Years (Year 12) | 2007-12-03 | 2008-06-03 | 2008-12-03 | $7700.00 | Window Closed / Lapsed |