Achieving locally minimal burst blocking in OBS networks with delayed scheduling

Neil Barakat*, Edward H. Sargent

*Corresponding author for this work

Research output: Contribution to conferencePaperpeer-review

1 Scopus citations

Abstract

This paper deals with the burst scheduling problem in bufferless, burst-switched WDM networks. We present a control architecture and an optimal online scheduling algorithm that achieve theoretically minimal burst blocking in OBS core nodes. Using simulation, we evaluate the blocking benefit of optimal delayed scheduling over simple first-come-first serve scheduling. We find that the reduction in blocking that can be realized from minimal-loss scheduling depends strongly on the variability of input burst lengths, ranging from no benefit for constant burst length to a reduction of an order of magnitude for highly variable burst lengths.

Original languageEnglish (US)
Pages170-172
Number of pages3
DOIs
StatePublished - 2005
Event2nd International Conference on Broadband Networks, BROADNETS 2005 - Boston, MA, United States
Duration: Oct 3 2005Oct 7 2005

Conference

Conference2nd International Conference on Broadband Networks, BROADNETS 2005
Country/TerritoryUnited States
CityBoston, MA
Period10/3/0510/7/05

ASJC Scopus subject areas

  • General Engineering

Fingerprint

Dive into the research topics of 'Achieving locally minimal burst blocking in OBS networks with delayed scheduling'. Together they form a unique fingerprint.

Cite this