Multiplex communications – Data flow congestion prevention or control – Flow control of data transmission through a network
Reexamination Certificate
1999-12-21
2004-05-11
Chin, Wellington (Department: 2664)
Multiplex communications
Data flow congestion prevention or control
Flow control of data transmission through a network
C370S229000, C370S237000, C370S395210
Reexamination Certificate
active
06735172
ABSTRACT:
FIELD OF THE INVENTION
The invention relates to an arrangement and method for connection or call admission control (CAC) in a broadband network. The invention further relates to software for carrying out the method.
BACKGROUND TO THE INVENTION
Broadband, e.g. ATM networks are being increasingly used for the transport of narrow band voice traffic, typically by interfacing the broadband network with one or more legacy TDM voice networks. In order to adapt this narrow band traffic to the ATM transport protocols, it has become common practice to package this traffic into minicells using the ATM Adaptation Layer 2 (AAL2) protocol. These minicells are then transported within ATM cells.
It will be appreciated that one of the constraints placed on the transport of voice traffic is the provision of guarantees on the quality of service (QoS). This in turn requires appropriate network management to ensure that sufficient bandwidth to support the quality of service is, and will remain, available before a call or connection request is accepted. This process is generally referred to as connection admission control.
Connection admission control is one of a number of known techniques for managing and controlling traffic and congestion in, connection-orientated networks. In particular, it is used in ATM (asynchronous transfer mode) networks to provide quality of service (QOS) guarantees. It is not of course limited to use in ATM networks. Connection admission control (CAC) procedures are used to decide if a request for an ATM connection can be accepted, based on the network capacity and the attributes of both the requested connection and existing connections. This is one application which requires that an equivalent bandwidth be determined accurately both for the new connection and for the existing connections. It is important that there is always enough bandwidth so that quality of service guarantees for the existing connections and the requested connections, can be met.
Connection admission control (CAC) procedures may be used at an access node at the edge of an ATM network to enable control of access to the route through the ATM network as route selection is made. A second level, may be used at each node along the selected route through the ATM network, to confirm that a respective link beyond that node, can admit the connection.
An estimate of the bandwidth required by the connection, and knowledge of the available bandwidth on each link is required. The CAC algorithm at the network edge uses parameters available from the routing database, and characteristics of the connection being requested (available from signalling information) to determine if an individual link is likely to accept or reject the connection. The link
ode is included if it is likely to accept the connection, and excluded from the route selection algorithm if it is unlikely to accept the connection.
After path selection is done, each node along the chosen route executes its own CAC algorithm, using factors such as link capacity, buffering capability or queuing architecture, traffic descriptors, QOS requirements and capacity allocated to different types of traffic or different connections.
Some of these parameters are fixed and some are variable. Queue size and the desired QOS are examples of fixed parameters, whereas the traffic descriptor and current available link capacity are dynamic parameters. The calculation is complex because connections typically use variable rates of ATM cell flow. Such flows can be described statistically using parameters such peak cell rate, and maximum burst size. By calculating an effective capacity, also known as effective bandwidth, for individual connections, many connections can share the bandwidth of an individual link more efficiently, without having to provide the peak bandwidth for all connections.
Many algorithms have been proposed for determining the effective capacity of the requested connections, and of existing connections. Some are described in an article entitled “Performance Evaluation of Connection Admission Control Techniques in ATM Networks” by Jamoussi et al, published in a 1996 IEEE journal. This article notes that a good CAC algorithm strives to achieve a balance of the objectives of QOS guarantee, execution speed, link efficiency, and simplicity.
A summary of admission techniques is provided by Perros and Khaled in IEEE communications magazine November 1996, “Call Admission control schemes, a review”. One known technique is shown in an article by Guerin et al entitled “Equivalent capacity and its application to bandwidth allocation” from the IEEE journal on selected areas in communications. Vol 9, no. 7. It involves determining an approximation for the equivalent bandwidth of an individual connection by using a known relationship between parameters of the connection, size of buffer at the Admission control node, and a quality of service matrix which may be probability of overflow, i.e. cell loss ratio (CLR).
The above referenced paper by Guerin et al shows that an approximation based on a combination of a fluid flow approximation and a stationary or static approximation gives results to an exact evaluation of equivalent capacity as defined by equation (1).
∈
=
β
·
exp
(
-
K
(
c
-
ρ
R
peak
)
b
(
1
-
ρ
)
(
R
peak
-
c
)
c
)
where
β
=
(
c
-
ρ
R
peak
)
+
∈
ρ
(
R
peak
-
c
)
(
1
-
ρ
)
c
(
1
)
R
peak
=Peak rate
□=Probability of overflow (i.e. CLR)
c=Equivalent capacity
K=Buffer size
□=Fraction of time source active
b=Mean duration of active period (talk spurt)
As this equation is computationally extremely strenuous the approximation using the minimum of the fluid flow approximation and the stationary approximation as proposed by Guerin and shown in equation (2) is used.
C
=
min
{
∑
t
=
1
N
m
i
+
a
′
∑
i
=
1
N
σ
i
2
,
∑
i
=
1
N
c
j
}
(
2
)
where
&agr;
1
={square root over (−2l n(&egr;)−ln(
2&pgr;
))}
m
□
=Mean bit-rate of i
th
source
R
peaki
=Peak rate of i
th
soure
□
C
2
=Variance of i
th
source, =m
i
x(R
peaki
−m
i
)
□=Probability of overflow (i.e. CLR)
C
a
=the total equivalent bandwidth of N channels
As can be seen, this equation (2) is based on values of mean bit rate. Variance, and bandwidth used (otherwise termed equivalent capacity). These values are determined by adding look up values which represent the increment or delta beyond the current running totals of these values, to the existing running totals. The resulting values are used to calculate static and flow approximations and thus the resulting equivalent bandwidth to be in use if the requested connection is to be admitted.
The relationship defined in equation (1) above is complex, and so can only be evaluated by numerical or iterative methods which are too computationally intensive to be usable in a practical network with sufficient accuracy. Accordingly, in Guerin et al, a major factor in this complex relationship, is approximated rather than evaluated. This enables the relationship to be evaluated using normal algebraic methods without requiring a lengthy numerical analysis or iterative method.
To calculate the aggregate equivalent bandwidth of the numerous connections already admitted, so that the available bandwidth can be determined, Guerin et al proposes taking the minimum of two approximations. The first is a static approximation, and the second is a fluid flow approximation. The result is greater than the real equivalent capacity, except where static evaluation under-estimates the equivalent capacity. The static approximation is representative of the bandwidth required for a large number of connections, when the effects o
Gibbs Graeme A
Sabry Martin
Barnes & Thornburg
Chin Wellington
Jain Raj
Nortel Networks Limited
LandOfFree
Providing connection admission control in a communications... does not yet have a rating. At this time, there are no reviews or comments for this patent.
If you have personal experience with Providing connection admission control in a communications..., we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Providing connection admission control in a communications... will most certainly appreciate the feedback.
Profile ID: LFUS-PAI-O-3196622