Show simple item record

dc.contributor.authorAyesta, U.
dc.contributor.authorErausquin, M.
dc.contributor.authorJacko, P.
dc.date.accessioned2017-02-21T08:11:14Z
dc.date.available2017-02-21T08:11:14Z
dc.date.issued2010-12-31
dc.identifier.issn0166-5316
dc.identifier.urihttp://hdl.handle.net/20.500.11824/385
dc.description.abstractWe introduce a comprehensive modeling framework for the problem of scheduling a finite number of finite-length jobs where the available service rate is time-varying. The main motivation comes from wireless data networks where the service rate of each user varies randomly due to fading. We employ recent advances on the restless bandit problem that allow us to obtain an opportunistic scheduling rule for the system without arrivals. When the objective is to minimize the mean number of users in the system or to minimize the mean waiting time, we obtain a priority-based policy which we call the "Potential Improvement" (PI) rule, since the priority index equals the ratio between the current available service rate and the expected potential improvement of the service rate. We also show that for certain objective functions, the index rule takes the form of known opportunistic scheduling rules like "Relatively Best" (RB) or "Proportionally Best" (PB). Thus our model provides a formal justification for the deployment of opportunistic scheduling rules in order to improve the flow-level performance in the presence of time-varying capacities. We further analyze the performance of the PI rule in the presence of randomly arriving users. When the service rates are constant, PI is equivalent to the cμ-rule, which is known to be optimal with any distribution of arrivals. Using a recent characterization for the stability region of flow-level scheduling rules under random arrivals, we show that PI achieves the maximum stability region. We perform numerical experiments in a wide range of scenarios and compare the performance of PI with other popular disciplines like RB, PB, Score-Based (SB) and the cμ-rule. Our results show that RB, PB, SB or the cμ-rule might outperform the others depending on the scenario, but regardless of this, the performance of PI is always superior or equivalent to the best of these opportunistic rules.
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.subjectcμ-rule
dc.subjectIndex policy
dc.subjectMarkov Decision Process
dc.subjectMulti-armed restless bandit problem
dc.subjectOpportunistic scheduling
dc.subjectOptimal scheduling
dc.subjectStochastic dynamic programming
dc.titleA modeling framework for optimizing the flow-level scheduling with time-varying channels
dc.typeinfo:eu-repo/semantics/conferenceObjecten_US
dc.identifier.doi10.1016/j.peva.2010.08.015
dc.relation.publisherversionhttps://www.scopus.com/inward/record.uri?eid=2-s2.0-77957698889&doi=10.1016%2fj.peva.2010.08.015&partnerID=40&md5=50245c038fc04888db9124ab8c40562a
dc.rights.accessRightsinfo:eu-repo/semantics/openAccessen_US
dc.type.hasVersioninfo:eu-repo/semantics/publishedVersionen_US
dc.journal.titlePerformance Evaluationen_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