Wireless scheduling with partial channel state information: large deviations and optimality

Gopalan, Aditya and Caramanis, Constantine and Shakkottai, Sanjay (2015) Wireless scheduling with partial channel state information: large deviations and optimality. In: QUEUEING SYSTEMS, 80 (4). pp. 293-340.

PDF Que_Sys_80-4_293_2015.pdf - Published Version Restricted to Registered users only Download (787kB) | Request a copy

Abstract

We consider a server serving a time-slotted queued system of multiple packet-based flows, where not more than one flow can be serviced in a single time slot. The flows have exogenous packet arrivals and time-varying service rates. At each time, the server can observe instantaneous service rates for only a subset of flows ( selected from a fixed collection of observable subsets) before scheduling a flow in the subset for service. We are interested in queue length aware scheduling to keep the queues short. The limited availability of instantaneous service rate information requires the scheduler to make a careful choice of which subset of service rates to sample. We develop scheduling algorithms that use only partial service rate information from subsets of channels, and that minimize the likelihood of queue overflow in the system. Specifically, we present a new joint subset-sampling and scheduling algorithm called Max-Exp that uses only the current queue lengths to pick a subset of flows, and subsequently schedules a flow using the Exponential rule. When the collection of observable subsets is disjoint, we show that Max-Exp achieves the best exponential decay rate, among all scheduling algorithms that base their decision on the current ( or any finite past history of) system state, of the tail of the longest queue. To accomplish this, we employ novel analytical techniques for studying the performance of scheduling algorithms using partial state, which may be of independent interest. These include new sample-path large deviations results for processes obtained by non-random, predictable sampling of sequences of independent and identically distributed random variables. A consequence of these results is that scheduling with partial state information yields a rate function significantly different from scheduling with full channel information. In the special case when the observable subsets are singleton flows, i.e., when there is effectively no a priori channel state information, Max-Exp reduces to simply serving the flow with the longest queue; thus, our results show that to always serve the longest queue in the absence of any channel state information is large deviations optimal.

Item Type:	Journal Article
Publication:	QUEUEING SYSTEMS
Publisher:	SPRINGER
Additional Information:	Copy right for this article belongs to the SPRINGER, VAN GODEWIJCKSTRAAT 30, 3311 GZ DORDRECHT, NETHERLANDS
Keywords:	Wireless scheduling; Large deviations; Partial channel state information; Sample path large deviations
Department/Centre:	Division of Electrical Sciences > Electrical Communication Engineering
Date Deposited:	11 Aug 2015 06:43
Last Modified:	11 Aug 2015 06:43
URI:	http://eprints.iisc.ac.in/id/eprint/52058

Actions (login required)

View Item