Scheduling optical packet switches with minimum number of configurations
暂无分享,去创建一个
[1] Richard Cole,et al. On Edge Coloring Bipartite Graphs , 1980, SIAM J. Comput..
[2] William J. Dally,et al. Guaranteed scheduling for switches with configuration overhead , 2003, IEEE/ACM Trans. Netw..
[3] Rajiv Ramaswami,et al. MEMS technology for optical networking applications , 2001, IEEE Commun. Mag..
[4] O. Spahn,et al. GaAs-based microelectromechanical waveguide switch , 2000, 2000 IEEE/LEOS International Conference on Optical MEMS (Cat. No.00EX399).
[5] T. Inukai,et al. An Efficient SS/TDMA Time Slot Assignment Algorithm , 1979, IEEE Trans. Commun..
[6] P. Barth,et al. A compact, scalable cross-connect switch using total internal reflection due to thermally-generated bubbles , 1998, Conference Proceedings. LEOS'98. 11th Annual Meeting. IEEE Lasers and Electro-Optics Society 1998 Annual Meeting (Cat. No.98CH36243).
[7] Bin Wu,et al. Minimizing internal speedup for performance guaranteed optical packet switches , 2004, IEEE Global Telecommunications Conference, 2004. GLOBECOM '04..
[8] Mounir Hamdi,et al. On scheduling optical packet switches with reconfiguration delay , 2003, IEEE J. Sel. Areas Commun..