Conference Paper

A Theory of QoS for Wireless

Dept. of Comput. Sci., Univ. of Illinois Urbana, Urbana, IL
DOI: 10.1109/INFCOM.2009.5061954 Conference: INFOCOM 2009, IEEE
Source: IEEE Xplore

ABSTRACT Wireless networks are increasingly used to carry applications with QoS constraints. Two problems arise when dealing with traffic with QoS constraints. One is admission control, which consists of determining whether it is possible to fulfill the demands of a set of clients. The other is finding an optimal scheduling policy to meet the demands of all clients. In this paper, we propose a framework for jointly addressing three QoS criteria: delay, delivery ratio, and channel reliability. We analytically prove the necessary and sufficient condition for a set of clients to be feasible with respect to the above three criteria. We then establish an efficient algorithm for admission control to decide whether a set of clients is feasible. We further propose two scheduling policies and prove that they are feasibility optimal in the sense that they can meet the demands of every feasible set of clients. In addition, we show that these policies are easily implementable on the IEEE 802.11 mechanisms. We also present the results of simulation studies that appear to confirm the theoretical studies and suggest that the proposed policies outperform others tested under a variety of settings.

  • [Show abstract] [Hide abstract]
    ABSTRACT: We address the problem of simultaneously ensuring long-term fairness and deterministic delay guarantees for real-time traffic over a single-hop network. Specifically, we propose a network control policy that maximises a concave utility function of the average throughput of each flow, while guaranteeing that each packet is delivered within a deterministic deadline. Although this problem has been addressed in the past, prior work makes restrictive assumptions, by allowing only binary packet arrival and service processes at each link. The present paper allows for any bounded burst size distributions for the arrival and service processes.
    2014 Sixth International Conference on Communication Systems and Networks (COMSNETS); 01/2014
  • Source
    [Show abstract] [Hide abstract]
    ABSTRACT: The model is a "generalized switch", serving multiple traffic flows in discrete time. The switch uses MaxWeight algorithm to make a service decision (scheduling choice) at each time step, which determines the probability distribution of the amount of service that will be provided. We are primarily motivated by the following question: in the heavy traffic regime, when the switch load approaches critical level, will the service processes provided to each flow remain "smooth" (i.e., without large gaps in service)? Addressing this question reduces to the analysis of the asymptotic behavior of the unscaled queue-differential process in heavy traffic. We prove that the stationary regime of this process converges to that of a positive recurrent Markov chain, whose structure we explicitly describe. This in turn implies asymptotic "smoothness" of the service processes.
  • [Show abstract] [Hide abstract]
    ABSTRACT: We consider the problem of transmitting multicast flows with hard deadlines over unreliable wireless channels. Every user in the network subscribes to several multicast flows, and requires a minimum throughput for each subscribed flow to meet the QoS constraints. The network controller schedules the transmissions of multicast traffic based on the instant feedback from the users. We characterize the multicast throughput region by analyzing its boundary points, each of which is the solution to a finite-horizon dynamic programming problem over an exponentially large state space. Using backward induction and interchange arguments, we show that the dynamic programming problems are solved by greedy policies that maximize the immediate weighted sum throughput in every slot. Furthermore, we develop a dynamic throughput-optimal policy that achieves any feasible throughput vector by tracking the running performance received by the users.
    IEEE INFOCOM 2014 - IEEE Conference on Computer Communications; 04/2014


Available from