WiMax网络中自相似呼叫接纳控制算法研究

针对WiMAX网络业务流的自相似特性,提出用M/Pareto模型来对网络业务流进行建模,通过M/Pareto模型和FBM业务流模型之间统计性质得到2个模型间的参数映射关系,推导出基于M/Pareto模型参数的有效带宽计算公式,据此设计出一个自相似接纳控制算法(SS-CAC)。该算法避免了通过测量的方法来获取FBM业务流模型中参数值,又适应了WiMAX网络流自相似这一特性,使得计算的有效带宽更加精确和方便,提高了系统资源利用率。仿真结果表明,该算法极大地提高网络的带宽利用率,降低了系统的呼叫阻塞率。     

Supporting multi-user real-time VBR video service using dynamic bandwidth management based on prediction

Real-time variable bit rate (VBR) video is expected to take a significant portion of multimedia applications. However, plentiful challenges to VBR video service provision have been raised for its characteristic of high traffic abruptness. To support multi-user real-time VBR video transmission with high bandwidth utilization and satisfied quality of service (QoS), this article proposes a practical dynamic bandwidth management scheme. This scheme forecasts future media rate of VBR video by employing time-domain adaptive linear predictor and using media delivery index (MDI) as both QoS measurement and complementary management reference. In addition, to support multi-user application, an adjustment priorities classified strategy is also put forward. Finally, a test-bed based on this management scheme is established. The experimental results demonstrate that the scheme proposed in this article is efficient with bandwidth utilization increased by 20%-60% compared to a fixed service rate and QoS guaranteed.     

Real‐time VP bandwidth control for long‐range‐dependent traffic

The asymptotics of cell loss ratio (CLR) in the regime of large buffers are exponential and can be characterized by two parameters, the asymptotic constant and asymptotic decay rate. This result is very general, provided that the arrival process does not possess long‐range dependence. As for the long‐range dependent case (or equivalently, when the increment of the traffic process is self‐similar), the CLR decreases with the buffer size sub‐exponentially, and the two parameters are no longer adequate to capture this phenomenon. Recent results from the literature show that for self‐similar traffic models the tail of the stationary queue length distribution is Weibullian. Using these results, this paper proposes an algorithm for estimating the CLR in real time based on buffer measurements, which works for both the long‐range‐ and the short‐range‐dependent case. For this purpose, the notion of state‐space representation of a single‐server queue is introduced, and Bayesian regression analysis is applied to estimate the state variable of that system. Our approach does not require any models describing the statistics of the traffic other than the asymptotic behaviour of the CLR. We describe how our method can be applied to VP bandwidth control by using results from simulation experiments. Copyright © 1999 John Wiley & Sons, Ltd.     

Bandwidth allocation and admission control scheme based on Nash bargaining solution for WiMAX systems

Development of fair and efficient bandwidth allocation and admission control schemes is one of the key issues in the design of IEEE 802.16 broadband wireless access systems in time division multiple access (TDMA) mode. In this article, the problem of bandwidth allocation and admission control is formulated as a Nash bargaining model. The nash bargaining solution (NBS) derived from the cooperative game is adopted to maximize the spectrum utilization. Analysis and simulation results show that there is a unique Pareto optimal bandwidth allocation solution by using NBS among various flows. Furthermore, maximum utility of the system can also be maintained by using the admission control policy with different number of connections and variable channel qualities. The total throughput of the proposed scheme is close to the maximal one, while significantly improving fairness compared to the existing solutions.     

A call admission control for service differentiation and fairness management in WDM grooming networks

We investigate a call admission control (CAC) mechanism for providing fairness control and service differentiation in a WDM network with grooming capabilities. A WDM grooming network can handle different classes of traffic streams which differ in their bandwidth requirements. We assume that for each class, call interarrival and holding times are exponentially distributed. Using a Markov Decision Process approach, an optimal CAC policy is derived for providing fairness in the network. The Policy Iteration algorithm is used to numerically compute the optimal policy. Furthermore, we propose a heuristic decomposition algorithm with lower computational complexity and good performance. Simulation results compare the performance of our proposed policy with those of Complete Sharing and Complete Partitioning policies. Comparisons show that our proposed policy provides the best performance in most cases. Although this approach is motivated by WDM networks, it may be deployed to determine the optimal resource allocation in many problems in wireless and wired telecommunications systems.     

Radio resource management games in wireless networks: an approach to bandwidth allocation and admission control for polling service in IEEE 802.16 [Radio Resource Management and Protocol Engineering for IEEE 802.16]

Game theory is a mathematical tool developed to understand competitive situations in which rational decision makers interact to achieve their objectives. Game theory techniques have recently been applied to various engineering design problems in which the action of one component impacts (and perhaps conflicts with) that of any other component. In particular, game theory techniques have been successfully used for protocol design and optimization (e.g., radio resource management, power control) in wireless networks. In this article we present an overview of different game theory formulations. Then a survey on the game-theory-based resource management and admission control schemes in different wireless networks is presented, and several open research issues are outlined. To this end, we propose an adaptive bandwidth allocation and admission control scheme for polling service in an IEEE 802.16-based wireless metropolitan area network. A noncooperative game is formulated, and the solution of this game is determined by the Nash equilibrium for the amount of bandwidth offered to a new connection. The admission control policy ensures QoS for all connections in the system