Evaluation of a MULTIFIT-based scheduling algorithm
Journal of Algorithms
Parallel machines scheduling with nonsimultaneous machine available time
Discrete Applied Mathematics
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)
SIGCOMM '97 Proceedings of the ACM SIGCOMM '97 conference on Applications, technologies, architectures, and protocols for computer communication
The worst-case analysis of the MULTIFIT algorithm for scheduling nonsimultaneous parallel machines
Discrete Applied Mathematics
Computers and Intractability: A Guide to the Theory of NP-Completeness
Computers and Intractability: A Guide to the Theory of NP-Completeness
A Genetic Algorithm for Multiprocessor Scheduling
IEEE Transactions on Parallel and Distributed Systems
Scheduling: Theory, Algorithms, and Systems
Scheduling: Theory, Algorithms, and Systems
IEEE Communications Magazine
On analyzing the capacity of WDM PONs
GLOBECOM'09 Proceedings of the 28th IEEE conference on Global telecommunications
INFOCOM'96 Proceedings of the Fifteenth annual joint conference of the IEEE computer and communications societies conference on The conference on computer communications - Volume 3
Efficient transport of packets with QoS in an FSAN-aligned GPON
IEEE Communications Magazine
Bandwidth allocation for multiservice access on EPONs
IEEE Communications Magazine
IEEE Communications Magazine
WDM Ethernet passive optical networks
IEEE Communications Magazine
An introduction to PON technologies [Topics in Optical Communications]
IEEE Communications Magazine
PON in adolescence: from TDMA to WDM-PON
IEEE Communications Magazine
FTTx: Current Status and the Future
IEEE Communications Magazine
IEEE Journal on Selected Areas in Communications
| Hi-index | 0.00 |
Owing to the high bandwidth provisioning, hybrid wavelength division multiplexing/time division multiplexing (WDM/TDM) passive optical network (PON) is becoming an attractive future-proof access network solution. In hybrid WDM/TDM PON, tunable lasers are potential candidate light sources attributed to their multiwavelength provisioning capability and color-free property. Currently, the laser tuning time ranges from a few tens of nanoseconds to seconds, or even minutes, depending on the adopted technology. Different laser tuning time may introduce different network performance. To achieve small packet delay and ensure fairness, the schedule length for given optical network unit (ONU) requests is desired to be as short as possible. This paper illustrates contributions in four main aspects. First, we show that both preemptive and nonpreemptive scheduling problems with the objective of minimizing the schedule length are NP-hard when the laser tuning time is nonzero. Second, we present a heuristic preemptive scheduling algorithm with an approximation factor of at most 2 and a heuristic nonpreemptive scheduling algorithm with an approximation factor of at most 2 - 1/m, where m is the number of wavelengths. Third, extensive simulations have been conducted, and simulation results show that our proposed algorithms, which consider laser tuning time, achieve significantly better performances as compared to algorithms that are directly derived from existing algorithms without considering laser tuning time. Fourth, since the scheduling in one cycle is related to that in the last cycle, we provide some discussions on the scheduling in multiple cycles.