Performance evaluation of an optically interconnected "scheduling" switch network for Pareto traffic

Abstract

A performance analysis of an optically interconnected packet-scheduling switch network is presented. The scheduling switch uses a branch of feed-forward delays for each input port, interconnected with elementary optical switches to resolve contention. The scheduling switch is guaranteed to be lossless under a certain smoothness property condition. We investigate the packet-loss performance of the switch when the smoothness property condition does not hold, as well as the packet delay impairments at the edge of a scheduling switch interconnected network when this property is enforced.

Research in optical burst switching within the e-Photon/ONe network of excellence

“…In our model [56], bursts consists of packet slots that arrive during ON periods and which are separated by idle periods (OFF periods). To generate a Paretodistributed sequence of ON periods, we have generated a Pareto-distributed sequence of burst (packet train) sizes, followed by Pareto-distributed idle periods.…”

Efficient burst reservation protocol: a hybrid signaling protocol for efficient burst-level reservations and quality-of-service differentiation in optical burst switching networks

“…Although contention resolution in the wavelength domain is considered as a straightforward process, it poses specific hardware requirements, raising issues such as node scalability, size, and cost. Alternative contention-resolution techniques have been also proposed employing fiber delay line structures [13][14][15] or deflection routing [16]. However, the former is impractical because of the lack of scalable optical buffers, whereas deflection routing affects the network load and cannot guarantee packet arrival in the correct order.…”