COD: alternative architectures for high speed packet switching
IEEE/ACM Transactions on Networking (TON)
High-speed buffer management for 40 Gb/s-based photonic packet switches
IEEE/ACM Transactions on Networking (TON)
A novel node architecture for optical networks: Modeling, analysis and performance evaluation
Computer Communications
Constructions of Optical 2-to-1 FIFO Multiplexers With a Limited Number of Recirculations
IEEE Transactions on Information Theory
Techniques for optical packet switching and optical burst switching
IEEE Communications Magazine
Shared fiber delay line buffers in asynchronous optical packet switches
IEEE Journal on Selected Areas in Communications - Part Supplement
IEEE Journal on Selected Areas in Communications - Part Supplement
Packet Prioritization in Multihop Latency Aware Scheduling for Delay Constrained Communication
IEEE Journal on Selected Areas in Communications
An analytical model for input-buffered optical packet switches with reconfiguration overhead
Photonic Network Communications
An analytical model for all-optical packet switching networks with finite FDL buffers
Photonic Network Communications
| Hi-index | 0.00 |
Optical buffers implemented by fiber delay lines (FDLs) have a volatile nature due to signal loss and noise accumulation. Packets suffer from excessive recirculation through FDLs, and they may be dropped eventually in their routing paths. Because of this, packet scheduling becomes more difficult in FDL buffers than in RAM buffers, and requires additional design considerations for reducing packet loss. We propose a latency-aware scheduling scheme and an analytical model for all-optical packet switching networks with FDL buffers. The latency-aware scheduling scheme is intended to minimize the packet loss rate of the networks by ranking packets in the optimal balance between latency and residual distance. The analytical model is based on non-homogeneous Markovian analysis to study the effect of the proposed scheduling scheme on packet loss rate and average delay. Furthermore, our numerical results show how various network parameters affect the optimal balance. We demonstrate quantitatively how to achieve the proper balance between latency and residual distance so that the network performance can be improved significantly. For instance, we find that under a given latency limit and light traffic load our scheduling scheme achieves a packet loss rate 71% lower than a scheduling scheme that ranks packets simply based on latency.