Scheduling over a time-varying user-dependent channel with applications to high-speed wireless data

Author:

Andrews Matthew1,Zhang Lisa1

Affiliation:

1. Bell Laboratories, Murrray Hill, New Jersey

Abstract

In a wireless network, a basestation transmits data to mobiles at time-varying, mobile-dependent rates due to the ever changing nature of the communication channels. In this article, we consider a wireless system in which the channel conditions and data arrival processes are governed by an adversary . We first consider a single server and a set of users. At each time step t , the server can only transmit data to one user. If user i is chosen, the transmission rate is r i ( t ). We say that the system is ( w , ε)- admissible if in any window of w time steps the adversary can schedule the users so that the total data arriving to each user is at most 1−ε times the total service it receives.Our objective is to design online scheduling algorithms to ensure stability in an admissible system. We first show, somewhat surprisingly, that the admissibility condition alone does not guarantee the existence of a stable online algorithm, even in a subcritical system (i.e., ε > 0). For example, if the nonzero rates in an infinite rate set can be arbitrarily small, then a subcritical system can be unstable for any deterministic online algorithm.On a positive note, we present a tracking algorithm that attempts to mimic the behavior of the adversary. This algorithm ensures stability for all ( w , ε)-admissible systems that are not excluded by our instability results. As a special case, if the rate set is finite, then the tracking algorithm is stable even for a critical system (i.e., ε = 0). Moreover, the queue sizes are independent of ε. For subcritical systems, we also show that a simpler max weight algorithm is stable as long as the user rates are bounded away from zero.The offline version of our problem resembles the problem of scheduling unrelated machines and can be modeled by an integer program. We present a rounding algorithm for its linear relaxation and prove that the rounding technique cannot be substantially improved.

Publisher

Association for Computing Machinery (ACM)

Subject

Artificial Intelligence,Hardware and Architecture,Information Systems,Control and Systems Engineering,Software

Reference21 articles.

1. Instability of the Proportional Fair Scheduling Algorithm for HDR

2. Universal-stability results and performance bounds for greedy contention-resolution protocols

3. Andrews M. Kumaran K. Ramanan K. Stolyar A. Vijayakumar R. and Whiting P. 2000. CDMA data QoS scheduling on the forward link with variable channel conditions. Bell Labs Tech. Memo. (Apr.). Andrews M. Kumaran K. Ramanan K. Stolyar A. Vijayakumar R. and Whiting P. 2000. CDMA data QoS scheduling on the forward link with variable channel conditions. Bell Labs Tech. Memo. (Apr.).

4. Providing quality of service over a shared wireless link

Cited by 21 articles. 订阅此论文施引文献 订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献

1. Tracking Drift-Plus-Penalty: Utility Maximization for Partially Observable and Controllable Networks;IEEE/ACM Transactions on Networking;2023

2. Universal Policy Tracking: Scheduling for Wireless Networks with Delayed State Observation;2022 58th Annual Allerton Conference on Communication, Control, and Computing (Allerton);2022-09-27

3. Stable routing scheduling algorithms in multi-hop wireless networks;Theoretical Computer Science;2022-06

4. Optimal control for networks with unobservable malicious nodes;Performance Evaluation;2021-11

5. Universal stability in multi-hop radio networks;Journal of Computer and System Sciences;2020-12

同舟云学术

1.学者识别学者识别

2.学术分析学术分析

3.人才评估人才评估

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

www.globalauthorid.com

TOP

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