Affiliation:
1. Bell Labs, Alcatel-LucentPO Box 636, Murray Hill, NJ 07974, USA
2. Department of Mathematics and Computer Science, Eindhoven University of TechnologyPO Box 513, 5600 MB Eindhoven, The Netherlands
Abstract
Channel conditions in wireless networks exhibit huge variations across space and time, giving rise to vast fluctuations in the transmission rates. Channel-aware scheduling strategies provide an effective mechanism for improving throughput performance by exploiting such rate variations, and these have been extensively examined at the packet level for a static user configuration. In this paper, we discuss the performance implications at the flow level for a dynamic user population, taking into account variations on a slower time scale and wide-range user mobility as well. First of all, we present simple necessary conditions for flow-level stability and prove that these are in fact (near) sufficient for a wide family of utility-based scheduling strategies. It is further shown how the flow-level performance of the proportional fair scheduling strategy may be evaluated by means of a processor-sharing model with a state-dependent service rate. In addition, we examine the impact of variations on a slower time scale, and establish that the so-called fluid and quasi-stationary regimes yield explicit, insensitive performance bounds. Finally, we turn our attention to a network of several base stations (BSs) with handoffs of active sessions governed by wide-range user mobility. It is demonstrated that mobility increases the capacity, not only in the case of globally optimal scheduling but also when each of the BSs adheres to a local fair-sharing discipline.
Subject
General Physics and Astronomy,General Engineering,General Mathematics
Reference39 articles.
1. Agrawal R. & Subramanian V. 2002 Optimality of certain channel-aware scheduling policies. In Proc. 40th Annual Allerton Conf. Commun. Control Comp . Monticello IL 2–4 October 2002 pp. 1532–1541.
2. Instability of the Proportional Fair Scheduling Algorithm for HDR
3. SCHEDULING IN A QUEUING SYSTEM WITH ASYNCHRONOUSLY VARYING SERVICE
RATES
4. Andrews D. M. Qian L. & Stolyar A. L. 2005 Optimal utility-based throughput allocation subject to throughput constraints. In Proc. Infocom 2005 Miami FL 15–17 March 2005 . Piscataway NJ: IEEE Press.
5. Bonald T. 2004 A score-based opportunistic scheduler for fading radio channels. In Proc. European Wireless Conference 2004 Barcelona Spain 24–27 February 2004 . Berlin Germany: VDE Verlag.
Cited by
7 articles.
订阅此论文施引文献
订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献