Show simple item record

dc.contributor.authorMarkakis, Mihalis G.
dc.contributor.authorModiano, Eytan H
dc.contributor.authorTsitsiklis, John N
dc.date.accessioned2018-04-05T18:38:09Z
dc.date.available2018-04-05T18:38:09Z
dc.date.issued2017-10
dc.date.submitted2016-10
dc.identifier.issn0364-765X
dc.identifier.issn1526-5471
dc.identifier.urihttp://hdl.handle.net/1721.1/114573
dc.description.abstractWe consider switched queueing networks with a mix of heavy-tailed (i.e., arrival processes with infinite variance) and exponential-type traffic and study the delay performance of the max-weight policy, known for its throughput optimality and asymptotic delay optimality properties. Our focus is on the impact of heavy-tailed traffic on exponential-type queues/flows, which may manifest itself in the form of subtle rate-dependent phenomena. We introduce a novel class of Lyapunov functions (piecewise linear and nonincreasing in the length of heavy-tailed queues), whose drift analysis provides exponentially decaying upper bounds to queue-length tail asymptotics despite the presence of heavy tails. To facilitate a drift analysis, we employ fluid approximations, proving that if a continuous and piecewise linear function is also a “Lyapunov function” for the fluid model, then the same function is a “Lyapunov function” for the original stochastic system. Furthermore, we use fluid approximations and renewal theory in order to prove delay instability results, i.e., infinite expected delays in steady state. We illustrate the benefits of the proposed approach in two ways: (i) analytically, by studying the delay stability regions of single-hop switched queueing networks with disjoint schedules, providing a precise characterization of these regions for certain queues and inner and outer bounds for the rest. As a side result, we prove monotonicity properties for the service rates of different schedules that, in turn, allow us to identify “critical configurations” toward which the state of the system is driven, and that determine to a large extent delay stability; (ii) computationally, through a bottleneck identification algorithm, which identifies (some) delay unstable queues/flows in complex switched queueing networks by solving the fluid model from certain initial conditions. Keywords: switched queueing networks; max-weight policy; heavy-tailed traffic; fluid approximations; piecewise linear Lyapunov functionsen_US
dc.description.sponsorshipNational Science Foundation (U.S.) (Grant CNS-1217048)en_US
dc.description.sponsorshipNational Science Foundation (U.S.) (Grant CMMI-1234062)en_US
dc.description.sponsorshipUnited States. Office of Naval Research (Grant N00014-12-1-0064)en_US
dc.description.sponsorshipUnited States. Army Research Office (Grant W911NF-08-1-0238)en_US
dc.publisherInstitute for Operations Research and the Management Sciences (INFORMS)en_US
dc.relation.isversionofhttp://dx.doi.org/10.1287/MOOR.2017.0867en_US
dc.rightsCreative Commons Attribution-Noncommercial-Share Alikeen_US
dc.rights.urihttp://creativecommons.org/licenses/by-nc-sa/4.0/en_US
dc.sourceMIT Web Domainen_US
dc.titleDelay Analysis of the Max-Weight Policy Under Heavy-Tailed Traffic via Fluid Approximationsen_US
dc.typeArticleen_US
dc.identifier.citationMarkakis, Mihalis G. et al. “Delay Analysis of the Max-Weight Policy Under Heavy-Tailed Traffic via Fluid Approximations.” Mathematics of Operations Research (October 2017): 1-35 © 2017 INFORMSen_US
dc.contributor.departmentMassachusetts Institute of Technology. Department of Aeronautics and Astronauticsen_US
dc.contributor.departmentMassachusetts Institute of Technology. Department of Electrical Engineering and Computer Scienceen_US
dc.contributor.departmentMassachusetts Institute of Technology. Laboratory for Information and Decision Systemsen_US
dc.contributor.mitauthorModiano, Eytan H
dc.contributor.mitauthorTsitsiklis, John N
dc.relation.journalMathematics of Operations Researchen_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.updated2018-04-05T18:18:17Z
dspace.orderedauthorsMarkakis, Mihalis G.; Modiano, Eytan; Tsitsiklis, John N.en_US
dspace.embargo.termsNen_US
dc.identifier.orcidhttps://orcid.org/0000-0001-8238-8130
dc.identifier.orcidhttps://orcid.org/0000-0003-2658-8239
mit.licenseOPEN_ACCESS_POLICYen_US


Files in this item

Thumbnail

This item appears in the following Collection(s)

Show simple item record