Optimal scaling of average queue sizes in an input-queued switch: an open problem
Author(s)Shah, Devavrat; Tsitsiklis, John N.; Zhong, Yuan
MetadataShow full item record
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 − ρ)).
DepartmentMassachusetts Institute of Technology. Department of Electrical Engineering and Computer Science; Massachusetts Institute of Technology. Laboratory for Information and Decision Systems
Shah, Devavrat, John N. Tsitsiklis, and Yuan Zhong. “Optimal Scaling of Average Queue Sizes in an Input-queued Switch: An Open Problem.” Queueing Systems 68.3-4 (2011): 375–384.
Author's final manuscript