Abstract
The model is a generalized switch, serving multiple traffic flows in discrete time. The switch uses MaxWeight algorithm to make a service decision (scheduling choice) at each time step, depending on the current queue lengths. In some applications, it is not important to keep the queue lengths/delays small (e.g., when queues are virtual, rather than physical), but is important that the service processes provided to each flow remains smooth (i.e., without large gaps in service) even when the switch is heavily loaded. Addressing this question reduces to the analysis of the asymptotic behavior of the unscaled queue-differential process in heavy traffic. We prove that the stationary regime of this process converges to that of a positive recurrent Markov chain, whose structure we explicitly describe. This in turn implies smoothness of the service processes.
| Original language | English (US) |
|---|---|
| Title of host publication | IEEE INFOCOM 2016 - 35th Annual IEEE International Conference on Computer Communications |
| Publisher | Institute of Electrical and Electronics Engineers Inc. |
| ISBN (Electronic) | 9781467399531 |
| DOIs | |
| State | Published - Jul 27 2016 |
| Event | 35th Annual IEEE International Conference on Computer Communications, IEEE INFOCOM 2016 - San Francisco, United States Duration: Apr 10 2016 → Apr 14 2016 |
Publication series
| Name | Proceedings - IEEE INFOCOM |
|---|---|
| Volume | 2016-July |
| ISSN (Print) | 0743-166X |
Other
| Other | 35th Annual IEEE International Conference on Computer Communications, IEEE INFOCOM 2016 |
|---|---|
| Country | United States |
| City | San Francisco |
| Period | 4/10/16 → 4/14/16 |
Fingerprint
ASJC Scopus subject areas
- Computer Science(all)
- Electrical and Electronic Engineering
Cite this
MaxWeight scheduling : Smoothness of the service process. / Singh, Rahul; Stolyar, Alexander.
IEEE INFOCOM 2016 - 35th Annual IEEE International Conference on Computer Communications. Institute of Electrical and Electronics Engineers Inc., 2016. 7524518 (Proceedings - IEEE INFOCOM; Vol. 2016-July).Research output: Chapter in Book/Report/Conference proceeding › Conference contribution
}
TY - GEN
T1 - MaxWeight scheduling
T2 - Smoothness of the service process
AU - Singh, Rahul
AU - Stolyar, Alexander
PY - 2016/7/27
Y1 - 2016/7/27
N2 - The model is a generalized switch, serving multiple traffic flows in discrete time. The switch uses MaxWeight algorithm to make a service decision (scheduling choice) at each time step, depending on the current queue lengths. In some applications, it is not important to keep the queue lengths/delays small (e.g., when queues are virtual, rather than physical), but is important that the service processes provided to each flow remains smooth (i.e., without large gaps in service) even when the switch is heavily loaded. Addressing this question reduces to the analysis of the asymptotic behavior of the unscaled queue-differential process in heavy traffic. We prove that the stationary regime of this process converges to that of a positive recurrent Markov chain, whose structure we explicitly describe. This in turn implies smoothness of the service processes.
AB - The model is a generalized switch, serving multiple traffic flows in discrete time. The switch uses MaxWeight algorithm to make a service decision (scheduling choice) at each time step, depending on the current queue lengths. In some applications, it is not important to keep the queue lengths/delays small (e.g., when queues are virtual, rather than physical), but is important that the service processes provided to each flow remains smooth (i.e., without large gaps in service) even when the switch is heavily loaded. Addressing this question reduces to the analysis of the asymptotic behavior of the unscaled queue-differential process in heavy traffic. We prove that the stationary regime of this process converges to that of a positive recurrent Markov chain, whose structure we explicitly describe. This in turn implies smoothness of the service processes.
UR - http://www.scopus.com/inward/record.url?scp=84983239060&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=84983239060&partnerID=8YFLogxK
U2 - 10.1109/INFOCOM.2016.7524518
DO - 10.1109/INFOCOM.2016.7524518
M3 - Conference contribution
AN - SCOPUS:84983239060
T3 - Proceedings - IEEE INFOCOM
BT - IEEE INFOCOM 2016 - 35th Annual IEEE International Conference on Computer Communications
PB - Institute of Electrical and Electronics Engineers Inc.
ER -