Please use this identifier to cite or link to this item:
http://hdl.handle.net/2080/267
Full metadata record
DC Field | Value | Language |
---|---|---|
dc.contributor.author | Turuk, A K | - |
dc.contributor.author | Kumar, R | - |
dc.date.accessioned | 2006-03-23T11:18:54Z | - |
dc.date.available | 2006-03-23T11:18:54Z | - |
dc.date.issued | 2004 | - |
dc.identifier.citation | Proceedings of the International Conference on High Performance Computing (HiPc 2004), 19-22 Bangalore, India P 309-318, (LNCS-3296) | en |
dc.identifier.uri | http://hdl.handle.net/2080/267 | - |
dc.description | Copyright for this article belongs to Springer-Verlag(LNCS) DOI: 10.1007/b104576 | en |
dc.description.abstract | Burst loss due to contention is a major issue in optical burst switching networks. In this paper, we propose a contention resolution scheme that uses a offset time different from that of conventional optical burst switching (OBS) to reduce burst loss and to provide QoS in optical burst switching networks. The proposed scheme can be tuned to both prioritized traffic and delay constraint traffic by changing the offset time. For selecting a data-channel, we propose three channel selection algorithms, namely Least Recently Used (LRU), First Fit (FF), and Priority Set (PS) algorithms.We simulate and compare proposed scheme with the preemptive priority just-enough-time (PPJET) contention resolution scheme. We consider bursty traffic in our simulation. It is found that our scheme outperforms PPJET in burst-loss. | en |
dc.format.extent | 167562 bytes | - |
dc.format.mimetype | application/pdf | - |
dc.language.iso | en | - |
dc.publisher | Springer Verlag | en |
dc.subject | QoS | en |
dc.subject | Optical Network | en |
dc.subject | Burst Switching | en |
dc.title | A Novel Scheme to Reduce Burst-Loss and Provide QoS in Optical Burst Switching Networks | en |
dc.type | Article | en |
Appears in Collections: | Conference Papers |
Files in This Item:
File | Description | Size | Format | |
---|---|---|---|---|
HiPCQos2004.pdf | 357.26 kB | Adobe PDF | View/Open |
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.