Flow-level performance and user mobility in wireless data networks

Author:

Borst Sem12

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.

Publisher

The Royal Society

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篇论文的施引文献,订阅后可以查看论文全部施引文献

1. Emulating Round-Robin in Wireless Networks;Proceedings of the 18th ACM International Symposium on Mobile Ad Hoc Networking and Computing;2017-07-10

2. Estimating Performance of Mobile Services from Comparative Output-Input Analysis of End-to-End Throughput;IEEE Transactions on Mobile Computing;2013-09

3. Stability of flow-level scheduling with Markovian time-varying channels;Performance Evaluation;2013-02

4. Optimal size-based opportunistic scheduler for wireless systems;Queueing Systems;2012-03-14

5. Stability with file arrivals and departures in multichannel cellular wireless networks;Queueing Systems;2011-10-19

同舟云学术

1.学者识别学者识别

2.学术分析学术分析

3.人才评估人才评估

"同舟云学术"是以全球学者为主线,采集、加工和组织学术论文而形成的新型学术文献查询和分析系统,可以对全球学者进行文献检索和人才价值评估。用户可以通过关注某些学科领域的顶尖人物而持续追踪该领域的学科进展和研究前沿。经过近期的数据扩容,当前同舟云学术共收录了国内外主流学术期刊6万余种,收集的期刊论文及会议论文总量共计约1.5亿篇,并以每天添加12000余篇中外论文的速度递增。我们也可以为用户提供个性化、定制化的学者数据。欢迎来电咨询!咨询电话:010-8811{复制后删除}0370

www.globalauthorid.com

TOP

Copyright © 2019-2024 北京同舟云网络信息技术有限公司
京公网安备11010802033243号  京ICP备18003416号-3