Batch scheduling algorithms for optical burst switching networks

Ayman Kaheel, Hussein Alnuweiri

Research output: Contribution to journalConference article

6 Citations (Scopus)

Abstract

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.

Original languageEnglish
Pages (from-to)90-101
Number of pages12
JournalLecture Notes in Computer Science
Volume3462
Publication statusPublished - 26 Sep 2005
Externally publishedYes

Fingerprint

Batch Scheduling
Optical burst switching
Reservation
Switching networks
Scheduling algorithms
Scheduler
Burst
Scheduling Algorithm
Batch
Wavelength
Blocking Probability
Blocking probability
Discrete event simulation
Discrete Event Simulation
Simulation Model
Maximise
Heuristics
Upper bound
Decrease
Processing

ASJC Scopus subject areas

  • Theoretical Computer Science
  • Computer Science(all)

Cite this

Batch scheduling algorithms for optical burst switching networks. / Kaheel, Ayman; Alnuweiri, Hussein.

In: Lecture Notes in Computer Science, Vol. 3462, 26.09.2005, p. 90-101.

Research output: Contribution to journalConference article

@article{22511bd935df4415b363d1415de2b4ea,
title = "Batch scheduling algorithms for optical burst switching networks",
abstract = "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.",
author = "Ayman Kaheel and Hussein Alnuweiri",
year = "2005",
month = "9",
day = "26",
language = "English",
volume = "3462",
pages = "90--101",
journal = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",
issn = "0302-9743",
publisher = "Springer Verlag",

}

TY - JOUR

T1 - Batch scheduling algorithms for optical burst switching networks

AU - Kaheel, Ayman

AU - Alnuweiri, Hussein

PY - 2005/9/26

Y1 - 2005/9/26

N2 - 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.

AB - 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.

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

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

M3 - Conference article

AN - SCOPUS:24944531346

VL - 3462

SP - 90

EP - 101

JO - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

JF - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

SN - 0302-9743

ER -