Repository logo
Log in(current)
Repository logoMIT Open ScholarshipDSpace@MIT
  1. Home
  2. MIT Open Access Articles
  3. MIT Open Access Articles
  4. Throughput Optimal Scheduling Over Time-Varying Channels in the Presence of Heavy-Tailed Traffic

Throughput Optimal Scheduling Over Time-Varying Channels in the Presence of Heavy-Tailed Traffic

Thumbnail Image
Download
Name

tsit 2 IT_tran5.pdf

Size

203.22 KB

Format

Adobe PDF

Checksum (MD5)

499598c63d2dec20dc921ff57be04595

Author(s)
Jagannathan, Krishna Prasanna
•
Markakis, Mihalis G.
•
Tsitsiklis, John N.
•
Modiano, Eytan H.
Date Issued
March 2014
Journal
IEEE Transactions on Information Theory
Publisher
Institute of Electrical and Electronics Engineers (IEEE)
Citation
Jagannathan, 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.
Version
Author's final manuscript
Abstract
We 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.
MIT Department
Massachusetts Institute of Technology. Department of Aeronautics and Astronautics
Massachusetts Institute of Technology. Department of Electrical Engineering and Computer Science
Terms of Use
Creative Commons Attribution-Noncommercial-Share Alike
http://creativecommons.org/licenses/by-nc-sa/4.0/
Persistent DSpace Link
http://hdl.handle.net/1721.1/95983
DOI of Published Version
https://doi.org/10.1109/tit.2014.2311125
Repository logo
PrivacyPermissionsAccessibilityContact us
Repository logo
Notify us about copyright concerns.