A fair resource allocation protocol for multimedia wireless networks
03 Sep 2001-Vol. 14, Iss: 1, pp 437-443
TL;DR: A fair resource allocation protocol for multimedia wireless networks that uses a combination of bandwidth reservation and bandwidth borrowing to provide network users with QoS in terms of guaranteed bandwidth, call blocking, and call dropping probabilities is presented.
Abstract: Wireless networks are expected to support real-time interactive multimedia traffic and must be able, therefore, to provide their users with quality-of-service (QoS) guarantees. Although the QoS provisioning problem arises in wireline networks as well, mobility of hosts and scarcity of bandwidth makes QoS provisioning a challenging task in wireless networks. It has been noticed that multimedia applications can tolerate and gracefully adapt to transient fluctuations in the QoS that they receive from the network. The additional flexibility afforded by the ability of multimedia applications to tolerate and adapt to transient changes in QoS can be exploited by protocol designers to significantly improve the overall performance of wireless systems. This paper presents a fair resource allocation protocol for multimedia wireless networks that uses a combination of bandwidth reservation and bandwidth borrowing to provide network users with QoS in terms of guaranteed bandwidth, call blocking, and call dropping probabilities. Our view of fairness was inspired by the well-known max-min fairness allocation protocol for wireline networks. Simulation results are presented that compare our protocol to similar schemes.
Citations
More filters
TL;DR: This paper addresses several MAC issues and QoS issues for delay-sensitive real-time traffic in the IEEE 802.11 single-hop ad hoc wireless networks, and proposes several schemes to guarantee QoS requirements.
Abstract: Nodes having a self-centrically broadcasting nature of communication form a wireless ad hoc network. Many issues are involved to provide quality of service (QoS) for ad hoc networks, including routing, medium access, resource reservation, mobility management, etc. Previous work mostly focuses on QoS routing with an assumption that the medium access control (MAC) layer can support QoS very well. However, contention-based MAC protocols are adopted in most ad hoc networks since there is no centralized control. QoS support in contention-based MAC layer is a very challenging issue. Carefully designed distributed medium access techniques must be used as foundations for most ad hoc networks. In this paper, we study and enhance distributed medium access techniques for real-time transmissions in the IEEE 802.11 single-hop ad hoc wireless networks. In the IEEE 802.11 MAC, error control adopts positive acknowledgement and retransmission to improve transmission reliability in the wireless medium (WM). However, for real-time multimedia traffic with sensitive delay requirements, retransmitted frames may be too late to be useful due to the fact that the delay of competing the WM is unpredictable. In this paper, we address several MAC issues and QoS issues for delay-sensitive real-time traffic. First, a priority scheme is proposed to differentiate the delay sensitive real-time traffic from the best-effort traffic. In the proposed priority scheme, retransmission is not used for the real-time traffic, and a smaller backoff window size is adopted. Second, we propose several schemes to guarantee QoS requirements. The first scheme is to guarantee frame-dropping probability for the real-time traffic. The second scheme is to guarantee throughput and delay. The last scheme is to guarantee throughput, delay, and frame-dropping probability simultaneously. Finally, we propose adaptive window backoff schemes to optimize throughput with and without QoS constraints.
47 citations
TL;DR: A method to maximize system utilization through joint optimization of call-/packet-level parameters is proposed andumerical results indicate that significant gain in system utilization is achieved.
Abstract: Resource allocation is a vital component of call-admission control that determines the amount of resource to assign to new and handoff connections for quality-of-service (QoS) satisfaction. In this paper, we present approximate analytical formulations of virtual partitioning resource-allocation schemes for handling multiclass services with guard channels in a cellular system. Resource-allocation models for best effort and guarantee access with preemption for best effort traffic and virtual partition with preemption for all classes are investigated. The analytical models, derived using a K-dimensional Markov chain, are solved using preemption rules for these schemes. Call-level grade of service, such as new-call-blocking probability, handoff-call-blocking probability, and system utilization, and packet-level QoS, such as packet-loss probability, are used as performance metrics. The performances of fast and slow mobile users are evaluated analytically and by simulation. The analytical and simulation results show excellent agreement. A method to maximize system utilization through joint optimization of call-/packet-level parameters is proposed. Numerical results indicate that significant gain in system utilization is achieved.
39 citations
TL;DR: This work presents a pricing mechanism for message exchanges between the WSTAs and the Central Spectrum Moderator and proves that the message exchanges reach the Nash equilibrium and that the resulting equilibrium messages generate allocations which are efficient, budget balanced, and satisfy voluntary participation.
Abstract: We consider the problem of multiuser resource allocation for wireless multimedia applications deployed by autonomous and noncollaborative wireless stations (WSTAs). Existing resource allocation solutions for WLANs are not network-aware and do not take into account the selfish behavior of individual WSTAs. Specifically, the selfish WSTAs can manipulate the network by untruthfully representing their private information (i.e., video characteristics, experienced channel conditions, and deployed streaming strategies). This often results in inefficient resource allocations. To overcome this obstacle, we present a pricing mechanism for message exchanges between the WSTAs and the Central Spectrum Moderator (CSM). The messages represent network-aware resource demands and corresponding prices. We prove that the message exchanges reach the Nash equilibrium and that the resulting equilibrium messages generate allocations which are efficient, budget balanced, and satisfy voluntary participation. The simulation results verify that these properties hold when the WSTAs behave strategically. Additionally, we evaluate the impact of initial prices and network congestion level on the convergence rate of message exchanges.
36 citations
Cites background from "A fair resource allocation protocol..."
...Recently, several fair resource allocation algorithms [ 35 ], [36] have been proposed for wireless multimedia applications....
[...]
...In [ 35 ], a max‐min fairness allocation is presented using a combination of the bandwidth reservation and bandwidth borrowing to provide the network users the required QoS....
[...]
TL;DR: In this work, a basic resource allocation problem is considered, where a fixed capacity must be shared among a set of users and a fundamental relation between the RA optimization problem and the notion of max–min fairness is established.
Abstract: In this work, a basic resource allocation (RA) problem is considered, where a fixed capacity must be shared among a set of users. The RA task can be formulated as an optimization problem, with a set of simple constraints and an objective function to be minimized. A fundamental relation between the RA optimization problem and the notion of max–min fairness is established. A sufficient condition on the objective function that ensures the optimal solution is max–min fairness is provided. Notably, some important objective functions like least squares and maximum entropy fall in this case. Finally, an application of max–min fairness for overload protection in 3G networks is considered.
28 citations
26 Mar 2007
TL;DR: This paper shows how to fairly allocate bandwidth in packet switches based on the max-min fairness principle, and considers the simpler unicast scenarios, and presents the maximum-min fair bandwidth allocation algorithm for unicast traffic.
Abstract: With the rapid development of broadband applications, the capability of networks to provide quality of service (QoS) has become an important issue. Fair scheduling algorithms are a common approach for switches and routers to support QoS. All fair scheduling algorithms are running based on a bandwidth allocation scheme. The scheme should be feasible in order to be applied in practice, and should be efficient to fully utilize available bandwidth and allocate bandwidth in a fair manner. However, since a single input port or output port of a switch has only the bandwidth information of its local flows (i.e., the flows traversing itself), it is difficult to obtain a globally feasible and efficient bandwidth allocation scheme. In this paper, we show how to fairly allocate bandwidth in packet switches based on the max-min fairness principle. We first formulate the problem, and give the definitions of feasibility and max-min fairness for bandwidth allocation in packet switches. As the first step to solve the problem, we consider the simpler unicast scenarios, and present the max-min fair bandwidth allocation algorithm for unicast traffic. We then extend the analysis to the more general multicast scenarios, and present the max-min fair bandwidth allocation algorithm for multicast traffic. We prove that both algorithms achieve max-min fairness, and analyze their complexity. The proposed algorithms are universally applicable to any type of switches and scheduling algorithms.
27 citations
Cites background from "A fair resource allocation protocol..."
...Max-min fairness has long been used as a popular fairness principle in resource allocation [22] [23] [24] [25]....
[...]
References
More filters
Book•
[...]
TL;DR: Undergraduate and graduate classes in computer networks and wireless communications; undergraduate classes in discrete mathematics, data structures, operating systems and programming languages.
Abstract: Undergraduate and graduate classes in computer networks and wireless communications; undergraduate classes in discrete mathematics, data structures, operating systems and programming languages. Also give lectures to both undergraduate-and graduate-level network classes and mentor undergraduate and graduate students for class projects.
6,991 citations
TL;DR: This paper proposes a distributed QoS routing scheme that selects a network path with sufficient resources to satisfy a certain delay (or bandwidth) requirement in a dynamic multihop mobile environment and can tolerate a high degree of information imprecision.
Abstract: In an ad hoc network, all communication is done over wireless media, typically by radio through the air, without the help of wired base stations. Since direct communication is allowed only between adjacent nodes, distant nodes communicate over multiple hops. The quality-of-service (QoS) routing in an ad hoc network is difficult because the network topology may change constantly, and the available state information for routing is inherently imprecise. In this paper, we propose a distributed QoS routing scheme that selects a network path with sufficient resources to satisfy a certain delay (or bandwidth) requirement in a dynamic multihop mobile environment. The proposed algorithms work with imprecise state information. Multiple paths are searched in parallel to find the most qualified one. Fault-tolerance techniques are brought in for the maintenance of the routing paths when the nodes move, join, or leave the network. Our algorithms consider not only the QoS requirement, but also the cost optimality of the routing path to improve the overall network performance. Extensive simulations show that high call admission ratio and low-cost paths are achieved with modest routing overhead. The algorithms can tolerate a high degree of information imprecision.
878 citations
"A fair resource allocation protocol..." refers background or methods in this paper
...This adaptation is typically achieved by the use of an adjustable-rate codec or by employing hierarchical encoding of voice and/or video streams [ 2 ,7,10,11]....
[...]
...It has been noticed that multimedia applications can tolerate and gracefully adapt to transient fluctuations in the QoS they receive from the network [ 2 ,7,9]....
[...]
TL;DR: The role of pricing policies in multiple service class networks is studied and it is found that it is possible to set the prices so that users of every application type are more satisfied with the combined cost and performance of a network with service-class-sensitive prices.
Abstract: The role of pricing policies in multiple service class networks is studied. An abstract formulation of service disciplines and pricing policies that allows the interplay between service disciplines and pricing policies in determining overall network performance to be described more clearly is presented. Effective multiclass service disciplines allow networks to focus resources on performance-sensitive applications, while effective pricing policies allows the benefits of multiple service classes to be spread around to all users. Furthermore, the incentives formed by service disciplines and pricing policies must be carefully tuned so that user self-interest leads to optimal overall network performance. These concepts are illustrated through simulation of several simple example networks. It is found that it is possible to set the prices so that users of every application type are more satisfied with the combined cost and performance of a network with service-class-sensitive prices. >
518 citations
"A fair resource allocation protocol..." refers background in this paper
...The idea is that users will pay for different levels of service; therefore, QoS provisioning algorithms must take pricing into account [ 11 ]....
[...]
TL;DR: It is shown that the distributed call admission control scheme limits the handoff dropping or the cell overload probability to a predefined level almost independent of load conditions, an important requirement of future wireless/mobile networks with quality-of-service (QoS) provisioning.
Abstract: The major focus of this paper is distributed call admission control in mobile/wireless networks, the purpose of which is to limit the call handoff dropping probability in loss systems or the cell overload probability in lossless systems. Handoff dropping or cell overload are consequences of congestion in wireless networks. Our call admission control algorithm takes into consideration the number of calls in adjacent cells, in addition to the number of calls in the cell where a new call request is made, in order to make a call admission decision. This is done by every base station in a distributed manner without the involvement of the network call processor. The admission condition is simple enough that the admission decision can be made in real time. Furthermore, we show that our distributed call admission control scheme limits the handoff dropping or the cell overload probability to a predefined level almost independent of load conditions. This is an important requirement of future wireless/mobile networks with quality-of-service (QoS) provisioning.
488 citations
"A fair resource allocation protocol..." refers background in this paper
...It is well known and obvious that, from the enduser’s perspective, it is far less acceptable to have a call dropped than blocked [3], [13], [ 19 ]....
[...]
...In addition, with the active participation of the mobile hosts and the MSC, the base stations are instrumental in initiating and finalizing handoffs [9], [10], [ 19 ]....
[...]
...The geographic area of interest is assumed to be tiled by a collection of regular hexagons referred to as cells [6], [9], [12], [10], [ 19 ]....
[...]
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
"A fair resource allocation protocol..." refers background or methods or result in this paper
...The described treatment of Class I1 handoffs was adopted from [ 8 ]....
[...]
...We chose the schemes presented in Oliviera et al. as the initial benchmark because they are arguably better than other comparable bandwidth allocation and admission control schemes found in the literature [ 8 ]....
[...]
...In [4], El-Kadi et al. use the same traffic model as in [ 8 ], and show that a fixed bandwidth reservation in each cell gives equal or better performance than the statistical reservation techniques in [SI, without the overhead of requesting and canceling reservations for each connection....
[...]
...The schemes presented in [ 8 ] have the interesting feature that when a connection request is made, the network tries to reserve some bandwidth for the connection in the cells surrounding the cell in which the request is made....
[...]
...In order to evaluate our new scheme, we used the same simulation model described in [4], which was derived from the model used in [ 8 ]....
[...]