Fair scheduling in input-queued switches under inadmissible traffic

  title={Fair scheduling in input-queued switches under inadmissible traffic},
  author={Neha Kumar and Rong Pan and Devavrat Shah},
  journal={IEEE Global Telecommunications Conference, 2004. GLOBECOM '04.},
  pages={1713-1717 Vol.3}
In recent years, several high-throughput low-delay scheduling algorithms have been designed for input-queued (IQ) switches, assuming admissible traffic. In this paper, we focus on queueing systems that violate admissibility criteria. We show that in a single-server system with multiple queues, the longest queue first (LQF) policy disallows a fair allocation of service rates. We also describe the duality shared by LQF's rate allocation and a fair rate allocation. In general, we demonstrate that… CONTINUE READING
Highly Cited
This paper has 21 citations. REVIEW CITATIONS


Publications citing this paper.
Showing 1-10 of 15 extracted citations

Simple and Fair Scheduling Algorithm for Combined Input-Crosspoint-Queued Switch

2007 IEEE International Conference on Communications • 2007
View 4 Excerpts
Highly Influenced

A Combined Fair Scheduling Algorithm for Combined-Input-Crosspoint-Queued Switch

2009 5th International Conference on Wireless Communications, Networking and Mobile Computing • 2009
View 3 Excerpts
Highly Influenced

Fair Scheduling in Networks Through Packet Election

IEEE Transactions on Information Theory • 2011
View 1 Excerpt


Publications referenced by this paper.
Showing 1-9 of 9 references

Switch under Heavy Traffic

D. Shah, D. Wischik
under preparation • 2004

Switching under Energy Constraints

P. Giaccone, B. Prabhakar, D. Shah
Asilomar Conference on Signals, Systems and Computers, • 2002

Switching under energy constraints

Conference Record of the Thirty-Sixth Asilomar Conference on Signals, Systems and Computers, 2002. • 2002
View 1 Excerpt

Stability of fluid and stochastic networks

J. G. Dai
Miscellanea Publication, • 1999
View 1 Excerpt

Similar Papers

Loading similar papers…