Workload optimality in switches without arrivals

Authors:
Gagan R. Gupta;Sujay Sanghavi;Ness B. Shroff
Affiliations:
Purdue University, West Lafayette, IN;Purdue University, West Lafayette, IN;The Ohio State University, Columbus, OH
Venue:
ACM SIGMETRICS Performance Evaluation Review
Year:
2009

Citing 3
Cited 1

Logarithmic delay for N × N packet switches under the crossbar constraint

IEEE/ACM Transactions on Networking (TON)
Scheduling with queue length guarantees for shared resource systems

SIGMETRICS '08 Proceedings of the 2008 ACM SIGMETRICS international conference on Measurement and modeling of computer systems
Node weighted scheduling

Proceedings of the eleventh international joint conference on Measurement and modeling of computer systems

Delay analysis and optimality of scheduling policies for multihop wireless networks

IEEE/ACM Transactions on Networking (TON)

Quantified Score

Hi-index	0.00

Visualization

Abstract

We analyze a switch with cross-bar constraints. Beginning with an initial loading and no further arrivals, we provide necessary conditions for a scheduling policy to minimize the workload at all times. We show that these conditions are sufficient for a switch of size N x 3 or smaller. We then consider a weaker notion of optimality: cumulative average workload optimality. Using a counter example for a 7 x 7 switch, we show that it is not possible to approximate the cumulative average workload within (1+4/475) of the optimal at all times. We conjecture that the workload under the MVM policy is within twice of the optimal at all times.