Simplified layering and flexible bandwidth with TWIN
Proceedings of the ACM SIGCOMM workshop on Future directions in network architecture
Virtual Fully Connected WDM Network: Architecture, Scheduling and Performance Evaluation
BROADNETS '04 Proceedings of the First International Conference on Broadband Networks
Performance of a distributed scheduling protocol for TWIN
ACM SIGMETRICS Performance Evaluation Review
Combinatorics, Probability and Computing
Performance analysis of a novel traffic scheduling algorithm in slotted optical networks
Computer Communications
Achieving 100% throughput in reconfigurable optical networks
IEEE/ACM Transactions on Networking (TON)
Minimizing internal speedup for performance guaranteed switches with optical fabrics
IEEE/ACM Transactions on Networking (TON)
Wavelength selective devices for WDM communication systems
ANTS'09 Proceedings of the 3rd international conference on Advanced networks and telecommunication systems
A flow-aware MAC protocol for a passive optical metropolitan area network
Proceedings of the 23rd International Teletraffic Congress
| Hi-index | 0.07 |
A time-domain wavelength interleaved network (TWIN) (Widjaja, I. et al., IEEE Commun. Mag., vol.41, 2003) is an optical network with an ultrafast tunable laser and a fixed receiver at each node. We consider the problem of scheduling bursts of data in a TWIN. Due to the high data rates employed on the optical links, the burst transmissions typically last for very short times compared with the round trip propagation times between source-destination pairs. A good schedule should ensure that: 1) there are no transmit/receive conflicts; 2) propagation delays are observed; 3) throughput is maximized (schedule length is minimized). We formulate the scheduling problem with periodic demand as a generalization of the well-known crossbar switch scheduling. We prove that even in the presence of propagation delays, there exist a class of computationally viable scheduling algorithms which asymptotically achieve the maximum throughput obtainable without propagation delays. We also show that any schedule can be rearranged to achieve a factor-two approximation of the maximum throughput even without asymptotic limits. However, the delay/throughput performance of these schedules is limited in practice. We consequently propose a scheduling algorithm that exhibits near optimal (on average within ∼7% of optimum) delay/throughput performance in realistic network examples.