Batch scheduling algorithms

A class of wavelength schedulers in optical burst switching networks

Ayman Kaheel, Hussein Alnuweiri

Research output: Contribution to journalConference article

6 Citations (Scopus)

Abstract

This paper proposes a novel class of wavelength scheduling algorithms in optical burst switching networks. The proposed wavelength scheduling algorithms process a batch of data bursts together instead of processing them one by one. When a control burst with a reservation request arrives to a 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 four novel 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 the blocking probability by 25% compared the best previously known wavelength scheduling algorithm.

Original languageEnglish
Article numberON06-4
Pages (from-to)1713-1719
Number of pages7
JournalIEEE International Conference on Communications
Volume3
Publication statusPublished - 12 Sep 2005
Externally publishedYes

Fingerprint

Optical burst switching
Switching networks
Scheduling algorithms
Wavelength
Blocking probability
Discrete event simulation
Processing

ASJC Scopus subject areas

  • Computer Networks and Communications
  • Electrical and Electronic Engineering

Cite this

Batch scheduling algorithms : A class of wavelength schedulers in optical burst switching networks. / Kaheel, Ayman; Alnuweiri, Hussein.

In: IEEE International Conference on Communications, Vol. 3, ON06-4, 12.09.2005, p. 1713-1719.

Research output: Contribution to journalConference article

@article{ec58e31223174008b543a0e9128ed3d8,
title = "Batch scheduling algorithms: A class of wavelength schedulers in optical burst switching networks",
abstract = "This paper proposes a novel class of wavelength scheduling algorithms in optical burst switching networks. The proposed wavelength scheduling algorithms process a batch of data bursts together instead of processing them one by one. When a control burst with a reservation request arrives to a 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 four novel 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 the blocking probability by 25{\%} compared the best previously known wavelength scheduling algorithm.",
author = "Ayman Kaheel and Hussein Alnuweiri",
year = "2005",
month = "9",
day = "12",
language = "English",
volume = "3",
pages = "1713--1719",
journal = "Conference Record - International Conference on Communications",
issn = "0536-1486",
publisher = "Institute of Electrical and Electronics Engineers Inc.",

}

TY - JOUR

T1 - Batch scheduling algorithms

T2 - A class of wavelength schedulers in optical burst switching networks

AU - Kaheel, Ayman

AU - Alnuweiri, Hussein

PY - 2005/9/12

Y1 - 2005/9/12

N2 - This paper proposes a novel class of wavelength scheduling algorithms in optical burst switching networks. The proposed wavelength scheduling algorithms process a batch of data bursts together instead of processing them one by one. When a control burst with a reservation request arrives to a 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 four novel 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 the blocking probability by 25% compared the best previously known wavelength scheduling algorithm.

AB - This paper proposes a novel class of wavelength scheduling algorithms in optical burst switching networks. The proposed wavelength scheduling algorithms process a batch of data bursts together instead of processing them one by one. When a control burst with a reservation request arrives to a 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 four novel 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 the blocking probability by 25% compared the best previously known wavelength scheduling algorithm.

UR - http://www.scopus.com/inward/record.url?scp=24144466464&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=24144466464&partnerID=8YFLogxK

M3 - Conference article

VL - 3

SP - 1713

EP - 1719

JO - Conference Record - International Conference on Communications

JF - Conference Record - International Conference on Communications

SN - 0536-1486

M1 - ON06-4

ER -