Delay analysis of the Max-Weight policy under heavy-tailed traffic via fluid approximations
Name
Allerton 2013_v3 copy 2.pdf
Size
360.42 KB
Format
Adobe PDF
Checksum (MD5)
f8214141f529712dbe09fb0ed0b41375
Author(s)
Markakis, Mihalis G.
Tsitsiklis, John N.
Modiano, Eytan H
Date Issued
April 9, 2018
Journal
2013 51st Annual Allerton Conference on Communication, Control, and Computing (Allerton)
Citation
Markakis, Mihalis G., et al. "Delay Analysis of the Max-Weight Policy under Heavy-Tailed Traffic via Fluid Approximations." 2013 51st Annual Allerton Conference on Communication, Control, and Computing (Allerton), 2-4 October, 2013, Monticello, Illinois, IEEE, 2013, pp. 436–44.
Version
Author's final manuscript
Abstract
We consider a single-hop switched queueing network with a mix of heavy-tailed (i.e., arrival processes with infinite variance) and light-tailed traffic, and study the delay performance of the Max-Weight policy, known for its throughput optimality and asymptotic delay optimality properties. Classical results in queueing theory imply that heavy-tailed queues are delay unstable, i.e., they experience infinite expected delays in steady state. Thus, we focus on the impact of heavy-tailed traffic on the light-tailed queues, using delay stability as performance metric. Recent work has shown that this impact may come in the form of subtle rate-dependent phenomena, the stochastic analysis of which is quite cumbersome. Our goal is to show how fluid approximations can facilitate the delay analysis of the Max-Weight policy under heavy-tailed traffic. More specifically, we show how fluid approximations can be combined with renewal theory in order to prove delay instability results. Furthermore, we show how fluid approximations can be combined with stochastic Lyapunov theory in order to prove delay stability results. We illustrate the benefits of the proposed approach in two ways: (i) analytically, by providing a sharp characterization of the delay stability regions of networks with disjoint schedules, significantly generalizing previous results; (ii) computationally, through a Bottleneck Identification algorithm, which identifies (some) delay unstable queues by solving the fluid model of the network from certain initial conditions.
MIT Department
Massachusetts Institute of Technology. Department of Aeronautics and Astronautics
Terms of Use
Creative Commons Attribution-Noncommercial-Share Alike
Persistent DSpace Link
DOI of Published Version
https://doi.org/10.1109/Allerton.2013.6736557
