<title>WDM fiber delay line buffer control for optical packet switching</title>

Abstract

A high-speed optical packet switching node using the WDM all optical switch structure is studied in this paper. Teletra c performance of an optical IP packet router is simulated under the self-similar bursty tra c condition. Four di erent control algorithms are investigated for the performance and complexity. A simple round-robin algorithm cannot attain an acceptable performance. Finding minimum bu er occupancy and sorting the packets by length are methods used to improve the IP router performance.

Variable IP packets buffer management schemes for optical packet switching

“…Therefore, it always outperforms the input-queuing switch architecture that can only achieve 58% throughput due to its head-of-line (HOL) blocking problem [6]. In addition, this switch architecture reduces the complexity of the optical buffers and thus decreases the required number of SOA gates [9].…”

“…Since each FDL can only delay a packet for a fixed time, once a packet is assigned to a particular wavelength and FDL, there is no way to modify its assignment during the delay period. For this reason, an optimal FDL buffering scheme for scheduling the packets is necessary to deal with packet arrivals at the input of the optical packet switch [9]. Note that the controller of Fig 1 does the packet sorting and management of the router [13].…”

“…Callegati et al [8] studied scheduling algorithms for synchronous fixed size packets in a router with re-circulating buffers, while Ge [9] analysed buffering schemes of variable length packets in routers with full sorting capabilities. Turner [10], Tancevski et al [11], and Xiong et al [12] describe the void-filling algorithm for fully asynchronous packet switching showing considerable performance improvement compared with non-void filling approaches.…”

“…Scheduling algorithms for slotted packets and variable length packets in optical packet switching have been studied extensively [8][9][10][11][12]. Callegati et al [8] studied scheduling algorithms for synchronous fixed size packets in a router with re-circulating buffers, while Ge [9] analysed buffering schemes of variable length packets in routers with full sorting capabilities.…”

Buffering management schemes for optical variable length packets under limited packet sorting

“…Scheduling algorithms for slotted packets and variable length packets in OPS have been studied extensively [9][10][11][12][13]. Callegati et al [9] studied scheduling algorithms for synchronous fixed-size packets in a router with re-circulating buffers.…”