Scheduling transmissions in WDM broadcast-and-select networks
IEEE/ACM Transactions on Networking (TON)
Open Shop Scheduling to Minimize Finish Time
Journal of the ACM (JACM)
INFOCOM '95 Proceedings of the Fourteenth Annual Joint Conference of the IEEE Computer and Communication Societies (Vol. 1)-Volume - Volume 1
The effects of tuning time in bandwidth-limited optical broadcast networks
INFOCOM '95 Proceedings of the Fourteenth Annual Joint Conference of the IEEE Computer and Communication Societies (Vol. 1)-Volume - Volume 1
On the Design of Optimal TDM Schedules for Broadcast WDM Networks with Arbitrary Transceiver Tuning Latencies
Efficient scheduling of transmissions in optical broadcast networks
IEEE/ACM Transactions on Networking (TON)
On scheduling all-to-all personalized connections and cost-effective designs in WDM rings
IEEE/ACM Transactions on Networking (TON)
Scheduling of real-time messages in optical broadcast-and-select networks
IEEE/ACM Transactions on Networking (TON)
Optimal Packet Scheduling in Tree-Structured LEO Satellite Clusters
IPDPS '01 Proceedings of the 15th International Parallel & Distributed Processing Symposium
On the All-to-All Broadcast Problem in Optical Networks
INFOCOM '97 Proceedings of the INFOCOM '97. Sixteenth Annual Joint Conference of the IEEE Computer and Communications Societies. Driving the Information Revolution
HiPeR-l: A High Performance Reservation Protocol with look-ahead for Broadcast WDM Networks
INFOCOM '97 Proceedings of the INFOCOM '97. Sixteenth Annual Joint Conference of the IEEE Computer and Communications Societies. Driving the Information Revolution
Optimal packet scheduling in tree-structured LEO satellite clusters
Mobile Networks and Applications
Messages Scheduling for Parallel Data Redistribution between Clusters
IEEE Transactions on Parallel and Distributed Systems
Scheduling hybrid WDM/TDM passive optical networks with nonzero laser tuning time
IEEE/ACM Transactions on Networking (TON)
A distributed real-time MAC protocol for WDM-based LANs
Computer Communications
| Hi-index | 0.00 |
We consider the problem of scheduling packet transmissions in sangle-hop WDM networks, wath tunability provided only at one end Our objective as to design schedules of minimum length for a given traffic demand matrix. The contribution of our work is twofold. First we define a special class of schedules which permit an intuitive formulation of the scheduling problem We then present algorithms which construct schedules of length equal to the lower bound provided that certain optimality conditions are satisfied. We also develop heuristics which, in the general case, give schedules of length equal or very close to the lower bound Secondly, we identify two distinct regions of network operation. In the first region the schedule length is determined by the tuning requirements. while in the second it is determined by the traffic demands. The point which the network switches between the two regions is identified in terms of the number of nodes and channels. and the tuning latency Accordingly, we show that it is possible to appropriately dimension the network fo offset the effects of even large values of tuning latency.