Guaranteed scheduling for switches with configuration overhead

We present three algorithms that provide- performance guarantees for scheduling switches, such as optical switches, with configuration overhead. Each algorithm emulates an unconstrained (zero overhead) switch by accumulating a batch of configuration requests and generating a corresponding schedule for a constrained switch. Speedup is required both to cover the configuration overhead of the switch and to compensate for empty slots left by the scheduling algorithm. Scheduling algorithms are characterized by the number of configurations, N/sub s/, they require to cover a batch of requests, and the speedup required to compensate for empty slots, S/sub min/. We show that a well known exact matching algorithm, EXACT, leaves no empty slots (i.e. S/sub min/=1), but requires N/sub s//spl ap/N/sup 2/ configurations for an N-port switch leading to high overhead or large batches and hence high delay. We present two new algorithms that reduce the number of configurations required substantially. MIN covers a batch of requests in the minimum possible number of configurations, N/sub s/=N, but at the expense of many empty slots, S/sub min//spl ap/4log/sub 2/ N. DOUBLE strikes a balance, requiring twice as many configurations, N/sub s/=2N, while reducing the number of empty slots so that S/sub min/=2. We show that DOUBLE offers the lowest required speedup to emulate an unconstrained switch across a wide range of port count and delay.

[1]  A. Hoffman,et al.  The variation of the spectrum of a normal matrix , 1953 .

[2]  N. S. Mendelsohn,et al.  On an Algorithm of G. Birkhoff Concerning Doubly Stochastic Matrices , 1960, Canadian Mathematical Bulletin.

[3]  Ronald L. Graham,et al.  Bounds on Multiprocessing Timing Anomalies , 1969, SIAM Journal of Applied Mathematics.

[4]  Teofilo F. Gonzalez,et al.  Open Shop Scheduling to Minimize Finish Time , 1976, JACM.

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

[6]  T. Inukai,et al.  An Efficient SS/TDMA Time Slot Assignment Algorithm , 1979, IEEE Trans. Commun..

[7]  Richard Cole,et al.  On Edge Coloring Bipartite Graphs , 1980, SIAM J. Comput..

[8]  Chak-Kuen Wong,et al.  Minimizing the Number of Switchings in an SS/TDMA System , 1985, IEEE Trans. Commun..

[9]  David B. Shmoys,et al.  Improved approximation algorithms for shop scheduling problems , 1991, SODA '91.

[10]  Minghua Chen,et al.  A conflict-free protocol for optical WDMA networks , 1991, IEEE Global Telecommunications Conference GLOBECOM '91: Countdown to the New Millennium. Conference Record.

[11]  Aura Ganz,et al.  A time-wavelength assignment algorithm for a WDM star network , 1992, [Proceedings] IEEE INFOCOM '92: The Conference on Computer Communications.

[12]  Vitaly A. Strusevich,et al.  Two machine open shop scheduling problem with setup, processing and removal times separated , 1993, Comput. Oper. Res..

[13]  Galen H. Sasaki,et al.  Scheduling transmissions in WDM broadcast-and-select networks , 1994, TNET.

[14]  Dorit S. Hochba,et al.  Approximation Algorithms for NP-Hard Problems , 1997, SIGA.

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

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

[17]  Gerhard J. Woeginger,et al.  Makespan minimization in open shops: A polynomial time approximation scheme , 1998, Math. Program..

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

[19]  Zhen Liu,et al.  SCHEDULING OF AN INPUT-QUEUED SWITCH TO ACHIEVE MAXIMAL THROUGHPUT , 2000 .

[20]  Leandros Tassiulas,et al.  Reduced Complexity Input Buffered Switches , 2000 .

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

[22]  Cheng-Shang Chang,et al.  Birkhoff-von Neumann input buffered crossbar switches , 2000, Proceedings IEEE INFOCOM 2000. Conference on Computer Communications. Nineteenth Annual Joint Conference of the IEEE Computer and Communications Societies (Cat. No.00CH37064).

[23]  Rajiv Ramaswami,et al.  MEMS technology for optical networking applications , 2001, IEEE Commun. Mag..