NXG05-6: Minimum Delay Scheduling in Scalable Hybrid Electronic/Optical Packet Switches

A hybrid electronic/optical packet switch consists of electronically buffered line-cards interconnected by an optical switch fabric. It provides a scalable switch architecture for next generation high-speed routers. Due to the non-negligible switch reconfiguration overhead, many packet scheduling algorithms are invented to ensure performance guaranteed switching (i.e. 100% throughput with bounded packet delay), at the cost of speedup. In particular, minimum delay performance can be achieved if an algorithm can always find a schedule of no more than N configurations for any input traffic matrix, where N is the switch size. Various minimum delay scheduling algorithms (MIN, alphai-SCALE and QLEF) are proposed. Among them, QLEF requires the lowest speedup bound. In this paper, we show that the existing speedup bound for QLEF is not tight enough. A new bound which is 10% lower than the existing one is derived.

[1]  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).

[2]  Nick McKeown,et al.  Scaling internet routers using optics , 2003, SIGCOMM '03.

[3]  Richard M. Karp,et al.  A n^5/2 Algorithm for Maximum Matchings in Bipartite Graphs , 1971, SWAT.

[4]  O. Spahn,et al.  GaAs-based microelectromechanical waveguide switch , 2000, 2000 IEEE/LEOS International Conference on Optical MEMS (Cat. No.00EX399).

[5]  Y. Ito,et al.  Analysis of a switch matrix for an SS/TDMA system , 1977, Proceedings of the IEEE.

[6]  Hung-Hsiang Jonathan Chao,et al.  Next generation routers , 2002, Proc. IEEE.

[7]  Lih Y. Lin,et al.  Free-space micromachined optical switches with submillisecond switching time for large-scale optical crossconnects , 1998, IEEE Photonics Technology Letters.

[8]  Richard M. Karp,et al.  A n^5/2 Algorithm for Maximum Matchings in Bipartite Graphs , 1971, SWAT.

[9]  Nicholas Bambos,et al.  Scheduling bursts in time-domain wavelength interleaved networks , 2003, IEEE J. Sel. Areas Commun..

[10]  Bin Wu,et al.  Minimizing internal speedup for performance guaranteed optical packet switches , 2004, IEEE Global Telecommunications Conference, 2004. GLOBECOM '04..

[11]  Bin Wu,et al.  Scheduling optical packet switches with minimum number of configurations , 2005, IEEE International Conference on Communications, 2005. ICC 2005. 2005.

[12]  Hai Liu,et al.  Maximal lifetime scheduling in sensor surveillance networks , 2005, Proceedings IEEE 24th Annual Joint Conference of the IEEE Computer and Communications Societies..

[13]  A. Agranat.  Electroholographic wavelength selective crossconnect , 1999, 1999 Digest of the LEOS Summer Topical Meetings: Nanostructures and Quantum Dots/WDM Components/VCSELs and Microcavaties/RF Photonics for CATV and HFC Systems (Cat. No.99TH8455).

[14]  Lih Y. Lin.  Micromachined free-space matrix switches with submillisecond switching time for large-scale optical crossconnect , 1998 .

[15]  Leandros Tassiulas,et al.  Scheduling algorithms for optical packet fabrics , 2003, IEEE J. Sel. Areas Commun..

[16]  William J. Dally,et al.  Guaranteed scheduling for switches with configuration overhead , 2002, Proceedings.Twenty-First Annual Joint Conference of the IEEE Computer and Communications Societies.

[17]  Bin Wu,et al.  Traffic scheduling in non-blocking optical packet switches with minimum delay , 2005, GLOBECOM '05. IEEE Global Telecommunications Conference, 2005..