Performance Analysis of WiMAX Networks AC

In WiMAX networks, contention based bandwidth requests are allowed in the uplink channel on the time division duplexing frame. The standard allows some types of traffic classes to use this period while preventing others like Unsolicited Grant Service. In this study, we provide a performance analysis of the three types of connections (ertPS, non-real time Polling Service and Best Effort) that are allowed to contend for bandwidth request opportunities. The choice of these traffic classes covers both real and non-real traffic types. Two quality of service parameters; contention probability and average connection delay are investigated in order to evaluate the network performances. Different levels of priority and blocking probability are assigned to each class of service. This performance analysis has been done using an analytical model for evaluating admission control for the previous mentioned classes in WiMAX network.     

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.     

A Cross-Layer Cognitive Radio-Based Framework and CAC Scheme in WiMAX Networks

Quality of service (QoS) provisioning is an important issue in the deployment of broadband wireless access networks with real-time and non-real-time traffic integration. The Connection Admission Control (CAC) operation is essential to guarantee the QoS requirements of connections while achieving system efficiency. Cognitive Radio is seen as a solution to the current low usage of the radio spectrum and the problem of the fixed spectrum allocation. In this paper, we propose a novel cross-layer Cognitive Radio-based QoS support framework and Cognitive Radio-based CAC scheme in WiMAX point-to-multipoint systems. By using a cross-layer approach, the proposed solution can intelligently explore unused spectrums and spread to non-active spectrums to improve the capacity of the system significantly and provide QoS guaranteed service to real-time traffic. A queueing analytical modeling for the WiAMX system has been carried out. The key system performance parameters are obtained based on the queueing analytical model theoretically. Extensive simulation experiments have been carried out to evaluate the performance of our proposal. The simulation results show that our proposed solution can expand the capacity of WiMAX systems up to two times while providing QoS guaranteed service to real-time and non-real-time traffics.     

Adaptive power allocation and call admission control in multiservice WiMAX access networks [Radio Resource Management and Protocol Engineering for IEEE 802.16]

To achieve a successful broadband wireless access solution, the IEEE 802.16 subcommittee has released a series of standards for WiMAX (worldwide interoperability for microwave access). From a technical viewpoint, WiMAX is a feasible alternative to the wired Internet access solutions such as cable modem and DSL. Nevertheless, from the commercial viewpoint, whether the promise of WiMAX will be materialized still depends on its revenue rate to telecom operators and its service quality to the subscribers. In such a context, this article addresses two resource management mechanisms in WiMAX access networks, that is, adaptive power allocation (APA) and call admission control (CAC), from the perspectives of both service providers and WiMAX subscribers. APA emphasizes how to share the limited power resource of base station among different WiMAX subscribers and further influences the access bandwidth of each subscriber; CAC highlights how to assign a subscriber's access bandwidth to different types of applications. Moreover, to build a WiMAX access network, APA and CAC have to work cooperatively to provide cross-layer resource management. In this article we focus on the OFDMA-TDD system, which allows high spectrum-utility efficiency on uplink and downlink channels in the asymmetric scenario of "lastmile" Internet access. We conclude the article with an optimization strategy to balance service provider's revenue and subscriber's satisfaction     

A dynamic call admission scheme for VBR traffic in ATM networks

The role of call admission control (CAC) in high-speed networks is to maintain the network utilization at a high level, while ensuring that the quality of service (QoS) requirements of the individual calls are met. We use the term static CAC to describe schemes that always allocate the same bandwidth to a specific group of multiplexed calls, independent of the other traffic sharing the link. Dynamic CAC, on the other hand, denotes a scheme in which the bandwidth allocation to a group of calls sharing a queue is influenced by the traffic in other queues destined for the same outgoing link. We propose a generic dynamic call admission scheme for VBR and ABR traffic whose aim is to reduce the blocking rate for VBR calls at the expense of a higher blocking rate for ABR calls. Our scheme is generic because it builds up on a pre-existing static scheme, e.g., one based on a simple notion of effective bandwidth. Our simple approach results in a significant reduction of the blocking rate for VBR traffic (several orders of magnitude), if the bandwidth requirements of a single call are a reasonably small fraction of the link capacity. At the same time, the deterioration of service for ABR traffic can be contained. This revised version was published online in August 2006 with corrections to the Cover Date.     

Power-based admission control for multiclass calls in QoS-sensitive CDMA networks

In this letter, we propose a power-based call admission control (CAC) scheme to accommodate multiclass traffic by directly extending the number-based CAC scheme in multicode CDMA networks, and develop some related mathematical properties. Against the conventional findings, we demonstrate that complete partitioning (CP) of the received signal power at a basestation for each traffic class can be an approach as useful as complete sharing (CS) in accommodating an appropriate number of users. The main advantage of CP scheme over CS scheme is its simplicity in resource management     

Effective bandwidth of multimedia traffic in packet wireless CDMA networks with LMMSE receivers: a cross-layer perspective

We propose a novel concept of cross-layer effective bandwidth that characterizes the unified resource usage taking into account both physical layer linear minimum mean square error (LMMSE) receivers and statistical characteristics of the packet traffic in code division multiple access (CDMA) networks. Based on the concept of cross-layer effective bandwidth, we develop an optimal connection admission control (CAC) scheme for variable bit rate packet traffic with QoS constraints at both physical and network layers. By introducing a small signal-to-interference ratio (SIR) outage probability using the concept of cross-layer effective bandwidth, the capacity of CDMA networks in the proposed CAC scheme can be increased significantly compared to some existing schemes. The effectiveness of the proposed approaches is demonstrated by numerical examples.     

Design of ATM Networks with Multiple Traffic Classes

In this paper, we propose a new heuristic design algorithm for the virtual path (VP)-based ATM network with multiple traffic classes, in which QoS constraints associated with traffic class are taken into account. The minimum bandwidth of VP required to carry given amount of traffic is obtained by utilizing an equivalent bandwidth concept, and the route of each VP is placed so that the network cost is minimized while the QoS requirement is fulfilled. To evaluate our design algorithm, we consider two kinds of traffic: voice traffic as low speed service and still picture traffic as high speed service. Through numerical examples, we demonstrate that our design method can achieve an efficient use of network resources, which results in providing a cost-effective VP-based ATM network.     

Modeling and call admission control algorithm of variable bit ratevideo in ATM networks

The authors propose a new method for the modeling and call admission control (CAC) of variable bit rate video source, which come to the front of ATM networks as hot issues nowadays. First, the modeling of video source is accomplished using the three-state Markov chains including the effects of scene change at which the bit rate of video source is abruptly increased. Also, using two AR models, they improve the defects which an AR model has in modeling a video source. In addition, they represent the analytical model of a video source so that a network manager can acquire the information which is very important in managing the entire networks. CAC is accomplished using the previously defined analytical model. A routing manager calculates the cell loss probability of a chosen VP where a new call is connected so that the routing manager decides whether this new call is accepted or not. This calculation is accomplished through the GB/D/1-S queuing system. Using BIA (bandwidth increasing algorithm), they check whether the calls rejected by the routing manager could be accepted if possible. Finally, the applicable procedures to suitable allocate bandwidth to each VP on a link are presented in detail     

Bandwidth borrowing‐based QoS approach for adaptive call admission control in multiclass traffic wireless cellular networks

This paper proposes a QoS approach for an adaptive call admission control (CAC) scheme for multiclass service wireless cellular networks. The QoS of the proposed CAC scheme is achieved through call bandwidth borrowing and call preemption techniques according to the priorities of the traffic classes, using complete sharing of the available bandwidth. The CAC scheme maintains QoS in each class to avoid performance deterioration through mechanisms for call bandwidth degradation, and call bandwidth upgrading based on min–max and max–min policies for fair resource deallocation and reallocation, respectively. The proposed adaptive CAC scheme utilizes a measurement‐based online monitoring approach of the system performance, and a prediction model to determine the amount of bandwidth to be borrowed from calls, or the amount of bandwidth to be returned to calls. The simulation‐based performance evaluation of the proposed adaptive CAC scheme shows the strength and effectiveness of our proposed scheme. Copyright © 2011 John Wiley & Sons, Ltd.     

Improving quality of service in WiMAX communication at vehicular speeds: a new call admission control solution

Call admission control (CAC) scheme serves as a useful tool for the WiMAX technology, which ensures that resources are not overcommitted and thereby, all existing connections enjoy guaranteed quality of service (QoS). CAC schemes largely rely on readily available information like currently available resources and bandwidth demand of the new call while making an acceptance or rejection decision once a new request arrives. Since wireless channels are not as reliable as wired communication, CAC scheme in WiMAX communication faces a serious challenge of making a right estimate of the usable channel capacity (i.e., effective throughput capacity) while computing the available resources in various communication scenarios. Existing CAC schemes do not consider the impact of mobility at vehicular speeds when computing the usable link capacity and available resources. The main limitation of such CAC scheme is that when a mobile node moves at a slower speed and makes a connection request to the base station (BS), the BS evaluates the situation based on the currently available information. The BS in such cases, is short‐sighted and often overestimates the available resources as it completely ignores the scenario when the SS reaches its top speed within a very short time after a CAC decision is made, causing a significant drop in usable throughput. In this paper, we address this limitation of existing WiMAX CAC schemes and propose a new CAC scheme that estimates the usable link capacity for WiMAX communication at vehicular speeds and uses this information while making a CAC decision. We also present a CAC scheme that takes the speed distribution model of a mobile node into account during the CAC decision making process. Simulation results confirm that the proposed scheme achieves lower dropping rate and improved QoS compared to existing schemes. Copyright © 2011 John Wiley & Sons, Ltd.     

Fair Adaptive Cross-Layer Resource Allocation Scheme for IEEE 802.16 Broadband Wireless Networks

In a WiMAX network, the Medium Access Control (MAC) protocol deals with resource allocation to different types of traffic. The key components that ensure Quality of Service (QoS) guarantees in a WiMAX network include Call Admission Control (CAC), Bandwidth and Burst allocation. In this Paper, a Cross-layer framework is designed to efficiently allocate resources to various classes of traffic. CAC and Bandwidth allocation are dealt in the MAC layer, while Burst allocation in the PHYsical layer. The predominant goal of this work is to reduce delay and Information Element (IE) overheads by efficiently utilizing the available frame space. The History based CAC (HCAC) proposed in this paper deals with call acceptance based on the Contention Window (CW) values. The History based Bandwidth Allocation (HBA) scheme deals with allocating bandwidth based on Consumption and Equity measures. The proposed tightly coupled Delay Tolerance based Scheduler (DTS) and Bucket based Burst Allocator (BBA) allocate resources by prioritizing flows with least delay tolerance. It is seen that the proposed schemes offer better performance in contrast to the existing benchmarked schemes in terms of Throughput, Average Delay and Packet Loss Ratio (PLR).

     

Resource allocation and connection admission control in satellitenetworks

This work focuses on resource allocation and connection admission control (CAC) issues in broadband satellite networks. Broadband services can now be provided by satellite systems operating in the Ka band, due to the large bandwidth available at such frequencies. In this context, we propose a resource allocation algorithm which integrates three classes of services at the MAC layer: constant bit rate (CBR), bursty data, and best effort services. The double movable boundary strategy (DMBS) is proposed to establish a resource-sharing policy among these service classes over the satellite uplink channel. The DMBS is a dynamically controlled boundary policy which adapts the allocation decision to the variable network loading conditions. Connection-oriented and connectionless services can be supported by the system. The CAC and slot allocation decisions are taken at the beginning of each control period after monitoring the filling level of traffic request queues. A threshold level for the bursty data request queue is defined to regulate the CAC process. The impact of the queue threshold value on the performance of the DMBS allocation policy is particularly evaluated in this study. A dynamic variation of this value is also proposed to enhance the system response to interactive applications. We present a brief analytical formulation for the DMBS model, together with simulation study details and performance evaluation results. The obtained results indicate a good efficiency, in terms of overall channel throughput and CBR blocking probability, for both fixed and dynamic data queue threshold approaches. The dynamic approach, however, outperforms the fixed one in terms of overall encountered bursty data delay     

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.     

QoS provisioning in GEO satellite with onboard processing using predictor algorithms

Recently, IP satellite networks have attracted considerable interest as a technology to deliver high-bandwidth IP-based multimedia services to nationwide areas. In particular, IP satellite networks seem to be one of the most promising technologies for connecting users in rural areas, where a wired high-speed network (e.g., xDSL) is not foreseen to be used. However, one of the main problems arising here is to guarantee specific quality of service constraints in order to have good performance for each traffic class. Among various QoS approaches used in the Internet, recently the DiffServ technique has become the most promising solution, mainly for its scalability with respect to the IntServ approach. Moreover, in satellite communication systems, DiffServ computational capabilities are placed at the edge points, reducing the implementation complexity of the satellite onboard equipment. This article deals with the problem of QoS provisioning for packet traffic by considering some resource allocation schemes, including bandwidth allocation techniques and priority-driven onboard switching algorithms. As to the first aim, the proposed technique takes advantage of proper statistical traffic modeling to predict future bandwidth requests. This approach takes into consideration DiffServ-based traffic management to guarantee QoS priority among different users. Moreover, the satellite onboard switching problem has been addressed by considering a suitable implementation of the DiffServ policy based on a cellular neural network.     

A Bandwidth Efficient Adaptive Call Admission Control Scheme for QoS Provisioning in IEEE 802.16e Mobile Networks

In wireless environment the bandwidth resource is limited and therefore judicious use of the available resources is needed. A bandwidth efficient Call Admission Control (CAC) is proposed in this paper for quality of service (QoS) provisioning for the services defined in IEEE 802.16e mobile WiMAX standards to satisfy both bandwidth and delay guarantees to the admitted connections. The concept of adaptive bandwidth degradation is introduced to improve the bandwidth utilization (BU) of the system. The proposed CAC scheme is analyzed by Markov Chain model and performance evaluation is made in comparison with fixed step size degradation. Results show that the proposed adaptive CAC scheme has excellent BU under stressed network condition. Also the long term average revenue is calculated for different service flows and for the overall system to see the efficiency of the adaptive CAC scheme.     

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

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

Bandwidth utilization efficiency enhancement for OFDM‐based WSN

Normally IEEE 802.16 (WiMAX) is used for mainly downlink traffic applications. However in the upper tier of 2‐tier (WiMAX‐WiFi) wireless sensor network, the uplink bandwidth faces bottlenecks for high throughput. In this paper, a solution has been proposed for this limitation of uplink bandwidth allocation through the use of queuing theoretic performance modeling. A Markov‐modulated Poisson process traffic model has been formed for orthogonal frequency division multiple access‐based transmission along with discrete time Markov chain system model for queuing. A downlink traffic pattern has been defined for wireless sensor network nodes. Analytical methods are used to estimate the performance parameters like throughput, delay, and probability of packet drop for resource allocation. An algorithm is formulated to find out minimum resource requirement for downlink and to transfer rest of the resources to uplink bandwidth allocation, for throughput enhancement. Uplink frame utilization is determined through another discrete time Markov chain model for adaptive triggering between the proposed maximum and the normal downlink to uplink ratio operations, for efficient distribution of bandwidth resources. Algorithm and simulation results prove outstanding improvement in the uplink throughput around 50%, without degrading the downlink throughput.