Linear-complexity algorithms for QoS support in input-queued switches with no speedup

  title={Linear-complexity algorithms for QoS support in input-queued switches with no speedup},
  author={Anthony C. Kam and Kai-Yeung Siu},
  journal={IEEE Journal on Selected Areas in Communications},
We present several fast, practical linear-complexity scheduling algorithms that enable provision of various quality-of-service (QoS) guarantees in an input-queued switch with no speedup. Specii-cally, our algorithms provide per-virtual-circuit transmission rate and cell delay guarantees using a credit-based bandwidth reservation scheme. Our algorithms also provide approximate max-min-fair sharing of unreserved switch capacity. The novelties of our algorithms derive from judicious choices of… CONTINUE READING
43 Citations
33 References
Similar Papers


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


Publications referenced by this paper.
Showing 1-10 of 33 references

Cell Switching WDM Broadcast LAN with Bandwidth Guarantee and Fair Access,

  • A. Kam, K.-Y. Siu, R. A. Barry, E. Swanson
  • J. Lightwave Technology, vol.16,
  • 1998
Highly Influential
7 Excerpts

Shapley, \College Admissions and the stability of marriage,

  • L.S.D. Gale
  • American Mathematical Monthly vol.69,
  • 1962
Highly Influential
6 Excerpts

Starvation-free Algorithm for Achieving 100% Throughput in an Input-Queued Switch,

  • Adisak Mekkittikul, Nick McKeown
  • 1996
Highly Influential
6 Excerpts

Similar Papers

Loading similar papers…