Qualitative properties of α-weighted scheduling policies
We consider a switched network, a fairly general constrained queueing network model that has been used successfully to model the detailed packet-level dynamics in communication networks, such as input-queued switches and wireless networks. The main operational issue in this model is that of dec...
Main Authors: | Shah, Devavrat, Zhong, Yuan, Tsitsiklis, John N |
---|---|
Other Authors: | Massachusetts Institute of Technology. Department of Electrical Engineering and Computer Science |
Format: | Article |
Language: | en_US |
Published: |
Association for Computing Machinery
2011
|
Online Access: | http://hdl.handle.net/1721.1/62864 https://orcid.org/0000-0003-0737-3259 https://orcid.org/0000-0003-2658-8239 |
Similar Items
-
Qualitative properties of α-fair policies in bandwidth-sharing networks
by: Zhong, Y., et al.
Published: (2014) -
Hardness of Low Delay Network Scheduling
by: Shah, Devavrat, et al.
Published: (2012) -
Max-weight scheduling in networks with heavy-tailed traffic
by: Markakis, Mihalis G., et al.
Published: (2017) -
Optimal scaling of average queue sizes in an input-queued switch: an open problem
by: Shah, Devavrat, et al.
Published: (2012) -
Max-Weight Scheduling in Queueing Networks With Heavy-Tailed Traffic
by: Markakis, Michail, et al.
Published: (2018)