research-article

A Novel View of the Drift: Method for Heavy Traffic Limits of Queueing Systems

Authors:

Daniela Hurtado-Lange,

Siva Theja MaguluriAuthors Info & Claims

ACM SIGMETRICS Performance Evaluation Review, Volume 46, Issue 2

Pages 81 - 82

https://doi.org/10.1145/3305218.3305248

Published: 17 January 2019 Publication History

Get Access

Abstract

The drift method has been recently developed to study queueing systems in heavy traffic [3]. This method was successfully used to obtain the heavy traffic scaled sum queue lengths of several systems, even when the so-called complete resource pooling condition is not satisfied. In this poster, we present a novel view of the drift method to explain why this methodworks.We believe that this view can be exploited to obtain the joint distribution of the steady-state heavy-traffic scaled queue lengths.

References

[1]

W. N. Kang and R. J. Williams. 2012. Diffusion approximation for an input-queued packet switch operating under a maximum weight algorithm. Stochastic Systems (2012).

Google Scholar

[2]

S. Kumar and P. R. Kumar. 1994. Performance bounds for queueing networks and scheduling policies. IEEE Trans. Automat. Control 39, 8 (Aug 1994), 1600--1611.

Crossref

Google Scholar

[3]

Siva Theja Maguluri, Sai Kiran Burle, and R Srikant. 2018. Optimal heavy-traffic queue length scaling in an incompletely saturated switch. Queueing Systems 88, 3--4 (2018), 279--309.

Digital Library

Google Scholar

Recommendations

Approximating the GI/GI/1+GI Queue with a Nonlinear Drift Diffusion: Hazard Rate Scaling in Heavy Traffic

We study a single-server queue, operating under the first-in-first-out (FIFO) service discipline, in which each customer independently abandons the queue if his service has not begun within a generally distributed amount of time. Under some mild ...
Asymptotically tight steady-state queue length bounds implied by drift conditions

The Foster---Lyapunov theorem and its variants serve as the primary tools for studying the stability of queueing systems. In addition, it is well known that setting the drift of the Lyapunov function equal to zero in steady state provides bounds on the ...
Asymptotic behavior of the stationary distribution in a finite QBD process with zero mean drift

We consider a finite QBD process with m levels. Assuming that the mean drift is 0, we obtain an asymptotic behavior @p"m^(^m^)~(1/m)c as m->~ in the stationary distribution (@p"0^(^m^),...,@p"m^(^m^)), by finding an explicit expression for vector c. ...

Comments

Please enable JavaScript to view thecomments powered by Disqus.

Information & Contributors

Information

Published In

cover image ACM SIGMETRICS Performance Evaluation Review

ACM SIGMETRICS Performance Evaluation Review Volume 46, Issue 2

September 2018

95 pages

ISSN:0163-5999

DOI:10.1145/3305218

Editor:
Nidhi Hegde
Borealis AI

Issue’s Table of Contents

Publisher

Association for Computing Machinery

New York, NY, United States

Publication History

Published: 17 January 2019

Published in SIGMETRICS Volume 46, Issue 2

Check for updates

Qualifiers

Research-article

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

0
Total Citations
49
Total Downloads

Downloads (Last 12 months)1
Downloads (Last 6 weeks)0

Reflects downloads up to 03 Jan 2025

Other Metrics

View Author Metrics

Citations

View Options

Login options

Check if you have access through your login credentials or your institution to get full access on this article.

Recommendations

Approximating the GI/GI/1+GI Queue with a Nonlinear Drift Diffusion: Hazard Rate Scaling in Heavy Traffic

Asymptotically tight steady-state queue length bounds implied by drift conditions

Asymptotic behavior of the stationary distribution in a finite QBD process with zero mean drift