Show simple item record

dc.contributor.authorCelik, G.
dc.contributor.authorBorst, S. C.
dc.contributor.authorWhiting, P. A.
dc.contributor.authorModiano, Eytan H.
dc.date.accessioned2016-07-01T21:52:21Z
dc.date.available2017-03-01T16:14:48Z
dc.date.issued2016-01
dc.date.submitted2014-11
dc.identifier.issn0257-0130
dc.identifier.issn1572-9443
dc.identifier.urihttp://hdl.handle.net/1721.1/103519
dc.description.abstractWe consider scheduling in networks with interference constraints and reconfiguration delays, which may be incurred when one service schedule is dropped and a distinct service schedule is adopted. Reconfiguration delays occur in a variety of communication settings, such as satellite, optical, or delay-tolerant networks. In the absence of reconfiguration delays it is well known that the celebrated Max-Weight scheduling algorithm guarantees throughput optimality without requiring any knowledge of arrival rates. As we will show, however, the Max-Weight algorithm may fail to achieve throughput optimality in case of nonzero reconfiguration delays. Motivated by the latter issue, we propose a class of adaptive scheduling algorithms which persist with the current schedule until a certain stopping criterion is reached, before switching to the next schedule. While earlier proposed Variable Frame-Based Max-Weight (VFMW) policies belong to this class, we also present Switching-Curve-Based (SCB) policies that are more adaptive to bursts in arrivals. We develop novel Lyapunov drift techniques to prove that this class of algorithms under certain conditions achieves throughput optimality by dynamically adapting the durations of the interswitching intervals. Numerical results demonstrate that these algorithms significantly outperform the ordinary Max-Weight algorithm, and that SCB policies yield a better delay performance than VFMW policies.en_US
dc.publisherSpringer USen_US
dc.relation.isversionofhttp://dx.doi.org/10.1007/s11134-016-9471-4en_US
dc.rightsCreative Commons Attribution-Noncommercial-Share Alikeen_US
dc.rights.urihttp://creativecommons.org/licenses/by-nc-sa/4.0/en_US
dc.sourceSpringer USen_US
dc.titleDynamic scheduling with reconfiguration delaysen_US
dc.typeArticleen_US
dc.identifier.citationCelik, G., S. C. Borst, P. A. Whiting, and E. Modiano. “Dynamic Scheduling with Reconfiguration Delays.” Queueing Systems 83, no. 1–2 (January 23, 2016): 87–129.en_US
dc.contributor.departmentMassachusetts Institute of Technology. Department of Aeronautics and Astronauticsen_US
dc.contributor.departmentMassachusetts Institute of Technology. Laboratory for Information and Decision Systemsen_US
dc.contributor.mitauthorModiano, Eytan H.en_US
dc.contributor.mitauthorCelik, G.en_US
dc.relation.journalQueueing Systemsen_US
dc.eprint.versionAuthor's final manuscripten_US
dc.type.urihttp://purl.org/eprint/type/JournalArticleen_US
eprint.statushttp://purl.org/eprint/status/PeerRevieweden_US
dc.date.updated2016-05-23T12:16:05Z
dc.language.rfc3066en
dc.rights.holderSpringer Science+Business Media New York
dspace.orderedauthorsCelik, G.; Borst, S. C.; Whiting, P. A.; Modiano, E.en_US
dspace.embargo.termsNen
dc.identifier.orcidhttps://orcid.org/0000-0001-8238-8130
mit.licenseOPEN_ACCESS_POLICYen_US


Files in this item

Thumbnail

This item appears in the following Collection(s)

Show simple item record