Bandwidth borrowing‐based QoS approach for adaptive call admission control in multiclass traffic wireless cellular networks

This paper proposes a QoS approach for an adaptive call admission control (CAC) scheme for multiclass service wireless cellular networks. The QoS of the proposed CAC scheme is achieved through call bandwidth borrowing and call preemption techniques according to the priorities of the traffic classes, using complete sharing of the available bandwidth. The CAC scheme maintains QoS in each class to avoid performance deterioration through mechanisms for call bandwidth degradation, and call bandwidth upgrading based on min–max and max–min policies for fair resource deallocation and reallocation, respectively. The proposed adaptive CAC scheme utilizes a measurement‐based online monitoring approach of the system performance, and a prediction model to determine the amount of bandwidth to be borrowed from calls, or the amount of bandwidth to be returned to calls. The simulation‐based performance evaluation of the proposed adaptive CAC scheme shows the strength and effectiveness of our proposed scheme. Copyright © 2011 John Wiley & Sons, Ltd.     

Optimal resource allocation and adaptive call admission control for voice/data integrated cellular networks

Resource allocation and call admission control (CAC) are key management functions in future cellular networks, in order to provide multimedia applications to mobiles users with quality of service (QoS) guarantees and efficient resource utilization. In this paper, we propose and analyze a priority based resource sharing scheme for voice/data integrated cellular networks. The unique features of the proposed scheme are that 1) the maximum resource utilization can be achieved, since all the leftover capacity after serving the high priority voice traffic can be utilized by the data traffic; 2) a Markovian model for the proposed scheme is established, which takes account of the complex interaction of voice and data traffic sharing the total resources; 3) optimal CAC parameters for both voice and data calls are determined, from the perspective of minimizing resource requirement and maximizing new call admission rate, respectively; 4) load adaption and bandwidth allocation adjustment policies are proposed for adaptive CAC to cope with traffic load variations in a wireless mobile environment. Numerical results demonstrate that the proposed CAC scheme is able to simultaneously provide satisfactory QoS to both voice and data users and maintain a relatively high resource utilization in a dynamic traffic load environment. The recent measurement-based modeling shows that the Internet data file size follows a lognormal distribution, instead of the exponential distribution used in our analysis. We use computer simulations to demonstrate that the impact of the lognormal distribution can be compensated for by conservatively applying the Markovian analysis results.     

Call admission control for QoS provisioning in 4G wireless networks: issues and approaches

This article presents a survey on the issues and the approaches related to designing call admission control schemes for fourth-generation wireless systems. We review the state of the art of CAC algorithms used in the traditional wireless networks. The major challenges in designing the CAC schemes for 4G wireless networks are identified. These challenges are mainly due to heterogeneous wireless access environments, provisioning of quality of service to multiple types of applications with different requirements, provisioning for adaptive bandwidth allocation, consideration of both call-level and packet-level performance measures, and consideration of QoS at both the air interface and the wired Internet. To this end, architecture of a two-tier CAC scheme for a differentiated services cellular wireless network is presented. The proposed CAC architecture is based on the call-level and packet-level QoS considerations at both the wireless and wired parts of the network. A performance analysis model for an example CAC scheme based on this architecture is outlined, and typical numerical results are presented.     

A dynamic joint scheduling and call admission control scheme for IEEE 802.16 networks

We propose a dynamic joint scheduling and call admission control (CAC) scheme for service classes defined in IEEE 802.16 standard. Using priority functions, equipped with service weights and service arrival rates, the proposed scheduling scheme differentiates service classes from each other. Based on obtained priority values, we first allocate the achievable bandwidth proportionally. Within individual service classes, we then use appropriate local schedulers to transmit packets accordingly. Moreover, instead of immediate admitting or blocking a new connection request, the proposed CAC scheme computes the average transmission rate that can be allocated to that connection during a time interval. The connection is admitted if its required rate is satisfied while at the same time QoS requirements of ongoing connections are not violated. Our numerical results demonstrate the effectiveness of the proposed schemes compared to the other schemes in the literature.     

A call admission control scheme for packet data in CDMA cellular communications

In wireless cellular communication systems, call admission control (CAC) is to ensure satisfactory services for mobile users and maximize the utilization of the limited radio spectrum. In this paper, we propose a new CAC scheme for a code division multiple access (CDMA) wireless cellular network supporting heterogeneous self-similar data traffic. In addition to ensuring transmission accuracy at the bit level, the CAC scheme guarantees service requirements at both the call level and the packet level. The grade of service (GoS) at the call level and the quality of service (QoS) at the packet level are evaluated using the handoff call dropping probability and the packet transmission delay, respectively. The effective bandwidth approach for data traffic is applied to guarantee QoS requirements. Handoff probability and cell overload probability are derived via the traffic aggregation method. The two probabilities are used to determine the handoff call dropping probability, and the GoS requirement can be guaranteed on a per call basis. Numerical analysis and computer simulation results demonstrate that the proposed CAC scheme can meet both QoS and GoS requirements and achieve efficient resource utilization.     

A Novel Effective Bandwidth Based Call Admission Control for Multimedia CDMA Systems

A novel Call Admission Control(CAC)scheme is proposed for multimedia CDMA systems.The effectivebandwidth of real time calls is reserved in the CAC with the consideration of active factors.The admission of non-real timecalls is controlled by the system according to the residual effective bandwidth left from real time calls.Simulation resultshave shown that the novel CAC has greatly enlarged the admission region for real time calls and make the transmission de-lay of non-real time calls under an acceptable level.     

基于GoS的功率控制WCDMA系统呼叫准入控制算法

该文提出的基于GoS的呼叫准入控制(GoS-CAC)算法的判决门限综合了多种因素:系统负荷、各业务服务质量(QoS)要求、信道质量、干扰水平、系统服务等级(GoS)以及用户的切换等等。GoS-CAC算法与功率/ 数据速率调节机制巧妙结合,具有判决速度快、精度高、门限自适应和简单易行等特点。仿真结果表明,与传统CAC算法相比,GoS-CAC算法的切换用户业务阻塞性能优约10%,系统GoS优50%左右,而中断性能优57%以上。     

Combined Connection Admission Control and Packet Transmission Scheduling for Mobile Internet Services

Mobile Internet access is expected to be the most popular communication service in the near future. In this paper, we investigate radio resource management for mobile Internet multimedia systems that use the orthogonal frequency division multiple access and adopt the adaptive modulation and coding technique. It is assumed that real-time (RT) service such as streaming video and best-effort (BE) services such as file transfer protocol and hypertext transfer protocol coexist in the systems. We suggest two levels of radio resource management schemes: the connection admission control (CAC) scheme at the first level and the packet transmission scheduler at the second level. The proposed scheduler does not assign higher priority to RT packets over BE packets unconditionally. Instead, only the RT packets that are close to the deadline are given higher priority. Therefore, the performance of BE services is improved at the cost of RT services. To control the performance degradation in RT services within an acceptable level, the CAC algorithm functions as a congestion controller. The combined effects of the proposed CAC and packet scheduling by using the cross-layer simulation that covers from the physical layer to the Internet application layer are evaluated. The numerical results show that the proposed schemes greatly improve the performance of BE services while maintaining the quality of video service at an acceptable level.     

Tiered bandwidth reservation scheme for multimedia wireless networks

It is important to provide quality of service (QoS) guarantees if we want to support multimedia applications over wireless networks. In this paper, considering the features of tiering in sectored cellular networks, we propose a novel scheme for bandwidth reservation to approach QoS provisioning. By predicting the movement of each connection, the reserving of bandwidth is only required in needful neighboring cells instead of in all neighboring cells. In addition, an admission control mechanism incorporated with bandwidth borrowing assists in distributing scarce wireless bandwidth in more adaptive way. Through mathematical analysis, we proof the advantages of tier‐based approach and the bound for the selection of tiered boundary. The simulation results also verify that our scheme can achieve superior performance than traditional schemes regarding no bandwidth reserving, fixed bandwidth reserving, and bandwidth borrowing in sectored cellular networks when performance metrics are measured in terms of the connection dropping probability (CDP), connection blocking probability (CBP), and bandwidth utilization (BU). Copyright © 2008 John Wiley & Sons, Ltd.     

一种CDMA网络多业务的呼叫允许控制算法

现今无线网络中的多媒体业务具有很大需求。该文对多业务CDMA通信系统容量进行分析,引入有效带宽概念,提出一种呼叫允许控制资源分配优化算法(CAC-RA)。此算法将多媒体业务分为实时业务和非实时业务,通过对自适应实时业务采用马尔科夫模型,对非实时业务采用排队模型,将两模型合并生成的的利益函数采用非线性规划,使呼叫允许控制、切换策略和资源分配问题同时得到解决。实验数据显示CAC-RA算法实现了合理的资源利用和最大的利益值,能较好地适应多业务CDMA网络。     

QoS Provisioning in Wireless/Mobile Multimedia Networks Using an Adaptive Framework

Recently there is a growing interest in the adaptive multimedia networking where the bandwidth of an ongoing multimedia call can be dynamically adjusted. In the wireless/mobile multimedia networks using the adaptive framework, the existing QoS provisioning focused on the call blocking probability and the forced termination probability should be modified. We, therefore, redefine a QoS parameter – the cell overload probability – from the viewpoint of the adaptive multimedia networking. Then, we propose a distributed call admission control (CAC) algorithm that guarantees the upper bound of the cell overload probability. Also, a bandwidth adaptation algorithm which seeks to minimize the cell overload probability is also presented. Simulation experiments are carried out to verify the performance of the proposed CAC algorithm. Furthermore, the performance of the adaptive wireless/mobile network is compared to that of the existing non-adaptive wireless/mobile networks. As a further step in QoS provisioning, we propose another QoS parameter, the degradation period ratio, and discuss analytically how the CAC algorithm guarantees the upper bound of the degradation period ratio.     

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.     

Pricing based adaptive scheduling method for bandwidth allocation

In this paper we present a packet scheduling method which guarantees bandwidth of the connection and optimizes revenue of the network service provider. A closed form formula for updating the adaptive weights of a packet scheduler is derived from a revenue-based optimization problem. The weight updating procedure is fast and independent on the assumption of the connections’ statistical behavior. The features of the algorithm are simulated and analyzed with and without a call admission control (CAC) mechanism. We also show in context with the CAC procedure a mechanism for guaranteeing a specified mean bandwidth for different service classes.     

Analysis of adaptive bandwidth allocation in wireless networks with multilevel degradable quality of service

A wireless/mobile network supporting multilevel quality of service (QoS) is considered. In such a network, users or applications can tolerate a certain degree of QoS degradation. Bandwidth allocation to users can, therefore, be adjusted dynamically according to the underlying network condition so as to increase bandwidth utilization and service provider's revenue. However, arbitrary QoS degradation may be unsatisfactory or unacceptable to the users, hence resulting in their subsequent defection. Instead of only focusing on bandwidth utilization or blocking/dropping probability, two new user-perceived QoS metrics, degradation ratio and upgrade/degrade frequency, are proposed. A Markov model is then provided to derive these QoS metrics. Using this model, we evaluate the effects of adaptive bandwidth allocation on user-perceived QoS and show the existence of trade offs between system performance and user-perceived QoS. We also show how to exploit adaptive bandwidth allocation to increase system utilization (for the system administrator) with controlled QoS degradation (for the users). By considering various mobility patterns, the simulation results are shown to match our analytical results, demonstrating the applicability of our analytical model to more general cases.     

Optimal call admission control on a single link with a GPS scheduler

The problem of call admission control (CAC) is considered for leaky bucket constrained sessions with deterministic service guarantees (zero loss and finite delay bound) served by a generalized processor sharing scheduler at a single node in the presence of best effort traffic. Based on an optimization process, a CAC algorithm capable of determining the (unique) optimal solution is derived. The derived algorithm is also applicable, under a slight modification, in a system where the best effort traffic is absent and is capable of guaranteeing that if it does not find a solution to the CAC problem, then a solution does not exist. The numerical results indicate that the CAC algorithm can achieve a significant improvement on bandwidth utilization as compared to a (deterministic) effective bandwidth-based CAC scheme.     

Service based CAC with QoS guarantee in mobile wireless cellular networks

The increasing variety and complexity of traffic in today's mobile wireless networks means that there are more restrictions placed on a network in order to guarantee the individual requirements of the different traffic types and users. Call admission control (CAC) plays a vital role in achieving this. In this paper, we propose a CAC scheme for multiple service systems where the predicted call usage of each service is used to make the admission decision. Our scheme enables real‐time traffic to be transmitted using shared bandwidth without quality of service (QoS) requirements being exceeded. This ensures that the utilization of the available wireless bandwidth is maximized. Information about the channel usage of each service is used to estimate the capacity of the cell in terms of the number of users that can achieve a certain bit error rate (BER). Priorities assigned to each service are used to allocate the network capacity. An expression for the handoff dropping probability is derived, and the maximum acceptance rate for each service that results in the estimated dropping probability not exceeding its QoS requirements is calculated. Each call is then accepted with equal probability throughout the duration of a control period. Achieved QoS during the previous control period is used to update the new call acceptance rates thus ensuring the dropping probability remains below the specified threshold. Simulations conducted in a wideband CDMA environment with conversational, streaming, interactive and background sources show that the proposed CAC can successfully meet the hard restraint on the dropping probability and guarantee the required BER for multiple services. Copyright © 2005 John Wiley & Sons, Ltd.     

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.     

Proportional degradation services in wireless/mobile adaptive multimedia networks

Adaptive multimedia services are very attractive since resources in wireless/mobile networks are relatively scarce and widely variable, and more importantly the resource fluctuation caused by mobility and channel fading can be mitigated using adaptive services. Therefore, there are extensive research activities on Quality of Service (QoS), call admission control, as well as bandwidth degradation and adaptation for adaptive multimedia services in wireless/mobile networks in recent years. However, fairness of bandwidth degradation has largely been ignored in previous work and remains an important issue in adaptive multimedia service provisioning. In this paper, we propose and study proportional degradation service provisioning in wireless/mobile networks that offer multiple classes of adaptive multimedia services. The proposed proportional degradation fairness model guarantees the proportional bandwidth degradation among different classes of services. Two proportional degradation scenarios are studied in this paper. In the first scenario, we study the proportional degradation provisioning with two QoS parameters for adaptive multimedia: the degradation ratio (DR) and the degradation degree (DD). In the second scenario, we study the proportional degradation provisioning with a new QoS parameter for adaptive multimedia: the degradation area (DA). For each scenario, based on the QoS parameters, proportional degradation adaptation algorithms are proposed to approximate the proportional degradation model, to fairly adapt calls' degradations, to utilize the system resource efficiently, as well as to optimize QoS parameters. Performance studies show that in the first scenario, proportional DR has been achieved very well, whereas proportional DD has not been well achieved. In other words, DR outperforms DD in terms of proportional degradation. In the second scenario, proportional DA has been well achieved. Furthermore, bandwidth resources have been efficiently utilized and DA has been minimized. Copyright © 2004 John Wiley & Sons, Ltd.     

Performance evaluation of priority based adaptive multiguard channel call admission control for multiclass services in mobile networks

The CAC (call admission control), which can guarantee call services to meet their QoS (Quality of Service) requirements, plays a significant role in providing QoS in wireless mobile networks. In this paper, an adaptive multiguard channel scheme‐based CAC strategy is proposed to prioritize traffic types and handoff calls. The major aim of the study is to develop the analytical model of the priority traffic and handoff calls based adaptive multiguard channel scheme and examining the performance through setting the value of the adaptive ratio parameters. Our proposed scheme tries to mediate the advantages and drawbacks of the static and dynamic CAC schemes. The proposed scheme is quite different from previous studies because multithreshold values have been considered for multiclass traffic by adaption parameters, and a closed form analytical model is developed The numerical results show that this scheme can be used to keep the targeted QoS requirement by suitably setting the adaptive ratio parameters. Copyright © 2011 John Wiley & Sons, Ltd.