On optimal scheduling algorithms for small generalized switches

Tianxiong Ji, Eleftheria Athanasopoulou, R. Srikant

Research output: Contribution to journalArticlepeer-review


It has been conjectured that MWS-α scheduling policies with α going to zero are heavy-traffic optimal for scheduling in a generalized switch when the objective is to minimize the number of backlogged packets in the system. We examine this conjecture by first deriving optimal or heavy-traffic optimal policies for small switches and then comparing them to MWS- α policies by simulation. Our conclusion is that the conjecture is not true in general, i.e., there are simple topologies for which there exist policies that outperform MWS-α in heavy traffic.

Original languageEnglish (US)
Article number5453034
Pages (from-to)1585-1598
Number of pages14
JournalIEEE/ACM Transactions on Networking
Issue number5
StatePublished - Oct 2010


  • Generalized switches
  • heavy traffic analysis
  • scheduling
  • workload optimality

ASJC Scopus subject areas

  • Software
  • Computer Science Applications
  • Computer Networks and Communications
  • Electrical and Electronic Engineering


Dive into the research topics of 'On optimal scheduling algorithms for small generalized switches'. Together they form a unique fingerprint.

Cite this