US5166894A
Expired / Lapsed
US
⏱️ 0.0 years remaining
Method and apparatus for cell loss rate estimation, call admission control, and buffer/link capacity designing in integrated network
Assignee: NTT Inc
•
Filing: 1990-11-15
•
Granted: 1992-11-24
•
Expires: 2010-11-15
Abstract
Abstract A method and an apparatus for the cell loss rate estimation in an integrated network, capable of highly accurate estimation which is not too small compared with the actual cell loss rate. In the apparatus, inputting probability density functions of number of arriving cells and an average number of arriving cells for a prescribed constant period of time; calculating a weighted sum of the probability density functions of number of arriving cells, using weight factors which depend on a buffer capacity of the output buffer and a link capacity of the integrated network; and obtaining an estimation value for the cell loss rate by dividing the weighted sum by the average number of arriving cells. These method and apparatus for the cell loss rate estimation are applied to a method and an apparatus for the call admission control as well as a method and an apparatus for the buffer/link capacity designing.
Inventors
- 👤 Hiroshi Saito
Bibliographic Details
Application Number
—
Jurisdiction
US
Data Source
google_patents
Last Synchronized
2026-10-26 22:49
CPC Classifications
H; H04; H04L; H04L12/00; H04L12/54; H04L12/56; H04L12/5601; H04L12/5602; G; G06; G06F; G06F17/00; G06F17/10; G06F17/18; H04L2012/5629; H04L2012/5631; H04L2012/5632; H04L2012/5638; H04L2012/5646; H04L2012/5647
Claims Analysis
Total Claims: 24
Claim 1
Independent Claim
278 words
A method of call admission control using an estimation of a cell loss rate for a finite capacity output buffer provided at an exchanger in an integrated network, comprising the steps of: receiving a call containing a number of arriving cells which are arriving at the exchanger from a transmission line of the integrated network; inputting probability density functions of said number of arriving cells {p(k), k=0, 1, . . . } and an average number of arriving cells A for a prescribed constant period of time T A , where A is a non-negative integer; calculating a weighted sum Σ w(k)p(k) of the probability density functions of said number of arriving cells p(k), using weight factors w(k) which depend on a buffer capacity K of the output buffer and a link capacity C of the integrated network, where K and C are non-negative integers; obtaining an estimation value B(p) for the cell loss rate by dividing the weighted sum Σ w(k)p(k) by the average number of arriving cells A; comparing at a comparator the estimation value B(p) obtained by assuming an admission of said call with a prescribed reference value memorized in a reference value memory which is connected to said comparator; determining a judgement that said call is to be admitted when the estimation value B(p) obtained by assuming an admission of said call becomes not greater than the prescribed reference value, and that said call is to be rejected otherwise according to a result of the comparison obtained by the comparator at the comparing step; and controlling a set up of said call at the exchanger according to the judgement determined at the determining step.
Claim 2
Independent Claim
278 words
A method of call admission control using an estimation of a cell loss rate for a finite capacity output buffer provided at an exchanger in an integrated network, comprising the steps of: receiving a call containing a number of arriving cells which are arriving at the exchanger from a transmission line of the integrated network; inputting probability density functions of said number of arriving cells {p(k), k=0, 1, . . . } and an average number of arriving cells A for a prescribed constant period of time T A , where A is a non-negative integer; calculating a weighted sum Σ w(k)p(k) of the probability density functions of said number of arriving cells p(k), using weight factors w(k) which depend on a buffer capacity K of the output buffer and a link capacity C of the integrated network, where K and C are non-negative integers; obtaining an estimation value B(p) for the cell loss rate by dividing the weighted sum Σ w(k)p(k) by the average number of arriving cells A; comparing at a comparator the estimation value B(p) obtained by assuming an admission of said call with a prescribed reference value memorized in a reference value memory which is connected to said comparator; determining a judgement that said call is to be admitted when the estimation value B(p) obtained by assuming an admission of said call becomes not greater than the prescribed reference value, and that said call is to be rejected otherwise according to a result of the comparison obtained by the comparator at the comparing step; and controlling a set up of said call at the exchanger according to the judgement determined at the determining step.
Claim 3
Dependent Claim
119 words
The method of claim 1, further comprising the steps of: inputting specified values of an average bit rate a i (bit/s) and a peak bit rate R i (bit/s) from each of n calls arriving at the output buffer, where n is a non-negative integer; and deriving the probability density functions of said number of arriving cells p(k) according to: T=KL/C φ.sub.i =a.sub.i T/L ε.sub.i =[R.sub.i T/L] θ.sub.i (0)=1-φ.sub.i /ε.sub.i θ.sub.i (ε)=φ.sub.i /ε.sub.i θ.sub.i (k)=0, k=1, . . . , ε.sub.i -1 p(k)=θ.sub.i * . . . *θ.sub.i * . . . *θ.sub.n (k) where L (bit) is a cell length, * denotes a convolution, and [R i T/L] denotes a smallest integer not less than R i T/L.
Claim 4
Dependent Claim
21 words
The method of claim 1, wherein the weight factors w(k) are given by: ##EQU24## and d(k) is an arbitrary non-negative function.
Claim 5
Dependent Claim
41 words
The method of claim 1, wherein the weight factors w(k) are given by: w(k)=(<k-r>.sup.+ +<k-K+r>.sup.+)+d(k),k=0,1, . . . where r=T A /h, r is an integer, h (sec)=L/C is a cell transfer time, ##EQU25## and d(k) is an arbitrary non-negative function.
Claim 6
Dependent Claim
31 words
The method of claim 1, wherein the weight factors w(k) are given by: w(k)=<k-(CT.sub.a /L)>.sup.+ +d(k),k=0,1, . . . where CT a /L≦(K+1), ##EQU26## and d(k) is an arbitrary non-negative function.
Claim 7
Independent Claim
285 words
An apparatus for call admission control using an estimation of a cell loss rate for a finite capacity output buffer provided at an exchanger in an integrated network, comprising: means for receiving a call containing a number of arriving cells which are arriving at the exchanger from a transmission line of the integrated network; means for inputting probability density functions of said number of arriving cells {p(k), k=0, 1, . . . } and an average number of arriving cells A for a prescribed constant period of time T A , where A is a non-negative integer; means for calculating a weighted sum Σ w(k)p(k) of the probability density functions of said number of arriving cells p(k), using weight factors w(k) which depend on a buffer capacity K of the output buffer and a link capacity C of the integrated network, where K and C are non-negative integers; means for obtaining an estimation value B(p) for the cell loss rate by dividing the weighted sum Σ w(k)p(k) by the average number of arriving cells A; a reference value memory for memorizing a prescribed reference value; a comparator connected to said memory for comparing the estimation value B(p) obtained by assuming an admission of said call with the prescribed reference value; means for determining a judgement that said call is to be admitted when the estimation value B(p) obtained by assuming an admission of said call becomes not greater than the prescribed reference value, and that said call is to be rejected otherwise according to a result of the comparison obtained by the comparator; and means for controlling a set up of said call at the exchanger according to the judgement determined at the determining means.
Claim 8
Independent Claim
285 words
An apparatus for call admission control using an estimation of a cell loss rate for a finite capacity output buffer provided at an exchanger in an integrated network, comprising: means for receiving a call containing a number of arriving cells which are arriving at the exchanger from a transmission line of the integrated network; means for inputting probability density functions of said number of arriving cells {p(k), k=0, 1, . . . } and an average number of arriving cells A for a prescribed constant period of time T A , where A is a non-negative integer; means for calculating a weighted sum Σ w(k)p(k) of the probability density functions of said number of arriving cells p(k), using weight factors w(k) which depend on a buffer capacity K of the output buffer and a link capacity C of the integrated network, where K and C are non-negative integers; means for obtaining an estimation value B(p) for the cell loss rate by dividing the weighted sum Σ w(k)p(k) by the average number of arriving cells A; a reference value memory for memorizing a prescribed reference value; a comparator connected to said memory for comparing the estimation value B(p) obtained by assuming an admission of said call with the prescribed reference value; means for determining a judgement that said call is to be admitted when the estimation value B(p) obtained by assuming an admission of said call becomes not greater than the prescribed reference value, and that said call is to be rejected otherwise according to a result of the comparison obtained by the comparator; and means for controlling a set up of said call at the exchanger according to the judgement determined at the determining means.
Claim 9
Dependent Claim
117 words
The apparatus of claim 6, further comprising: means for inputting specified values of an average bit rate a i (bit/s) and a peak bit rate R i (bit/s) from each of n calls arriving at the output buffer, where n is a non-integer; and means for deriving the probability density functions of said number of arriving cells p(k) according to: T=KL/C φ.sub.i =a.sub.i T/L ε.sub.i =[R.sub.i T/L] θ.sub.i (0)=1-φ.sub.i /ε.sub.i θ.sub.i (ε)=φ.sub.i /ε.sub.i θ.sub.i (k)=0,k=1, . . . ,ε.sub.i -1 p(k)=θ.sub.i * . . . *θ.sub.i * . . . *θ.sub.n (k) where L (bit) is a cell length, * denotes a convolution, and [R i T/L] denotes a smallest integer not less than R i T/L.
Claim 10
Dependent Claim
21 words
The apparatus of claim 6, wherein the weight factors w(k) are given by: ##EQU27## and d(k) is an arbitrary non-negative function.
Claim 11
Dependent Claim
42 words
The apparatus of claim 6, wherein the weight factors w(k) are given by: w(k)=(<k-r>.sup.+ +<k-K+r>.sup.+)+d(k), k=0, 1,. . . where r=T A /h, r is an integer, h (sec)=L/C is a cell transfer time, ##EQU28## and d(k) is an arbitrary non-negative function.
Claim 12
Dependent Claim
33 words
The apparatus of claim 6, wherein the weight factors w(k) are given by: w(k)=<k-(CT.sub.A /L)>.sup.+ +d(k), k=0, 1, . . . where CT A /L≦(K+1), ##EQU29## and d(k) is an arbitrary non-negative function.
Claim 13
Independent Claim
247 words
A method of buffer/link capacity controlling for a finite capacity output buffer provided at an exchanger in an integrated network, comprising the steps of: receiving a call containing a number of arriving cells which are arriving at the exchanger from a transmission line of the integrated network; inputting probability density functions of said number of arriving cells {p(k), k=0, 1, . . .} and an average number of arriving cells A for a prescribed constant period of time T A , where A is a non-negative integer; calculating a weighted sum Σw(k)p(k) of the probability density functions of said number of arriving cells p(k), using weight factors w(k) which depend on a buffer capacity K of the output buffer and a link capacity C of the integrated network, where K and C are non-negative integers; obtaining an estimation value B(p) for the cell loss rate by dividing the weighted sum Σw(k)p(k) by the average number of arriving cells A; comparing at a comparator the estimation value B(p) with a prescribed reference value memorized in a reference value memory which is connected to said comparator; determining appropriate values of the buffer capacity K and the link capacity C such that the estimation value B(p) becomes not greater than the prescribed reference value according to a result of the comparison obtained by the comparator at the comparing step; and controlling the buffer capacity K and the link capacity C according to the appropriate values determined at the determining step.
Claim 14
Independent Claim
247 words
A method of buffer/link capacity controlling for a finite capacity output buffer provided at an exchanger in an integrated network, comprising the steps of: receiving a call containing a number of arriving cells which are arriving at the exchanger from a transmission line of the integrated network; inputting probability density functions of said number of arriving cells {p(k), k=0, 1, . . .} and an average number of arriving cells A for a prescribed constant period of time T A , where A is a non-negative integer; calculating a weighted sum Σw(k)p(k) of the probability density functions of said number of arriving cells p(k), using weight factors w(k) which depend on a buffer capacity K of the output buffer and a link capacity C of the integrated network, where K and C are non-negative integers; obtaining an estimation value B(p) for the cell loss rate by dividing the weighted sum Σw(k)p(k) by the average number of arriving cells A; comparing at a comparator the estimation value B(p) with a prescribed reference value memorized in a reference value memory which is connected to said comparator; determining appropriate values of the buffer capacity K and the link capacity C such that the estimation value B(p) becomes not greater than the prescribed reference value according to a result of the comparison obtained by the comparator at the comparing step; and controlling the buffer capacity K and the link capacity C according to the appropriate values determined at the determining step.
Claim 15
Dependent Claim
118 words
The method of claim 11, further comprising the steps of: inputting specified values of an average bit rate a i (bit/s) and a peak bit rate R i (bit/s) from each of n calls arriving at the output buffer, where n is a non-integer; and deriving the probability density functions of said number of arriving cells p(k) according to: T=KL/C φ.sub.i =a.sub.i T/L ε.sub.i =[R.sub.i T/L] θ.sub.i (0)=1-φ.sub.i /ε.sub.i θ.sub.i (ε)=φ.sub.i /ε.sub.i θ.sub.i (k)=0, k=1, . . . , ε.sub.i -1 p(k)=θ.sub.i * . . . *θ.sub.i * . . . *θ.sub.n (k) where L (bit) is a cell length, * denotes a convolution, and [R i T/L] denotes a smallest integer not less than R i T/L.
Claim 16
Dependent Claim
21 words
The method of claim 11, wherein the weight factors w(k) are given by: ##EQU30## and d(k) is an arbitrary non-negative function.
Claim 17
Dependent Claim
43 words
The method of claim 11, wherein the weight factors w(k) are given by: w(k)=(<k-r>.sup.+ +<k-K+r>.sup.+)+d(k), k=0, 1, . . . where r=T A /h, r is an integer, h (sec)=L/C is a cell transfer time, ##EQU31## and d(k) is an arbitrary non-negative function.
Claim 18
Dependent Claim
33 words
The method of claim 11, wherein the weight factors w(k) are given by: w(k)=<k-(CT.sub.A /L)>.sup.+ d(k), k=0, 1, . . . where CT A /L≦(K+1), ##EQU32## and d(k) is an arbitrary non-negative function.
Claim 19
Independent Claim
256 words
An apparatus for buffer/link capacity controlling for a finite capacity output buffer provided at an exchanger in an integrated network, comprising: means for receiving a call containing a number of arriving cells which are arriving at the exchanger from a transmission line of the integrated network; means for inputting probability density functions of said number of arriving cells {p(k), k=0, 1, . . .} and an average number of arriving cells A for a prescribed constant period of time T A , where A is a non-negative integer; means for calculating a weighted sum Σ w(k)p(k) of the probability density functions of said number of arriving cells p(k), using weight factors w(k) which depend on a buffer capacity K of the output buffer and a link capacity C of the integrated network, where K and C are non-negative integers; means for obtaining an estimation value B(p) for the cell loss rate by dividing the weighted sum Σ w(k)p(k) by the average number of arriving cells A; a reference value memory for memorizing a prescribed reference value; a comparator connected to said memory for comparing the estimation value B(p) with the prescribed reference value; means for determining appropriate values of the buffer capacity K and the link capacity C such that the estimation value B(p) becomes not greater than the prescribed reference value according to a result of the comparison obtained by the comparator; and means for controlling a buffer capacity K and the link capacity C according to the appropriate values determined by the determining means.
Claim 20
Independent Claim
256 words
An apparatus for buffer/link capacity controlling for a finite capacity output buffer provided at an exchanger in an integrated network, comprising: means for receiving a call containing a number of arriving cells which are arriving at the exchanger from a transmission line of the integrated network; means for inputting probability density functions of said number of arriving cells {p(k), k=0, 1, . . .} and an average number of arriving cells A for a prescribed constant period of time T A , where A is a non-negative integer; means for calculating a weighted sum Σ w(k)p(k) of the probability density functions of said number of arriving cells p(k), using weight factors w(k) which depend on a buffer capacity K of the output buffer and a link capacity C of the integrated network, where K and C are non-negative integers; means for obtaining an estimation value B(p) for the cell loss rate by dividing the weighted sum Σ w(k)p(k) by the average number of arriving cells A; a reference value memory for memorizing a prescribed reference value; a comparator connected to said memory for comparing the estimation value B(p) with the prescribed reference value; means for determining appropriate values of the buffer capacity K and the link capacity C such that the estimation value B(p) becomes not greater than the prescribed reference value according to a result of the comparison obtained by the comparator; and means for controlling a buffer capacity K and the link capacity C according to the appropriate values determined by the determining means.
Claim 21
Dependent Claim
120 words
The apparatus of claim 16, further comprising: means for inputting specified values of an average bit rate a i (bit/s) and a peak bit rate R i (bit/s) from each of n calls arriving at the output buffer, where n is a non-negative integer; and means for deriving the probability density functions of said number of arriving cells p(k) according to: T=KL/C φ.sub.i =a.sub.i T/L ε.sub.i =[R.sub.i T/L] θ.sub.i (0)=1-φ.sub.i /ε.sub.i θ.sub.i (ε)=φ.sub.i /ε.sub.i θ.sub.i (k)=0, k=1, . . . , ε.sub. -1 p(k)=θ.sub.i * . . . *θ.sub.i * . . . *θ.sub.n (k) where L (bit) is a cell length, * denotes a convolution, and [R i T/L] denotes a smallest integer not less than R i T/L.
Claim 22
Dependent Claim
21 words
The apparatus of claim 16, wherein the weight factors w(k) are given by: ##EQU33## and d(k) is an arbitrary non-negative function.
Claim 23
Dependent Claim
43 words
The apparatus of claim 16, wherein the weight factors w(k) are given by: w(k)=(<k-r>.sup.+ +<k-K+r>.sup.+)+d(k), k=0, 1, . . . where r=T A /h, r is an integer, h (sec)=L/C is a cell transfer time, ##EQU34## and d(k) is an arbitrary non-negative function.
Claim 24
Dependent Claim
33 words
The apparatus of claim 16, wherein the weight factors w(k) are given by: w(k)=<k-(CT.sub.A /L)>.sup.+ +d(k), k=0, 1, . . . where CT A /L≦(K+1), ##EQU35## and d(k) is an arbitrary non-negative function.
References Cited (Backward Citations)
USPTO Annuity & Maintenance Windows
| Annuity Stage | Window Opens | Payment Deadline | Surcharge Period Until | Estimated Fee | Status |
|---|---|---|---|---|---|
| 3.5 Years (Year 4) | 1995-11-24 | 1996-05-25 | 1996-11-24 | $2000.00 | Window Closed / Lapsed |
| 7.5 Years (Year 8) | 1999-11-24 | 2000-05-25 | 2000-11-24 | $3760.00 | Window Closed / Lapsed |
| 11.5 Years (Year 12) | 2003-11-24 | 2004-05-25 | 2004-11-24 | $7700.00 | Window Closed / Lapsed |