Overview of measurement-based connection admission control methods in ATM networks

An overview is given of previously-proposed measurement-based connection admission control (CAC) methods. First we address requirements for CAC methods, and then provide a taxonomy for CAC methods. Measurement-based CAC methods are discussed in detail, classified according to the taxonomy, and compared against each other with respect to the requirements. We conclude that measurement-based CAC methods based on effective bandwidth and bufferless models are promising because they do not require complex hardware and are less dependent on assumptions regarding traffic than methods in which the effect of buffer is considered.     

A QoS-provisioning neural fuzzy connection admission controller formultimedia high-speed networks

This paper proposes a neural fuzzy approach for connection admission control (CAC) with QoS guarantee in multimedia high-speed networks. Fuzzy logic systems have been successfully applied to deal with traffic-control-related problems and have provided a robust mathematical framework for dealing with real-world imprecision. However, there is no clear and general technique to map domain knowledge on traffic control onto the parameters of a fuzzy logic system. Neural networks have learning and adaptive capabilities that can be used to construct intelligent computational algorithms for traffic control. However, the knowledge embodied in conventional methods is difficult to incorporate into the design of neural networks. The proposed neural fuzzy connection admission control (NFCAC) scheme is an integrated method that combines the linguistic control capabilities of a fuzzy logic controller and the learning abilities of a neural network. It is an intelligent implementation so that it can provide a robust framework to mimic experts' knowledge embodied in existing traffic control techniques and can construct efficient computational algorithms for traffic control. We properly choose input variables and design the rule structure for the NFCAC controller so that it can have robust operation even under dynamic environments. Simulation results show that compared with a conventional effective-bandwidth-based CAC, a fuzzy-logic-based CAC, and a neural-net-based CAC, the proposed NFCAC can achieve superior system utilization, high learning speed, and simple design procedure, while keeping the QoS contract     

Managing bandwidth in ATM networks with bursty traffic

Three approaches to the bandwidth management problem that have been proposed and studied by various groups are reviewed to illustrate three distinctly different approaches and identify their strengths and weaknesses. Based on these approaches, a bandwidth management and congestion control scheme for asynchronous transfer mode (ATM) networks that supports both point-to-point and one-to-many multicast virtual circuits is proposed. It is shown that the method can handle fully heterogeneous traffic and can be effectively implemented. The algorithm for making virtual circuit acceptance decisions is straightforward and fast, and the hardware mechanisms needed to implement buffer allocation and traffic monitoring at the user-network interface have acceptable complexities. It is also shown, through numerical examples, that the approach can achieve reasonable link efficiencies even in the presence of very bursty traffic. No advance reservation required, simplifying the interface between the network and the user and avoiding an initial network round trip delay before data can be transmitted     

A connection admission control scheme based on game theoretical model in ATM networks

In this paper, the main schemes of connection admission control (CAC) in ATM networks are briefly discussed especially the principle of dynamic bandwidth allocation. Then the fair share of the bandwidth among different traffic sources is analyzed based on cooperative game model. A CAC scheme is proposed using the genetic algorithm (GA) to optimize the bandwidth-delay-product formed utilization function that ensures the fair share and accuracy of accepting/rejecting the incoming calls. Simulation results show that the proposed scheme ensures fairness of the shared bandwidth to different traffic sources.     

Estimation of equivalent bandwidth without modeling arrival processes for connection admission control in an ATM multiplexer

The traffic modeling is a key element in analyzing and simulating communications network. Most of the previously studied approaches to the connection admission control (cac) are based on an assumed arrival process model. However, there are some limits to apply the assumed model to the real environment. In this paper, we study a connection admission control (cac) method without assuming arrival processes in an atm multiplexer when homogeneous traffics are multiplexed. To obtain the equivalent bandwidth (eb) without modeling arrival processes, the concept of equivalent bandwidth convergence (ebc) is proposed and implemented by using the upper bound of the first derivative of cell loss rate (clr) for the load. With the ebc concept, one can avoid modeling of the arrival process and implement the cac simply and effectively. We show by numerical examples the convergence process of the average clr and the eb for voice and video traffics, and the robustness of the ebc concept.     

Dynamic call admission control in ATM networks

The authors present dynamic call admission control using the distribution of the number of cells arriving during the fixed interval. This distribution is estimated from the measured number of cells arriving at the output buffer during the fixed interval and traffic parameters specified by users. Call acceptance is decided on the basis of online evaluation of the upper bound of cell loss probability, derived from the estimated distribution of the number of calls arriving. QOS (quality of service) standards can be guaranteed using this control when there is no estimation error. The control mechanism is effective when the number of call classes is large. It tolerates loose bandwidth enforcement and loose policing control, and dispenses with modeling of the arrival processes. Numerical examples demonstrate the effectiveness of this control, and implementation is also discussed     

A parametric optimization approach to admission control and bandwidth assignment in hybrid TDM networks

The access to a multiservice synchronous TDM network is considered, where hybrid frames are used to carry two basic traffic types (a circuit-switched isochronous and a packet-switched asynchronous one), generated by several users. Each user is assigned a portion of the total available bandwidth, in terms of slots/frame, which is dynamically allocated between the two traffic types at the user premises, by means of a local randomized decision rule. The users' bandwidth shares (capacities) are allocated by a centralized agent, whose goal is to minimize a global cost function that accounts for packet delays and call blocking of the entire process. Parametric optimization problems for the central agent are defined and the application of suitable descent techniques is shown, with the cost function extending over a finite and an infinite time horizon, respectively. The specific nature of the optimization problems is discussed, and numerical examples and simulations are presented that illustrate the effectiveness of the method.     

Fuzzy connection admission control for ATM networks based onpossibility distribution of cell loss ratio

This paper proposes a connection admission control (CAC) method for asynchronous transfer mode (ATM) networks based on the possibility distribution of cell loss ratio (CLR). The possibility distribution is estimated in a fuzzy inference scheme by using observed data of the CLR. This method makes possible secure CAC, thereby guaranteeing the allowed CLR. First, a fuzzy inference method is proposed, based on a weighted average of fuzzy sets, in order to estimate the possibility distribution of the CLR. In contrast to conventional methods, the proposed inference method can avoid estimating excessively large values of the CLR. Second, the learning algorithm is considered for tuning fuzzy rules for inference. In this, energy functions are derived so as to efficiently achieve higher multiplexing gain by applying them to CAC. Because the upper bound of the CLR can easily be obtained from the possibility distribution by using this algorithm, CAC can be performed guaranteeing the allowed CLR. The simulation studies show that the proposed method can well extract the upper bound of the CLR from the observed data. The proposed method also makes possible self-compensation in real time for the case where the estimated CLR is smaller than the observed CLR. It preserves the guarantee of the CLR as much as possible in operation of ATM switches. Third, a CAC method which uses the fuzzy inference mentioned above is proposed. In the area with no observed CLR data, fuzzy rules are automatically generated from the fuzzy rules already tuned by the learning algorithm with the existing observed CLR data. Such areas exist because of the absence of experience in connections. This method can guarantee the allowed CLR in the CAC and attains a high multiplex gain as is possible. The simulation studies show its feasibility. Finally, this paper concludes with some brief discussions     

Comparison of admission control schemes in ATM networks

Asynchronous transfer mode (ATM) offers an efficient means of carrying a wide spectrum of BISDN traffic provided that network congestion is prevented. Unfortunately, efficient congestion control is difficult to achieve in integrated broadband networks, owing to the wide range of traffic characteristics and quality of service (QOS) requirements. We have implemented a network simulator that allows us to evaluate many proposed admission control schemes using many different traffic models. We present the results of several simulation studies, including one study of the performance of the admission control schemes in the presence of traffic sources that exhibit long-term dependence.     

Neural networks for adaptive traffic control in ATM networks

Neural networks (NNs) have several valuable properties for implementing ATM traffic control. The authors present NN-based solutions for two problems arising in connection admission control, affecting the grade of service (GOS) at both the cell and call levels, and propose that neural networks may increase the network throughput and revenue     

Connection admission control with picture-type dependent effectivebandwidths for VBR MPEG video traffic in ATM networks

The I-picture starting time distribution of variable bit rate (VBR) MPEG video sources may significantly affect the cell loss characteristics of ATM multiplexers. The authors propose a new connection admission control (CAC) method which can reflect this effect. For CAC, VBR MPEG video traffic is modelled as a composite sequence of three subsequences with different effective bandwidths according to their picture coding types. Experimental results show that the proposed method can fully reflect this effect due to the starting time distribution while also improving network utilisation significantly     

A dynamic call admission scheme for VBR traffic in ATM networks

The role of call admission control (CAC) in high-speed networks is to maintain the network utilization at a high level, while ensuring that the quality of service (QoS) requirements of the individual calls are met. We use the term static CAC to describe schemes that always allocate the same bandwidth to a specific group of multiplexed calls, independent of the other traffic sharing the link. Dynamic CAC, on the other hand, denotes a scheme in which the bandwidth allocation to a group of calls sharing a queue is influenced by the traffic in other queues destined for the same outgoing link. We propose a generic dynamic call admission scheme for VBR and ABR traffic whose aim is to reduce the blocking rate for VBR calls at the expense of a higher blocking rate for ABR calls. Our scheme is generic because it builds up on a pre-existing static scheme, e.g., one based on a simple notion of effective bandwidth. Our simple approach results in a significant reduction of the blocking rate for VBR traffic (several orders of magnitude), if the bandwidth requirements of a single call are a reasonably small fraction of the link capacity. At the same time, the deterioration of service for ABR traffic can be contained. This revised version was published online in August 2006 with corrections to the Cover Date.     

Effective bandwidth of general Markovian traffic sources andadmission control of high speed networks

A prime instrument for controlling congestion in a high-speed network is admission control, which limits calls and guarantees a grade of service determined by delay and loss probability in the multiplexer. It is shown that for general Markovian traffic sources it is possible to assign a notional effective bandwidth to each source that is an explicitly identified, simply computed quantity with provably correct properties in the natural asymptotic regime of small loss probabilities. It is the maximal real eigenvalue of a matrix that is directly obtained from the source characteristics and the admission criterion, and for several sources it is simply additive. Both fluid and point process models are considered. Numerical results show that the acceptance set for heterogeneous classes of sources is closely approximated and conservatively bounded by the set obtained from the effective bandwidth approximation. The bandwidth-reducing properties of the leaky bucket regulator are exhibited numerically     

Intelligent traffic control for ATM broadband networks

Performance results prove that a neural networks approach achieves better results, simpler and faster, than algorithmic approaches. The focus of this paper is to shed light on how neural networks (NNs) can be used to solve many of the serious problems encountered in the development of a coherent traffic control strategy in ATM networks. The main philosophy that favors neural networks over conventional programming approaches is their learning and adaptive capabilities, which can be utilized to construct adaptive (and computationally intelligent) algorithms for allocation of resources (e.g., bandwidth, buffers), thus providing highly effective tools for congestion control     

Cross-Layer optimal connection admission control for variable bit rate multimedia traffic in packet wireless CDMA networks

Next generation wireless code division multiple access (CDMA) networks are required to support packet multimedia traffic. This paper addresses the connection admission control problem for multiservice packet traffic modeled as Markov modulated Poisson process (MMPP) with the quality of service (QoS) requirements on both physical layer signal-to-interference ratio (SIR) and network layer blocking probability. Optimal linear-programming-based algorithms are presented that take into account of SIR outage probability constraints. By exploiting the MMPP traffic models and introducing a small SIR outage probability, the proposed algorithms can dramatically improve the network utilization. In addition, we propose two reduced complexity algorithms that require less computation and can have satisfactory approximation to the optimal solutions. Numerical examples illustrating the performance of the proposed schemes are presented.     

Effective control of traffic flow in ATM networks using fuzzyexplicit rate marking (FERM)

We describe the fuzzy explicit fate marking (FERM) traffic flow control algorithm for a class of best effort service, known as available bit rate (ABR), proposed by the ATM Forum. FERM is an explicit rate marking scheme in which an explicit rate is calculated at the asynchronous transfer mode (ATM) switch and sent back to the ABR traffic sources encapsulated within resource management (RM) cells. The flow rate is calculated by the fuzzy congestion control (FCC) module by monitoring the average ABR queue length and its rate of change, then by using a set of linguistic rules. We use simulation to compare the steady-state and transient performance of FERM with EPRCA (a current favourite by the ATM Forum) in the presence of high priority variable bit rate (VBR) video and constant bit rate (CBR) in both a local-area network (LAN) and a wide-area network (WAN) environment. Our experiments show that FERM exhibits a robust behavior, even under extreme network loading conditions, and ensures fair share of the bandwidth for all virtual channels (VCs) regardless of the number of hops they traverse. Additionally, FERM controls congestion substantially better than EPRCA, offers faster transient response, leads to lower end-to-end delay and better network utilization     

A dynamic bandwidth control scheme of VP in ATM networks

This paper proposes an efficient adaptive bandwidth allocation scheme of virtual paths. The bandwidth of a virtual path is dynamically adjusted according to the link residual capacity. The scheme can remarkably reduce the load on node processing and simplify the network architecture, while keeping higher transmission efficiency. The excellent performance is proved by detailed theoretical analyses.     

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.     

Bandwidth allocation and admission control in ATM networks withservice 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     

Adaptive bandwidth management in ATM networks

A framework for adaptive bandwidth management in ATM based networks is proposed. It is based on a layered approach which includes bandwidth allocation to virtual networks. The central concept of this approach is adaptive estimation of the effective bandwidth required, by connections carried in the network. To achieve reliable results the estimation process takes into account both the traffic source declarations and the connection superposition process measurements on the network links. This is done in an optimization framework provided by estimation theory. A study, based on a linear two-state Kalman filter, shows that the proposed approach provides good adaptation to undeclared changes in traffic parameters and that the network performance is significantly improved when compared to the effective bandwidth allocation based solely on the source parameters declarations. These features allow more relaxed source parameter declarations and at the same time permit less stringent source policing. Thus the two bottlenecks influencing bandwidth management in ATM networks can be significantly widened.