An adaptive bandwidth reservation algorithm for QoS sensitive multimedia cellular networks
10 Dec 2002-Vol. 3, Iss: 3, pp 1475-1479
TL;DR: An adaptive algorithm that is able to resolve conflicting performance criteria - bandwidth utilization, call dropping and call blocking probabilities and tries to strike the appropriate performance balance between contradictory requirements for QoS sensitive multimedia services is proposed.
Abstract: Bandwidth is an extremely valuable and scarce resource in a wireless network. Therefore, efficient bandwidth management is necessary in order to provide high quality service to users with different requirements in a multimedia wireless/mobile network. In this paper, we propose an on-line bandwidth reservation algorithm that adjusts bandwidth reservations adaptively based on existing network conditions. The most important contribution of our work is an adaptive algorithm that is able to resolve conflicting performance criteria - bandwidth utilization, call dropping and call blocking probabilities. Our algorithm is quite flexible, is responsive to current traffic conditions in cellular networks, and tries to strike the appropriate performance balance between contradictory requirements for QoS sensitive multimedia services.
Citations
More filters
20 Mar 2003
TL;DR: An on-line load balancing algorithm with preemption that is able to balance the traffic load among cells accommodating heterogeneous multimedia services while ensuring efficient bandwidth utilization is proposed.
Abstract: Efficient bandwidth management is necessary in order to provide high quality service to users in a multimedia wireless/mobile network. In this paper, we propose an on-line load balancing algorithm with preemption. This technique is able to balance the traffic load among cells accommodating heterogeneous multimedia services while ensuring efficient bandwidth utilization. The most important features of our algorithm are its adaptability, flexibility and responsiveness to current network conditions. In addition, our online scheme to control bandwidth adaptively is a cell-oriented approach. This approach has low complexity making it practical for real cellular networks. Simulation results indicate the superior performance of our algorithm.
47 citations
Cites methods or result from "An adaptive bandwidth reservation a..."
...In [7], we introduced an online bandwidth reservation concept for intra-cell bandwidth management in which the amount of the reserved bandwidth is dynamically adjusted based on the current network conditions....
[...]
...In our previous work [7], we developed an online bandwidth reservation scheme for handoff traffic only....
[...]
...In this paper, we reserve bandwidth for new call traffic (group II) also in the same manner as in [7]....
[...]
TL;DR: This paper presents a novel dynamic-grouping bandwidth reservation scheme based on the probabilistic resource estimation to provide QoS guarantees for multimedia traffic in wireless cellular networks and uses it to reduce the connection blocking rate and connection dropping rate, while increasing the bandwidth utilization.
Abstract: In wireless networks carrying multimedia traffic (voice, video, data, and image), it becomes necessary to provide a quality-of-service(QoS) guarantee for multimedia traffic connections supported by the network. In order to provide mobile hosts with high QoS in the next-generation wireless networks, efficient and better bandwidth reservation schemes must be designed. This paper presents a novel dynamic-grouping bandwidth reservation scheme as a solution to support QoS guarantees in the next-generation wireless networks. The proposed scheme is based on the probabilistic resource estimation to provide QoS guarantees for multimedia traffic in wireless cellular networks. We establish several reservation time sections, called groups, according to the mobility information of mobile hosts of each base station. The amount of reserved bandwidth for each base station is dynamically adjusted for each reservation group. We use the dynamic-grouping bandwidth reservation scheme to reduce the connection blocking rate and connection dropping rate, while increasing the bandwidth utilization. The simulation results show that the dynamic-grouping bandwidth reservation scheme provides less connection-blocking rate and less connection-dropping rate and achieves high bandwidth utilization.
35 citations
TL;DR: This paper focuses on the pinwheel task model to develop a variable voltage processor with d discrete voltage/speed levels and modified the definitions of both intra- and inter-task DVFS and design their DVFS scheduling to reduce the power consumption of DVFS processors.
11 citations
Cites background or methods from "An adaptive bandwidth reservation a..."
...One of the most widely-used techniques to improve PDV is pinwheel scheduling [1, 5, 29, 30, 31, 32, 33]....
[...]
...Notably, the time complexity of the algorithm in [30] is O(dn log n) where n denotes the number of jobs....
[...]
...Therefore, our scheme outperforms their algorithms, even if we ignore the overhead incurred by producing the whole schedule in the method presented in [30]....
[...]
08 Jun 2005
TL;DR: This paper presents a fuzzy call admission control scheme to meet the requirement of the QoS, which searches automatically the optimal number of the guard channels in a base station to make an effective use of resource and guarantee theQoS provision.
Abstract: Scarcity of the spectrum resource and mobility of users make quality-of-service (QoS) provision a critical issue in wireless networks. This paper presents a fuzzy call admission control scheme to meet the requirement of the QoS. It searches automatically the optimal number of the guard channels in a base station to make an effective use of resource and guarantee the QoS provision. Simulation compares the proposed fuzzy scheme with an adaptive channel reservation scheme. Simulation results show that fuzzy scheme has a better robust performance in terms of call dropping probability, call blocking probability, and channel utilization.
10 citations
Cites background from "An adaptive bandwidth reservation a..."
...In the present, there are many schemes about call admission control aiming at keeping the CDP and CBP low while maximizing the resource utilization to meet the system demand at the same time [1-6]....
[...]
TL;DR: A novel static reservation scheme for VBR multimedia traffic that takes into account the end-user Quality of Experience (QoE) and applies a two-step process that uses a simple video model and a Markov queue model for the reservation.
9 citations
Cites methods from "An adaptive bandwidth reservation a..."
...For cellular networks in [19] an on-line method is proposed that adjusts resources adaptively based on existing network conditions....
[...]
References
More filters
Book•
01 Jan 1998TL;DR: This book discusses competitive analysis and decision making under uncertainty in the context of the k-server problem, which involves randomized algorithms in order to solve the problem of paging.
Abstract: Preface 1. Introduction to competitive analysis: the list accessing problem 2. Introduction to randomized algorithms: the list accessing problem 3. Paging: deterministic algorithms 4. Paging: randomized algorithms 5. Alternative models for paging: beyond pure competitive analysis 6. Game theoretic foundations 7. Request - answer games 8. Competitive analysis and zero-sum games 9. Metrical task systems 10. The k-server problem 11. Randomized k-server algorithms 12. Load-balancing 13. Call admission and circuit-routing 14. Search, trading and portfolio selection 15. Competitive analysis and decision making under uncertainty Appendices Bibliography Index.
2,615 citations
Additional excerpts
...Therefore, online algorithms are natural candidates for the design of efficient bandwidth control schemes in QoS sensitive multimedia cellular networks [ 6 ]....
[...]
TL;DR: It is shown that the proposed scheme provides small handoff dropping probability (i.e., the probability that handoff connections are dropped due to a lack of bandwidth) and achieves high bandwidth utilization.
Abstract: In the next generation high-speed wireless networks, it is important to provide quality-of-service (QoS) guarantees as they are expected to support multimedia applications. This paper proposes an admission control scheme based on adaptive bandwidth reservation to provide QoS guarantees for multimedia traffic carried in high-speed wireless cellular networks. The proposed scheme allocates bandwidth to a connection in the cell where the connection request originates and reserves bandwidth in all neighboring cells. When a user moves to a new cell and a handoff occurs, bandwidth is allocated in the new cell, bandwidth is reserved in the new cell's neighboring cells, and reserved bandwidth in more distant cells is released. The amount of bandwidth to reserve is dynamically adjusted, reflecting the current network conditions. The performance of the proposed scheme is evaluated through simulations of realistic cellular environments. The simulated network consists of a large number of cells, mobile users with various movement patterns are assumed, and a variety of multimedia applications (e.g., audio phone, video conference, video on demand, file transfer, etc.) is considered. It is shown that the proposed scheme provides small handoff dropping probability (i.e., the probability that handoff connections are dropped due to a lack of bandwidth) and achieves high bandwidth utilization.
455 citations
"An adaptive bandwidth reservation a..." refers background or methods in this paper
...Figures 1-3 show the performance comparison of our scheme with the ABR scheme [2] in terms of CBP, CDP and bandwidth utilization....
[...]
...Different multimedia services can be categorized into two classes: class I (real time) and class II (non-real time) according to the required QoS [1,2,3]....
[...]
...In Section III, simulation results on the performance of the proposed scheme are presented along with a comparison with the scheme proposed in [2]....
[...]
...In this scheme [2], a real-time call user is not only allocated the requested bandwidth in its current cell, but the same amount of bandwidth is reserved in all of its neighboring cells....
[...]
...Earlier work reported in [2] has also considered bandwidth reservation....
[...]
01 Oct 1998
TL;DR: This work design and evaluate predictive and adaptive schemes for the bandwidth reservation for the existing connections' handoffs and the admission control of new connections, and develops an algorithm that controls this window for efficient use of bandwidth and effective response to time-varying traffic/mobility and inaccuracy of mobility estimation.
Abstract: How to control hand-off drops is a very important Quality-of-Service (QoS) issue in cellular networks. In order to keep the hand-off dropping probability below a pre-specified target value (thus providing a probabilistic QoS guarantee), we design and evaluate predictive and adaptive schemes for the bandwidth reservation for the existing connections' handoffs and the admission control of new connections.We first develop a method to estimate user mobility based on an aggregate history of hand-offs observed in each cell. This method is then used to predict (probabilistically) mobiles' directions and hand-off times in a cell. For each cell, the bandwidth to be reserved for hand-offs is calculated by estimating the total sum of fractional bandwidths of the expected hand-offs within a mobility-estimation time window. We also develop an algorithm that controls this window for efficient use of bandwidth and effective response to (1) time-varying traffic/mobility and (2) inaccuracy of mobility estimation. Three different admission-control schemes for new connection requests using this bandwidth reservation are proposed. Finally, we evaluate the performance of the proposed schemes to show that they meet our design goal and outperform the static reservation scheme under various scenarios.
257 citations
"An adaptive bandwidth reservation a..." refers background in this paper
...Each base station (BS) makes an adaptive decision for call admission and bandwidth reservation by exchanging state information with the adjacent cells periodically [1,4,5]....
[...]
...Different multimedia services can be categorized into two classes: class I (real time) and class II (non-real time) according to the required QoS [1,2,3]....
[...]
TL;DR: Some typical multimedia applications and services that might be expected to use future wireless and combined wireless/wired networks, including multimedia teleconferencing, the electronic newspaper, and nomadic computing are discussed.
Abstract: Discusses some typical multimedia applications and services that might be expected to use future wireless and combined wireless/wired networks. These include, among others, multimedia teleconferencing, the electronic newspaper, and nomadic computing. The author then describes control questions to be addressed in the mixed wireless/wired environment and control problems arising in the wireless network environment itself. Included are questions such as admission control, dynamic bandwidth control, flow control, handoff control, and resource allocation, among others. >
131 citations
"An adaptive bandwidth reservation a..." refers background in this paper
...These schemes distinguish between new calls and hand-off calls, and give higher priority to hand-off calls in order to guarantee call’s continuity [4,5]....
[...]
...Each base station (BS) makes an adaptive decision for call admission and bandwidth reservation by exchanging state information with the adjacent cells periodically [1,4,5]....
[...]
TL;DR: A framework for quality‐of‐service (QoS) provisioning for multimedia services in next generation wireless access networks aims at providing a differentiated treatment to multimedia traffic flows at the link layer, which can be broadly classified as real‐time and non‐real‐time (or delay‐tolerant).
Abstract: We propose a framework for qualitydofdservice lQoSr provisioning for multimedia services in next generation wireless access networks. This framework aims at providing a differentiated treatment to multimedia traffic flows at the link layer, which can be broadly classified as realdtime lor delaydsensitiver and nondrealdtime lor delaydtolerantr. Various novel schemes are proposed to support the differential treatment and guarantee QoS. These schemes include bandwidth compaction, channel reservation and degradation, with the help of which a call admission and control algorithm is developed. The performance of the proposed framework is captured through analytical modeling and simulation experiments. Analytically, the average carried traffic and the worst case buffer requirements for realdtime and nondrealdtime calls are estimated. Simulation results show up to 21% improvement in the admission probability of realdtime calls and up to 17% improvement in the admission probability of nondrealdtime calls, when various call control techniques like bandwidth compaction are employed. Using our channel reservation technique, we observe a 12% improvement in the call admission probability compared to another scheme proposed in the literature.
106 citations