Analysis of reduced rate scheduling for switches with reconfiguration overhead
暂无分享,去创建一个
[1] G. Keiser. Optical Fiber Communications , 1983 .
[2] H. Sunak. Optical fiber communications , 1985, Proceedings of the IEEE.
[3] Cyriel Minkenberg,et al. Current issues in packet switch design , 2003, CCRV.
[4] Nick McKeown,et al. A Starvation-free Algorithm For Achieving 100% Throughput in an Input- Queued Switch , 1999 .
[5] Xin Li,et al. Design and analysis of scheduling algorithms for switches with reconfiguration overhead , 2003, Workshop on High Performance Switching and Routing, 2003, HPSR..
[6] Marco Ajmone Marsan,et al. Packet-mode scheduling in input-queued cell-based switches , 2002, TNET.
[7] Nick McKeown,et al. The iSLIP scheduling algorithm for input-queued switches , 1999, TNET.
[8] Ge Nong,et al. Burst-based scheduling algorithms for non-blocking ATM switches with multiple input queues , 2000, IEEE Communications Letters.
[9] Leandros Tassiulas,et al. Reduced Complexity Input Buffered Switches , 2000 .