Claims Analysis
Total Claims: 22
Claim 1
Independent Claim
273 words
A method of evaluating the QOS in an ATM multiplexing apparatus in which priority control is performed, including the steps of: a) storing data concerning upper and lower bounds of the 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 the probability distribution of the arrival rate in a call admitted state that is to be evaluated; 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 the probability distribution of a call length corresponding to each of said plurality of appearance values of the arrival rate by solving a state equation formulating a call 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 call length probability distribution calculated in step d); and f) evaluating the QOS by taking a weighted average of the results calculated in step e) by using the upper and lower bounds of the arrival rate probability distribution determined in step b).
Claim 2
Independent Claim
273 words
A method of evaluating the QOS in an ATM multiplexing apparatus in which priority control is performed, including the steps of: a) storing data concerning upper and lower bounds of the 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 the probability distribution of the arrival rate in a call admitted state that is to be evaluated; 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 the probability distribution of a call length corresponding to each of said plurality of appearance values of the arrival rate by solving a state equation formulating a call 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 call length probability distribution calculated in step d); and f) evaluating the QOS by taking a weighted average of the results calculated in step e) by using the upper and lower bounds of the arrival rate probability distribution determined in step b).
Claim 3
Dependent Claim
75 words
A method according to claim 1, in which
the priority control is classified priority control having a plurality of buffers for storing calls on a priority class basis,
steps b) to f) are performed 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 calls output from a buffer of a priority class higher than the priority class under consideration.
Claim 4
Dependent Claim
41 words
A method according to claim 2, in which the probability distribution of the number of output calls is calculated recursively from a probability distribution of the number of output calls in a priority class higher than the priority class under consideration.
Claim 5
Dependent Claim
48 words
A method according to claim 1, in which
the priority control is nested threshold priority control having a single buffer with a plurality of threshold values corresponding to a plurality of priority classes, and
said state equation formulates the call multiplexing process including said nested threshold priority control.
Claim 6
Independent Claim
28 words
A method according to any preceding claim and further including the step of judging whether to admit or reject a call on the basis of the evaluated QOS.
Claim 7
Independent Claim
28 words
A method according to any one of claims 1 to 4 and including the further step of optimising the priority control on the basis of said evaluated QOS.
Claim 8
Dependent Claim
27 words
A method according to claim 6 when appendant to claim 2 or 3 in which the priority control is optimised by changing the lengths of the buffers.
Claim 9
Dependent Claim
25 words
A method according to claim 6 when appendant to claim 4 in which the priority control is optimised by changing the values of the thresholds.
Claim 10
Independent Claim
26 words
A method of evaluating the QOS in an ATM multiplexing apparatus substantially as described herein with reference to any of the accompanying
Figures 1 to 6.
Claim 11
Independent Claim
26 words
A method of evaluating the QOS in an ATM multiplexing apparatus substantially as described herein with reference to any of the accompanying
Figures 1 to 6.
Claim 12
Independent Claim
295 words
An apparatus for evaluating the QOS in an ATM multiplexing apparatus in which priority control is performed, including:
storing means for storing data concerning upper and lower bounds of the 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 the probability distribution of the arrival rate in a call admitted state that is to be evaluated;
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 the probability distribution of a call length corresponding to each of said plurality of appearance values of the arrival rate by solving a state equation formulating a call 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 call length probability distribution calculated by said first calculating means; and
evaluating means for evaluating the QOS by taking a weighted average of the results 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.
Claim 13
Independent Claim
295 words
An apparatus for evaluating the QOS in an ATM multiplexing apparatus in which priority control is performed, including:
storing means for storing data concerning upper and lower bounds of the 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 the probability distribution of the arrival rate in a call admitted state that is to be evaluated;
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 the probability distribution of a call length corresponding to each of said plurality of appearance values of the arrival rate by solving a state equation formulating a call 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 call length probability distribution calculated by said first calculating means; and
evaluating means for evaluating the QOS by taking a weighted average of the results 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.
Claim 14
Dependent Claim
86 words
An apparatus according to claim 10, in which
the priority control is classified priority control having a plurality of buffers for storing calls on a priority class basis,
the evaluating means is adapted to evaluate the
QOS for a set of calls belonging to each priority class, and
the first calculating means is adapted to solve said state equation with the contribution of a probability distribution of the number of calls output from a buffer of a priority class higher than the priority class under consideration.
Claim 15
Dependent Claim
40 words
An apparatus according to claim 11, adapted to calculate recursively the probability distribution of the number of output calls from a probability distribution of the number of output calls in a priority class higher than the priority class under consideration.
Claim 16
Dependent Claim
48 words
An apparatus according to claim 10, in which
the priority control is nested threshold priority control having 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 17
Independent Claim
32 words
An apparatus according to any one of claims 10 to 13 and further including judging means for judging whether to admit or reject a call on the basis of the evaluated QOS.
Claim 18
Independent Claim
28 words
An apparatus according to any one of claims 10 to 13 and further including optimising means for optimising the priority control on the basis of the evaluated QOS.
Claim 19
Dependent Claim
32 words
An apparatus according to claim 15 when appendant to claim 11 or 12 in which the optimising means is adapted to optimise the priority control by changing the lengths of the buffers.
Claim 20
Dependent Claim
30 words
An apparatus according to claim 15, when appendant to claim 13 in which the optimising means is adapted to optimise the priority control by changing the values of the thresholds.
Claim 21
Independent Claim
26 words
An apparatus for evaluating the QOS in an ATM multiplexing apparatus substantially as described herein with reference to any of the accompanying
Figures 1 to 6.
Claim 22
Independent Claim
26 words
An apparatus for evaluating the QOS in an ATM multiplexing apparatus substantially as described herein with reference to any of the accompanying
Figures 1 to 6.