Pipelined two step iterative matching algorithms for CIOQ crossbar switches

2005 Symposium on Architectures for Networking and Communications Systems, ANCS 2005

Volumn , Issue , 2005, Pages 41-50

  Pan, Deng ^a   Yang, Yuanyuan ^a  

^a Stony Brook University   (United States)

Author keywords

Convergence; Iterative algorithms; Pipeline; Scheduling

Indexed keywords

ANALYTICAL RESULTS; CIOQ SWITCHES; CONVERGENCE; CROSSBAR SWITCH; EXTENSIVE SIMULATIONS; ITERATIVE ALGORITHMS; ITERATIVE MATCHING; ITERATIVE MATCHING ALGORITHMS; MATCHINGS; PARALLEL ITERATIVE MATCHING; PIPELINED ALGORITHMS; TIME SLOTS;

CONTENT BASED RETRIEVAL; CONVERGENCE OF NUMERICAL METHODS; PARALLEL ALGORITHMS; PIPELINES; Q SWITCHING; SCHEDULING ALGORITHMS; SWITCHES; TIME SWITCHES;

ITERATIVE METHODS;

EID: 67650351059     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/ANCS.2005.4675264     Document Type: Conference Paper

References (14)

1. N. McKeown, "The iSLIP scheduling algorithm for input-queued switches," IEEE/ACM Trans. Networking, vol. 7, no. 2, pp. 188-201, 1999.
2. N. McKeown, A. Mekkittikul, V. Anantharam and J. Walrand, "Achieving 100% throughput in an input queued switch," IEEE Trans. Commun., vol. 47, no. 8, pp. 1260-1267, 1999. (Pubitemid 30507567)
3. T. Anderson, S. Owicki. J. Saxe and C. Thacker, "High-speed switch scheduling for local-area networks," ACM Trans.
4. M. J. Karol, M. J. Hluchyj and S. P. Morgan, "Input versus output queueing on a space-division packet switch," IEEE Trans. Commun., vol. 35, pp. 1347-1356, 1987.
5. Nick McKeown, "A fast switched backplane for a gigabit switched router," Business Communications Review, vol. 27, no. 12, 1997.
6. J. G. Dai and B. Prabhakar, "The throughput of data switches with and without speedup," IEEE INFOCOM '00, vol. 2, pp. 556-564, Tel Aviv, Israel, Mar. 2000. (Pubitemid 30584504)
7. N. McKeown, M. Izzard, A. Mekkittikul, B. Ellesick and M. Horowitz, "The tiny tera: a packet switch core," IEEE Micro, vol. 17, no. 1, pp. 26-33, Feb. 1997. (Pubitemid 127571629)
8. C. Partridge et al., "A 50-Gb/s IP router," IEEE/ACM Trans. Networking, vol. 6, no. 3, pp. 237-248, 1998. (Pubitemid 128750043)
9. N. McKeown, "Scheduling algorithms for input queued cell switches," PhD Thesis, University of California at Berkeley, May 1995.
10. 5/2 algorithm for maximum matching in bipartite graphs," SIAM Journal of Computing, vol. 2, no. 4, pp. 225-231, Dec. 1973.
11. R. Tarjan, "Data structures and network algorithms,"CBMS-NSF Regional Conference Series in Applied Mathematics, Dec. 1983.
12. R. Panigrahy, A. Prakash, A. Nemat, and A. Aziz, "Weighted Random Matching: a simple scheduling algorithm for achieving 100% throughput," Proc. of the IEEE Workshop on High Performance Switching and Routing, pp. 111-115, Phoenix, AZ, 2004.
13. D. Pan and Y. Yang, "FIFO based multicast scheduling algorithm for VOQ packet switches," to appear in IEEE Trans. Computers, vol. 54, no. 10, October 2005.
14. Y. Li, S. S. Panwar and H.J. Chao, "Exhaustive service matching algorithms for input queued switches," Proc. Of IEEE Workshop on High Performance Switching and Routing, pp. 253-258, 2004.