Please use this identifier to cite or link to this item:
Full metadata record
DC FieldValueLanguage
dc.contributor.authorTuruk, A K-
dc.contributor.authorKumar, R-
dc.identifier.citationComputer Communications (Accepted Postprint)en
dc.descriptionCopyright for this article belongs to Elsevier Science Ltd
dc.description.abstractContention resolution is a major issue in bufferless optical burst switching (OBS) networks. The existing contention resolution schemes consider priority and arrival time to resolve contention. For most multimedia applications priority and delay are key parameters for QoS provisioning. In this paper, we propose a new signaling protocol for reducing contention in OBS networks and consider three parameters, namely, priority of the burst, number of hops traversed, and burst size into account to resolve contention. The source node in the proposed protocol can be informed of the contention up to halfway along the path of the burst, and thus, can reschedule the burst accordingly. The scheme is adaptable to both prioritized and delay constrained traffic. We call the scheme OBS-Flex. For selecting a data channel, we propose three channel selection algorithms, namely, Least Recently Used (LRU), First Fit (FF), and Priority Set (PS). We simulate OBS-Flex and compare with preemptive priority just-enough-time (PPJET) contention resolution scheme. We show that OBS-Flex outperforms PPJET in terms of burst loss rates. For simulation, we have considered Poisson and bursty traffic models.en
dc.format.extent400775 bytes-
dc.subjectOptical burst switchingen
dc.subjectWavelength division multiplexingen
dc.subjectContention resolutionen
dc.subjectBlocking probabilityen
dc.subjectChannel selection algorithmen
dc.subjectPoisson and bursty trafficen
dc.titleA flexible contention resolution scheme for QoS provisioning in optical burst switching networksen
Appears in Collections:Journal Articles

Files in This Item:
File Description SizeFormat 
turuk-2006-comcom.pdf391.38 kBAdobe PDFView/Open

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