Enabling seamless multimedia wireless access through QoS‐based bandwidth adaptation

Effective support of real‐time multimedia applications in wireless access networks, viz. cellular networks and wireless LANs, requires a dynamic bandwidth adaptation framework where the bandwidth of an ongoing call is continuously monitored and adjusted. Since bandwidth is a scarce resource in wireless networking, it needs to be carefully allocated amidst competing connections with different Quality of Service (QoS) requirements. In this paper, we propose a new framework called QoS‐adaptive multimedia wireless access (QoS‐AMWA) for supporting heterogeneous traffic with different QoS requirements in wireless cellular networks. The QoS‐AMWA framework combines the following components: (i) a threshold‐based bandwidth allocation policy that gives priority to handoff calls over new calls and prioritizes between different classes of handoff calls by assigning a threshold to each class, (ii) an efficient threshold‐type connection admission control algorithm, and (iii) a bandwidth adaptation algorithm that dynamically adjusts the bandwidth of an ongoing multimedia call to minimize the number of calls receiving lower bandwidth than the requested. The framework can be modeled as a multi‐dimensional Markov chain, and therefore, a product‐form solution is provided. The QoS metrics—new call blocking probability (NCBP), handoff call dropping probability (HCDB), and degradation probability (DP)—are derived. The analytical results are supported by simulation and show that this work improves the service quality by minimizing the handoff call dropping probability and maintaining the bandwidth utilization efficiently. Copyright © 2006 John Wiley & Sons, Ltd.     

Modelling and analysis of routing and resource allocation techniques in multi‐service networks

In this paper a novel call level model based on the extension of the classical Erlang multi‐rate model for broadband integrated services networks is proposed. We use the model to study routing strategies in multi‐service networks where service classes with/without QoS guarantees coexist. Examples for such networks include ATM and IP‐based integrated networks. In ATM, the CBR and VBR service classes provide QoS guarantees, while the ABR and UBR service classes are of the best effort type. In IP, traditional TCP/IP traffic is of the best effort type, while new protocols like the RSVP or the differentiated services with central resource handling attempt to support QoS parameters. The coexistence of guaranteed and best effort traffic gives rise to new challenging problems since for a given elastic (best effort) connection the bottleneck link determines the available bandwidth and thereby puts constraints on the bandwidth at the other links along the connection's path. Since the available bandwidth fluctuates in time following the load on the links, routing and link allocation in this environment together with blocking probability calculations and fairness issues need to be studied. By means of our proposed model we are able to conduct a survey of various routing and link allocation techniques as well as to develop a modified shortest path routing algorithm which, according to the numerical examples, performs well in this environment. Copyright © 1999 John Wiley & Sons, Ltd.     

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.     

Congestion probabilities in a batched Poisson multirate loss model supporting elastic and adaptive traffic

The ever increasing demand of elastic and adaptive services, where in-service calls can tolerate bandwidth compression/expansion, together with the bursty nature of traffic, necessitates a proper teletraffic loss model which can contribute to the call-level performance evaluation of modern communication networks. In this paper, we propose a multirate loss model that supports elastic and adaptive traffic, under the assumption that calls arrive in a single link according to a batched Poisson process (a more “bursty” process than the Poisson process, where calls arrive in batches). We assume a general batch size distribution and the partial batch blocking discipline, whereby one or more calls of a new batch are blocked and lost, depending on the available bandwidth of the link. The proposed model does not have a product form solution, and therefore we propose approximate but recursive formulas for the efficient calculation of time and call congestion probabilities, link utilization, average number of calls in the system, and average bandwidth allocated to calls. The consistency and the accuracy of the model are verified through simulation and found to be quite satisfactory.     

Handoff performance in wireless DS‐CDMA networks

This paper analyses the performance of DS‐CDMA networks in the presence of call handoffs. We show that a handoff may violate the SINR requirements for other users, and thus cause an outage in the target cell. We propose to use the probability of such events as a possible metric for quality of service in networks with multiple traffic types, and derive the corresponding QoS parameters. A two‐level admission policy is defined: in tier 1 policy, the network capacity is calculated on the basis of the bound on outage probability. However, this policy does not suffice to prevent outage events upon handoffs for various traffic types, and henceforth, we propose an extension that reserves extra bandwidth for handoff calls, thus ensuring that handoff calls will not violate the outage probability bound. The overhead imposed by the extension is negligible, as the complete two‐tier admission control algorithm is executed only when a call is admitted into the network. Once admitted, calls can freely execute handoffs using the reserved bandwidth. The modified second‐tier bandwidth reservation policy is adaptive with respect to the traffic intensity and user's mobility and we show that it can provide satisfactory call (flow) quality during its lifetime. Analytical results for the QoS have been verified by the simulations. Copyright © 2002 John Wiley & Sons, Ltd.     

Flow‐level performance analysis of a multi‐rate system supporting stream and elastic services

We consider a multi‐rate system where stream and elastic flows receive service. Both the stream and the elastic classes are associated with peak rate limitation. In contrast to the constant bit rate stream flows, the elastic flows tolerate bandwidth compression while in service. Because of the occasional bandwidth compression, the holding time of elastic flows depends on their perceived throughput. Although this model is Markovian under quite non‐restrictive assumptions, the model's state space grows exponentially with the number of traffic classes. The model is not quasi‐reversible, and therefore, it cannot be evaluated by efficient recursive formulae. We propose a method whereby the original state space is mapped to a two‐dimensional one, independently of the number of the stream and the elastic traffic classes. The special structure of the two‐dimensional model allows us to develop an efficient method that approximates the average throughputs of elastic flows. The state space reduction together with the proposed approximation provides a powerful tool for the performance analysis of this model as it allows the approximation of the average throughputs of elastic flows reasonably accurately in large models as well. Copyright © 2012 John Wiley & Sons, Ltd.     

IPv6-based dynamic coordinated call admission control mechanism over integrated wireless networks

Many wireless access systems have been developed recently to support users mobility and ubiquitous communication. Nevertheless, these systems always work independently and cannot simultaneously serve users properly. In this paper, we aim to integrate IPv6-based wireless access systems and propose a coordinated call admission control mechanism to utilize the total bandwidth of these systems to minimize the call blocking probabilities, especially the handoff call dropping probabilities. First, we propose an integrated hierarchical wireless architecture over IPv6-based networks to combine the wireless access systems including cellular systems (second-generation, General Packet Radio Service, or third-generation), IEEE 802.11 a/b/g WLAN, and Bluetooth. In the proposed architecture, mobile user can request a call with quality-of-service (QoS) requirements by any wireless network interfaces that can be accessed. When the proposed coordinated call admission control (CCAC) mechanism receives a request, it takes the QoS requirements of the incoming call and the available and reserved bandwidth of this wireless system into consideration to accept or reject this request. Besides, the mechanism can coordinate with other wireless systems dynamically to adjust the bandwidth reserved for handoff calls at each wireless system in this architecture so as to reduce the call blocking probabilities. Once the call is admitted, the mobile user is able to access heterogeneous wireless access networks via multiple interfaces simultaneously. Finally, we evaluate this system to show that the CCAC on the proposed architecture outperforms other mechanisms proposed before.     

Scalable Quasi‐Dynamic‐Provisioning‐Based Admission Control Mechanism in Differentiated Service Networks

The architecture in a differentiated services (DiffServ) network is based on a simple model that applies a per‐class service in the core node of the network. However, because the network behavior is simple, the network structure and provisioning is complicated. If a service provider wants dynamic provisioning or a better bandwidth guarantee, the differentiated services network must use a signaling protocol with QoS parameters or an admission control method. Unfortunately, these methods increase the complexity. To overcome the problems with complexity, we investigated scalable dynamic provisioning for admission control in DiffServ networks. We propose a new scalable qDPM² mechanism based on a centralized bandwidth broker and distributed measurement‐based admission control and movable boundary bandwidth management to support heterogeneous QoS requirements in DiffServ networks.     

An opportunistic cross‐layer architecture for voice in multi‐hop wireless LANs

We propose an opportunistic cross‐layer architecture for adaptive support of Voice over IP in multi‐hop wireless LANs. As opposed to providing high call quality, we target emergencies where it is important to communicate, even if at low quality, no matter the harshness of the network conditions. With the importance of delay on voice quality in mind, we select adaptation parameters that control the ratio of real‐time traffic load to available bandwidth. This is achieved in two ways: minimizing the load and maximizing the bandwidth. The PHY/MAC interaction improves the use of the spectral resources by opportunistically exploiting rate‐control and packet bursts, while the MAC/application interaction controls the demand per source through voice compression. The objective is to maximize the number of calls admitted that satisfy the end‐to‐end delay budget. The performance of the protocol is studied extensively in the ns‐2 network simulator. Results indicate that call quality degrades as load increases and overlonger paths, and a larger packet size improves performance. For long paths having low‐quality channels, forward error correction, header compression, and relaxing the delay budget of the system are required to maintain call admission and quality. The proposed adaptive protocol achieves high performance improvements over the traditional, non‐adaptive approach. Copyright © 2008 John Wiley & Sons, Ltd.     

Traffic analysis for multiparty videoconferencing in virtual path‐based ATM networks

With effective bandwidth concept encapsulating cell‐level behaviour, asynchronous transfer mode (ATM) network design and analysis at the call‐level may be formulated in the framework of circuit‐switched loss networks. In this paper, we develop an analytical framework for a kind of multiparty videoconferencing in the VP‐based ATM network at call‐level. For this kind of conference, only the video of the current speaker is broadcast to other conferees. We first address several conference management issues in the VP‐based ATM network, including the bandwidth allocation strategies, routing rule, call admission policy and speaker change management. Next, we formulate a traffic model for the conferences. Since an exact analysis of such a multiparty conference network is mathematically intractable, an approximate analysis for such conferences in a fully connected VP network is performed. The key of our method is to make use of the reduced‐load approximation and open Jackson network model to derive the traffic loads from new conferences as well as that from the speaker change of the on‐going conferences. Our study shows that the proposed analysis can give accurate predictions of the blocking probabilities for the new conference calls as well as video freeze probabilities for the on‐going conferences. Copyright © 2000 John Wiley & Sons, Ltd.     

Call admission control for an adaptive heterogeneous multimedia mobile network

A novel call admission control (CAC) scheme for an adaptive heterogeneous multimedia mobile network with multiple classes of calls is investigated here. Different classes of calls may have different bandwidth requirement, different request call holding time and different cell residence time. At any time, each cell of the network has the capability to provide service to at least a given number of calls for each class of calls. Upon the arrival (or completion or hand off) of a call, a bandwidth degrade (or upgrade) algorithm is applied. An arriving call to a cell, finding insufficient bandwidth available in this cell, may either be disconnected from the network or push another call out of the cell toward a neighboring cell with enough bandwidth. We first prove that the stationary distribution of the number of calls in the network has a product form and then show how to apply this result in deriving explicit expressions of handoff rates for each class of calls, in obtaining the disconnecting probabilities for each class of new and handoff calls, and in finding the grade of service of this mobile network     

Class-Based Service Connectivity Using Multi-level Bandwidth Adaptation in Multimedia Wireless Networks

Due to the fact that quality of service requirements are not very strict for all traffic types, more calls of higher priority can be accommodated by reducing some bandwidth allocation for the bandwidth adaptive calls. The bandwidth adaptation to accept a higher priority call is more than that of a lower priority call. Therefore, the multi-level bandwidth adaptation technique improves the overall forced call termination probability as well as provides priority of the traffic classes in terms of call blocking probability without reducing the bandwidth utilization. We propose a novel bandwidth adaptation model that releases multi-level of bandwidth from the existing multimedia traffic calls. The amount of released bandwidth is decided based on the priority of the requesting traffic calls and the number of existing bandwidth adaptive calls. This prioritization of traffic classes does not reduce the bandwidth utilization. Moreover, our scheme reduces the overall forced call termination probability significantly. The proposed scheme is modeled using the Markov Chain. The numerical results show that the proposed scheme is able to provide negligible handover call dropping probability as well as significantly reduced new call blocking probability of higher priority calls without increasing the overall forced call termination probability.     

Cross-Layer optimization for LDPC-coded multirate multiuser systems with QoS constraints

In this paper, we propose a new multirate multiple-access wireless system implemented by variable spreading gain and chip-level random interleaving. The receiver employs a flexible chip-level iterative multiuser detection scheme where the variable spreading gain affects only the despreading parameters. Optimization across the physical and network layers in the uplink of such a system is treated. It is assumed that each user employs an low-density parity-check (LDPC) code to protect its data. At the physical layer, the quality of service (QoS) requirement is specified in terms of the target bit error rate (BER) of each user. Optimal user transmit powers are dynamically adjusted according to the current system load and the corresponding rate requirements. At the network layer, the QoS requirements include the call blocking probabilities, call connection delays, packet congestion probabilities and packet loss rates. To maximize the average revenue of the network subject to both call-level and packet-level QoS constraints, a multicriterion reinforcement learning (MCRL)-based adaptive call admission control (CAC) method is proposed that can easily handle multiple average QoS requirements. Unlike existing model-based approaches, the MCRL-based technique does not require the explicit knowledge of the state transition probabilities to derive the optimal policy. This feature is important when the number of states is so large that model-based optimization algorithms become infeasible, which is typically the case for a large integrated service network supporting a number of different service types.     

A call admission control scheme for packet data in CDMA cellular communications

In wireless cellular communication systems, call admission control (CAC) is to ensure satisfactory services for mobile users and maximize the utilization of the limited radio spectrum. In this paper, we propose a new CAC scheme for a code division multiple access (CDMA) wireless cellular network supporting heterogeneous self-similar data traffic. In addition to ensuring transmission accuracy at the bit level, the CAC scheme guarantees service requirements at both the call level and the packet level. The grade of service (GoS) at the call level and the quality of service (QoS) at the packet level are evaluated using the handoff call dropping probability and the packet transmission delay, respectively. The effective bandwidth approach for data traffic is applied to guarantee QoS requirements. Handoff probability and cell overload probability are derived via the traffic aggregation method. The two probabilities are used to determine the handoff call dropping probability, and the GoS requirement can be guaranteed on a per call basis. Numerical analysis and computer simulation results demonstrate that the proposed CAC scheme can meet both QoS and GoS requirements and achieve efficient resource utilization.     

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.     

Modeling and Simulation of Mixed Queueing and Loss Systems

In this paper, we investigate a multi-rate network in which wide-band calls are allowed to wait if insufficient resources are available at the time of the call arrival. On the link level, an analytical model is presented and simulations have been carried out on the network level. The results indicate that allowing a few wide-band calls to queue can give a significant improvement in performance in terms of network revenue , as well as a means to level out the blocking probabilities of the different traffic classes. This improvement becomes significant when the service discipline of the waiting calls (of different bandwidth requirements) is adaptive in the sense that longer queues get served first. This observation motivates the investigation of the impact of various buffer space assignment and queueing disciplines on network revenue and call blocking probabilities. The study of such mixed delay and queueing networks is motivated by its possible applications to traffic problems in future Broadband Integrated Services Digital Networks as well as in multi-rate cellular radio networks.     

Mobility management schemes for real‐time traffic and resource allocation in IEEE 802.16e mobile network

In this paper, our aim is to develop in IEEE802.16e Wireless Networks with link adaptation, in the presence of real‐time traffic call admission control (CAC) schemes. These CAC propose various scenarios of resource splitting and handling the intracell mobility. In particular, we consider two types of intracell mobility classes : low mobility class for mobiles moving usually with low speed between the neighboring regions of the cell and high mobility class for those moving with high speed and that can skip more than one region before changing their modulation. For this reason, we assume a time threshold T _th that determines the minimum time a call must remain in a region before the base station changes its modulation. And we compare it with the time that a call may spend in a region to decide whether the base station will change its modulation or not. In the beginning, we introduce two CAC schemes. In the first one, we reserve a portion of resources to mobiles in migration with both high and low mobility. And in the second one, we give the priority just to mobiles in migration with high mobility. Then, we calculate the impact in the blocking and dropping probabilities. We show by numerical results that by the proposed CAC schemes, we can find a resource management that outperforms well under different types of mobility. But, to find a good tradeoff between dropping the calls in migration and blocking the new calls, we introduce the optimization problem in the second part. So, we are faced to the necessity of optimizing the results found in the first part. Therefore, we define an objective function to optimize, in order to ensure the highest quality of service for users and to give a better stability state between the dropping and blocking probability. We show that the proposed objective function gives the optimal resources allocation between the migrating and new arriving calls in the cell. Copyright © 2015 John Wiley & Sons, Ltd.     

On providing blocking probability and throughput guarantees in a multi‐service environment

As the Internet evolves from a packet network supporting a single best effort service class towards an integrated infrastructure supporting several service classes—some with QoS guarantees—there is a growing interest in the introduction of admission control and in devising bandwidth sharing strategies, which meet the diverse needs of QoS‐assured and elastic services. In this paper we show that the extension of the classical multi‐rate loss model is possible in a way that makes it useful in the performance analysis of a future admission control based Internet that supports traffic with peak rate guarantee as well as elastic traffic. After introducing the model, it is applied for the analysis of a single link, where it sheds light on the trade‐off between blocking probability and throughput. For the investigation of this trade‐off, we introduce the throughput‐threshold constraint, which bounds the probability that the throughput of a traffic flow drops below a predefined threshold. Finally, we use the model to determine the optimal parameter set of the popular partial overlap link allocation policy: we propose a computationally efficient algorithm that provides blocking probability‐ and throughput guarantees. We conclude that the model and the numerical results provide important insights in traffic engineering in the Internet. Copyright © 2002 John Wiley & Sons, Ltd.     

Evaluation of call blocking probabilities in LEO satellite networks

In this paper, we present a new method for calculating call blocking probabilities (CBPs) in a low Earth orbit satellite network that carries voice calls. The calculation of the CBPs uses the Erlang‐B formula, but the traffic intensity has been modified to take into the time and location in which the calls are made. Copyright © 2009 John Wiley & Sons, Ltd.     

Engset multi‐rate state‐dependent loss models with QoS guarantee

We consider a single link loss system of quasi‐random input, described by the Engset multirate loss model (EnMLM). Blocked calls may once reattempt to be connected to the system requiring less bandwidth; then the system is described by the single retry model for finite sources (f‐SRM). The EnMLM and the f‐SRM are extended with the single threshold finite source model (f‐STM), where calls may attempt to be connected to the system with less bandwidth requirements, according to the link occupancy, before blocking occurs. We focus on CBP equalization in the EnMLM, f‐SRM and f‐STM, under the bandwidth reservation (BR) policy. For this analysis, we apply two approximate methods, the Roberts' method and the method of reverse transition rates (RTR), which lead to a recursive CBP calculation. We evaluate the accuracy of the above models under the BR policy by comparing the analytical with simulation CBP results, based on the relative approximation errors (RAE). The results are highly satisfactory because they show that the proposed models (formulas) lead to small RAE. Copyright © 2005 John Wiley & Sons, Ltd.