Call admission control is a principal component for QoS delivery in IP networks. It determines the extent to which network resources are utilized. It determines also whether QoS are actually delivered or not. Continuing on the steps of the existing approaches, we introduce a distributed and scalable admission control scheme to provide end-to-end statistical QoS guarantees in Differentiated Serv...

We consider the problem of admission control for variable-rate traac sources sharing a buuerless link, in order to provide a quality-of-service in terms of overload probability. Through analysis and simulations, we study the performance of a scheme which has no prior knowledge of the traac statistics and makes admission decision based on the current network state only. We analyze the dynamics o...

This paper presents a call admission control (CAC) algorithm that aids in the Quality of Service (QoS) support in a wireless network base station. The Threshold Access Sharing (TAS) scheme provides improved performance over generalized methods of current CAC algorithms. The TAS algorithm relies on a prioritization of admitted traffic through bandwidth thresholds. This is particularly vital for ...

A per-connection end-to-end call admission control (CAC) problem is solved in this paper to allocate network resources to an input session to guarantee its quality of service (Qos) requirements. In conjunction with the solution of the CAC problem, a traffic descriptor is proposed to describe the loss rate and the delay bound Qos requirements of the connection to be set up as well as the statist...

In wireless multimedia communication systems, call admission control (CAC) is critical for simultaneously achieving a high resource utilization efficiency and maintaining quality-of-service (QoS) to mobile users. User mobility, heterogeneous nature of multimedia traffic, and limited radio spectrum pose significant challenges to CAC. QoS provisioning to both new calls and handoff calls comes wit...

In this paper we consider call admission control of multiple classes without waiting room. We use event-based dynamic programming for our model. We show that sometimes the customer classes can be ordered: if it is optimal to accept a class, then to accept a more profitable class is optimal too. We demonstrate submodularity of the minimum cost for the 2-classes problem and establish some propert...

In this work, we investigate the performance of distributed admission control with QoS provisioning and dynamical channel allocation for mobile/wireless networks. We first provide a QoS metric feasible for admission control with dynamically allocated channels. We then derive analytically a criterion using the QoS measure for distributed call admission control with dynamic channel allocation. Si...

In this paper, we solve the call admission control (CAC) problem in a cellular network via a form of NeuroEvolution algorithm. The results are compared with Complete Sharing scheme, which allows all types of traffic to access all available channels at all time, and show that our proposed CAC scheme CN can reduce the hand off failure subject to several predefined Quality of Service (QoS) constra...

Fault Tolerance: A Model-Theoretic Approach to Fault Tolerance and Fault Compensation without Error Correction Leo Marcus (2011). International Journal of Adaptive, Resilient and Autonomic Systems (pp. 25-35). www.igi-global.com/article/abstract-fault-tolerance/62846?camid=4v1a A Scheduling Model with Multi-Objective Optimization for Computational

| In this paper, we consider a CDMA cellular network that has signal power as its scare resource and uses the multicode transmission scheme to support multiclass calls with di erent QoS requirements. By simply extending the number-based scheme to accomodate multiclass traÆc, we present a power-based call admission control scheme. Contrary to the general fact that complete sharing (CS) achieves ...