Optimal scaling of average queue sizes in an input-queued switch: an open problem

Authors:
Devavrat Shah;John N. Tsitsiklis;Yuan Zhong
Affiliations:
Laboratory for Information and Decision Systems, Massachusetts Institute of Technology, Cambridge, USA 02139;Laboratory for Information and Decision Systems, Massachusetts Institute of Technology, Cambridge, USA 02139;Laboratory for Information and Decision Systems, Massachusetts Institute of Technology, Cambridge, USA 02139
Venue:
Queueing Systems: Theory and Applications
Year:
2011

Citing 3
Cited 2

Randomized algorithms

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

IEEE/ACM Transactions on Networking (TON)
Achieving 100% throughput in an input-queued switch

INFOCOM'96 Proceedings of the Fifteenth annual joint conference of the IEEE computer and communications societies conference on The conference on computer communications - Volume 1

Optimal queue-size scaling in switched networks

Proceedings of the 12th ACM SIGMETRICS/PERFORMANCE joint international conference on Measurement and Modeling of Computer Systems
Max-Weight Scheduling in Queueing Networks With Heavy-Tailed Traffic

IEEE/ACM Transactions on Networking (TON)

Quantified Score

Hi-index	0.00

Visualization

Abstract

We review some known results and state a few versions of an open problem related to the scaling of the total queue size (in steady state) in an n脳n input-queued switch, as a function of the port number n and the load factor 驴. Loosely speaking, the question is whether the total number of packets in queue, under either the maximum weight policy or under an optimal policy, scales (ignoring any logarithmic factors) as O(n/(1驴驴)).