TY - GEN
T1 - Optimal scheduling policies in small generalized switches
AU - Ji, Tianxiong
AU - Athanasopoulou, Eleftheria
AU - Srikant, R.
PY - 2009
Y1 - 2009
N2 - We consider small generalized switches with less than or equal to four links, and study scheduling policies designed to minimize the total number of packets in the system. By focusing on very small switches, we are able to derive optimal or heavy-traffic optimal policies whose performance can then be compared to previously conjectured optimal policies. In particular, it has been conjectured that the max-weight policy with weight qα is optimal in heavy-traffic when α → 0. Our results show that this conjecture is not true.
AB - We consider small generalized switches with less than or equal to four links, and study scheduling policies designed to minimize the total number of packets in the system. By focusing on very small switches, we are able to derive optimal or heavy-traffic optimal policies whose performance can then be compared to previously conjectured optimal policies. In particular, it has been conjectured that the max-weight policy with weight qα is optimal in heavy-traffic when α → 0. Our results show that this conjecture is not true.
UR - http://www.scopus.com/inward/record.url?scp=70349669489&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=70349669489&partnerID=8YFLogxK
U2 - 10.1109/INFCOM.2009.5062259
DO - 10.1109/INFCOM.2009.5062259
M3 - Conference contribution
AN - SCOPUS:70349669489
SN - 9781424435135
T3 - Proceedings - IEEE INFOCOM
SP - 2921
EP - 2925
BT - IEEE INFOCOM 2009 - The 28th Conference on Computer Communications
T2 - 28th Conference on Computer Communications, IEEE INFOCOM 2009
Y2 - 19 April 2009 through 25 April 2009
ER -