Optimal scheduling policies in small generalized switches

Tianxiong Ji, Eleftheria Athanasopoulou, R. Srikant

Research output: Chapter in Book/Report/Conference proceedingConference contribution


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.

Original languageEnglish (US)
Title of host publicationIEEE INFOCOM 2009 - The 28th Conference on Computer Communications
Number of pages5
StatePublished - 2009
Event28th Conference on Computer Communications, IEEE INFOCOM 2009 - Rio de Janeiro, Brazil
Duration: Apr 19 2009Apr 25 2009

Publication series

NameProceedings - IEEE INFOCOM
ISSN (Print)0743-166X


Other28th Conference on Computer Communications, IEEE INFOCOM 2009
CityRio de Janeiro

ASJC Scopus subject areas

  • General Computer Science
  • Electrical and Electronic Engineering


Dive into the research topics of 'Optimal scheduling policies in small generalized switches'. Together they form a unique fingerprint.

Cite this