Dynamic pricing for load‐balancing in user‐centric joint call admission control of next‐generation wireless networks

Next‐generation wireless networks (NGWN) will be heterogeneous, comprising of a number of radio access technologies (RATs) co‐existing in the same geographical area. In NGWN, joint call admission control (JCAC) algorithms are required to select the most appropriate RAT for each incoming call. It is envisaged that these JCAC algorithms will be user‐centric (i.e. will consider users' preferences in making RAT selection decisions) in order to enhance user satisfaction. However, user‐centric JCAC algorithms can lead to highly unbalanced traffic load among the available RATs in NGWN because users act independently, and most of them may prefer to be connected through a particular RAT. Highly unbalanced traffic load in NGWN will result in high overall call blocking/dropping probability and poor radio result utilization. To address this problem, we propose dynamic pricing for balancing traffic load among available RATs in heterogeneous wireless networks where users' preferences are considered in making RAT selection decisions. By dynamically adjusting the service price in each of the available RATs, the proposed user‐centric JCAC scheme evens out the unbalanced traffic load caused by independent users' preferences. The JCAC scheme uses fuzzy multiple attribute decision‐making (MADM) technique to select the most appropriate RAT for each incoming call. We develop a Markov model to evaluate the overall call blocking/dropping probability and percentage load in each RAT in heterogeneous wireless networks. Performance of the proposed JCAC scheme is compared with that of a scheme that does not use dynamic pricing. Simulation results are given to show the effectiveness of the proposed JCAC scheme. Copyright © 2009 John Wiley & Sons, Ltd.     

连云港市广电网络呼叫中心建设

连云港市广电网络经过多年的发展取得很大进步。随着数字电视、互动电视、广电宽带等业务的开展,越来越需要建设多功能的广电网络呼叫中心。介绍连云港市广电网络呼叫中心的选择、建设和高效利用。     

基于函数调用图的Android恶意代码检测方法研究

提出了一种基于函数调用图的 Android 程序特征提取及检测方法。该方法通过对 Android 程序进行反汇编得到函数调用图,在图谱理论基础上,结合函数调用图变换后提取出的图结构和提取算法,获取出具有一定抗干扰能力的程序行为特征。由于 Android 函数调用图能够较好地体现 Android 程序的功能模块、结构特征和语义。在此基础上,实现检测原型系统,通过对多个恶意 Android 程序分析和检测,完成了对该系统的实验验证。实验结果表明,利用该方法提取的特征能够有效对抗各类 Android 程序中的混淆变形技术,具有抗干扰能力强等特点,基于此特征的检测对恶意代码具有较好地识别能力。     

Call admission control scheme for real-time services in packet-switched OFDM wireless networks

A call admission control scheme is proposed for real-time services in packet-switched orthogonal frequency division multiplexing （OFDM） wireless cellular networks. The main idea of the proposed scheme is to use maximum acceptance ratio to maintain maximum channel utilization for real-time services according to the desired packet-level and call- level quality-of-service （QoS） requirements. The acceptance ratio is periodically adjusted by using a time discrete Markov chain and Wiener prediction theory according to the varying traffic load. Extensive simulation results show that this algorithm maintains high channel utilization, even as it guarantees packet-level and call-level QoS requirements for real-time services.     

融合的蜂窝网络/无线局域网中资源管理的性能分析

Wireless Local Area Network (WLAN) with high data bit rates can be used with cellular network to achieve higher level of Quality of Service (QoS) by sharing their total resources efficiently. The integration between cellular and WLAN networks should be ensured considering different channel allocation strategies of both networks and efficient resource management techniques should be developed. In this paper, we propose a new call admission scheme to use the coupled resource effectively. The proposed scheme, by taking the different resource sharing strategies for two access networks, limits the new, horizontal and vertical handoff voice and data call arrivals with respect to their call level QoS requirements. Numerical results show that the proposed integrated cellular/WLAN network model uses the resources more effectively and achieves all upper bound QoS requirements for voice and data users as compared with the non integrated network model.     

Stochastic models for bidding strategies on oligopoly electricity market

In this paper we consider the forward/futures contracts and Asian-type call options for power delivery as important components of the bidding strategies of the players’ profits on the electricity market. We show how these derivatives can affect their profit. We use linear asymmetric supply function equilibrium (SFE) and Cournot models to develop firms’ optimal bidding strategies by including forward/futures contracts and Asian-type options. We extend the methodology proposed by Niu et al. (IEEE Trans Power Syst 20(4):1859–1867, 2005), where only forward contracts for power delivery were considered in the SFE model.     

On the Counting Process for a Class of Markovian Arrival Processes with an Application to a Queueing System

In this paper, we consider the counting process for a class of Markovian arrival processes (MAPs). We assume that the representing matrices in such MAPs are expanded in terms of matrix representations of the standard generators in the Lie algebra of the special linear group. The primary purpose of this paper is to construct an explicit solution of the time-dependent distribution and factorial moments of the number of arrival events in (0,t] of the counting process for this class of MAPs. Our construction relies on the Baker–Hausdorff lemma and the specific structure of the representing matrices. To investigate the efficiency of CPU usage with the explicit solution, we have conducted numerical experiments on computing the time-dependent distribution of the counting process through the explicit solution and uniformization-based method. We show that the CPU times required to compute the time-dependent distribution of the number of arrival events in (0,t] through the explicit solution have little sensitivity to t, while the consumption of CPU times with the uniformization-based method becomes greater as t increases. For illustrative purposes, we present a system performance analysis of a queueing system for possible use in automatic call distribution (ACD) systems. As an application of the explicit solution, we use it to express the waiting time distribution of the queueing system. Some numerical examples are also given with comparisons to computer simulations.AMS subject classification: 60K20, 60K25, 68M20This revised version was published online in June 2005 with corrected coverdate     

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.     

数字电视时代的广电客户关系管理与营销系统

介绍广电客户关系管理与营销系统的概念、原理和整体框架,就数字电视整转后如何构建广电客户关系管理与营销系统进行探讨,给出结合呼叫中心的典型系统组成结构和功能应用。     

IP网络QoS问题和对策

服务质量(QoS)技术是IP网络技术能否成为未来统一承载网络技术的关键。根据拥塞持续时间,网络QoS风险可以分为微秒级、毫秒级、秒级、分钟级,和更长时间级别等5个等级。调度机制、缓存和队列、呼叫接纳控制、流量工程等技术均是解决一类QoS风险的有效手段。IP网络运营商需要在分析网络中主要风险的基础上制定整体QoS解决方案,在呼损、时延、抖动、丢包4项指标中取得均衡。