Statistical multiplexing and connection admission control in ATM networks

Asynchronous Transfer Mode (ATM) technology is widely employed for the transport of network traffic, and has the potential to be the base technology for the next generation of global communications. Connection Admission Control (CAC) is the effective traffic control mechanism which is necessary in ATM networks in order to avoid possible congestion at each network node and to achieve the Quality-of-Service (QoS) requested by each connection. CAC determines whether or not the network should accept a new connection. A new connection will only be accepted if the network has sufficient resources to meet its QoS requirements without affecting the QoS commitments already made by the network for existing connections. The design of a high-performance CAC is based on an in-depth understanding of the statistical characteristics of the traffic sources

A review of connection admission control algorithms for ATM networks

The emergence of high-speed networks such as those with ATM integrates large numbers of services with a wide range of characteristics. Admission control is a prime instrument for controlling congestion in the network. As part of connection services to an ATM system, the Connection Admission Control (CAC) algorithm decides if another call or connection can be admitted to the Broadband Network. The main task of the CAC is to ensure that the broadband resources will not saturate or overflow within a very small probability. It limits the connections and guarantees Quality of Service for the new connection. The algorithm for connection admission is crucial in determining bandwidth utilisation efficiency. With statistical multiplexing more calls can be allocated on a network link, while still maintaining the Quality of Service specified by the connection with traffic parameters and type of service. A number of algorithms for admission control for Broadband Services with ATM Networks are described and compared for performance under different traffic loads. There is a general description of the ATM Network as an introduction. Issues to do with source distributions and traffic models are explored in Chapter 2. Chapter 3 provides an extensive presentation of the CAC algorithms for ATM Broadband Networks. The ideas about the Effective Bandwidth are reviewed in Chapter 4, and a different approach to admission control using online measurement is presented in Chapter 5. Chapter 6 has the numerical evaluation of four of the key algorithms, with simulations. Finally Chapter 7 has conclusions of the findings and explores some possibilities for further work

On Evaluating Loss Performance Deviation: A Simple Tool and Its Practical Applications

The focus of this paper is on developing and evaluating a practical methodology for determining if and when different types of traffic can be safely multiplexed within the same service class. The use of class rather than individual service guarantees offers many advantages in terms of scalability, but raises the concern that not all users within a class see the same performance. Understanding when and why a user will experience performance that differs significantly from that of other users in its class is, therefore, of importance. Our approach relies on an analytical model developed under a number of simplifying assumptions, which we test using several real traffic traces corresponding to different types of users. This testing is carried out primarily by means of simulation, to allow a comprehensive coverage of different configurations. Our findings establish that although the simplistic model does not accurately predict the absolute performance that individual users experience, it is quite successful and robust when it comes to identifying situations that can give rise to substantial performance deviations within a service class. As a result, it provides a simple and practical tool for rapidly characterizing real traffic profiles that can be safely multiplexed

An integrated bandwidth allocation and admission control framework for the support of heterogeneous real-time traffic in class-based IP networks

The support of real-time traffic in class-based IP networks requires the reservation of resources in all the links along the end-to-end paths through appropriate queuing and forwarding mechanisms. This resource allocation should be accompanied by appropriate admission control procedures in order to guarantee that newly admitted real-time traffic flows do not cause any violation to the Quality of Service (QoS) experienced by the already established real-time traffic flows. In this paper we initially aim to highlight certain issues with respect to the areas of bandwidth allocation and admission control for the support of real-time traffic in class-based IP networks. We investigate the implications of topological placement of both the bandwidth allocation and admission control schemes. We show that the performance of bandwidth allocation and admission control schemes depends highly on the location of the employed procedures with respect to the end-users requesting the services and the various network boundaries (access, metro, core, etc.). Based on our results we conclude that the strategies for applying these schemes should be location-aware, because the performance of bandwidth allocation and admission control at different points in a class-based IP network, and for the same traffic load, can be quite different and can deviate greatly from the expected performance. Through simulations we also try to provide a quantitative view of the aforementioned deviations. Taking the implications of this “location-awareness” into account, we subsequently present a new Measurement-based Admission Control (MBAC) scheme for real-time traffic that uses measurements of aggregate bandwidth only, without keeping the state of any per-flow information. In this scheme there is no assumption made on the nature of the traffic characteristics of the real-time traffic flows, which can be of heterogeneous nature. Through simulations we show that the admission control scheme is robust with respect to traffic heterogeneity and measurement errors. We also show that our scheme compares favorably against other admission control schemes in the literature

Application of Network Calculus To Guaranteed Service Networks

We use recent network calculus results to study some properties of lossless multiplexing as it may be used in guaranteed service networks. We call network calculus a set of results that apply min-plus algebra to packet networks. We provide a simple proof that shaping a traffic stream to conform with a burstiness constraint preserves the original constraints satisfied by the traffic stream We show how all rate based packet schedulers can be modeled with a simple rate latency service curve. Then we define a general form of deterministic effective bandwidth and equivalent capacity. We find that call acceptance regions based on deterministic criteria (loss or delay) are convex, in contrast to statistical cases where it the complement of the region which is convex. We thus find that, in general, the limit of the call acceptance region based on statistical multiplexing when the loss probability target tends to 0 may be strictly larger than the call acceptance region based on lossless multiplexing. Lastly, we consider the problem of determining the optimal parameters of a variable bit rate (VBR) connection when it is used as a trunk, or tunnel, given that the input traffic is known. We find that there is an optimal peak rate for the VBR trunk, essentially insensitive to the optimization criteria. For a linear cost function, we find an explicit algorithm for the optimal remaining parameters of the VBR trunk

Application of an automatically designed fuzzy logic decision support system to connection admission control in ATM networks

PhDAbstract not availabl