Efficient call admission control for heterogeneous services inwireless mobile ATM networks

An efficient call admission control scheme for handling heterogeneous services in wireless ATM networks is proposed. Quality-of-service provisioning of jitter bounds for constant bit rate traffic and delay bounds for variable bit rate traffic is used in the CAC scheme to guarantee predefined QoS levels for all traffic classes. To reduce the forced handoff call dropping rate, the CAC scheme gives handoff calls a higher priority than new calls by reserving an appropriate amount of resources for potential handoff calls. Resource reservation in the CAC scheme makes use of user mobility information to ensure efficient resource utilization. Simulation results show that the proposed CAC scheme can achieve both low handoff call dropping rate and high resource utilization     

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.     

QoS Provisioning with New Effective Bandwidth/Buffer Calculation Scheme in Wireless IP Networks

The huge commercial success of mobile telephony, the phenomenal growth of Internet users, the popularity of IP-based multimedia applications are the major driving forces behind third-generation (3G), ongoing Byond 3G (B3G), and forth-genertion (4G) evolution. 3G brought wired applications, both data and multimedia, into wireless environments. It operates on IP-based infrastructures to provide wider service access capability. To support and satisfy QoS (Quality of Service) of diverse IP-based multimedia applications, traffic management, such as Connection Admission Control (CAC) and resource allocation, becomes essential. CAC and resource allocation are computationally complex when combined with QoS guarantee for traffic with different characteristics. However, CAC and resource allocation are real-time traffic control procedures. Hence, processing load should be minimized to reduce delay. At the same time, network resources should be utilized efficiently to accommodate more users. However, reducing processing load and obtaining high resource utilization efficiency has been considered to be contradictory matter. In addition, CAC and resource allocation schemes which consider multiple QoS criteria – loss and delay – simultaneously have not been adequately studied. Simultaneous QoS consideration is important to satisfy stringent and diverse QoS requirements of multimedia traffic. In this paper, we propose a nobel effective bandwidth/buffer calculation method based on a virtual channel/buffer analysis scheme. We show that our method can achieve high resource utilization efficiency with reduced processing load. Moreover, we show that our scheme allows for simultaneous consideration of multiple QoS criteria, loss and delay.     

一种新的对称CDMA系统中非对称业务下的呼叫允许控制策略

未来无线多媒体网络将以分组技术为基础,支持多种业务的传输,业务的QoS保证将受到一定的挑战.各运营商也将针对自己所服务的对象特点,定义各类业务的QoS等级,来提供具有不同QoS要求的业务.因此,呼叫允许控制(Call Admission Control,CAC)策略将要以分组业务为主要对象,即既要在充分利用系统资源的基础上保证各业务的QoS要求,又要适应各运营商之间的不同需求.因此本文提出一种新的对称CDMA系统中非对称业务下基于动态QoS保证的CAC策略.各运营商可根据自己的要求定义各业务的QoS等级.由于业务的不同特性,使得网络中上行链路和下行链路的业务呈现不对称性,为避免资源的浪费,将根据网络中的资源占有情况动态的地分配上行和下行链路中的资源.仿真结果表明,该策略可以自适应地保证各业务的QoS要求,提高了业务间的公平性和系统资源的利用率.     

Enabling seamless multimedia wireless access through QoS‐based bandwidth adaptation

Effective support of real‐time multimedia applications in wireless access networks, viz. cellular networks and wireless LANs, requires a dynamic bandwidth adaptation framework where the bandwidth of an ongoing call is continuously monitored and adjusted. Since bandwidth is a scarce resource in wireless networking, it needs to be carefully allocated amidst competing connections with different Quality of Service (QoS) requirements. In this paper, we propose a new framework called QoS‐adaptive multimedia wireless access (QoS‐AMWA) for supporting heterogeneous traffic with different QoS requirements in wireless cellular networks. The QoS‐AMWA framework combines the following components: (i) a threshold‐based bandwidth allocation policy that gives priority to handoff calls over new calls and prioritizes between different classes of handoff calls by assigning a threshold to each class, (ii) an efficient threshold‐type connection admission control algorithm, and (iii) a bandwidth adaptation algorithm that dynamically adjusts the bandwidth of an ongoing multimedia call to minimize the number of calls receiving lower bandwidth than the requested. The framework can be modeled as a multi‐dimensional Markov chain, and therefore, a product‐form solution is provided. The QoS metrics—new call blocking probability (NCBP), handoff call dropping probability (HCDB), and degradation probability (DP)—are derived. The analytical results are supported by simulation and show that this work improves the service quality by minimizing the handoff call dropping probability and maintaining the bandwidth utilization efficiently. Copyright © 2006 John Wiley & Sons, Ltd.     

Novel multimedia traffic modeling based CAC scheme for CDMA communication systems

As the radio spectrum is a very scarce resource, the Call Admission Control （CAC） is one of the most important parts in radio resource management. The Code Division Multiple Access （CDMA） based next generation wireless communications systems will support the transmission of multimedia traffic, such as voice, video and data, thus the CAC, which can support the multimedia traffic and guarantee the Quality of Service （QoS） of different traffic, has gained broad attention. In this paper, a novel multimedia traffic modeling method and a corresponding dynamic QoS based CAC are proposed. The analysis and simulation results show that the proposed CAC scheme can guarantee the QoS to different traffic demand, and improve the system performance significantly.     

一种优化无线多媒体业务接入允许控制和资源分配算法

无线网络中的多媒体业务具有很大吸引力。本文将多媒体业务分为实时业务和非实时业务,提出了一种呼叫接入控制优化算法CAC-RA,此算法通过采用马尔科夫方法,排队论和非线性规划模型,同时解决呼叫允许控制和资源优化分配问题。提出的利益函数考虑了最大利用资源,同时满足无线网络各类用户的QoS要求,同时尽量减少用户的资源重新分配的频率和幅度变化,仿真实验数据显示CAC-RA算法能较好地适应业务变化的网络,同时实现了较为理想的利益值,满足无线网络多媒体用户的QoS要求。     

Call admission control for integrated on/off voice and best-effort data services in mobile cellular communications

This paper proposes a call admission control (CAC) policy for a cellular system supporting voice and data services, and providing a higher priority to handoff calls than to new calls. A procedure for searching the optimal admission region is given. The traffic flow is characterized by a three-dimensional (3-D) birth-death model, which captures the complex interaction between the on/off voice and best-effort data traffic sharing the total resources without partition. To reduce complexity, the 3-D model is simplified to an exact (approximate) 2-D model for voice (data). The mathematical expressions are then derived for the performance measures and for the minimal amount of resources required for quality-of-service (QoS) provisioning. Numerical results demonstrate that: 1) the proposed CAC policy performs well in terms of QoS satisfaction and resource utilization; 2) the approximate 2-D model for data traffic can achieve a high accuracy in the traffic flow characterization; and 3) the admission regions obtained by the proposed search method agree very well with those obtained by numerically solving the mathematical equations. Furthermore, computer simulation results demonstrate that the impact of lognormal distributed data file size is not significant, and may be compensated by conservatively applying the Markovian analysis results.     

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.     

Providing deterministic packet delays and packet losses in multimedia wireless networks

‘Anytime, anywhere’ communication, information access and processing are much cherished in modern societies because of their ability to bring flexibility, freedom and increased efficiency to individuals and organizations. Wireless communications, by providing ubiquitous and tetherless network connectivity to mobile users, are therefore bound to play a major role in the advancement of our society. Although initial proposals and implementations of wireless communications are generally focused on near‐term voice and electronic messaging applications, it is recognized that future wireless communications will have to evolve towards supporting a wider range of applications, including voice, video, data, images and connections to wired networks. This implies that future wireless networks must provide quality‐of‐service (QoS) guarantees to various multimedia applications in a wireless environment. Typical traffic in multimedia applications can be classified as either Constant‐Bit‐Rate (CBR) traffic or Variable‐Bit‐Rate (VBR) traffic. In particular, scheduling the transmission of VBR multimedia traffic streams in a wireless environment is very challenging and is still an open problem. In general, there are two ways to guarantee the QoS of VBR multimedia streams, either deterministically or statistically. In particular, most connection admission control (CAC) algorithms and medium access control (MAC) protocols that have been proposed for multimedia wireless networks only provide statistical, or soft, QoS guarantees. In this paper, we consider deterministic QoS guarantees in multimedia wireless networks. We propose a method for constructing a packet‐dropping mechanism that is based on a mathematical framework that determines how many packets can be dropped while the required QoS can still be preserved. This is achieved by employing: (1) An accurate traffic characterization of the VBR multimedia traffic streams; (2) A traffic regulator that can provide bounded packet loss and (3) A traffic scheduler that can provide bounded packet delay. The combination of traffic characterization, regulation and scheduling can provide bounded loss and delay deterministically. This is a distinction from traditional deterministic QoS schemes in which a 0% packet loss are always assumed with deterministically bounding the delay. We performed a set of performance evaluation experiments. The results will demonstrate that our proposed QoS guarantee schemes can significantly support more connections than a system, which does not allow any loss, at the same required QoS. Moreover, from our evaluation experiments, we found that the proposed algorithms are able to out‐perform scheduling algorithms adopted in state‐of‐the‐art wireless MAC protocols, for example Mobile Access Scheme Based on Contention and Reservation for ATM (MASCARA) when the worst‐case traffic is being considered. Copyright © 2002 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.     

The integration of ad hoc sensor and cellular networks for multi-class data transmission

This paper targets mobile telemedicine applications that can be supported using third generation (3G) cellular networks, to provide highly flexible medical services. On the other hand, large-scale Ad hoc Sensor Networks (ASN), when deployed among mobile patients who may carry different kinds of micro-sensors to measure ECG, blood pressure, basal temperature or other physiological data, can provide a dynamic data query architecture to allow the medical specialists to monitor patients at any place. So far very little research has been conducted to explore the possibility of integrating ASN with mobile telemedicine. In this paper: 1. we suggest an integrated architecture that takes advantage of the low cost mobile sensor networks and 3G cellular networks to support multimedia medical calls with differentiated Quality-of-Service (QoS) requirements. 2. We propose a low-energy, distributed, concentric-zone-based data query mechanism that has the advantages of both proactive and reactive ad hoc routing algorithms to collect medical results from large-scale mobile patients for medical specialists who use cellular network to report patient data to the medical center. 3. In order to minimize the ambulance wireless call-dropping rate, we adopt accurate resource reservation call admission control (CAC) scheme to allocate the necessary bandwidth in the destination cell. 4. In order to meet the QoS requirements of patients’ wireless calls, we use dynamic guard channel CAC scheme to keep their handoff-call dropping rate below a certain threshold. We evaluate the validity of our schemes through simulations and analyze their performance. Our results clearly indicate the efficiency of the proposed CAC and sensor network query algorithms to meet the multimedia telemedicine QoS requirements.     

Analysis of a hybrid cutoff priority scheme for multiple classes of traffic in multimedia wireless networks

In this paper, we propose and analyze the performance of a new handoff scheme called hybrid cutoff priority scheme for wireless networks carrying multimedia traffic. The unique characteristics of this scheme include support for N classes of traffic, each may have different QoS requirements in terms of number of channels needed, holding time of the connection and cutoff priority. The proposed scheme can handle finite buffering for both new calls and handoffs. Futhermore, we take into consideration the departure of new calls due to caller impatience and the dropping of queued handoff calls due to unavailability of channels during the handoff period. The performance indices adopted in the evaluation using the Stochastic Petri Net (SPN) model include new call and handoff blocking probabilities, call forced termination probability, and channel utilization for each type of traffic. Impact on the performance measures by various system parameters such as queue length, traffic input and QoS of different traffic has also been studied. This revised version was published online in June 2006 with corrections to the Cover Date.     

QoS provisioning dynamic connection-admission control for multimedia wireless networks using a Hopfield neural network

This paper presents a quality-of-service (QoS) provisioning dynamic connection-admission control (CAC) algorithm for multimedia wireless networks. A multimedia connection consists of several substreams (i.e., service classes), each of which presets a range of feasible QoS levels (e.g., data rates). The proposed algorithm is mainly devoted to finding the best possible QoS levels for all the connections (i.e., QoS vector) that maximize resource utilization by fairly distributing wireless resources among the connections while maximizing the statistical multiplexing gain (i.e., minimizing the blocking and dropping probabilities). In the case of congestion (overload), the algorithm uniformly degrades the QoS levels of the existing connections (but only slightly) in order to spare some resources for serving new or handoff connections, thereby naturally minimizing the blocking and dropping probabilities (it amounts to maximizing the statistical multiplexing gain). The algorithm employs a Hopfield neural network (HNN) for finding a QoS vector. The problem itself is formulated as a multi-objective optimization problem. Hardware-based HNN exhibits high (computational) speed that permits real time running of the CAC algorithm. Simulation results show that the algorithm can maximize resource utilization and maintain fairness in resource sharing, while maximizing the statistical multiplexing gain in providing acceptable service grades. Furthermore, the results are relatively insensitive to handoff rates.     

Dynamic-Grouping bandwidth reservation scheme for multimedia wireless networks

In wireless networks carrying multimedia traffic (voice, video, data, and image), it becomes necessary to provide a quality-of-service(QoS) guarantee for multimedia traffic connections supported by the network. In order to provide mobile hosts with high QoS in the next-generation wireless networks, efficient and better bandwidth reservation schemes must be designed. This paper presents a novel dynamic-grouping bandwidth reservation scheme as a solution to support QoS guarantees in the next-generation wireless networks. The proposed scheme is based on the probabilistic resource estimation to provide QoS guarantees for multimedia traffic in wireless cellular networks. We establish several reservation time sections, called groups, according to the mobility information of mobile hosts of each base station. The amount of reserved bandwidth for each base station is dynamically adjusted for each reservation group. We use the dynamic-grouping bandwidth reservation scheme to reduce the connection blocking rate and connection dropping rate, while increasing the bandwidth utilization. The simulation results show that the dynamic-grouping bandwidth reservation scheme provides less connection-blocking rate and less connection-dropping rate and achieves high bandwidth utilization.     

Joint connection-level and packet-level quality-of-service support for VBR traffic in wireless multimedia networks

In this paper, we investigate call admission control (CAC) schemes that can jointly provide connection-level quality-of-service (QoS) (in terms of the new call blocking probability and the handoff dropping probability) and packet-level QoS (in terms of the packet loss probability) for wireless multimedia networks. Stationary CAC schemes are proposed as the results of the solution to constrained optimization problems. A dynamic CAC scheme that can be adapted to varied and varying traffic conditions dynamically is also proposed. The proposed CAC schemes are computationally efficient and easy to implement, thus being suitable for real-time system deployment. Simulation results have demonstrated that the proposed dynamic CAC scheme achieves better performance when applied to realistic traffic conditions found in wireless multimedia networks.     

QoS Performance Bounds and Efficient Connection Admission Control for Heterogeneous Services in Wireless Cellular Networks

Quality-of-Service (QoS) performance and connection admission control (CAC) for heterogeneous services in wireless multiple access networks are investigated. The heterogeneous services include constant bit rate (CBR), variable bit rate (VBR) and available bit rate (ABR) services. Multiple access control is handled by a polling-based scheme with non-preemptive priority. Tight delay variation (jitter) bounds for CBR connections and delay bounds for VBR connections are derived. A CAC scheme based on the derived bounds is developed. The CAC makes use of user mobility information to reserve an appropriate amount of system resources for potential handoff connections to achieve low handoff connection dropping rate (HCDR). Simulation results show that the proposed CAC scheme can achieve both low HCDR and high resource utilization.     

多业务无线蜂窝移动通信系统的一种呼叫允许控制策略

第三代移动通信系统要求支持宽带多媒体业务,如话音、视频、数据等多种业务,不同业务有不同的QoS要求。本文提出的多业务无线蜂窝移动通信系统中一种基于QoS的呼收允许控制策略,对不同业务的切换呼叫给予不同的优先权。本文分析了两种呼叫允许控制（CAC）算法,一种是各种业务的切控呼叫无缓冲器,不进入排队系统;另一种是各种业务的切换呼叫设置有缓冲器,进入排除系统,并且话音、视频业务的切切呼叫比数据业务的切换呼叫有更高的优先权,系统的空闲信道应首先分配给话音、视频业务的切换呼叫,再分配给数据业务的切换呼叫。在分析两种CAC算法的呼叫阻塞概率、切换失败概率以及系统吞吐量的基础上,给出了计算机仿真结果。     

Cross-Layer Enhancement to Support TCP-Based Traffics in WLANs

Widespread deployment of wireless local area networks and a gradual increase in streaming applications have brought about a demand for improved quality of service (QoS) in wireless networks. However, increasing user datagram protocol based high priority multimedia traffic and the class differentiation introduced in QoS protocols, has resulted into transmission control protocol (TCP) starvation and increased spurious timeouts. While today’s Internet traffic is still dominated by TCP based applications, the negative effects of IEEE 802.11e enhanced distributed coordination function (EDCF) scheme on TCP performance in the presence of high priority traffic have not been extensively explored. In this paper, the performance of TCP in 802.11e WLAN competing with high priority traffic is examined. The prioritised adaptive enhanced scheme (PAD_EDCF) is proposed. The proposed scheme gives priority to TCP control packets in order to improve the low traffic transmission flow and acquires additional capability of adjusting the MAC parameters based on the traffic load condition. Simulation results demonstrate that the proposed scheme significantly improves TCP performances in terms of traffic efficiency, throughput and reduces delay.     

Adaptive quality of service handoff priority scheme for mobilemultimedia networks

For various advantages including better utilization of radio spectrum (through frequency reuse), lower mobile transmit power requirements, and smaller and cheaper base station equipment, future wireless mobile multimedia networks are likely to adopt micro/picocellular architectures. A consequence of using small cell sizes is the increased rate of call handoffs as mobiles move between cells during the holding times of calls. In a network supporting multimedia services, the increased rate of call handoffs not only increases the signaling load on the network, but makes it very difficult for the network to guarantee the quality of service (QoS) promised to a call at setup or admission time. This paper describes an adaptive QoS handoff priority scheme which reduces the probability of call handoff failures in a mobile multimedia network with a micro/picocellular architecture. The scheme exploits the ability of most multimedia traffic types to adapt and trade off QoS with changes in the amount of bandwidth used. In this way, calls can trade QoS received for fewer handoff failures. The call level and packet level performance of the handoff scheme are studied analytically for a homogeneous network supporting a mix of wide-band and narrow-band calls. Comparisons are made to the performance of the nonpriority handoff scheme and the well-known guard-channel handoff scheme