On the speedup required for work-conserving crossbar switches

IEEE Journal on Selected Areas in Communications

Volumn 17, Issue 6, 1999, Pages 1057-1066

  Krishna, Pattabhiraman ^a   Patel, Naimish S ^b,c   Charny, Anna ^b,d   Simcoe, Robert J ^b,e  

^a HEWLETT PACKARD COMPANY   (United States)

^b Digital Computer Corp   (United States)

^c Sycamore Networks   (United States)

^d Cabletron Systems   (United States)

^e Nexabit Networks   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; CLIENT SERVER COMPUTER SYSTEMS; COMPUTER ARCHITECTURE; DATA COMMUNICATION SYSTEMS; SCHEDULING; TELECOMMUNICATION TRAFFIC;

CROSSBAR SWITCHES; LOWEST OCCUPANCY OUTPUT FIRST ALGORITHM; QUALITY OF SERVICE; WORK CONSERVING SERVER;

CROSSBAR EQUIPMENT;

EID: 0032673103     PISSN: 07338716     EISSN: None     Source Type: Journal    
DOI: 10.1109/49.772435     Document Type: Article

References (20)

1. M. Karol, M. Hluchyj, and S. Morgan, "Input versus output queueing on a space division switch," IEEE Trans. Commun., vol. 35, pp. 1347-1356, 1987.
2. S.-Q. Li, "Performance of a nonblocking space-division packet switch with correlated input traffic," in Proc. IEEE Globecom, 1989, pp. 1754-1763.
3. N. McKeown, V. Anantharam, and J. Walrand, "Achieving 100% throughput in an input-queued switch," in Froc. IEEE INFOCOM, 1996, pp. 296-302.
4. R. E. Tarjan, "Data Structures and Network Algorithms," Bell Labs, 1983.
5. T. E. Anderson, S. S. Owicki, J. B. Saxe, and C. P. Thacker, "High speed switch scheduling for local area networks," ACM Trans. Comput. Syst., vol. 11, pp. 319-352, Nov. 1993.
6. D. Stiliadis and A. Verma, "Providing bandwidth guarantees in an input-buffered crossbar switch," in Proc. IEEE INFOCOM, 1995, pp. 960-968.
7. N. McKeown, "Scheduling algorithms for input-queued cell switches," Ph.D. dissertation, Univ. California, Berkeley, CA, 1995.
8. C. Lund, S. Phillips, and N. Reingold, "Fair prioritized scheduling in an input-buffered switch," in Proc. Broadband Commun., 1996.
9. N. McKeown, B. Prabhakar, and M. Zhu, "Matching output queueing with combined input and output queueing," in Proc. 35th Ann. Allerton Conf. Commun., Control, and Computing, Oct. 1997.
10. B. Prabhakar and N. McKeown, "On the speedup required for combined input and output queued switching," Computer Systems Lab, Stanford Univ., Stanford, CA, Tech. Rep. CSL-TR-97-738.
11. R. Guerin and K. N. Sivarajan, "Delay and throughput performance of speeded-up input-queueing packet switches," IBM, Res. Rep. RC 20892, 1997.
12. A. Mekkittikul and N. McKeown, "A practical scheduling algorithm to achieve 100% throughput in input-queued switches," in Proc. IEEE INFOCOM, Mar. 1998.
13. 2Q - Worst-case fair weighted fair queueing," in Proc. INFOCOM, 1996.
14. T. L. Rodeheffer and J. B. Saxe, "An efficient matching algorithm for a high-throughput, low-latency data switch," Compaq Comput. Corp., Syst. Res. Ctr., Res. Rep. 1998-162.
15. A. Charny, P. Krishna, N. Patel, and R. Simcoe, "Algorithms for providing bandwidth and delay guarantees in input-buffered crossbar switches with speedup," in Proc. IWQoS, Napa Valley, CA, May 1998.
16. Y.-S. Yeh, M. G. Hluchyj, and A. S. Acampora, "The knockout switch: A simple, modular architecture for high-performance packet switching," IEEE J. Select. Areas Commun., vol. SAC-5, pp. 1274-1283, Oct. 1987.
17. Y. Oie et al., "Effect of speedup in nonblocking packet switch," in Proc. ICC, 1989.
18. J. S.-C. Chen and T. E. Stern, "Throughput analysis, optimal buffer allocation, and traffic imbalance study of a generic nonblocking packet switch," IEEE J. Select. Areas Commun., vol. 9, pp. 439-449, Apr. 1991.
19. S.-T. Chuang, A. Goel, N. McKeown, and B. Prabhakar, "Matching output queueing with a combined input output queued switch," Stanford Univ., Stanford, CA, Tech. Rep. CSL-TR-98-758. (An extended version of this report also appears in this special issue.)
20. A. Charny, "Providing QoS guarantees in input-buffered crossbar switches with speedup," Ph.D. Dissertation, MIT Cambridge, MA, 1998.