Linear-complexity algorithms for QoS support in input-queued switches with no speedup
- 1 June 1999
- journal article
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Journal on Selected Areas in Communications
- Vol. 17 (6), 1040-1056
- https://doi.org/10.1109/49.772432
Abstract
No abstract availableKeywords
This publication has 30 references indexed in Scilit:
- Effect of speedup in nonblocking packet switchPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2003
- On the speedup required for work-conserving crossbar switchesPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2002
- Algorithms for providing bandwidth and delay guarantees in input-buffered crossbars with speedupPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2002
- Exact emulation of an output queueing switch by a combined input output queueing switchPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2002
- Tiny Tera: a packet switch coreIEEE Micro, 1997
- Efficient network QoS provisioning based on per node traffic shapingIEEE/ACM Transactions on Networking, 1996
- Throughput analysis, optimal buffer allocation, and traffic imbalance study of a generic nonblocking packet switchIEEE Journal on Selected Areas in Communications, 1991
- A calculus for network delay. I. Network elements in isolationIEEE Transactions on Information Theory, 1991
- New directions in communications (or which way to the information age?)IEEE Communications Magazine, 1986
- College Admissions and the Stability of MarriageThe American Mathematical Monthly, 1962