Please use this identifier to cite or link to this item: https://scholarbank.nus.edu.sg/handle/10635/69543
DC FieldValue
dc.titleBurst rescheduling with wavelength and last-hop FDL reassignment in WDM optical burst switching networks
dc.contributor.authorTan, S.K.
dc.contributor.authorMohan, G.
dc.contributor.authorChua, K.C.
dc.date.accessioned2014-06-19T03:01:53Z
dc.date.available2014-06-19T03:01:53Z
dc.date.issued2003
dc.identifier.citationTan, S.K.,Mohan, G.,Chua, K.C. (2003). Burst rescheduling with wavelength and last-hop FDL reassignment in WDM optical burst switching networks. IEEE International Conference on Communications 2 : 1448-1452. ScholarBank@NUS Repository.
dc.identifier.issn05361486
dc.identifier.urihttp://scholarbank.nus.edu.sg/handle/10635/69543
dc.description.abstractIn this paper, we consider the problem of fast and efficient dynamic scheduling of bursts that belong to different classes of priority in wavelength-division multiplexing (WDM)-based optical burst switching (OBS) networks with limited optical buffers. In OBS networks, control and data components of a burst are sent separately with a time gap to ensure that resources such as wavelengths and fiber delay lines (FDLs) are reserved at various nodes before the data burst arrives. A scheduling algorithm with attractive features such as computational simplicity and efficient resource utilization is mandatory to quickly handle dynamic burst traffic and reduce burst dropping probability. While void filling algorithms achieve good burst dropping performance they are computationally complex. We propose burst rescheduling as an alternative to void filling which can do fast scheduling without requiring to examine and fill voids and at the same time can achieve good performance. Burst rescheduling uses two mechanisms known as wavelength reassignment and last-hop FDL reassignment. We develop a scheduling algorithm using the above rescheduling mechanisms called Burst Rescheduling with Wavelength and Last-hop FDL Reassignment (BR-WFR) which is computationally simpler than a void filling algorithm. We then discuss the signaling overhead and feasibility of implementing burst rescheduling. Through simulation experiments we demonstrate the effectiveness of the proposed burst rescheduling algorithm.
dc.sourceScopus
dc.typeConference Paper
dc.contributor.departmentELECTRICAL & COMPUTER ENGINEERING
dc.description.sourcetitleIEEE International Conference on Communications
dc.description.volume2
dc.description.page1448-1452
dc.identifier.isiutNOT_IN_WOS
Appears in Collections:Staff Publications

Show simple item record
Files in This Item:
There are no files associated with this item.

Page view(s)

44
checked on Mar 30, 2020

Google ScholarTM

Check


Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.