T-WAS and T-XAS algorithms for fiber-loop optical buffers

In optical packet/burst switched networks fiber loops provide a viable and compact means of contention resolution. For fixed size packets it is known that a basic void-avoiding schedule (VAS) can vastly outperform a more classical pre-reservation algorithm as FCFS. For the setting of a uniform distributed packet size and a restricted buffer size we proposed two novel forward-looking algorithms, WAS and XAS, that, in specific settings, outperform VAS up to 20% in terms of packet loss. This contribution extends the usage and improves the performance of the WAS and XAS algorithms by introducing an additional threshold variable. By optimizing this threshold, the process of selectively delaying packet longer than strictly necessary can be made more or less strict and as such be fitted to each setting. By Monte Carlo simulation it is shown that the resulting T-WAS and T-XAS algorithms are most effective for those instances where the algorithms without threshold can offer no or only limited performance improvement

Analytical MMAP-based bounds for packet loss in optical packet switching with recirculating FDL buffers

The major goal of Optical Packet Switching (OPS) is to match switching technology to the huge capacities provided by (D)WDM. A crucial issue in packet switched networks is the avoidance of packet losses stemming from contention. In OPS, contention can be solved using a combination of exploitation of the wavelength domain (through wavelength conversion) and bu#ering. To provide optical bu#ering, Fibre Delay Lines (FDLs) are used