Frame-based matching algorithms for optical switches

IEEE International Conference on High Performance Switching and Routing, HPSR

Volumn , Issue , 2003, Pages 97-102

  Li, Yihan ^a   Panwar, S ^a   Chao, H J ^a  

^a POLYTECHNIC UNIVERSITY   (United States)

Author keywords

exhaustive service; optical switching; polling systems; scheduling; Virtual Output Queueing

Indexed keywords

OPTICAL SWITCHES; SCHEDULING; SEMICONDUCTOR SWITCHES;

EXHAUSTIVE SERVICE; HIGH-SPEED ELECTRONICS; IMPLEMENTATION COMPLEXITY; OPTICAL PACKET SWITCHES; OPTICAL SWITCHING; POLLING SYSTEM; VIRTUAL OUTPUT QUEUEING; VIRTUAL OUTPUT QUEUING;

ALGORITHMS;

EID: 33749471422     PISSN: 23255595     EISSN: 23255609     Source Type: Conference Proceeding    
DOI: 10.1109/HPSR.2003.1226687     Document Type: Conference Paper

References (24)

1. M. J. Karol, M. Hluchyj, and S. Morgan, "Input versus output queuing on a space-division packet switch," IEEE Trans, on Communications, vol.35, pp. 1347-1356,1987.
2. L. Tassiulas, A. Ephremides, "Stability properties of constrained queueing systems and scheduling for maximum throughput in multihop radio networks," IEEE Trans. Automatic Control, Vol. 37, No. 2, pp. 1936-1949.
3. N. McKeown, V. Anantharam, and J. Walrand, "Achieving 100% throughput in an input-queued switch," IEEE INFOCOM'96, pp. 296-302.
4. N. McKeown, "Scheduling algorithms for input-queued cell switches," Ph.D. Thesis, UC Berkeley, May 1995.
5. A. Mekkittikul and N. McKeown, "A practical scheduling algorithm to achieve 100% throughput in input-queued switches," IEEE INFOCOM 98, Vol 2, pp. 792-799, April 1998.
6. J. Dai, B. Prabhakar, "The throughput of data switches with and without speedup," IEEE INFOCOM 2000, Tel Aviv, Israel, March 2000.
7. M. Ajmone, E. Leonardi, M. Mellia, F. Neri, "On the stability of Input-buffer cell switches with speed-up," IEEE INFOCOM 2000, Tel Aviv, Israel, March 2000.
8. T. E. Anderson, S. S. Owicki, J. B. Saxe and C. P. Thacker, "High speed switch scheduling for local area networks," ACM Trans, on Computer Systems, vol. 11, No. 4, pp. 319-352, Nov. 1993.
9. N. McKeown, "The iSLIP scheduling algorithm for Input-Queued switches," IEEE/ACM Trans. Networking, vol. 7, pp. 188-201, April 1999.
10. H. J. Chao, "Saturn: a terabit packet switch using Dual Round-Robin", IEEE Communication Magazine, vol. 38 12, pp. 78-84, Dec. 2000.
11. Y. Li, S. Panwar, H. J. Chao, "On the performance of a Dual Round-Robin switch," IEEE INFOCOM 2001, vol. 3, pp. 1688-1697, April 2001.
12. Y. Li, S. Panwar, H. J. Chao, "The Dual Round-Robin Matching switch with exhaustive service," 2002 Workshop on High Performance Switching and Routing (HPSR 2002), pp. 58-63, May 2002.
13. Y. Li, S. Panwar, H. J. Chao, "Performance Analysis of a Dual Round Robin Matching Switch with Exhaustive Service," IEEE Globecom 2002.
14. C-S. Chang, D. Lee and Y. Jou., "Load balanced Birkhoff-von Neumann switches, part I: one-stage buffering ," Special issue of Computer Communications on "Current Issues in Terabit Switching," 2001.
15. I. Keslassy, N. McKeown, "Maintaining packet order in two-stage switches", IEEE Infocom 2002, vol.2, New York, 2002, pp. 1032-1041.
16. L. Tassiulas, "Linear complexity algorithms for maximum throughput in radio networks and input queued switches," IEEE INFOCOM'98, vol.2, New York, 1998, pp.533-539.
17. C. Pu, S. Lee, S. Park, P. Chu, I. Brener, "MEMS for optical communication: present and future," Proceedings of SPIE, vol. 4870, pp. 84-92, 2002.
18. A. Bianco, M. Franceschinis, S. Ghisoolfi, A. M. Hill, E. Leonardi, F. Neri, R. Webb, "Frame-based Matching algorithms for Input-Queued switches," HPSR 2002, pp. 69-76.
19. B. Towles, W. Dally, "Guaranteed scheduling for switches with configuration overhead," IEEE Infocom 2002, vol. 1, pp. 342-351.
20. D. Shah, M. Kopikare, "Delay bounds for approximate maximum weight matching algorithms for input queued switches", IEEE Infocom 2002, New York, 2002, pp. 1024-1031.
21. K. Kar, T.V. Lakshman, D. Stiliadis, L. Tassiulas, "Reduced complexity input buffered switches," Proceedings of Hot Interconnects VIII, 2000.
22. R.E. Tarjan, Data structures and network algorithms, Society for Industrial and Applied Mathematics, Pennsylvania, Nov. 1983.
23. G. F. Pfister, " 'Hot Spot' contention and combining in multistage interconnection networks," IEEE Trans, on Computers, vol. C-34, No. 10, pp. 943-948, Oct. 1985.
24. L. Kleinrock, H. Levy, "The analysis of random polling systems," Operations Research, Vol.36, No.5 (September-October), pp. 716-732, 1988.