Wavelength scheduling algorithms with delayed acceptance for optical burst switching networks

Ayman Kaheel, Hussein Alnuweiri

Research output: Contribution to journalConference article

Abstract

In typical Optical Burst Switching (OBS) networks a reservation request is either accepted or rejected as soon as it is presented to the employed wavelength scheduling algorithm. This paper proposes a class of wavelength scheduling algorithms that 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 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 period, 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 novel heuristic batch scheduling algorithms. Simulation results suggest that batch schedulers could decrease the blocking probability by 25% compared to the best previously known wavelength scheduling algorithm.

Original languageEnglish
Article number1556930
Pages (from-to)290-295
Number of pages6
JournalCanadian Conference on Electrical and Computer Engineering
Volume2005
DOIs
Publication statusPublished - 1 Dec 2005
Externally publishedYes

Fingerprint

Optical burst switching
Switching networks
Scheduling algorithms
Wavelength
Blocking probability
Processing

Keywords

  • Blocking probability
  • Optical burst switching
  • Wavelength scheduling

ASJC Scopus subject areas

  • Hardware and Architecture
  • Electrical and Electronic Engineering

Cite this

Wavelength scheduling algorithms with delayed acceptance for optical burst switching networks. / Kaheel, Ayman; Alnuweiri, Hussein.

In: Canadian Conference on Electrical and Computer Engineering, Vol. 2005, 1556930, 01.12.2005, p. 290-295.

Research output: Contribution to journalConference article

@article{f8c4017f395147bb81b33bc49645c717,
title = "Wavelength scheduling algorithms with delayed acceptance for optical burst switching networks",
abstract = "In typical Optical Burst Switching (OBS) networks a reservation request is either accepted or rejected as soon as it is presented to the employed wavelength scheduling algorithm. This paper proposes a class of wavelength scheduling algorithms that 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 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 period, 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 novel heuristic batch scheduling algorithms. Simulation results suggest that batch schedulers could decrease the blocking probability by 25{\%} compared to the best previously known wavelength scheduling algorithm.",
keywords = "Blocking probability, Optical burst switching, Wavelength scheduling",
author = "Ayman Kaheel and Hussein Alnuweiri",
year = "2005",
month = "12",
day = "1",
doi = "10.1109/CCECE.2005.1556930",
language = "English",
volume = "2005",
pages = "290--295",
journal = "Canadian Conference on Electrical and Computer Engineering",
issn = "0840-7789",
publisher = "Institute of Electrical and Electronics Engineers Inc.",

}

TY - JOUR

T1 - Wavelength scheduling algorithms with delayed acceptance for optical burst switching networks

AU - Kaheel, Ayman

AU - Alnuweiri, Hussein

PY - 2005/12/1

Y1 - 2005/12/1

N2 - In typical Optical Burst Switching (OBS) networks a reservation request is either accepted or rejected as soon as it is presented to the employed wavelength scheduling algorithm. This paper proposes a class of wavelength scheduling algorithms that 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 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 period, 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 novel heuristic batch scheduling algorithms. Simulation results suggest that batch schedulers could decrease the blocking probability by 25% compared to the best previously known wavelength scheduling algorithm.

AB - In typical Optical Burst Switching (OBS) networks a reservation request is either accepted or rejected as soon as it is presented to the employed wavelength scheduling algorithm. This paper proposes a class of wavelength scheduling algorithms that 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 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 period, 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 novel heuristic batch scheduling algorithms. Simulation results suggest that batch schedulers could decrease the blocking probability by 25% compared to the best previously known wavelength scheduling algorithm.

KW - Blocking probability

KW - Optical burst switching

KW - Wavelength scheduling

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

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

U2 - 10.1109/CCECE.2005.1556930

DO - 10.1109/CCECE.2005.1556930

M3 - Conference article

AN - SCOPUS:33751347145

VL - 2005

SP - 290

EP - 295

JO - Canadian Conference on Electrical and Computer Engineering

JF - Canadian Conference on Electrical and Computer Engineering

SN - 0840-7789

M1 - 1556930

ER -