Packet-mode emulation of output-queued switches
Proceedings of the eighteenth annual ACM symposium on Parallelism in algorithms and architectures
A Novel Photonic Container Switched Architecture and Scheduler to Design the Core Transport Network
IEEE Transactions on Computers
Combining aggregation and scheduling using an iterative maximal weight matching switch scheduler
ICCOM'07 Proceedings of the 11th Conference on 11th WSEAS International Conference on Communications - Volume 11
Minimizing internal speedup for performance guaranteed switches with optical fabrics
IEEE/ACM Transactions on Networking (TON)
Parallel switch system with QoS guarantee for real-time traffic
Journal of Computer Science and Technology
A hop-constraint timing assembly algorithm for facilitating iBUS in IP-over-WDM networks
IEEE Communications Letters
Crosstalk-preventing scheduling in AWG-based cell switches
GLOBECOM'09 Proceedings of the 28th IEEE conference on Global telecommunications
Crosstalk-preventing scheduling in single-and two-stage AWG-based cell switches
IEEE/ACM Transactions on Networking (TON)
An analytical model for input-buffered optical packet switches with reconfiguration overhead
Photonic Network Communications
Circuit switching under the radar with REACToR
NSDI'14 Proceedings of the 11th USENIX Conference on Networked Systems Design and Implementation
| Hi-index | 0.08 |
Using optical technology for the design of packet switches/routers offers several advantages such as scalability, high bandwidth, power consumption, and cost. However, reconfiguring the optical fabric of these switches requires significant time under current technology (microelectromechanical system mirrors, tunable elements, bubble switches, etc.). As a result, conventional slot-by-slot scheduling may severely cripple the performance of these optical switches due to the frequent fabric reconfiguration that may entail. A more appropriate way is to use a time slot assignment (TSA) scheduling approach to slow down the scheduling rate. The switch gathers the incoming packets periodically and schedules them in batches, holding each fabric configuration for a period of time. The goal is to minimize the total transmission time, which includes the actual traffic-sending process and the reconfiguration overhead. This optical switch scheduling problem is defined in this paper and proved to be NP-complete. In particular, earlier TSA algorithms normally assume the reconfiguration delay to be either zero or infinity for simplicity. To this end, we propose a practical algorithm, ADJUST, that breaks this limitation and self-adjusts with different reconfiguration delay values. The algorithm runs at O(λN2logN) time complexity and guarantees 100% throughput and bounded worst-case delay. In addition, it outperforms existing TSA algorithms across a large spectrum of reconfiguration values.