On optimal scheduling algorithms for small generalized switches

Authors:
Tianxiong Ji;Eleftheria Athanasopoulou;R. Srikant
Affiliations:
Coordinated Science Laboratory and Department of Electrical and Computer Engineering, University of Illinois at Urbana-Champaign, Urbana, IL;Coordinated Science Laboratory and Department of Electrical and Computer Engineering, University of Illinois at Urbana-Champaign, Urbana, IL;Coordinated Science Laboratory and Department of Electrical and Computer Engineering, University of Illinois at Urbana-Champaign, Urbana, IL
Venue:
IEEE/ACM Transactions on Networking (TON)
Year:
2010

Citing 4
Cited 2

Dynamic programming: deterministic and stochastic models

Dynamic programming: deterministic and stochastic models
Impact of fairness on Internet performance

Proceedings of the 2001 ACM SIGMETRICS international conference on Measurement and modeling of computer systems
Stable scheduling policies for fading wireless channels

IEEE/ACM Transactions on Networking (TON)
Control Techniques for Complex Networks

Control Techniques for Complex Networks

Asymptotically tight steady-state queue length bounds implied by drift conditions

Queueing Systems: Theory and Applications
On Sample-Path Optimal Dynamic Scheduling for Sum-Queue Minimization in Forests

IEEE/ACM Transactions on Networking (TON)

Quantified Score

Hi-index	0.00

Visualization

Abstract

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.