The analysis of random polling systems
Operations Research
A single-server queue with vacations and non-gated time-limited service
Performance Evaluation
The iSLIP scheduling algorithm for input-queued switches
IEEE/ACM Transactions on Networking (TON)
Discrete-Time Models for Communication Systems Including ATM
Discrete-Time Models for Communication Systems Including ATM
Analysis of multi-server queue with a single vacation (e, d)-policy
Performance Evaluation
Minimizing internal speedup for performance guaranteed switches with optical fabrics
IEEE/ACM Transactions on Networking (TON)
Bandwidth guaranteed multicast scheduling for virtual output queued packet switches
Journal of Parallel and Distributed Computing
A latency-aware scheduling algorithm for all-optical packet switching networks with FDL buffers
Photonic Network Communications
Stochastic decompositions in the M/M/1 queue with working vacations
Operations Research Letters
Optical switching technology comparison: optical MEMS vs. other technologies
IEEE Communications Magazine
On scheduling optical packet switches with reconfiguration delay
IEEE Journal on Selected Areas in Communications
Hi-index | 0.00 |
The overhead associated with reconfiguring a switch fabric in optical packet switches is an important issue in relation to the packet transmission time and can adversely affect switch performance. The reconfiguration overhead increases the mean waiting time of packets and reduces throughput. The scheduling of packets must take into account the reconfiguration frequency. This work proposes an analytical model for input-buffered optical packet switches with the reconfiguration overhead and analytically finds the optimal reconfiguration frequency that minimizes the mean waiting time of packets. The analytical model is suitable for several round-robin (RR) scheduling schemes in which only non-empty virtual output queues (VOQs) are served or all VOQs are served and is used to examine the effects of the RR scheduling schemes and various network parameters on the mean waiting time of packets. Quantitative examples demonstrate that properly balancing the reconfiguration frequency can effectively reduce the mean waiting time of packets.