Scheduling jobs with fixed start and end times
Discrete Applied Mathematics
The maximum k-colorable subgraph problem for chordal graphs
Information Processing Letters
Optical burst switching (OBS) - a new paradigm for an optical Internet
Journal of High Speed Networks - Special issue on optical networking
Smallest-last ordering and clustering and graph coloring algorithms
Journal of the ACM (JACM)
A new analytical model for computing blocking probability in optical burst switching networks
ISCC '04 Proceedings of the Ninth International Symposium on Computers and Communications 2004 Volume 2 (ISCC"04) - Volume 02
Control architecture in optical burst-switched WDM networks
IEEE Journal on Selected Areas in Communications
An optimal batch scheduling algorithm for OBS networks
GLOBECOM'09 Proceedings of the 28th IEEE conference on Global telecommunications
Optimal algorithms for the batch scheduling problem in OBS networks
Computer Networks: The International Journal of Computer and Telecommunications Networking
| Hi-index | 0.00 |
Previously proposed wavelength scheduling algorithms in optical burst switching networks process each reservation request individually and in a greedy manner. In this paper we propose a new family of wavelength scheduling algorithms that process a batch of reservation requests together instead of processing them one by one. When a control burst with a reservation request arrives to a free batch scheduler, the scheduler waits for a small amount of time, called the acceptance delay, before deciding to accept or reject the reservation request. After the acceptance delay has passed, the scheduler processes all the reservation requests that have arrived during the acceptance delay, then it accepts the requests that will maximize the utilization of the wavelength channels. We describe an optimal batch scheduler that serves as an upper bound on the performance of batch scheduling algorithms. Furthermore, we introduce two heuristic batch scheduling algorithms. The performance of the proposed algorithms is evaluated using a discrete-event simulation model. Simulation results suggest that batch schedulers could decrease the blocking probability by 25% compared to the best previously known wavelength scheduling algorithm.