Please use this identifier to cite or link to this item:
https://doi.org/10.1016/S1389-1286(02)00325-0
DC Field | Value | |
---|---|---|
dc.title | Algorithms for burst rescheduling in WDM optical burst switching networks | |
dc.contributor.author | Tan, S.K. | |
dc.contributor.author | Mohan, G. | |
dc.contributor.author | Chua, K.C. | |
dc.date.accessioned | 2014-06-17T02:37:31Z | |
dc.date.available | 2014-06-17T02:37:31Z | |
dc.date.issued | 2003-01-15 | |
dc.identifier.citation | Tan, S.K., Mohan, G., Chua, K.C. (2003-01-15). Algorithms for burst rescheduling in WDM optical burst switching networks. Computer Networks 41 (1) : 41-55. ScholarBank@NUS Repository. https://doi.org/10.1016/S1389-1286(02)00325-0 | |
dc.identifier.issn | 13891286 | |
dc.identifier.uri | http://scholarbank.nus.edu.sg/handle/10635/54962 | |
dc.description.abstract | Wavelength division multiplexing (WDM) is a promising technology for realizing terabit networks. Optical burst switching (OBS) is a way to efficiently support bursty traffic on WDM-based optical Internet networks. In OBS networks, the control (header) and payload (data) components of a burst are sent separately with a time gap. The control packet first traverses the burst switching nodes and reserves suitable wavelengths on the links for the corresponding data burst by using a scheduling algorithm. Our work is motivated from the observation that the existing scheduling algorithms either have low computational complexity or high performance in terms of burst dropping probability, but not both simultaneously. Since the arrival of bursts is dynamic, it is highly desirable that the scheduling is done as quickly as possible. We develop scheduling algorithms which integrate the merits of both low computational complexity and high burst dropping performance. The key idea is to reschedule an existing burst by assigning a new wavelength to it keeping the burst arrival and leaving time unchanged in order to accommodate the new burst. We propose computationally simple rescheduling algorithms called on-demand burst rescheduling and aggressive burst rescheduling. The effectiveness of the proposed algorithms and the signaling overhead are studied through simulation experiments. © 2002 Elsevier Science B.V. All rights reserved. | |
dc.description.uri | http://libproxy1.nus.edu.sg/login?url=http://dx.doi.org/10.1016/S1389-1286(02)00325-0 | |
dc.source | Scopus | |
dc.subject | Burst dropping performance | |
dc.subject | Optical burst switching | |
dc.subject | Scheduling | |
dc.subject | Wavelength division multiplexing | |
dc.type | Article | |
dc.contributor.department | ELECTRICAL & COMPUTER ENGINEERING | |
dc.description.doi | 10.1016/S1389-1286(02)00325-0 | |
dc.description.sourcetitle | Computer Networks | |
dc.description.volume | 41 | |
dc.description.issue | 1 | |
dc.description.page | 41-55 | |
dc.description.coden | CNETD | |
dc.identifier.isiut | 000180401200004 | |
Appears in Collections: | Staff Publications |
Show simple item record
Files in This Item:
There are no files associated with this item.
SCOPUSTM
Citations
17
checked on Jan 24, 2021
WEB OF SCIENCETM
Citations
12
checked on Jan 15, 2021
Page view(s)
112
checked on Jan 19, 2021
Google ScholarTM
Check
Altmetric
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.