Abstract
We consider a switch with uniform traffic operating under the MaxWeight scheduling algorithm. This traffic pattern is interesting to study in the heavy-traffic regime since the queue lengths exhibit a multi-dimensional state-space collapse. We use a Lyapunov-type drift technique to characterize the heavy-traffic behavior of the expectation of the sum queue lengths in steady-state. Specifically, in the case of Bernoulli arrivals, we show that the heavy-traffic scaled queue length is " n - 3 2 + 1 2n # . Our result implies that the MaxWeight algorithm has optimal queue-length scaling behavior in the heavy-traffic regime with respect to the size of a switch with a uniform traffic pattern. This settles the heavy-traffic version of an open conjecture.
| Original language | English (US) |
|---|---|
| Article number | 2825264 |
| Pages (from-to) | 72-74 |
| Number of pages | 3 |
| Journal | Performance Evaluation Review |
| Volume | 43 |
| Issue number | 2 |
| DOIs | |
| State | Published - Sep 16 2015 |
| Event | 33rd International Symposium on Computer Performance, Modeling, Measurement, and Evaluation, IFIP WG 7.3 Performance 2015 - Sydney, Australia Duration: Oct 19 2015 → Oct 21 2015 |
Fingerprint
ASJC Scopus subject areas
- Software
- Hardware and Architecture
- Computer Networks and Communications
Cite this
Heavy-traffic behavior of the maxweight algorithm in a switch with uniform traffic. / Maguluri, Siva Theja; Srikant, Rayadurgam.
In: Performance Evaluation Review, Vol. 43, No. 2, 2825264, 16.09.2015, p. 72-74.Research output: Contribution to journal › Conference article
}
TY - JOUR
T1 - Heavy-traffic behavior of the maxweight algorithm in a switch with uniform traffic
AU - Maguluri, Siva Theja
AU - Srikant, Rayadurgam
PY - 2015/9/16
Y1 - 2015/9/16
N2 - We consider a switch with uniform traffic operating under the MaxWeight scheduling algorithm. This traffic pattern is interesting to study in the heavy-traffic regime since the queue lengths exhibit a multi-dimensional state-space collapse. We use a Lyapunov-type drift technique to characterize the heavy-traffic behavior of the expectation of the sum queue lengths in steady-state. Specifically, in the case of Bernoulli arrivals, we show that the heavy-traffic scaled queue length is " n - 3 2 + 1 2n # . Our result implies that the MaxWeight algorithm has optimal queue-length scaling behavior in the heavy-traffic regime with respect to the size of a switch with a uniform traffic pattern. This settles the heavy-traffic version of an open conjecture.
AB - We consider a switch with uniform traffic operating under the MaxWeight scheduling algorithm. This traffic pattern is interesting to study in the heavy-traffic regime since the queue lengths exhibit a multi-dimensional state-space collapse. We use a Lyapunov-type drift technique to characterize the heavy-traffic behavior of the expectation of the sum queue lengths in steady-state. Specifically, in the case of Bernoulli arrivals, we show that the heavy-traffic scaled queue length is " n - 3 2 + 1 2n # . Our result implies that the MaxWeight algorithm has optimal queue-length scaling behavior in the heavy-traffic regime with respect to the size of a switch with a uniform traffic pattern. This settles the heavy-traffic version of an open conjecture.
UR - http://www.scopus.com/inward/record.url?scp=84978704744&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=84978704744&partnerID=8YFLogxK
U2 - 10.1145/2825236.2825264
DO - 10.1145/2825236.2825264
M3 - Conference article
AN - SCOPUS:84978704744
VL - 43
SP - 72
EP - 74
JO - Performance Evaluation Review
JF - Performance Evaluation Review
SN - 0163-5999
IS - 2
M1 - 2825264
ER -