On multi‐cell admission control in CDMA networks

We consider a multi‐cell (MC) code division multiple access (CDMA) system that supports multiple service classes, including peak rate allocated and elastic ones. Peak rate allocated sessions—when admitted into the system—transmit at a constant bit rate, while elastic sessions can be slowed down at the expense of increasing their residency time. Admitted sessions cause an instantaneous bit rate‐dependent interference in neighbour cells. In this rather general setting, we propose a method to calculate the class‐wise blocking probabilities as the functions of the estimated so‐called inter‐cell coupling factors. In the paper this coupling factor is the ratio between the uplink path gains to different Node‐B:s (that can be easily obtained in a CDMA system from pilot measurement reports), but our model could include other coupling measures as well. We find that when these coupling factors are underestimated, the system may get into false states (FSs) or false rate states (FRSs) that lead to violating the noise rise threshold. As traffic becomes increasingly elastic, the probability of FSs decreases, but the probability of FRSs increases. Based on numerical results, we make the point that as the traffic becomes more elastic, avoiding the underestimation of these coupling factors as well as exercising MC admission control plays an increasingly important role in guaranteeing proper service quality. Copyright © 2007 John Wiley & Sons, Ltd.     

On providing blocking probability and throughput guarantees in a multi‐service environment

As the Internet evolves from a packet network supporting a single best effort service class towards an integrated infrastructure supporting several service classes—some with QoS guarantees—there is a growing interest in the introduction of admission control and in devising bandwidth sharing strategies, which meet the diverse needs of QoS‐assured and elastic services. In this paper we show that the extension of the classical multi‐rate loss model is possible in a way that makes it useful in the performance analysis of a future admission control based Internet that supports traffic with peak rate guarantee as well as elastic traffic. After introducing the model, it is applied for the analysis of a single link, where it sheds light on the trade‐off between blocking probability and throughput. For the investigation of this trade‐off, we introduce the throughput‐threshold constraint, which bounds the probability that the throughput of a traffic flow drops below a predefined threshold. Finally, we use the model to determine the optimal parameter set of the popular partial overlap link allocation policy: we propose a computationally efficient algorithm that provides blocking probability‐ and throughput guarantees. We conclude that the model and the numerical results provide important insights in traffic engineering in the Internet. Copyright © 2002 John Wiley & Sons, Ltd.     

The extended connection‐dependent threshold model for call‐level performance analysis of multi‐rate loss systems under the bandwidth reservation policy

Firstly, we reviewed two extensions of the Erlang multi‐rate loss model, whereby we can assess the call‐level QoS of telecom networks supporting elastic traffic: (i) the extended Erlang multi‐rate loss model, where random arriving calls of certain bandwidth requirements at call setup can tolerate bandwidth compression while in service; and (ii) the connection‐dependent threshold model, where arriving calls may have several contingency bandwidth requirements, whereas in‐service calls cannot tolerate bandwidth compression. Secondly, we proposed a new model, the extended connection‐dependent threshold model. Calls may have alternative bandwidth requirements at call setup and can tolerate bandwidth compression while in service. We proposed a recurrent formula for the efficient calculation of link occupancy distribution and consequently call blocking probabilities, link utilization, and throughput per service class. Furthermore, in the proposed model, we incorporated the bandwidth reservation policy, whereby we can (i) equalize the call blocking probabilities of different service classes, (ii) guarantee specific QoS per service class, and (iii) implement different maximum bandwidth compression/expansion rate per service class so that the network supports both elastic and stream traffic. The accuracy of the new model is verified by simulation. Moreover, the proposed model performs better than the existing models. Finally, we generalize the proposed model by incorporating service classes with either random or quasi‐random arrivals. Copyright © 2011 John Wiley & Sons, Ltd.     

On the performance of TCP over a TDD‐TD/CDMA architecture

This paper determines the performance of TCP when it is employed over a TDD‐TD/CDMA architecture which supports different classes of subscribers and adopts an interference‐driven admission control policy. The blocking and the outage probability of the system users are evaluated under various traffic conditions as well as the TCP throughput that data users experience. Call blocking and TCP throughput are determined by means of a semi‐analytical approach. This work shows that when TCP is taken into account, many options come out for the system design in order to optimize radio resources. Resource assignment in the TDD‐TD/CDMA system can then be done as a function of the actual radio link quality with the goal both to serve as many users as possible and to keep the TCP throughput as high as possible. Copyright © 2003 John Wiley & Sons, Ltd.     

Link Capacity Sharing between Guaranteed- and Best Effort Services on an ATM Transmission Link under GoS Constraints

While link allocation policies in multi-rate circuit switched loss models have drawn much attention in recent years, it is still an open question how to share the link capacity between service classes in a fair manner. In particular, when an ATM link is offered calls from service classes with/without strict QoS guarantees one is interested in link capacity sharing policies that maximize throughput and keep the per-class blocking probabilities under some GoS constraints. In this paper we propose a model and associated computational technique for an ATM transmission link to which CBR/VBR and ABR classes offer calls. We also propose a simple link allocation rule which takes into account blocking probability constraints for the CBR/VBR calls and a throughput constraint for the ABR calls and attempts to minimize the blocking probability of ABR calls. Numerical examples demonstrate the effectiveness of the policy and of the applied computational technique.     

Bounding the Blocking Probabilities in Multirate CDMA Networks Supporting Elastic Services

Several previous contributions have proposed calculation methods that can be used to determine the steady state (and from it the blocking probabilities) of code-division multiple-access (CDMA) systems. This present work extends the classical Kaufman-Roberts formula such that it becomes applicable in CDMA systems in which elastic services with state-dependent instantaneous bit rate and average-bit-rate-dependent residency time are supported. Our model captures the effect of soft blocking, that is, an arriving session may be blocked in virtually all system states but with a state dependent probability. The core of this method is to approximate the original irreversible Markov chain with a reversible one and to give lower and upper bounds on the so-called partially blocking macro states of the state space. We employ this extended formula to establish lower and upper bounds on the steady state and the classwise blocking probabilities.     

Performance analysis of a reuse partitioning technique for multi‐channel cellular systems supporting elastic services

For multi‐cell systems employing intra‐cell orthogonal communication channels, inter‐cell interference mitigation techniques are expected to be one of the key radio resource management functions. In this paper we propose and analyze a simple reuse partitioning technique (with random and coordinated resource block allocation in neighbor cells) that is able to reduce inter‐cell interference. We propose a model that is able to take into account that sessions dynamically enter and leave the system. Rigid sessions require a class‐specific fixed number of resource blocks, while elastic sessions can enter the system if a minimum number of resources are allocated to them. In this rather general setting (and using the example of a system employing frequency division for multiple access) we analyze the system performance in terms of the expected number of channel collisions, the session‐blocking probabilities, the signal‐to‐interference‐and‐noise ratio (SINR) and packet error rate performance. We present numerical results on the various trade‐offs between these measures (including the trade‐off between the reuse factor and the SINR performance) that provide insight into the behavior of multi‐channel cellular systems and help dimensionalize the parameters of a reuse partitioned system. Copyright © 2008 John Wiley & Sons, Ltd.     

Flow‐level performance analysis of a multi‐rate system supporting stream and elastic services

We consider a multi‐rate system where stream and elastic flows receive service. Both the stream and the elastic classes are associated with peak rate limitation. In contrast to the constant bit rate stream flows, the elastic flows tolerate bandwidth compression while in service. Because of the occasional bandwidth compression, the holding time of elastic flows depends on their perceived throughput. Although this model is Markovian under quite non‐restrictive assumptions, the model's state space grows exponentially with the number of traffic classes. The model is not quasi‐reversible, and therefore, it cannot be evaluated by efficient recursive formulae. We propose a method whereby the original state space is mapped to a two‐dimensional one, independently of the number of the stream and the elastic traffic classes. The special structure of the two‐dimensional model allows us to develop an efficient method that approximates the average throughputs of elastic flows. The state space reduction together with the proposed approximation provides a powerful tool for the performance analysis of this model as it allows the approximation of the average throughputs of elastic flows reasonably accurately in large models as well. Copyright © 2012 John Wiley & Sons, Ltd.     

Admission control for variable spreading gain CDMA cellular system with imperfect power control and shadowing

Variable spreading gain (VSG) CDMA is the prime transmission scheme for supporting multiple services for the next generation cellular systems. As different services have different quality of service and data rate requirements, admission control is essential in safeguarding the performance of different services in VSG‐CDMA cellular systems in harsh wireless environment. In this paper, we propose an admission control scheme for multiple services VSG‐CDMA cellular system in a practical multi‐cell environment where there exist adverse effects due to imperfect power control and shadowing. Rather than with a fixed bound as in previous studies, the admission bound in our scheme is based on the probability distribution of total intra‐cell power (P_in) and other‐cell interference power (I_other). This is used to estimate the blocking probability by utilizing a simple and accurate approximation that incorporates the random nature of P_in and I_other. Evaluation of the impact of power control error to the mean and standard deviation of P_in and I_other, we performed and compared the blocking probability with fixed admission bound scheme in an integrated voice/data environment. Our work has enabled the calculation of the blocking probability and capacity of different mobility users having different power control errors under shadowing. Copyright © 2006 John Wiley & Sons, Ltd.     

Effect of AMC on fixed‐rate traffic with hard delay constraints in mobile broadband systems

The adaptive modulation and coding (AMC) technique, which has been adopted by advanced mobile telecommunication systems, supports a flexible response to the random radio behaviour. As a result, the attained transmission rate over a wireless link is time varying. Hence, resource demands are not deterministic but fluctuating even for calls with constant bit rate service requirements. Consequently, constant bit rate calls are susceptible to a forced call termination because of insufficient resources not only in a target cell during inter‐cell handoffs but also in a serving cell during radio link deterioration. Furthermore, call blocking and dropping probabilities depend on radio propagation conditions among other factors and therefore they are dissimilar throughout a service area. The latter leads to unfairness problems. We analytically measure the impact of AMC on fixed‐rate service with hard delay constraints such as voice for different signal, mobility and traffic conditions. We consider a reference case (call requests are admitted into the system provided there are enough free resources) and two classes of admission control approaches: traditional (only inter‐cell handoffs are prioritised) and modified (all ongoing calls are prioritised). The reported results reveal conditions for which AMC affects voice call performance and can serve as guidelines on admission control design. Copyright © 2013 John Wiley & Sons, Ltd.     

基于动态流感知的接纳控制策略研究

流感知接纳控制使用调度机制测量的优先队列队长和公平速率作为链路状态信息实现隐式接纳判决。在对动态流感知进行分析的基础上,定义了优先队列的拥塞指数。在不同拥塞指数条件下,提出分别使用与流峰值速率相关的接纳概率对多业务进行区分接入判决,通过拒绝高速弹性流的接入达到对低速实时流的性能保护。推导了实时流阻塞率和弹性流平均吞吐量的理论公式。仿真结果显示相对于基于测量的接纳控制算法,提出策略具有较低的阻塞率和更好的平均吞吐量性能。     

Call admission control schemes and performance analysis in wirelessmobile networks

Call admission control (CAC) plays a significant role in providing the desired quality of service in wireless networks. Many CAC schemes have been proposed. Analytical results for some performance metrics such as call blocking probabilities are obtained under some specific assumptions. It is observed, however, that due to the mobility, some assumptions may not be valid, which is the case when the average values of channel holding times for new calls and handoff calls are not equal. We reexamine some of the analytical results for call blocking probabilities for some call admission control schemes under more general assumptions and provide some easier-to-compute approximate formulas     

Improving Voice and Data Services in Cellular/WLAN Integrated Networks by Admission Control

In this paper, we study voice and data service provisioning in an integrated system of cellular and wireless local area networks (WLANs). With the ubiquitous coverage of the cellular network and the disjoint deployment of WLANs in hot-spot areas, the integrated system has a two-tier overlaying structure. As an essential resource allocation aspect, admission control can be used to properly admit voice and data calls to the overlaying cells and WLANs. A simple admission scheme is proposed in this study to analyze the dependence of resource utilization and the impact of user mobility and traffic characteristics on admission parameters. Both admission control and rate control are considered to limit the input traffic to the WLAN, so that the WLAN operates in its most efficient states and effectively complements the cellular network. The call blocking/dropping probabilities and data call throughput are evaluated for effective and accurate derivation of the admission parameters. It is observed that the utilization varies with the configuration of admission parameters, which properly distributes the voice and data traffic load to the cells and WLANs. Mobility and traffic variability have a significant impact on the selection of the admission parameters.     

Probabilistic call admission control in wireless multiservice networks

A new probabilistic call admission control scheme is proposed for multiservice wireless networks. The new scheme gradually suppresses the admission rate of the new calls and of the calls of each service class (SC) supported considering their priorities independently. The scheme is examined both for a single SC and for multiple SCs under general conditions. The analysis employs Markov chain theory and yields analytical expressions for the call blocking probabilities. The proposed analytical method was validated via simulations employing different distributions for the channel holding time; the simulations demonstrated the accuracy of the proposed framework.     

Predictive QoS-based admission control for multiclass traffic incellular wireless networks

We develop the notion of quality of service (QoS) for multimedia traffic in terms of maximum call dropping probabilities independent of system load and a predefined call blocking probability profile for the different traffic classes for wireless networks of arbitrary shape and dimension. We describe two distributed predictive admission control algorithms, independent multiclass one-step prediction (IMOSP-CS and IMOSP-RES), which provide each traffic class with a given call dropping probability and a desired call blocking probability profile. Both algorithms may be seen as extensions of the multimedia one-step prediction (MMOSPRED) algorithm previously reported, which uses prediction of the overload probability in the home and neighbor cells in deciding whether to admit new users into a multiclass cellular system. The two algorithms differ in their approach to handoff call admission. The first algorithm completely shares the bandwidth among the entering handoff users while the second implements a partition-based reservation scheme. In this paper, we additionally impose a call blocking criterion that ensures a system-imposed call priority independent of the traffic in the system and which adapts to changes in the offered load. In comparing these algorithms to each other, we focus on system throughput and class independence. Both algorithms provide appropriate throughput under both homogeneous and heterogeneous traffic loading conditions while maintaining steady call dropping probabilities for each traffic class     

Mobility-Aware Admission Control Schemes in the Downlink of Third-Generation Wireless Systems

In this paper, novel connection admission control (CAC) algorithms that take into account the effect of mobility of users both inside and outside the cell in the downlink of third-generation mobile systems are developed. First, the system capacity, including the other-cell interference, subject to feedback between cells is studied. Then, effective bandwidth expressions for calls are obtained as a function of both their location in the cell as well as their class of traffic (i.e., voice versus data). Next, this formulation is used to derive two mobility-aware admission control algorithms, i.e., a priority CAC, where calls are accepted not only upon resource availability, but also through acceptance ratios that reflect their levels of priority, and a squeezing CAC, where elastic calls may be squeezed to a minimum agreed value, giving way to admit more calls in the system and to secure further ongoing mobile users. Using Markovian analysis, several performance measures are obtained, namely the blocking probability, the dropping probability, both intracell and intercell, as well as the overall cell throughput. The authors eventually investigate the performance of our CAC and show how to extend the Erlang capacity bounds, i.e., the set of arrival rates such that the corresponding blocking/dropping probabilities are kept below predetermined thresholds     

Call admission control in cellular networks: A reinforcement learning solution

In this paper, we address the call admission control (CAC) problem in a cellular network that handles several classes of traffic with different resource requirements. The problem is formulated as a semi‐Markov decision process (SMDP) problem. We use a real‐time reinforcement learning (RL) [neuro‐dynamic programming (NDP)] algorithm to construct a dynamic call admission control policy. We show that the policies obtained using our TQ‐CAC and NQ‐CAC algorithms, which are two different implementations of the RL algorithm, provide a good solution and are able to earn significantly higher revenues than classical solutions such as guard channel. A large number of experiments illustrates the robustness of our policies and shows how they improve quality of service (QoS) and reduce call‐blocking probabilities of handoff calls even with variable traffic conditions. Copyright © 2004 John Wiley & Sons, Ltd.     

Utility‐based probabilistic call admission control for complete fairness in wireless networks

Resource reservation or the other prioritization strategies adopted by Call Admission Control (CAC) schemes in wireless networks lead to unfair resource allocation to users belonging to different service classes (SCs) due to high divergence among the respective call blocking probabilities (CBPs). In this paper, we propose dynamic optimization of probabilistic CAC (P‐CAC) schemes to assure CAC fairness among users of different SCs in wireless networks. The approach is based on users utility combined with fairness optimization, aiming at dynamically determining the probability value in the P‐CAC scheme. This optimal probability is adjusted to network ongoing traffic, CBPs of each SC, prioritization levels characterizing the SCs supported, and the users risk aversion, which reflects their behavior toward the perceived QoS. The existence and uniqueness of the optimal probability that leads to absolute fairness among the users of a wireless network are proven. Copyright © 2012 John Wiley & Sons, Ltd.     

Fairly adjusted multimode dynamic guard bandwidth admission control over CDMA systems

Guard-based call admission control schemes support admission priorities based on resources sharing with differentiated resource capacity limits. To minimize deviation from call blocking/dropping targets due to nonstationary call arrival condition, dynamic guard-based schemes with predictive adaptation control adjust differentiated capacity limits according to predicted future arrival rates based on specified estimation algorithms. Existing dynamic guard admission schemes are developed under the assumption of perfect estimation, which may not be possible in a highly nonstationary environment and, thus resulting in failures to maintain targeted blocking/dropping probabilities. This paper presents the fairly adjusted multimode-dynamic guard bandwidth scheme, which is a dynamic-guard-based scheme over code-division multiple-access systems with predictive adaptation control to adapt interference-based guard loading-limits under nonstationary call arrival condition; and reactive adaptation control to counteract arrival rate estimation errors. When the predictive adaptation control policy mode is not able to maintain long-term call blocking or dropping targets due to estimation error, this will trigger reactive adaptation control policy modes that include temporary blocking (preemption) of one or more lower priority classes subject to fairness constraints to ensure lower priority classes are not preempted at all costs during estimation error recovery. Analytical and simulation results show that proposed scheme is able to provide performance guarantees in terms of dropping probabilities under nonstationary traffic arrival and imperfect arrival rate estimation.     

Location‐aided medium access control for low data rate UWB wireless sensor networks

This paper presents a distributed medium access control (MAC) protocol for low data rate ultra‐wideband (UWB) wireless sensor networks (WSNs), named LA‐MAC. Current MAC proposal is closely coupled to the IEEE 802.15.4a physical layer and it is based on its Impulse‐Radio (IR) paradigm. LA‐MAC protocol amplifies its admission control mechanism with location‐awareness, by exploiting the ranging capability of the UWB signals. The above property leads to accurate interference predictions and blocking assessments that each node in the network can perform locally, limiting at the same time the actions needed to be performed towards the admission phase. LA‐MAC is evaluated through extensive simulations, showing a significant improvement in many critical parameters, such as throughput, admission ratio, energy consumption, and delay, under different traffic load conditions. Copyright © 2010 John Wiley & Sons, Ltd.