Frame-based matching algorithms for optical switches

Virtual output queuing is widely used by fixed-length high-speed electronic switches to overcome head-of-line blocking. This is done by means of matching algorithms. These matching algorithms have typically been cell-based. That is, in every time slot, a new matching set is calculated and the switch fabric is updated to connect matched inputs and outputs. Fabric reconfiguration in an optical switch is not as fast as in an electronic switch. During reconfiguration, no data can be transferred. Given this overhead, it is not efficient to update connections between inputs and outputs for every time slot. We present frame-based matching algorithms for optical packet switches, so that connections can be updated less frequently to reduce the bandwidth loss. The implementation complexity and performance of these schemes are studied.

[1]  Cheng-Shang Chang,et al.  Load balanced Birkhoff-von Neumann switches, part I: one-stage buffering , 2002, Computer Communications.

[2]  H. Jonathan Chao,et al.  On the performance of a dual round-robin switch , 2001, Proceedings IEEE INFOCOM 2001. Conference on Computer Communications. Twentieth Annual Joint Conference of the IEEE Computer and Communications Society (Cat. No.01CH37213).

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

[4]  Nick McKeown,et al.  A practical scheduling algorithm to achieve 100% throughput in input-queued switches , 1998, Proceedings. IEEE INFOCOM '98, the Conference on Computer Communications. Seventeenth Annual Joint Conference of the IEEE Computer and Communications Societies. Gateway to the 21st Century (Cat. No.98.

[5]  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.

[6]  Samuel P. Morgan,et al.  Input Versus Output Queueing on a Space-Division Packet Switch , 1987, IEEE Trans. Commun..

[7]  Nick McKeown,et al.  Scheduling algorithms for input-queued cell switches , 1996 .

[8]  Thomas E. Anderson,et al.  High-speed switch scheduling for local-area networks , 1993, TOCS.

[9]  Shivendra S. Panwar,et al.  The dual round robin matching switch with exhaustive service , 2002, Workshop on High Performance Switching and Routing, Merging Optical and IP Technologie.

[10]  Cheng-Shang Chang,et al.  Load balanced Birkhoff-von Neumann switches, part II: multi-stage buffering , 2002, Comput. Commun..

[11]  Leandros Tassiulas,et al.  Linear complexity algorithms for maximum throughput in radio networks and input queued switches , 1998, Proceedings. IEEE INFOCOM '98, the Conference on Computer Communications. Seventeenth Annual Joint Conference of the IEEE Computer and Communications Societies. Gateway to the 21st Century (Cat. No.98.

[12]  H. Jonathan Chao,et al.  Saturn: a terabit packet switch using dual round-robin , 2000, Globecom '00 - IEEE. Global Telecommunications Conference. Conference Record (Cat. No.00CH37137).

[13]  Leandros Tassiulas,et al.  Stability properties of constrained queueing systems and scheduling policies for maximum throughput in multihop radio networks , 1992 .

[14]  Devavrat Shah,et al.  Delay bounds for approximate maximum weight matching algorithms for input queued switches , 2002, Proceedings.Twenty-First Annual Joint Conference of the IEEE Computer and Communications Societies.

[15]  Nick McKeown,et al.  The iSLIP scheduling algorithm for input-queued switches , 1999, TNET.

[16]  Jean C. Walrand,et al.  Achieving 100% throughput in an input-queued switch , 1996, Proceedings of IEEE INFOCOM '96. Conference on Computer Communications.

[17]  Andrea Bianco,et al.  Frame-based matching algorithms for input-queued switches , 2002, Workshop on High Performance Switching and Routing, Merging Optical and IP Technologie.

[18]  Leonard Kleinrock,et al.  The Analysis of Random Polling Systems , 1988, Oper. Res..

[19]  Robert E. Tarjan,et al.  Data structures and network algorithms , 1983, CBMS-NSF regional conference series in applied mathematics.

[20]  Igal Brener,et al.  MEMS for optical communication: present and future , 2002, SPIE ITCom.

[21]  Nick McKeown,et al.  Maintaining packet order in two-stage switches , 2002, Proceedings.Twenty-First Annual Joint Conference of the IEEE Computer and Communications Societies.

[22]  H. Jonathan Chao,et al.  Performance analysis of a dual round robin matching switch with exhaustive service , 2002, Global Telecommunications Conference, 2002. GLOBECOM '02. IEEE.

[23]  Gregory F. Pfister,et al.  “Hot spot” contention and combining in multistage interconnection networks , 1985, IEEE Transactions on Computers.

[24]  Marco Ajmone Marsan,et al.  On the stability of input-buffer cell switches with speed-up , 2000, Proceedings IEEE INFOCOM 2000. Conference on Computer Communications. Nineteenth Annual Joint Conference of the IEEE Computer and Communications Societies (Cat. No.00CH37064).

[25]  Balaji Prabhakar,et al.  The throughput of data switches with and without speedup , 2000, Proceedings IEEE INFOCOM 2000. Conference on Computer Communications. Nineteenth Annual Joint Conference of the IEEE Computer and Communications Societies (Cat. No.00CH37064).