Please use this identifier to cite or link to this item:
http://hdl.handle.net/2080/278
Full metadata record
DC Field | Value | Language |
---|---|---|
dc.contributor.author | Turuk, A K | - |
dc.contributor.author | Kumar, R | - |
dc.date.accessioned | 2006-04-12T03:37:49Z | - |
dc.date.available | 2006-04-12T03:37:49Z | - |
dc.date.issued | 2006 | - |
dc.identifier.citation | Computer Communications (Accepted Postprint) | en |
dc.identifier.uri | http://hdl.handle.net/2080/278 | - |
dc.description | Copyright for this article belongs to Elsevier Science Ltd http://dx.doi.org/10.1016/j.comcom.2006.03.009 | en |
dc.description.abstract | Contention 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.extent | 400775 bytes | - |
dc.format.mimetype | application/pdf | - |
dc.language.iso | en | - |
dc.publisher | Elsevier | en |
dc.subject | Optical burst switching | en |
dc.subject | Wavelength division multiplexing | en |
dc.subject | Contention resolution | en |
dc.subject | Blocking probability | en |
dc.subject | Channel selection algorithm | en |
dc.subject | Poisson and bursty traffic | en |
dc.title | A flexible contention resolution scheme for QoS provisioning in optical burst switching networks | en |
dc.type | Article | en |
Appears in Collections: | Journal Articles |
Files in This Item:
File | Description | Size | Format | |
---|---|---|---|---|
turuk-2006-comcom.pdf | 391.38 kB | Adobe PDF | View/Open |
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.