Show simple item record

dc.contributor.authorJagannathan, Krishna Prasanna
dc.contributor.authorMarkakis, Mihalis G.
dc.contributor.authorTsitsiklis, John N.
dc.contributor.authorModiano, Eytan H.
dc.date.accessioned2015-03-12T16:15:38Z
dc.date.available2015-03-12T16:15:38Z
dc.date.issued2014-03
dc.date.submitted2013-08
dc.identifier.issn0018-9448
dc.identifier.issn1557-9654
dc.identifier.urihttp://hdl.handle.net/1721.1/95983
dc.description.abstractWe study the problem of scheduling over time varying links in a network that serves both heavy-tailed and light tailed traffic. We consider a system consisting of two parallel queues, served by a single server. One of the queues receives heavy-tailed traffic (the heavy queue), and the other receives light-tailed traffic (the light queue). The queues are connected to the server through time-varying ON/OFF links, which model fading wireless channels. We first show that the policy that gives complete priority to the light-tailed traffic guarantees the best possible tail behavior of both queue backlog distributions, whenever the queues are stable. However, the priority policy is not throughput maximizing, and can cause undesirable instability effects in the heavy queue. Next, we study the class of throughput optimal max-weight-α scheduling policies. We discover a threshold phenomenon, and show that the steady state light queue backlog distribution is heavy-tailed for arrival rates above a threshold value, and light-tailed otherwise. We also obtain the exact tail coefficient of the light queue backlog distribution under max-weight-α scheduling. Finally, we study a log-max-weight scheduling policy, which is throughput optimal, and ensures that the light queue backlog distribution is light-tailed.en_US
dc.description.sponsorshipNational Science Foundation (U.S.) (Grant CNS-1217048)en_US
dc.description.sponsorshipNational Science Foundation (U.S.) (Grant CNS-0915988)en_US
dc.description.sponsorshipNational Science Foundation (U.S.) (CMMI-1234062)en_US
dc.description.sponsorshipUnited States. Army Research Office. Multidisciplinary University Research Initiative (Grant W911NF-08-1-0238)en_US
dc.language.isoen_US
dc.publisherInstitute of Electrical and Electronics Engineers (IEEE)en_US
dc.relation.isversionofhttp://dx.doi.org/10.1109/tit.2014.2311125en_US
dc.rightsCreative Commons Attribution-Noncommercial-Share Alikeen_US
dc.rights.urihttp://creativecommons.org/licenses/by-nc-sa/4.0/en_US
dc.sourceTsitsiklis, John N. via Chris Sherratten_US
dc.titleThroughput Optimal Scheduling Over Time-Varying Channels in the Presence of Heavy-Tailed Trafficen_US
dc.typeArticleen_US
dc.identifier.citationJagannathan, Krishna, Mihalis G. Markakis, Eytan Modiano, and John N. Tsitsiklis. “Throughput Optimal Scheduling Over Time-Varying Channels in the Presence of Heavy-Tailed Traffic.” IEEE Trans. Inform. Theory 60, no. 5 (May 2014): 2896–2909.en_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.approverTsitsiklis, John N.en_US
dc.contributor.mitauthorModiano, Eytan H.en_US
dc.contributor.mitauthorTsitsiklis, John N.en_US
dc.contributor.mitauthorJagannathan, Krishna Prasanna
dc.relation.journalIEEE Transactions on Information Theoryen_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
dspace.orderedauthorsJagannathan, Krishna; Markakis, Mihalis G.; Modiano, Eytan; Tsitsiklis, John N.en_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