An HMM-based call admission control policy for supporting QoS in wireless cellular networks

The multimedia services are getting to become the major trend in next-generation cellular networks. Call admission control (CAC) plays the key role for guaranteeing the quality of service (QoS) in cellular networks. The goal which keeps both the call dropping probability (CDP) and call blocking probability (CBP) below a certain level is more difficult owing to user indeterminate mobility. In this paper, the Hidden Markov Models (HMMs) concept which is suitable for solving a dynamic situation is introduced and applied to the call admission control policy. The prediction of user mobility can be modeled and resolved as the decoding problem of the HMMs. According to the prediction result, the proposed CAC method can reserve appropriate bandwidths for a handoff call beforehand. Thus, the call dropping probability can be kept below a lower level. Moreover, the call blocking probability is not sacrificed too much since the proposed method can reserve the suitable bandwidths in the appropriate cells but not reserve stationary ones which are always adopted by traditional CAC methods. Therefore, the proposed method not only can satisfy both CDP and CBP issues, but also improve the system utilization.     

Integration of pricing with call admission control to meet QoS requirements in cellular networks

Call admission control (CAC) plays a significant role in providing the desired quality of service (QoS) in cellular networks. We investigate the role of pricing as an additional dimension of the call admission control process in order to efficiently and effectively control the use of wireless network resources. First, we prove that, for a given wireless network, there exists a new call arrival rate which can maximize the total utility of users while maintaining the required QoS. Based on this result and observation, we propose an integrated pricing and call admission control scheme where the price is adjusted dynamically based on the current network conditions in order to alleviate the problem of congestion. Our proposed integrated approach implicitly implements a distributed user-based prioritization mechanism by providing negative incentives according to the current network conditions and therefore shaping the aggregate traffic in the network. We compare the performance of our approach in terms of congestion prevention, achievable total user utility, and obtained revenue, with the corresponding results of conventional systems where pricing is not taken into consideration in the call admission control process. These performance results verify the considerable improvement that can be achieved by the integration of pricing in the call admission control process in cellular networks.     

Availability of end-to-end ideal QoS in IP packet networks

Network processor technology has advanced to the point where high-precision time-based store-and-forward logic is readily incorporated into packet switches and routers. With appropriate scheduling, packets from multiple flows can be serviced without contending for link resources. Accordingly, packet flows traversing a network of switching elements can have both path and time determinacy attributes which support ideal end-to-end QoS (zero jitter, zero loss, acceptable end-to-end latency) for real-time UDP packet flows and guaranteed goodput for TCP flows. One approach to packing a network with a relatively large number of such deterministic flows, i.e. achieving high availability of the ideal QoS service in a network, uses precise buffering of packets at each switch, which introduces latency. This paper describes analysis methods for quantifying how much buffering may be necessary to achieve high (99.999%) availability. For typical network topologies the analysis shows that buffering latency requirements are very small compared to transport delays, even when the network is highly utilized with heterogeneous (e.g. voice, video, circuit emulation, and data) traffic. Actual physical implementations have empirically validated the analysis results as well as the scalability of the end-to-end, time-based forwarding approach and the end-to-end availability of ideal QoS services in IP packet networks.     

Deterministic on-line call control in cellular networks

We study an on-line call control problem in cellular networks that are based on the Frequency Division Multiplexing (FDM) technology. In such networks, interference may occur when the same frequency is assigned to two different calls emanating from the same cell or its neighboring cells. The number of frequencies supporting the networks is limited. The goal is to maximize the number of calls served without causing any interference. We focus on the case that the number of frequencies is sufficiently large and the calls stay forever. We give a deterministic on-line algorithm with asymptotic competitive ratio of 2.5 and show a general lower bound of 2. For the special case of linear cellular networks, we achieve a best possible deterministic on-line algorithm with asymptotic competitive ratio of 3/2.     

Online call control in cellular networks revisited

Wireless communication networks based on frequency division multiplexing (FDM in short) play an important role in the field of communications, in which each request can be satisfied by assigning a frequency. To avoid interference, each assigned frequency must be different from the neighboring assigned frequencies. Since frequencies are scarce resources, the main problem in wireless networks is how to fully utilize the given bandwidth of frequencies. In this paper, we consider the online call control problem. Given a fixed bandwidth of frequencies and a sequence of communication requests arriving over time, each request must be either satisfied immediately after its arrival by assigning an available frequency, or rejected. The objective of the call control problem is to maximize the number of accepted requests. We study the asymptotic performance of this problem, i.e., the number of requests in the sequence and the bandwidth of frequencies are very large. In this paper, we give a 7/3-competitive algorithm, say CACO, for the call control problem in cellular networks, improving the previous 2.5-competitive result, and show that CACO is best possible among a class of HYBRID algorithms.     

An adaptive call admission algorithm for cellular networks

In this paper, we first propose a new continuous action-set learning automaton and theoretically study its convergence properties and show that it converges to the optimal action. Then we give an adaptive and autonomous call admission algorithm for cellular mobile networks, which uses the proposed learning automaton to minimize the blocking probability of the new calls subject to the constraint on the dropping probability of the handoff calls. The simulation results show that the performance of the proposed algorithm is close to the performance of the limited fractional guard channel algorithm for which we need to know all the traffic parameters in advance.     

Completed analysis of cellular networks with PH-renewal arrival call

In this paper, we apply the PH-renewal process to model new call and handoff processes, and apply the matrix-analytic approach to explore the performance measures of the drop and block probabilities. We examine the bursty nature of handoff call drops by means of conditional statistics with respect to alternating block and non-block periods. Five related performance measures are derived from conditional statistics, including the long-term new call block and handoff call drop probabilities, and the three short-term measures of average length of a block period and a non-block period, as well as the conditional handoff call drop probability during a block period. These performance measures greatly assist the priority reservation handoff mechanism in determining a proper threshold guard channel in the cell. Furthermore, we derive the handoff call drop probability from the short-term performance measures of average length of a block period and a non-block period, as well as the conditional handoff call drop probability during a block period. The results presented in this paper can provide guidelines for designing adaptive algorithms to adjust the threshold in the guard channel reservation handoff scheme.     

Mobility-based predictive call admission control and bandwidth reservation in wireless cellular networks

This paper presents call admission control and bandwidth reservation schemes in wireless cellular networks that have been developed based on assumptions more realistic than existing proposals. In order to guarantee the handoff dropping probability, we propose to statistically predict user mobility based on the mobility history of users. Our mobility prediction scheme is motivated by computational learning theory, which has shown that prediction is synonymous with data compression. We derive our mobility prediction scheme from data compression techniques that are both theoretically optimal and good in practice. In order to utilize resource more efficiently, we predict not only the cell to which the mobile will handoff but also when the handoff will occur. Based on the mobility prediction, bandwidth is reserved to guarantee some target handoff dropping probability. We also adaptively control the admission threshold to achieve a better balance between guaranteeing handoff dropping probability and maximizing resource utilization. Simulation results show that the proposed schemes meet our design goals and outperform the static-reservation and cell-reservation schemes.     

Energy-aware deployment of dense heterogeneous cellular networks with QoS constraints

The base station (BS) configuration is a key factor to improve energy efficiency (EE). In this paper, we focus on designing the network deployment parameters (i.e., BS densities) for biased K-tier heterogeneous cellular network (HCN) with quality of service (QoS) provisioning. Using appropriate approximations, we derive the closed-form expressions of optimal BS density across all tiers to minimize the area power consumption (APC) by applying the stochastic geometry theory, while satisfying the users’ QoS requirements. These results are used to obtain some new insights into the EE performance of biased HCN deployment. With the aid of this approach, the best type of BSs to be deployed or switched off for energy saving purposes can be identified from the perspectives of BS transmission power. More precisely, if the BS transmission power ratio between an arbitrary pair of tiers of K-tier HCN, e.g., the small cell BS and macro BS tiers, is higher than a threshold which is a function of path loss exponent, bias factor and power consumption, the small cell BSs are preferred. The opposite situation takes place otherwise. Furthermore, it is also shown that, compared to the unbiased HCN scenario, significant energy savings are possible by appropriately biasing the HCN and optimizing the BS density, subject to the QoS constraints among all tiers.     

A self-learning call admission control scheme for CDMA cellular networks

In the present paper, a call admission control scheme that can learn from the network environment and user behavior is developed for code division multiple access (CDMA) cellular networks that handle both voice and data services. The idea is built upon a novel learning control architecture with only a single module instead of two or three modules in adaptive critic designs (ACDs). The use of adaptive critic approach for call admission control in wireless cellular networks is new. The call admission controller can perform learning in real-time as well as in offline environments and the controller improves its performance as it gains more experience. Another important contribution in the present work is the choice of utility function for the present self-learning control approach which makes the present learning process much more efficient than existing learning control methods. The performance of our algorithm will be shown through computer simulation and compared with existing algorithms.     

Joint source coding and packet classification for real-time video transmission over differentiated services networks

Differentiated Services (DiffServ) is one of the leading architectures for providing quality of service in the Internet. We propose a scheme for real-time video transmission over a DiffServ network that jointly considers video source coding, packet classification, and error concealment within a framework of cost-distortion optimization. The selections of encoding parameters and packet classification are both used to manage end-to-end delay variations and packet losses within the network. We present two dual formulations of the proposed scheme: the minimum distortion problem, in which the objective is to minimize the end-to-end distortion subject to cost and delay constraints, and the minimum cost problem, which minimizes the total cost subject to end-to-end distortion and delay constraints. A solution to these problems using Lagrangian relaxation and dynamic programming is given. Simulation results demonstrate the advantage of jointly adapting the source coding and packet classification in DiffServ networks.     

无线蜂窝网络呼叫接入控制仿真平台的设计与实现

介绍了蜂窝网络无线通信中的呼叫接入控制(CAC)的特点,描述了基于面向对象的事件驱动技术的仿真平台的设计思想和仿真系统的优化,对仿真平台的物理模型进行了分析,并给出平台的运行过程。最后给出了无预留信道和固定预留信道的接入控制算法的进行了仿真,并对仿真的结果进行了分析,试验结果符合理论分析。     

Traffic speed estimation based on normal location updates and call arrivals from cellular networks

Information and communication technologies have improved the quality of Intelligent Transportation Systems (ITS). By estimating from Cellular Floating Vehicle Data (CFVD) is more cost-effective, and easier to acquire than traditional ways. In this paper, this study proposes a novel approach to evaluate the relation of normal location update, call arrivals, traffic flow, and traffic density. Moreover, the traffic speed is estimated by the proposed approach according to CFVD. In the simulation, this study compares the real traffic information with the estimated traffic information by Vehicle Detector (VD). The experiment results show that the accuracy of traffic speed estimation is 92.92%. Therefore, the proposed approach can be used to estimate traffic speed from CFVD for ITS.     

Utilizing call admission control for pricing optimization of multiple service classes in wireless cellular networks

In this paper, we utilize admission control algorithms designed for revenue optimization with QoS guarantees to derive optimal pricing of multiple service classes in wireless cellular networks. A service provider typically adjusts pricing only periodically. Once a “global” optimal pricing is derived, it would stay static for a period of time, allowing users to be charged with the same rate while roaming. We utilize a hybrid partitioning-threshold admission control algorithm to analyze a pricing scheme that correlates service demand with pricing, and to periodically determine optimal pricing under which the system revenue is maximized while guaranteeing that QoS requirements of multiple service classes are satisfied.     

A unified approach to analyzing models of cellular communication networks with data call buffering

A unified approach to the analysis of models of cellular communication networks with queues of data calls was developed. Consideration was given to the models with two types of strategies for admission to the cell channels and the buffer. In one strategy, admission to the voice call channels is based on reservation of channels for handover of calls of the given type, and in the other strategy, on the scheme of truncating the calls of the given type. In both models, the strategy of buffer admission by the data calls relies on the scheme of place reservation for handover of the calls of the given type. The models with finite and infinite data call queues were studied. For different admission strategies, algorithms to calculate the servicing performance indices were given, and the results of their comparative analysis were presented.     

QoS management in heterogeneous home networks

An OSGi (Open Services Gateway Initiative) home gateway system manages the integration of heterogeneous home networks protocols and devices to develop ubiquitous applications. Wired and wireless heterogeneous home networks have different QoS concerns. For instance, jitter and latency are important concerns in web phones, while packet loss ratio is important in on-line video. This study adopts UPnP QoS specification version 1.0 to design an adaptive QoS management mechanism based on the RMD (Resource Management in DiffServ) architecture. This study monitors real-time network traffic, and adaptively controls the bandwidth, to satisfy the minimum but most important quality for each application in home network congestion. Simulation results indicate that the average jitter, latency and packet loss are reduced by 0.1391 ms, 0.0066 s, and 5.43%, respectively. The packet loss ratio is reduced by 4.53%, and the throughput is increased by 1.2% in high definition video stream; the packet loss ratio is reduced by 1.89% for standard definition video stream, and in VoIP (Voice over IP) the jitter and latency are reduced to 0.0407 ms and 0.0209 s, respectively.     

异构蜂窝网络中联合功率控制的终端直通通信资源分配

针对异构蜂窝网络中终端直通（D2D）用户和小蜂窝用户复用宏蜂窝用户资源产生的干扰问题,提出一种联合功率控制的资源分配方案。首先,在满足用户信号干扰噪声比（SINR）和发射功率约束条件的前提下,根据系统干扰模型推导出每个D2D用户和小蜂窝用户复用宏蜂窝用户信道资源时的最优发射功率;其次,将用户的信道选择规划成用户和信道之间的双边匹配问题,采用延迟接受（Gale-Shapley）算法得到一个稳定的匹配解;最后,以所得的匹配解为初始条件,通过交换搜索算法进一步优化分配方案。仿真结果表明,该方案的系统总容量和能量效率分别是最优解的93.62%和92.14%,与随机资源分配方案、无功率控制和交换搜索的分配方案,以及有功率控制无交换搜索的分配方案相比,系统容量平均增幅分别为48.29%、15.97%和4.8%,系统能量效率平均增幅分别为62.72%、44.48%和4.45%。该方案能够达到近似最优的系统总容量,有效提高频率利用率和能量效率。     

Increasing QoS in selfish overlay networks

A routing overlay network is an application-layer overlay on the existing Internet routing substrate that allows an alternative routing service. Recent studies have suggested that such networks might contain selfish nodes, which develop their strategies by considering only their own objectives. Extremely selfish nodes, called free-riders, might even refuse to share their resources with the network, thus making overlay service unavailable to the nodes that depend on them. The authors use a game-theoretic approach to evaluate the selfish-node mechanism and increase quality of service (QoS) by detecting and excluding free-riders.     

SLA-based QoS pricing in DiffServ networks

The availability of high-speed transmission media and networking equipment in contemporary networks, as well as the evolution of quality-demanding applications has focused research interest on the provision of advanced qualitative services in addition to the traditional best-effort model of the Internet. A number of alternatives for service differentiation and QoS provisioning have been proposed and standardized, but in the case of backbone, transport networks the DiffServ architecture has prevailed, due to its scalability and deployment feasibility. The provisioning of services according to the DiffServ framework has in turn raised the requirements for interdependent, controlled resource allocation and service pricing, with particular needs for pricing mechanisms that preserve the potential and flexibility of DiffServ. At the same time, such mechanisms should reflect resource usage, allocate resources efficiently, reimburse costs or maximize service provision profits and lead customers to requesting services that will maximize their revenue. In this work, after reviewing related research, the principles that a pricing scheme for DiffServ-based services should follow are presented, stressing the differences form traditional Internet pricing. Based on these principles, an analytical approach to pricing a particular class of DiffServ-based services and a methodology for applying this approach in a real network are proposed and evaluated.     

Quality-of-service in packet networks: basic mechanisms and directions

In this paper, we review the basic mechanisms used in packet networks to support Quality-of-Service (QoS) guarantees. We outline the various approaches that have been proposed, and discuss some of the trade-offs they involve. Specifically, the paper starts by introducing the different scheduling and buffer management mechanisms that can be used to provide service differentiation in packet networks. The aim is not to provide an exhaustive review of existing mechanisms, but instead to give the reader a perspective on the range of options available and the associated trade-off between performance, functionality, and complexity. This is then followed by a discussion on the use of such mechanisms to provide specific end-to-end performance guarantees. The emphasis of this second part is on the need for adapting mechanisms to the different environments where they are to be deployed. In particular, fine grain buffer management and scheduling mechanisms may be neither necessary nor cost effective in high speed backbones, where “aggregate” solutions are more appropriate. The paper discusses issues and possible approaches to allow coexistence of different mechanisms in delivering end-to-end guarantees.