QoS parallel incremental scheduling for optical pseudo-Banyan packet switching system

Abstract

In this paper, we propose a QoS parallel incremental scheduling (QPIS) algorithm for a variant of an earlier-proposed 10-Gb/s QoS optical packet switching system. The variant system consists of optical pseudo-Banyan space switches, a handful of fiber-delay-line (FDL)-based optical buffers, and four-wave-mixing (FWM) wavelength converters. The QPIS minimizes the loss probability for high-priority packets while maximizing system throughput and satisfying two constraints (switch-contention free, and buffer-contention free). Most notably, we prove that QPIS is incremental, i.e., the computed packet sets within each time slot are monotonically non-decreasing, and then derive the computational complexity. From simulation results that pit the QPIS algorithm against two other sequential algorithms, we show that QPIS outperforms these algorithms on packet loss probability, QoS differentiation, and computational complexity.