Admission Control In ATM Networks Research Articles

Sustaining Negotiated QoS in Connection Admission Control for ATM Networks Using Fuzzy Logic Techniques

An international association advancing the multidisciplinary study of informing systems. Founded in 1998, the Informing Science Institute (ISI) is a global community of academics shaping the future of informing science.

An adaptive call admission control in ATM networks using optimized measurements windows

We propose an adaptive measurement-based admission control algorithm that uses optimization procedure to choose an appropriate measurement window size dynamically. Previous designs on measurement-based admission control mainly focused on strategies that consider the worst case traffic source model to guarantee QoS bounds for all connections. In this paper, we develop a simple mechanism in which both statistical multiplexing gain and QoS are considered An accurate formula for the cell loss probability which is combined with measurements, is presented for refined on/off traffic model. Furthermore, more accurate measurements of traffic would be given to admission controller through optimized window size. The proposed adaptive control is an appealing alternative: not only does it offer adaptivity to changing traffic conditions, but supports a guarantee that loss QoS bound is not violated due to the admission of new calls into ATM network. Simulations were performed to test the performance of the proposed algorithm.

Connection admission control in ATM networks using survey-based type-2 fuzzy logic systems

This paper presents a connection admission control (CAC) method that uses a type-2 fuzzy logic system (FLS). Type-2 FLSs can handle linguistic uncertainties. The linguistic knowledge about CAC is obtained from 30 computer network experts. A methodology for representing the linguistic knowledge using type-2 membership functions and processing surveys using type-2 FLS is proposed. The type-2 FLS provides soft decision boundaries, whereas a type-1 FLS provides a hard decision boundary. The soft decision boundaries can coordinate the cell loss ratio (CLR) and bandwidth utilization, which is impossible for the hard decision boundary.

Automatically designed fuzzy system for connection admission control in ATM networks

Connection admission control (CAC) is a vital function for asynchronous transfer mode networks. A CAC algorithm should be simple, i.e. economically implementable and fast, and it should be efficient, i.e. allow statistical multiplexing. A solution based on an analytical queueing model is too CPU-intensive and cannot be applied online. The paper proposes a new scheme based on fuzzy logic. The aim is to predict online the cell loss ratio that a connection will exhibit if it is accepted into the network. The CAC scheme is based on a consideration of fuzzy logic and artificial neural networks (ANNs). The ANN is used in the learning phase to tune the fuzzy system automatically. The structure of the neuro-fuzzy system is discussed. A training set obtained by an analytical algorithm, namely the convolution algorithm, is used to develop a learning algorithm and to check the applicability of the technique.

Practical connection admission control for ATM networks based on on-line measurements

We present algorithms for connections admission control (CAC) in an ATM network based upon the use of on-line measurement and estimation. (The algorithms described in this paper are the subject of a UK patent application.) Our approach uses the theory of large deviations, which is a valuable tool for reasoning about rare events in stochastic systems. We have shown previously that the large deviations rate function, or entropy, of ATM traffic can be estimated from activity measurements. This can be used to determine the effective bandwidth of the traffic. In this paper we present practical measurement-based CAC algorithms which are computationally efficient, and can be used with traffic whose statistical characteristics are unknown.

Bandwidth allocation and call admission control in ATM networks

Bandwidth allocation and call admission control in ATM networks

Bandwidth allocation and call admission control in ATM networks

This paper is concerned with dynamic resource allocation in ATM networks. One of the essential issues in designing and configuring an ATM network is guaranteeing the quality of service for different connections. This needs more advanced functions to monitor the current situation, determine the required resource, allocate the resource and modify it. In this paper we introduce a new dynamic resource allocation metric based on probabilistic tools which serves as a monitoring mechanism of resource allocation in ATM systems. © 1998 John Wiley & Sons, Ltd.

Fast and accurate estimation of ATM quality-of-service parameters with applications to call admission control

It is demonstrated how fast and accurate estimates of quality-of-service (QOS) parameters can be obtained for an ATM multiplexer queueing model fed by multiple Markovian traffic sources. This has been achieved by constructing a simple approximation of the buffer overflow probability, which involves computation of two parameters based on the theory of large deviations. Upper bounds on other QOS parameters, such as cell loss ratio, mean cell delay and cell delay variance, can all be derived from this estimate. It is shown that this approximation is much more accurate than the pure effective bandwidth one, which ignores the statistical multiplexing gain due to a large number of sources. One attraction of the proposed method is that the speed of computation of this approach is independent of the size of the system. Thus the authors' analytical techniques can be implemented fast enough for real-time admission control in ATM networks.

Upper bounds for blocking probabilities in large multi-rate loss networks

In this paper, we consider large loss networks with fixed routing and multi?rate traffic. We use single?link formulae and standard results on multidimensional Gaussian distributions to obtain upper bounds for blocking probabilities of new calls under light up to critical loading conditions. This is the loading regime of interest for many practical applications such as admission control in ATM networks. The main advantage of our approach is that the complexity does not scale with the size of the system, making it numerically attractive. Comparison with simulation results show that we get good upper bounds. We conclude by discussing the correlation between links in a network.

Integrated dynamic distributed routing and admission control in ATM networks

A node-by-node admission control and routing scheme for ATM networks is devised. The scheme is based on the subdivision of traffic into a number of classes, characterized by different performance requirements. At each network node, for all outgoing links, link capacity partitions are periodically assigned to the traffic classes, as the result of an optimization problem over a fixed time interval. Local access control rules compute the maximum number of connections of each class that a link can accept within the assigned capacity. Incoming call connection requests are forwarded in a hop-by-hop fashion. Each node traversed, first checks the presence of resources needed to accept a new connection and guarantee all quality of service (QoS) requirements. This is done by using the local access control rule. Then, it chooses the next node along the path on the basis of a distributed routing strategy. This minimizes a cost function accounting for local instantaneous information, as well as for aggregate information that is passed periodically among adjacent nodes. Two routing strategies are introduced. In the first scheme, a new call is rejected if, at a certain node along the path, there are not enough resources to guarantee QoS requirements, and no recovery mechanism is implemented. In the second scheme, an alternative path is looked for after the first failure. Simulation results are presented which show a comparison between the two proposed routing strategies. Comparison is also made between the proposed scheme and the other approaches. © 1997 John Wiley & Sons, Ltd.

Integrated dynamic distributed routing and admission control in ATM networks

Integrated dynamic distributed routing and admission control in ATM networks

Neural-network-based call admission control in ATM networks with heterogeneous arrivals

Call Admission Control (CAC) has been accepted as a potential solution for supporting diverse, heterogeneous traffic sources demanding different Quality of Services (QOSs) in ATM networks. Also, CAC is required to consume a minimum of time and space to make call acceptance decisions. In this paper, we present an efficient neutral-network-based CAC (NNCAC) mechanism for ATM networks with heterogeneous arrivals. All heterogeneous traffic calls are initially categorized into various classes. Based on the number of calls in each class, NNCAC efficiently and accurately estimates the cell delay and cell loss ratio of each class in real time by means of a pre-trained neutral network. According to our decent study which exhibits the superiority of the employment of analysis-based training data over simulation-based data, we particularly construct the training data from a heterogeneous-arrival dual-class queueing model M [ N 1] + I [ N 2] / D/1/ K, where M and I represent the Bernoulli and interrupted Bernoulli processes, and N 1 and N 2 represent the corresponding numbers of calls, respectively. Analytic results of the queueing model are confirmed by simulation results. Finally, we demonstrate the profound agreement of our neural-network-based estimated results with analytic results, justifying the viability of our NNCAC mechanism.

Bandwidth allocation and admission control in ATM networks with service separation

The statistical multiplexing operation within an ATM network node is considered, with respect to different methods for the allocation of the bandwidth of an outgoing link. Service separation is assumed by dividing the overall traffic flows into classes, homogeneous in terms of performance requirements and statistical characteristics. Which share the bandwidth of a link according to some specified policy. This context allows one to clearly define, by means of several existing approaches, a region in the space of connections of the different classes (call space) where quality of service (QoS) requirements at the cell level are satisfied. Within this region, some criteria for allocating the bandwidth of the link to the service classes are proposed, and the resulting allocation and call admission control (CAC) strategies are defined and analyzed. The goal of these operations is to achieve some desired QoS at the call level. Several numerical simulation results are presented, in order to highlight the different performance characteristics of the various methods.

An adaptive scheme for admission control in ATM networks

This paper presents a real time front-end admission control scheme for ATM networks. A call management scheme which uses the burstiness associated with traffic sources in a heterogeneous ATM environment to effect dynamic assignment of bandwidth is presented. In the proposed scheme, call acceptance is based on an on-line evaluation of the upper bound on cell loss probability which is derived from the estimated distribution of the number of calls arriving. Using this scheme, the negotiated quality of service will be assured when there is no estimation error. The control mechanism is effective when the number of calls is large, and tolerates loose bandwidth enforcement and loose policing control. The proposed approach is very effective in the connection oriented transport of ATM networks where the decision to admit new traffic is based on the a priori knowledge of the state of the route taken by the traffic.

Optimal connection admission control in ATM networks

We characterize the achievable performance of ATM networks in terms of the offered traffic, the admissible region, and the revenue measure. We describe how the boundaries of admissible regions with convex complements may be linearized —thus reducing the admissible region — so as to obtain a convenient loss network representation. Asymptotic results for the achievable performance suggest that the potential reduction in revenue is immaterial in high-capacity networks. Numerical experiments confirm that the actual reduction is typically negligible, even in networks of moderate capacity.

Optimal connection admission control in ATM networks

Abstract We characterize the achievable performance of ATM networks in terms of the offered traffic, the admissible region, and the revenue measure. We describe how the boundaries of admissible regions with convex complements may be linearized —thus reducing the admissible region — so as to obtain a convenient loss network representation. Asymptotic results for the achievable performance suggest that the potential reduction in revenue is immaterial in high-capacity networks. Numerical experiments confirm that the actual reduction is typically negligible, even in networks of moderate capacity.

Effective bandwidth approach to connection admission control for multimedia traffic in ATM networks

The authors propose an effective bandwidth approach to connection admission control in ATM networks. The aggregate arrival traffic is accurately modelled by a two-state Markov modulated Poisson process (MMPP) via the matching of four important statistics. If the buffer is large, admission control can be achieved by computing the effective bandwidth of the two-state MMPP. Simulation tests show that the approach is simple and results in higher utilisation compared with conventional methods.

A method for call admission control in ATM networks with heterogeneous sources

We present a procedure for call admission control for ATM networks. The procedure can be applied to deciding if an additional Virtual Channel (user, source) can be assigned to an end-to-end Virtual Path, or if a link connecting two ATM switches can carry an additional VC. Each source is characterized by its peak rate, mean rate, and cycle length. The objective is to admit as many sources as possible, while meeting a desirable level of cell loss probability. We adapt an effective bandwidth technique to the case where sources do not have to belong to a small number of classes. We do this by suggesting an upper bound for the cell-loss-probability for the case of heterogeneous Markovian on-off sources, and by showing that its computation can be performed in real time by the sending switch, with a reasonable amount of computational and storage resources. We show by simulation that the proposed procedure is effective even for highly bursty source mixes, where it achieves more than 80% of the theoretically possible multiplexing gain.

Approximating the heterogeneous fluid queue with a birth-death fluid queue

Recent research has shown that fluid-flow queueing models accurately determine the burst level component of the ATM multiplexer process, and fluid models therefore constitute an efficient tool for the investigation of admission control in ATM networks. This article first gives a review of Markov-driven fluid queues with special attention given to the heterogeneous on/off model. Then an approximation procedure in which the original heterogeneous arrival process is replaced by a homogeneous birth-death arrival process is presented. The substitution is based on matching statistical parameters. Finally, the approach is evaluated by numerical examples. >

A decision-theoretic approach to call admission control in ATM networks

This paper describes a simple and robust ATM call admission control, and develops the theoretical background for its analysis. Acceptance decisions are based on whether the current load is less than a precalculated threshold, and Bayesian decision theory provides the framework for the choice of thresholds. This methodology allows an explicit treatment of the trade-off between cell loss and call rejection, and of the consequences of estimation error. Further topics discussed include the robustness of the control to departures from model assumptions, its performance relative to a control possessing precise knowledge of all unknown parameters, the relationship between leaky bucket depths and buffer requirements, and the treatment of multiple call types. >