Optimal algorithms for the batch scheduling problem in OBS networks

Authors:
Gustavo B. Figueiredo;Eduardo Candido Xavier;Nelson L. S. Da Fonseca
Affiliations:
Department of Computer Science, Federal University of Bahia, Brazil;Institute of Computing, University of Campinas, Brazil;Institute of Computing, University of Campinas, Brazil
Venue:
Computer Networks: The International Journal of Computer and Telecommunications Networking
Year:
2012

Citing 12
Cited 0

Scheduling jobs with fixed start and end times

Discrete Applied Mathematics
An optimal greedy heuristic to color interval graphs

Information Processing Letters
Terabit burst switching

Journal of High Speed Networks - Special issue on optical networking
Schedule burst proactively for optical burst switched networks

Computer Networks: The International Journal of Computer and Telecommunications Networking
Algorithms in c, part 5: graph algorithms, third edition

Algorithms in c, part 5: graph algorithms, third edition
Impact of setup message processing and optical switch configuration times on the performance of IP over optical burst switching networks

ISCIS'05 Proceedings of the 20th international conference on Computer and Information Sciences
Batch scheduling algorithms for optical burst switching networks

NETWORKING'05 Proceedings of the 4th IFIP-TC6 international conference on Networking Technologies, Services, and Protocols; Performance of Computer and Communication Networks; Mobile and Wireless Communication Systems
Control architecture in optical burst-switched WDM networks

IEEE Journal on Selected Areas in Communications
Prioritized burst segmentation and composite burst-assembly techniques for QoS support in optical burst-switched networks

IEEE Journal on Selected Areas in Communications
FRR for latency reduction and QoS provisioning in OBS networks

IEEE Journal on Selected Areas in Communications
Efficient burst scheduling algorithms in optical burst-switched networks using geometric techniques

IEEE Journal on Selected Areas in Communications
Optical burst switching: a new area in optical networking research

IEEE Network: The Magazine of Global Internetworking

Quantified Score

Hi-index	0.00

Visualization

Abstract

This paper introduces optimal batch scheduling algorithms for the problem of scheduling batches of bursts in optical burst switching networks. The problem is modelled as a job scheduling problem with identical machines. The consideration of previously scheduled bursts in the scheduling allows such modeling. Two optimal algorithms with polynomial time complexity are derived and evaluated. Results show that the algorithm that allows re-scheduling of previously scheduled bursts leads to preferred solutions. Moreover, an extended version of the JET reservation protocol is proposed for efficient handling of batches of bursts. Results obtained via simulation prove the superior performance of the BATCHOPT algorithm.