Optimal scaling of average queue sizes in an input-queued switch: an open problem
Name
Shah_Optimal scaling of average.pdf
Size
153.8 KB
Format
Adobe PDF
Checksum (MD5)
07b415bee82dda3ad94b2549524c4089
Author(s)
Shah, Devavrat
Tsitsiklis, John N.
Zhong, Yuan
Date Issued
June 2011
Journal
Queueing Systems
Publisher
Springer-Verlag
Citation
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.
Version
Author's final manuscript
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 − ρ)).
MIT Department
Massachusetts Institute of Technology. Department of Electrical Engineering and Computer Science
Massachusetts Institute of Technology. Laboratory for Information and Decision Systems
Terms of Use
Creative Commons Attribution-Noncommercial-Share Alike 3.0
Persistent DSpace Link
DOI of Published Version
https://doi.org/10.1007/s11134-011-9234-1
