Scheduling transmissions in WDM broadcast-and-select networks
IEEE/ACM Transactions on Networking (TON)
Efficient scheduling of transmissions in optical broadcast networks
IEEE/ACM Transactions on Networking (TON)
Optimal transmission schedules in TWDM optical passive star networks
Discrete Applied Mathematics
Packet scheduling in broadcast WDM networks with arbitrary transceiver tuning latencies
IEEE/ACM Transactions on Networking (TON)
Open Shop Scheduling to Minimize Finish Time
Journal of the ACM (JACM)
Optimal transmission schedule in WDM optimal networks with multiple transmitters and receivers
Journal of High Speed Networks
Optical WDM Networks: Principles and Practice
Optical WDM Networks: Principles and Practice
Optimal Scheduling Algorithms in WDM Optical Passive Star Networks
Proceedings of the 11 IPPS/SPDP'99 Workshops Held in Conjunction with the 13th International Parallel Processing Symposium and 10th Symposium on Parallel and Distributed Processing
Hi-index | 0.00 |
Packet scheduling provides a way to reduce routing control and guarantees overall throughput. An interesting special case of the packet scheduling is all-to-all broadcast in which every transmitter and receiver pair has exactly one packet to be transferred. Several optimal scheduling algorithms have been proposed for the all-to-all broadcast problem in wavelength division multiplexed (WDM) optical star networks. However, these algorithms do not fit anymore when failures occur in some transceivers. In this paper, we consider the all-to-all broadcast problem in WDM optical star network with some breakdown or power-off transceivers. We focus on the all-optical scheduling problem where the traffic reaches its destination in single-hop without being converted to electronic form for reaching high data transmission rates. The transmitters are tunable with an associated tuning delay, and the receivers are fixed-tuned to one of the available wavelengths. In this model, we first identify the lower bounds of the scheduling length for the problem. Then, we propose single-hop scheduling algorithms to find the optimal solution in both terms of arbitrary number of wavelengths and value of tuning latency.