Show simple item record

dc.contributor.authorJacko, P.
dc.contributor.authorVillar, S.S.
dc.date.accessioned2017-02-21T08:11:15Z
dc.date.available2017-02-21T08:11:15Z
dc.date.issued2012-12-31
dc.identifier.isbn978-0-98-362834-7
dc.identifier.urihttp://hdl.handle.net/20.500.11824/398
dc.description.abstractIn this paper we study three opportunistic schedulers for the problem of optimal multi-class flow-level scheduling in wireless downlink and uplink systems. For user channels we employ the Gilbert-Elliot model of good and bad channel condition with flow-level interpretation, and assume an automatic repeat query (ARQ) feedback, so that channel state information is available at the end of the slot only if the user was scheduled. The problem is essentially a Partially-Observable Markov Decision Process with a sample-path resource constraint. Given its complexity, we study two naïve schedulers: the myopic rule and the belief-state rule. Further, realizing that the problem fits the multi-armed restless bandit framework, we consider the relaxation of the problem which instead of serving a given number of flows on sample-path allows for serving that number of flows only in expectation, and derive an optimal Whittle index policy in closed form. We further discuss the interpretation of the resulting novel Whittle-index-based heuristic scheduler and evaluate its performance against the two naïve schedulers in simulations under the time-average criterion. According to the Whittle-index-based scheduler, the users whose last channel feedback gave good condition and those not served yet receive an absolute priority over those whose last channel feedback gave bad condition, which extends to this setting the property of channel-aware schedulers that are known to be maximally stable. In addition, we obtain tie-breaking index values for setting priorities among users in each of the two groups. In case of a single user class, the scheduler becomes independent of the problem parameters and equivalent to both the myopic and belief-state scheduler, and has a simple universal structure which can be represented by three first-in-first-out priority lists.
dc.formatapplication/pdf
dc.language.isoengen_US
dc.rightsReconocimiento-NoComercial-CompartirIgual 3.0 Españaen_US
dc.rights.urihttp://creativecommons.org/licenses/by-nc-sa/3.0/es/en_US
dc.subjectARQ feedback
dc.subjectflow-level scheduling
dc.subjectmyopic policy
dc.subjectopportunistic scheduling
dc.subjectPartially-Observable Markov Decision Process
dc.subjectrestless bandits
dc.subjectWhittle index
dc.titleOpportunistic schedulers for optimal scheduling of flows in wireless systems with ARQ feedback
dc.typeinfo:eu-repo/semantics/conferenceObjecten_US
dc.relation.publisherversionhttps://www.scopus.com/inward/record.uri?eid=2-s2.0-84869440006&partnerID=40&md5=e3da1de0fde8e51c86997ccea3e3022f
dc.rights.accessRightsinfo:eu-repo/semantics/openAccessen_US
dc.type.hasVersioninfo:eu-repo/semantics/publishedVersionen_US
dc.journal.titleFinal Program - 2012 24th International Teletraffic Congress, ITC 24en_US


Files in this item

Thumbnail

This item appears in the following Collection(s)

Show simple item record

Reconocimiento-NoComercial-CompartirIgual 3.0 España
Except where otherwise noted, this item's license is described as Reconocimiento-NoComercial-CompartirIgual 3.0 España