Coordinated multihop scheduling: a framework for end-to-end services
IEEE/ACM Transactions on Networking (TON)
A performance model for an asynchronous optical buffer
Performance Evaluation - Performance 2005
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
A Frame-Based Architecture with Shared Buffers for Slotted Optical Packet Switching
HPCC '09 Proceedings of the 2009 11th IEEE International Conference on High Performance Computing and Communications
A latency-aware scheduling algorithm for all-optical packet switching networks with FDL buffers
Photonic Network Communications
Constructions of Optical 2-to-1 FIFO Multiplexers With a Limited Number of Recirculations
IEEE Transactions on Information Theory
Advances in photonic packet switching: an overview
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
Queueing in high-performance packet switching
IEEE Journal on Selected Areas in Communications
Heuristic performance model of optical buffers for variable length packets
Photonic Network Communications
| Hi-index | 0.00 |
Signal loss and noise accumulation can cause fading in optical buffers implemented by fiber delay lines (FDLs). Optical packets that excessively recirculate through FDLs are easily dropped from their routing paths. Therefore, analytical models and packet scheduling schemes require additional considerations for FDL buffers. This work proposes an analytical model for all-optical packet switching networks with finite FDL buffers and a general class of scheduling schemes including many basic scheduling schemes. We intend to minimize the packet loss probability by ranking packets to achieve an optimal balance between latency and residual lifetime in the general class of scheduling schemes. The analytical model is based on a non-homogeneous Markovian analysis to study the effects of various scheduling schemes on packet loss probability and average latency. Analytical results show how various network parameters affect the optimal balance, and illustrate how properly balancing latency and residual distance can significantly improve network performance.