1. Field of the Invention
The present invention relates generally to communication systems, and more particularly to call admission control for controlling access to ATM networks or IP networks with support of differentiates services.
2. Description of the Related Art
An Asynchronous Transfer Mode (ATM) network is one method for realizing a flexible and cost-effective network for handling a wide variety of communications. In an ATM network, various types of data that have various transmission rates and traffic characteristics, are multiplexed. Therefore, the multiplexed traffic load fluctuates heavily and rapidly, especially when high speed calls are multiplexed.
Call admission control (CAC) is an important element of ATM traffic management. CAC provides access by regulating the number and types of connections that can be allowed at any given time for a given amount of resources. In an ATM multi-service network, the resource demand of each connection has to be estimated as a function of several variables, including the cell-level traffic descriptions, the required quality-of-service (QOS), the states of the network resources, and the traffic-stream class of priority. When a call request is made, the ATM network determines whether the quality of service would be suitable in all connections, including connections which are already established when the call request is accepted, and determines propriety of the acceptance according to the available services. To make this determination, it is recommended that each terminal issuing a call request should declare parameters, such as an average rate (an average bandwidth) and a peak rate (a peak bandwidth), as source traffic characteristics, and the call admission control be performed using the declared parameters.
ATM admission control can be based on either of two approaches: a direct performance-evaluation approach or an inverse resource-requirement-estimation approach. In the direct approach, the estimated cell-level performance resulting from the admission of a new connection (or call) is calculated. In the inverse approach, an EBR (“equivalent bit rate,” often called the “equivalent bandwidth” or “effective bandwidth”) of the new arrival is determined by some artifice or another. The connection is accepted if the remaining unassigned capacity of the route is not less than the calculated EBR. The EBR for a connection which traverses several links may vary from the link to link and would be based on the source's traffic descriptors, the cell-level performance objectives, the speed of the link under consideration, and the buffer size.
Thus, in the inverse approach, call admission criteria can be expressed as follows:
BWup-cbr+BWup-rtvbr+BWup-nrtvbr≦Cp (1A)
BWdown-cbr+BWdown-rtvbr+BWdown-nrtvbr≦Cp (1B)
where BWup-crb, BWup-rtvbr, and BWup-nrvbr are the aggregate effective bandwidth for Constant Bit Rate (CBR), real time Variable Bit Rate (rtVBR) and non-real time Variable Bit Rate (nrtVBR) upstream traffic classes and BWdown-cbr, BWdown-rtvbr, and BWdown-nrtvbr are the aggregate effective bandwidth for CRB, rtVBR and nrtVBR downstream traffic classes, respectively, and Cp is the port bandwidth. When a new connection request, which belongs to a particular class, comes in, it is necessary to recompute the effective bandwidth for that class and then determine if the above criteria in Equations (1A) and (1B) are met.
There are problems, however, with conventional call admission control. For example, in conventional call admission control systems, there is no perfect call admission control or effective bandwidth computation, as the systems generally make approximation of the traffic models. Accordingly, the systems do not have the capacity for maintaining the communication quality or for efficiently utilizing resources of the network when the systems are supplied with calls which have many different traffic characteristics, making precision traffic control difficult to achieve.
The present invention provides novel call admission methods for admitting connections in communications networks such as ATM networks or emerging IP networks.
According to the present invention, an innovative overbooking technique is utilized which distinguishes among the different service classes. Each service class is assigned an overbooking factor. The call admission is determined based on the overbooking factor assigned to the class and the effective bandwidth for that service class. In addition, methods are disclosed for performing appropriate bookkeeping, i.e., updating and maintaining information concerning the state of the system.
These and other advantages and features of the invention will become apparent from the following detailed description of the invention which is provided in connection with the accompanying drawings.
The present invention will be described as set forth in the embodiments illustrated in
In accordance with the present invention, an innovative overbooking technique is utilized which distinguishes among the different service classes. Each service class is assigned an overbooking factor. The call admission is determined based on the overbooking factor assigned to the class and the effective bandwidth for that service class.
In step 20, the aggregate effective bandwidth for class i, designated Ci, is calculated. The computation of the effective bandwidth is as follows. For the CBR class, it is known in the art that a buffer size of 150 cells is sufficient to keep cell loss ratio (CLR) below 10−11 for a very large number of connections (about 5000) at 95% utilization. Therefore, it is reasonable to allocate this amount of buffer for the CBR class without concern for CBR traffic cell loss. Accordingly, only the cell delay variation (CDV) needs to be checked at connection admission time. Let d be the most stringent CDV requirement among CBR traffic. Further let a be the cell transmission time corresponding to the allocated CBR bandwidth. We need to ensure the QoS of CDV is guaranteed by:
Pr(qcbr>d/a)<α (2)
where α denotes the desired percentile for the CDV, and qcbr is the queue length of the CBR traffic. Heterogeneous CBR traffic multiplexing can be modeled as ΣiDi/l/K queue. It has been shown that the queue in ΣiDi/l/K can be upper bounded by the queue of an appropriate approximating N*D/D/l/K queue where the latter queue has the same number of streams as the format but the streams are homogeneous (have the same period) with the common period D such that N/D=p, the same load factor as in the former queue. Given the existing Ncbr number of CBR connections with peak cell rate (PCR) being pi and DCV requirement di for i=1, 2, . . . , Ncbr, it is necessary to find the appropriate bandwidth allocation factor BWcbr such that the tighest CDV is met by solving the following equation, which gives the queue distribution in a homogeneous queue with Ncbr connections with period D:
where x=
and where α is the cell transmission time given by cell size divided by BWcbr*ShelfPCR, where ShelfPCR is the feeder bandwidth of the multiplexer. Bisection or a table lookup can then be used to solve the above equation and find effective bandwidth allocation Ci=BWcbr for the CBR traffic class.
The rt-VBR traffic class can be characterized by three parameters, pi, mi, bi, which represent peak cell rate (PCR), sustainable cell rate (SRC), burst size for the i-th connection for i=1, 2, . . . , Nrtvbr where Nrtvbr denotes the number of established rt-VBR connections. Assuming the source is modeled by on-off periods, we can compute the average ON and OFF periods by Toni=bi/pi, Toffi=bi/(1/mi−1/pi). The QoS requirement for rt-VBR is the cell loss ratio (CLR, denoted Li) and the cell delay variation (CDV, denoted by di), where α denotes the desired percentile for the delay performance.
For loss performance, the following must be satisfied:
Pr(qrtvbr>Brtvbr)<Lmin=mini=1N
where qrtvbr and Brtvbr denote the queue occupancy and buffer allocation for rt-VBR traffic class, respectively. For delay performance, the following condition must be checked:
Essentially, the cell delay performance checking is similar to cell loss checking. Accordingly, in the following it is only necessary to concentrate on the cell loss performance guarantee, and in Equation (6) the approach can be taken where traffic sources are assumed independent with exponentially distributed on and exponentially distributed off periods. The first stage consists of computing as a function of Brtvbr, Lmin, and the traffic description the following lossless effective bandwidth:
where xi=mi/pi and σi=Brtvbr/(bilog(1/Lmin)).
In the second stage, the Gaussian approximation is used to estimate the loss probability which is given in terms of the error function by:
where
and BWrtvbr is the effective bandwidth factor required to guarantee the minimum cell loss ratio. Equation (8) can be solved for Ci=BWrtvbr by using a table lookup of inverse error function:
where Q−1 is the Q-inverse function. The Q-function is defined as:
where Q(x)=α, x can be expressed in terms of the error function as:
x=√{square root over (2erf)}1(1−2α) (12)
where erf1 is the inverse error function.
Once the effective bandwidth Ci per service class is computed in step 20 as described above, it can be determined if a call will be admitted. A call will be admitted if:
where Cp is the total bandwidth of the port, or link, in the system through which the calls are passing. In step 30, the free bandwidth at the port is determined by:
When a call is requesting to be admitted to the system, in step 40, it is determined if freeBW is greater than zero, i.e., if there is available bandwidth to admit the call. If freeBW is greater than zero, then in step 50 the call is admitted. If in step 40 it is determined that freeBW is less than zero, then in step 60 the call is rejected and entry into the system is denied.
Thus, in accordance with the present invention, an overbooking technique is utilized which distinguishes among the different service classes. Each service class is assigned an overbooking factor, and admission of a call is determined based on the overbooking factor assigned to the class and the effective bandwidth for that service class.
Once it has been determined in step 50 of
Pr(q>B)<L (15A)
Pr(q>d*Calloc)<α (15B)
where L is the CLR requirement, d is the CDV requirement, α is the CDV percentile, and Calloc is the allocated bandwidth.
When a new connection setup request, described by p, m, and b, comes in, in step 100 the effective bandwidth to meet the CLR requirement e0clr is computed by
where xi=mi/pi and σi=B/(bi log(1/L)). In step 105, the variance of the traffic load for the CLR requirement vclr is computed by
vclr=m*(e0clr−m) (17)
In step 110, the required bandwidth Cclr to meet the CLR requirements is computed by
Cclr=min(E0clr+e0clr,(M+m)+Q−1(L)√{square root over (Vclr+vclr)}) (18)
where M, V, and E0clr are the aggregate traffic load, variance of the aggregate traffic load, and sum of the lossless effective bandwidth to meet the CLR requirement, i.e.,
In step 115, Calloc is set equal to the value determined for Cclr in step 110. In step 120, effective bandwidth for the new connection as well as all the existing connections to meet the CDV requirements e0cdv is computed by
where xi=mi/pi and σi=d*Calloc/(bilog(1/α)). In step 125, the variance of the aggregate traffic load Vcdv and the sum of the lossless effective bandwidth E0cdv to meet the CDV requirements are computed by
In step 130, the required bandwidth to meet the CDV requirements is computed by
Ccdv=min(E0cdv,M+Q−1(α)√{square root over (vcdv)}) (25)
In step 135, the required bandwidth reqBW is determined by max (Cclr, Ccdv) and in step 140 the required bandwidth reqBW determined in step 135 is compared to the capacity of the port, or link, Cp, in the system through which the calls are passing. If the required bandwidth reqBW is greater than the capacity of the link Cp, then in step 145 the call is rejected. If the required bandwidth reqBW is not greater than the capacity of the link Cp, then in step 145 the call is accepted and the state variables of the system are updated to include the accepted call as follows:
N=N+1
M+=m
Vclr+=vclr
E0clr+=e0clr
where N is the number of established connections. Specifically, the number of connections N is increased by one, the aggregate load M is updated by adding the new connection's sustainable cell rate (SCR) m to the previous aggregate load, the aggregate variance of the traffic load Vclr is updated by adding the new connection's variance vclr to the previous aggregate variance, and the sum of the lossless effective bandwidth E0clr is updated by adding the new connection's lossless effective bandwidth e0clr to the previous effective bandwidth. Thus, in accordance with the present invention, perfect state bookkeeping is performed when a new connection setup is requested to determine if the call will be admitted or denied.
N=N−1
M−=m
Vclr−=vclr
E0clr−=e0clr
Specifically, the number of connections N is decreased by one, the aggregate traffic load M is updated by subtracting the sustainable cell rate (SCR) m of the call to be released from the previous aggregate load, the aggregate variance of the traffic load Vclr is updated by subtracting the variance vclr of the call to be released from the previous aggregate variance, and the sum of the lossless effective bandwidth E0clr is updated by subtracting the lossless effective bandwidth e0clr of the call to be released from the previous effective bandwidth.
In step 175, the required bandwidth to meet the CLR requirement is computed by
Cclr=min(E0clr,M+Q−1(L)√{square root over (Vclr)}) (26)
In step 180, Calloc is set equal to the value determined for Cclr in step 175. In step 185, effective bandwidth e0cdv for the connection of the call to be released as well as all the existing connections to meet the CDV requirement is computed using Equation (22). In step 190, the variance of the aggregate traffic load Vcdv and the sum of the lossless effective bandwidth E0cdv to meet the CDV requirement are computed using Equation (23) and (24), respectively. In step 195, the required bandwidth Ccdv to meet the CDV requirements is computed using Equation (25). In step 200, the required bandwidth reqBW is allocated, where reqBW=max(Cclr, Ccdv), and in step 205 the call is released.
When a new connection setup ci request, described by p, m, and b, comes in, in step 220 the effective bandwidth to meet the CLR requirement e0clr is computed using Equation (16). In step 225, the variance of the traffic load vclr is computed using Equation (17). In step 230, the required bandwidth Cclr to meet the CLR requirement is computed using Equation (18). In step 235, Calloc is set equal to the value determined for Cclr in step 230. In step 240, effective bandwidth e0cdv for the new connection to meet the CDV requirement is computed using Equation (22). In step 245, the variance of the traffic load vcdv is set equal to m(e0cdv−m) and e0cdv is assigned the value of e0cdv computed in step 240 for each connection ci. In step 250, the required bandwidth to meet the CDV requirements is computed by
Ccdv=min(E0cdv+e0cdv,(M+m)+Q−1(α)√{square root over (Vcdv+vcdv)}) (27)
In step 255, the required bandwidth reqBW is determined by max (Cclr, Ccdv) and in step 260 the required bandwidth reqBW determined in step 255 is compared to the capacity of the port, or link, Cp, in the system through which the calls are passing. If the required bandwidth reqBW is greater than the capacity of the link Cp, then in step 265 the call is rejected. If the required bandwidth reqBW is not greater than the capacity of the link Cp, then in step 270 the call is accepted and the state variables of the system are updated to include the accepted call as follows:
N=N+1
M+=m
Vclr+=vclr
E0clr+=e0clr
Vcdv+=vcdv
E0cdv+=e0cdv
Specifically, the number of connections N is increased by one, the aggregate traffic load M is updated by adding the new connection's sustainable cell rate (SCR) m to the previous aggregate load, the aggregate variance of the traffic load Vclr is updated by adding the new connection's variance vclr to the previous aggregate variance, the sum of the lossless effective bandwidth E0clr is updated by adding the new connection's lossless effective bandwidth e0clr to the previous effective bandwidth, the aggregate variance of the traffic load Vcdv is updated by adding the new connection's variance vcdv to the previous aggregate variance, and the sum of the lossless effective bandwidth E0cdv is updated by adding the new connection's lossless effective bandwidth e0cdv to the previous effective bandwidth. Thus, in accordance with the present invention, perfect state bookkeeping is performed when a new connection setup is requested to determine if the call will be admitted or denied.
N=N−1
M−=m
Vclr−=vclr
E0clr−=e0clr
Vcdv−=vcdv
E0cdv−=e0cdv
Specifically, the number of connections N is decreased by one, the aggregate traffic load M is updated by subtracting the sustainable cell rate (SCR) m of the call to be released from the previous aggregate load, the aggregate variance of the traffic load Vclr is updated by subtracting the variance vclr of the call to be released from the previous aggregate variance, the sum of the lossless effective bandwidth E0clr is updated by subtracting the lossless effective bandwidth e0clr of the call to be released from the previous effective bandwidth, the aggregate variance of the traffic load Vcdv is updated by subtracting the variance vcdv of the call to be released from the previous aggregate variance, and the sum of the lossless effective bandwidth E0cdv is updated by subtracting the lossless effective bandwidth e0cdv of the call to be released from the previous effective bandwidth.
In step 325, the required bandwidth to meet the CLR requirement is computed using Equation (26). In step 330, the required bandwidth Ccdv to meet the CDV requirement is computed using Equation (25). In step 335, the required bandwidth reqBW is allocated, where reqBW=max (Cclr, Ccdv), and in step 340 the call is released.
The methods of the present invention are implemented in software and, for an ATM or IP network, are to be executed within each access terminal of the network.
C=shelf_PCR1+shelf_PCR2+shelf—PCR3+ . . . +shelf_PCR1 (28)
Reference has been made to embodiments in describing the invention. However, additions, deletions, substitutions, or other modifications which would fall within the scope of the invention defined in the claims may be implemented by those skilled in the art and familiar with the disclosure of the invention without departing from the spirit or scope of the invention. Also, although the invention is described as implemented by a programmable controller, preferably a microprocessor running a software program, it may be implemented in hardware, software, or any combination of the two. All are deemed equivalent with respect to the operation of the invention. Additionally, while the invention has been described with respect to ATM/IP networks, the invention is not so limited and may be used with any type of communication system, including for example wireless communication systems. Accordingly, the invention is not to be considered as limited by the foregoing description, but is only limited by the scope of the appended claims.
Number | Name | Date | Kind |
---|---|---|---|
5463620 | Sriram | Oct 1995 | A |
5583857 | Soumiya et al. | Dec 1996 | A |
5594717 | Watanabe et al. | Jan 1997 | A |
5696764 | Soumiya et al. | Dec 1997 | A |
5850385 | Esaki | Dec 1998 | A |
5862126 | Shah et al. | Jan 1999 | A |
5881049 | Beshai et al. | Mar 1999 | A |
5884174 | Nagarajan et al. | Mar 1999 | A |
5894471 | Miyagi et al. | Apr 1999 | A |
5917804 | Shah et al. | Jun 1999 | A |
5982748 | Yin et al. | Nov 1999 | A |
5982750 | Tabe et al. | Nov 1999 | A |
6028840 | Worster | Feb 2000 | A |
6188690 | Holden et al. | Feb 2001 | B1 |
6215768 | Kim | Apr 2001 | B1 |
6324166 | Yokoyama et al. | Nov 2001 | B1 |
6400685 | Park | Jun 2002 | B1 |
6459681 | Oliva | Oct 2002 | B1 |
6477144 | Morris et al. | Nov 2002 | B1 |
6490249 | Aboul-Magd et al. | Dec 2002 | B1 |
6608815 | Huang et al. | Aug 2003 | B1 |
6687228 | Fichou et al. | Feb 2004 | B1 |
6735172 | Gibbs et al. | May 2004 | B1 |
6865150 | Perkins et al. | Mar 2005 | B1 |
20010026553 | Gallant et al. | Oct 2001 | A1 |