Graphs & digraphs (2nd ed.)
Scheduling transmissions in WDM broadcast-and-select networks
IEEE/ACM Transactions on Networking (TON)
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 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
Pipelined Transmission Scheduling in All-Optical TDM/WDM Rings
IC3N '97 Proceedings of the 6th International Conference on Computer Communications and Networks
A general approach for all-to-all routing in multihop WDM optical networks
IEEE/ACM Transactions on Networking (TON)
A Message Scheduling Scheme for All-to-All Personalized Communication on Ethernet Switched Clusters
IEEE Transactions on Parallel and Distributed Systems
A new scalable optimal topology for multi-hop optical networks
Computer Communications
Technologies and architectures for scalable dynamic dense WDM networks
IEEE Communications Magazine
WDM-based local lightwave networks. II. Multihop systems
IEEE Network: The Magazine of Global Internetworking
Improvement of multi-hop packet transmission scheduling in WDM optical star networks
Computer Communications
Hi-index | 0.24 |
In this paper, we present a multi-hop scheduling algorithm for the All-to-All Broadcast (AAB) problem in Wavelength Division Multiplexed (WDM) optical star networks with N nodes. To decrease the packet delay in packet transmissions, our scheduling algorithm will limit the hop distance to a constant @r. We transfer the @r-hop AAB problem to the Hamiltonian cycles problem and then generate the logical rings for physical packet transmissions. In order to minimize the scheduling length, the problem of selection of logical rings is to minimize the number of tuning operations to reduce the influence of tuning latency @d for the AAB problem. We propose a 2-approximation algorithm that needs only 2@?(N-1)/ @r@? tuning operations in an AAB scheduling. When @r