Shared-memory optical packet (ATM) switch

Previously, we determined fundamental performance limitations associated with `all-optical' packet switches, in which the packet buffering is implemented via fiber delay lines. In this work, we propose and analyze an optical packet (ATM) switch architecture that comes close to achieving the optimal performance (i.e., best possible delay-throughput performance and minimal possible buffer requirements) of a random-access, shared-memory design. The proposed Shared-Memory Optical Packet (SMOP) Switch buffers packets in recirculation delay lines of appropriately-selected lengths, and uses a novel control algorithm that: (i) keeps packets in their proper first-in, first-out sequence, (ii) supports multiple levels of priority traffic, (iii) minimizes the needed number of recirculation loops (which reduces the size of the switch fabric), and (iv) ensures that packets pass through the recirculation delay lines only a small number of times (e.g., less than 10).

[1]  Mark J. Karol Queuing in optical packet switches , 1992, Other Conferences.

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

[3]  Mark J. Karol,et al.  Queueing in high-performance packet switching , 1988, IEEE J. Sel. Areas Commun..

[4]  Lars Dittmann,et al.  Statistical multiplexing of identical bursty sources in an ATM network , 1988, IEEE Global Telecommunications Conference and Exhibition. Communications for the Information Age.

[5]  David M. Lucantoni,et al.  Buffer sizing for synchronous self‐routeing broadband packet switches with bursty traffic , 1989 .