Call admission control schemes: a review

Over the last few years, a substantial number of call admission control (CAC) schemes have been proposed for ATM networks. We review the salient features of some of these algorithms. Also, we quantitatively compare the performance of three of these schemes     

Call admission control with opportunistic scheduling scheme

In this paper, a rate‐based admission control scheme for a single shared wireless base station with opportunistic scheduling and adaptive modulation and coding (AMC) is proposed. The proposed admission scheme maintains minimum average rates of the admitted users, i.e., new users will be admitted if the base station has enough resources to support the required minimum average transmission rates of all users. The proposed scheme relies on an analytical model for the average per‐user rates of an opportunistic scheduling in an unsaturated scenario, where some queues may be empty for certain periods of time. We provide extensive simulation results to demonstrate the accuracy of the base analytical model on which our admission scheme relies. Copyright © 2009 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     

Call admission control for capacity-varying networks

Many networks, such as Non-Geostationary Orbit Satellite (NGOS) networks and networks providing multi-priority service using advance reservations, have capacities which vary over time for some or all types of calls carried on these networks. For connection-oriented networks, Call Admission Control (CAC) policies which only use current capacity information may lead to excessive and intolerable dropping of admitted calls whenever the network capacity decreases. Thus, novel CAC policies are required for these networks. Three such CAC policies are discussed, two for calls with exponentially distributed call holding times and one for calls whose holding time distributions have Increasing Failure Rate (IFR) functions. The Admission Limit Curve (ALC) is discussed and shown to be a constraint limiting the conditions under which any causal CAC policy may admit calls and still meet call dropping guarantees on an individual call basis. We demonstrate how these CAC policies and ALC represent progressive steps in developing optimal CAC policies for calls with exponentially distributed call holding times, and extend this process to the more general case of calls with IFR call holding times.     

A generalized processor sharing approach to flow control inintegrated services networks: the single-node case

The problem of allocating network resources to the users of an integrated services network is investigated in the context of rate-based flow control. The network is assumed to be a virtual circuit, connection-based packet network. It is shown that the use of generalized processor sharing (GPS), when combined with leaky bucket admission control, allows the network to make a wide range of worst-case performance guarantees on throughput and delay. The scheme is flexible in that different users may be given widely different performance guarantees and is efficient in that each of the servers is work conserving. The authors present a practical packet-by-packet service discipline, PGPS that closely approximates GPS. This allows them to relate results for GPS to the packet-by-packet scheme in a precise manner. The performance of a single-server GPS system is analyzed exactly from the standpoint of worst-case packet delay and burstiness when the sources are constrained by leaky buckets. The worst-case session backlogs are also determined     

Fluid simulation for self-similar traffic in generalized processor sharing servers

We propose a fluid simulation algorithm for generalized processor sharing (GPS) servers. We analyze the complexity of the proposed algorithm and show the advantage of fluid simulation, compared to packet-level simulation. Numerical results show that the simulation time can be much reduced by admitting some performance errors as the load is heavier and the self-similarity is higher.     

A generalized processor sharing approach to flow control inintegrated services networks: the multiple node case

Worst-case bounds on delay and backlog are derived for leaky bucket constrained sessions in arbitrary topology networks of generalized processor sharing (GPS) servers. The inherent flexibility of the service discipline is exploited to analyze broad classes of networks. When only a subset of the sessions are leaky bucket constrained, we give succinct per-session bounds that are independent of the behavior of the other sessions and also of the network topology. However, these bounds are only shown to hold for each session that is guaranteed a backlog clearing rate that exceeds the token arrival rate of its leaky bucket. A much broader class of networks, called consistent relative session treatment (CRST) networks is analyzed for the case in which all of the sessions are leaky bucket constrained. First, an algorithm is presented that characterizes the internal traffic in terms of average rate and burstiness, and it is shown that all CRST networks are stable. Next, a method is presented that yields bounds on session delay and backlog given this internal traffic characterization. The links of a route are treated collectively, yielding tighter bounds than those that result from adding the worst-case delays (backlogs) at each of the links in the route. The bounds on delay and backlog for each session are efficiently computed from a universal service curve, and it is shown that these bounds are achieved by “staggered” greedy regimes when an independent sessions relaxation holds. Propagation delay is also incorporated into the model. Finally, the analysis of arbitrary topology GPS networks is related to Packet GPS networks (PGPS). The PGPS scheme was first proposed by Demers, Shenker and Keshav (1991) under the name of weighted fair queueing. For small packet sizes, the behavior of the two schemes is seen to be virtually identical, and the effectiveness of PGPS in guaranteeing worst-case session delay is demonstrated under certain assignments     

Call admission control in wireless multimedia networks

Call admission control (CAC) is a mechanism used in networks to administer quality of service (QoS). Whereas the CAC problem in time-division multiple access (TDMA)-based cellular networks is simply related to the number of physical channels available in the network, it is strongly related to the physical layer performance in code-division multiple access (CDMA) networks since the multi-access interference in them is a function of the number of users and is a limiting factor in ensuring QoS. In this article, the CAC issues in multimedia DS-CDMA systems are reviewed by illustrating the basic principles underlying various schemes that have been proposed progressively from the simplest to the complex. The article also introduces SIR as a measure of QoS and describes the relatively simple schemes to administer CAC. The expression for SIR resulting from linear minimum mean-squared error processing is also presented. This article illustrates how CAC for multiple class service can be casted into an optimality framework and then discuss the recent work addressing self-similar multiple access interference.     

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.     

Bandwidth sharing and admission control for elastic traffic

We consider the performance of a network like the Internet handling so‐called elastic traffic where the rate of flows adjusts to fill available bandwidth. Realized throughput depends both on the way bandwidth is shared and on the random nature of traffic. We assume traffic consists of point to point transfers of individual documents of finite size arriving according to a Poisson process. Notable results are that weighted sharing has limited impact on perceived quality of service and that discrimination in favour of short documents leads to considerably better performance than fair sharing. In a linear network, max–min fairness is preferable to proportional fairness under random traffic while the converse is true under the assumption of a static configuration of persistent flows. Admission control is advocated as a necessary means to maintain goodput in case of traffic overload. This revised version was published online in June 2006 with corrections to the Cover Date.     

无线移动通信系统中的呼叫接入控制

呼叫接入控制是无线移动通信系统中无线资源管理的重要部分,它直接关系到系统中用户服务质量是否能够得到保证,同时呼叫接入控制算法的有效性决定了系统资源的利用效率。文中综述了各种呼叫接入控制算法及其特点,并指出在无线移动通信系统中它们的重要性。     

基于分形漏桶整形器的通用处理器共享系统性能分析

为了分析自相似业务流对通用处理器共享（GPS）系统性能的影响,研究了GPS系统性能与业务流自相似参数等因素之间的关系.通过使用分形漏桶的包络曲线对进入GPS系统的自相似业务流进行整形,推导了利用自相似业务流作为输入的GPS系统的队列长度和时延统计上界.数值结果与分析显示,基于分形漏桶的GPS系统性能模型对自相似业务流具有较好的性能.     

Performance modelling of generalized processor sharing systems with multiple self-similar traffic flows

The Generalized Processor Sharing (GPS) is an important service differentiation scheme in telecommunication systems and has attracted great research interests due to the desirable properties of fairness, traffic isolation, and work conservation. The major limitation of the existing analytical performance models of GPS systems subject to self-similar traffic is that these models have been restricted to a simplified scenario with only two traffic flows. To overcome such a limitation, this study proposes a new flow-decomposition approach to modelling GPS systems subject to multiple self-similar traffic flows. We present and prove the existence of a feasible ordering of GPS systems based on the required and guaranteed service rates of traffic flows. With the aid of the feasible ordering, we decompose the GPS system into a group of single-queue systems and then derive the queue length distributions and loss probabilities of individual self-similar traffic flows in the original GPS system. Extensive simulation experiments are conducted to validate the accuracy of the developed analytical model.     

Analytical modelling and evaluation of generalized processor sharing systems with heterogeneous traffic

Generalized processor sharing (GPS) has been widely studied as an important scheme for providing differentiated quality of service. Realistic traffic in multi‐service networks exhibits heterogeneous properties and can be categorized into two classes, namely, long range dependent (LRD) and short range dependent (SRD) traffic. Performance modelling and analysis of GPS systems subject to heterogeneous network traffic is an open and challenging problem. This paper develops an analytical performance model for GPS systems under heterogeneous LRD and SRD traffic. To this end, we propose a cost‐efficient modelling method for GPS and further develop the analytical upper and lower bounds of the queue length distributions for individual traffic flows. Numerical examples and extensive simulation results are presented to validate the accuracy and merits of the analytical model. Copyright © 2007 John Wiley & Sons, Ltd.     

Combined admission control and scheduling in multi-service networks

Providing the required metrics for different service respectively is a basic characteristic in multi-service networks. The different service can be accessed and forwarded differently to provide the different transmission performance. The state information between admission control and scheduling can be exchanged each other by the defined correlation coefficient to adjust the flow distribution in progress. The priority queue length measured by scheduler implicitly can describe the priority flows load. And the fair rate can describe the non-priority flows load. Different admission decision will be made according to the state of scheduler to assure the time-delay upper threshold for the priority flows under heavy load and the fairness for elastic flows in light load, respectively. The stability condition was conduced and proved. Simulation results show the policy can ensure both the delay for the priority flows and the minimal throughput for non-priority flows.     

基于分形整形器的GPS系统性能确定上界研究

为了精确求解以自相似业务作为输入的网络性能确定边界问题,在GPS(generalized processor sharing)系统入口处利用分形整形器对自相似业务进行调控,提出了基于分形整形器的GPS系统模型,基于确定性网络演算理论推导了使用自相似业务作为输入时该GPS系统的缓存队列长度、延迟、延迟抖动以及有效带宽等性能确定上界模型。数值结果表明,基于分形整形器的GPS系统性能确定上界模型对自相似业务具有较好的性能。     

多业务蜂窝CDMA系统中的呼叫接纳控制策略

基于码分多址(CDMA)技术的第三代(3G)移动通信系统将支持多种业务传输,有效的呼叫接纳控制策略将使系统在满足各类业务不同QoS要求的同时,能够为更多的用户提供服务,该文首先分析了多业务蜂窝CDMA系统的剩余容量与QoS约束间的关系,接着提出了适用于任意多类业务环境、基于信号干扰比(SIR)测量的两种呼叫接纳控制策略,局部策略与全局策略,并通过大量计算机仿真研究了两种策略在业务均匀分布和非均匀分布环境下的性能,仿真结果表明,在两种业务分布情况下,全局策略的性能部优于局部策略。     

Call admission control in the microcell/macrocell overlaying system

Call admission control can significantly affect the performance of a cellular system by adding additional bandwidth to a wireless network. In this paper, we show how call admission control can be used to optimize the performance of a hierarchical cellular system. The hierarchical system we study is based on a novel frequency planning scheme, whereby both the micro and macro layers can share the same spectrum and a hard partition of the frequency spectrum is not needed. The original analysis of the hierarchical system showed that a significant capacity gain can be achieved by the scheme. However, this capacity is gained at the expense of the carrier-to-interference ratio (C/I) performance of the macrocells. In this paper, we show that call admission control can be used in hierarchical cellular systems to achieve a capacity gain without sacrificing the C/I performance of the macrocells