A New Call Admission Control Mechanism for Multimedia Traffic over Next-Generation Wireless Cellular Networks

The subject of Call Admission Control (CAC) for wireless networks has been studied extensively in the literature. Another subject on which many researchers have focused their attention is that of video traffic modeling. However, user mobility, combined with the rapidly growing number of "greedy" multimedia applications, in terms of bandwidth and Quality of Service (QoS) requirements, form a challenging and yet unresolved problem for third and fourth-generation wireless networks. In recent work, we have built a Discrete Autoregressive (DAR (1)) model to capture the behavior of multiplexed H.263 videoconference movies from variable bit rate (VBR) coders. Based on this model, we propose in this work a new efficient CAC scheme for wireless cellular networks, which differs from the existing proposals in the literature in that it uses precomputed traffic scenarios combined with online simulation for its decision making. Our scheme is shown, via an extensive simulation study comparison and a conceptual comparison with well-known existing approaches, to clearly excel in terms of QoS provisioning to users receiving videoconference videoconference and Web traffic. To the best of our knowledge, this is the first work in the relevant literature where such an approach has been proposed.     

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     

Call admission control for wireless mesh network based on power interference modeling using directional antenna

Interference is a fundamental issue in wireless mesh networks (WMNs) and it seriously affects the network performance. In this paper we characterize the power interference in IEEE 802.11 CSMA/CA based wireless mesh networks using directional antennas. A model based centralized call admission control (CAC) scheme is proposed which uses physical collision constraints, and transmitter-side, receiver-side and when-idle protocol collision prevention constraints. The CAC assists to manage requests from users depending on the available bandwidth in the network: when a new virtual link establishment request from a user is accepted into the network, resources such as interface, bandwidth, transmission power and channel are allocated in the participating nodes and released once the session is completed. The proposed CAC is also able to contain the interference in the WMN by managing the transmission power of nodes.     

Real-time call admission control for packet-switched networking by cellular neural networks

In this paper, novel call admission control (CAC) algorithms are developed based on cellular neural networks. These algorithms can achieve high network utilization by performing CAC in real-time, which is imperative in supporting quality of service (QoS) communication over packet-switched networks. The proposed solutions are of basic significance in access technology where a subscriber population (connected to the Internet via an access module) needs to receive services. In this case, QoS can only be preserved by admitting those user configurations which will not overload the access module. The paper treats CAC as a set separation problem where the separation surface is approximated based on a training set. This casts CAC as an image processing task in which a complex admission pattern is to be recognized from a couple of initial points belonging to the training set. Since CNNs can implement any propagation models to explore complex patterns, CAC can then be carried out by a CNN. The major challenge is to find the proper template matrix which yields high network utilization. On the other hand, the proposed method is also capable of handling three-dimensional separation surfaces, as in a typical access scenario there are three traffic classes (e.g., two type of Internet access and one voice over asymmetric digital subscriber line.     

A novel neural network traffic enforcement mechanism for ATMnetworks

ATM has been recommended by the CCITT as the transport vehicle for the future B-ISDN networks. In ATM-based networks, a set of user declared parameters that describes the traffic characteristics, is required for the connection acceptance control (CAC) and traffic enforcement (policing) mechanisms. At the call set-up phase, the CAC algorithm uses those parameters to make a call acceptance decision. During the call progress, the policing mechanism uses the same parameters to control the user's traffic within its declared values in order to protect the network's resources and avoid possible congestion problems. A novel policing mechanism using neural networks (NNs) is presented. This is based upon an accurate estimation of the probability density function (pdf) of the traffic via its count process and implemented using NNs. The pdf-based policing is made possible only by NNs because pdf policing requires complex calculations, in real-time, at very high speeds. The architecture of the policing mechanism is composed of two interconnected NNs. The first one is trained to learn the pdf of “ideal nonviolating” traffic, whereas the second is trained to capture the “actual” characteristics of the “actual” offered traffic during the progress of the call. The output of both NNs is compared. Consequently, an error signal is generated whenever the pdf of the offered traffic violates its “ideal” one. The error signal is then used to shape the traffic back to its original values     

Models for setting ATM parameter values

In ATM networks, a user should negotiate at connection set-up a traffic contract which includes traffic characteristics and requested QoS. The traffic characteristics currently considered are the Peak Cell Rate, the Sustainable Cell Rate, the Intrinsic Burst Tolerance and the Cell Delay Variation (CDV) tolerance(s). The values taken by these traffic parameters characterize the so-called Worst Case Traffic that is used by CAC procedures for accepting a new connection and allocating resources to it. Conformance to the negotiated traffic characteristics is defined, at the ingress User to Network Interface (UNI) and at subsequent Inter Carrier Interfaces (ICIs), by algorithmic rules based on the Generic Cell Rate Algorithm (GCRA) formalism. Conformance rules are implemented by policing mechanisms that control the traffic submitted by the user and discard excess traffic. It is therefore essential to set traffic characteristic values that are relevant to the considered cell stream, and that ensure that the amount of non-conforming traffic is small. Using a queueing model representation for the GCRA formalism, several methods are available for choosing the traffic characteristics. This paper presents approximate methods and discusses their applicability. We then discuss the problem of obtaining traffic characteristic values for a connection that has crossed a series of switching nodes. This problem is particularly relevant for the traffic contract components corresponding to ICIs that are distant from the original source.     

Multi-Dimensional Adaptive SINR Based Vertical Handoff for Heterogeneous Wireless Networks

Vertical handoff in next generation heterogeneous wireless networks is a multi-dimensional issue. In this article we propose a multi-dimensional adaptive SINR based vertical handoff algorithm (MASVH) which uses the combined effects of SINR, user required bandwidth, user traffic cost and utilization from participating access networks to make handoff decisions for multi-attribute QoS consideration. Simulation results confirm that the new MASVH algorithm improves the system performance in terms of higher throughput and lower dropping probability, as well as reduces the user traffic cost for accessing the integrated wireless networks.     

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

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

Bandwidth allocation and connection admission control in ATMnetworks

Asynchronous transfer mode (ATM) is the transmission format for almost all future communication networks, including broadband integrated services digital networks (B-ISDN). The key feature of ATM is its high flexibility in bandwidth allocation. Instead of reserving capacity for each connection, the bandwidth is allocated on demand. As a consequence, packets (called cells in ATM terminology) might be lost. To guarantee a given quality of service (QoS), some kind of control is needed to decide whether to accept or to reject an incoming connection. A connection is accepted only if the network has sufficient resources to achieve the QoS required by the user without affecting the QoS of the existing connections. In ATM networks, connection admission control (CAC) is responsible for this decision. It is a very complex function because the traffic may vary greatly and have poorly known characteristics. This paper describes CAC procedures proposed in the literature and discusses issues related to bandwidth allocation in ATM networks. It shows that CAC and statistical multiplexing are only needed for certain connections     

A survey of active network research

Active networks are a novel approach to network architecture in which the switches (or routers) of the network perform customized computations on the messages flowing through them. This approach is motivated by both lead user applications, which perform user-driven computation at nodes within the network today, and the emergence of mobile code technologies that make dynamic network service innovation attainable. The authors discuss two approaches to the realization of active networks and provide a snapshot of the current research issues and activities. They illustrate how the routers of an IP network could be augmented to perform such customized processing on the datagrams flowing through them. These active routers could also interoperate with legacy routers, which transparently forward datagrams in the traditional manner     

业务非均匀分布CDMA系统中一种基于公平性保证的贪婪呼叫接纳控制策略

呼叫接纳控制(Call Admission Control,CAC)是移动通信系统资源管理的主要内容之一。它通过接纳或者拒绝一种用户服务请求,来保持系统的正常运行,是平衡用户服务满意度与系统资源最大化利用矛盾的主要手段。该文主要研究小区间业务非均匀分布时基于公平性保证的动态CAC策略,提出了一种新的CAC策略,可适用于多业务且有变速率(Variable BitRate,VBR)业务的情况。该策略采用贪婪算法,用户请求接入以全系统的预期信干比作为判决条件,从而实现了不同到达率小区之间阻塞率的均衡,保证了用户接入的公平性,对于实际系统的应用具有重要的意义。     

Performance of CAC strategies for multimedia traffic in wireless networks

Call admission control (CAC) strategies for multimedia traffic in wireless networks is studied. A wireless network cell serving two types of customers; narrowband customers, which require one channel and wideband customers, which require b/sub w//spl ges/1 channels is considered. Two CAC strategies; reserve channels strategy (RCS) and threshold strategy (TS) are applied to the wireless cell and their performances are compared. The results show that in most operating conditions, the RCS has a lower blocking probability and probability of handoff call dropping than the TS. Only in the case when the wideband traffic is higher than the narrowband traffic that the weighted probability of handoff call dropping becomes higher for the RCS. Mean server utilization is lower for the threshold CAC than for the reserve channels CAC strategy at most operating conditions.     

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.     

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.     

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.     

基于市场拍卖模型的ATM网络ABR业务控制

本文提出一种分布式的、基于用户竞价模型的ＡＴＭ网络ＡＢＲ业务控制机制,可为用户提供在业务传输中没价格与不同服务质量等级之间的协商。在此欺压耻我们定义了新的资源利用公平性准则。它是最大一最小准则的扩充,本文方法所用的控制和计旨易于实现,并且遵循ＡＴＭ论坛提出的ＡＢＲ业务明确位率反馈控制规范,因而此方法ＡＢＲ业务的计旨几分布式管理相集成提供了一条新思路。     

QoS support for integrated services over CATV

Cable TV has emerged as a promising access network infrastructure for the delivery of voice, video, and high-speed data traffic. A central issue in the design of protocols for CATV networks is to support different levels of QoS for diverse user applications. While CATV service providers and equipment have standardized, in the so-called MCNS protocol, the basic network architecture and interfaces, issues in the MAC layer for QoS support are likely to be left for differentiation in vendor products. This article first presents an overview of the basic CATV network architectural assumptions and the set of QoS requirements for supporting integrated services over CATV. It then discusses a MAC layer scheduling protocol that can efficiently multiplex constant bit rate traffic, such as voice over IP with guaranteed delay bound, and best-effort traffic, such as data services with minimum bit rate guarantee, while achieving fairness on any excess available bandwidth. The performance of this algorithm is illustrated by simulation results using Opnet. We also discuss a dynamic polling mechanism that enhances the link utilization while preserving delay bounds for latency-critical traffic     

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.