Please use this identifier to cite or link to this item:
http://hdl.handle.net/2080/269
Full metadata record
DC Field | Value | Language |
---|---|---|
dc.contributor.author | Turuk, A K | - |
dc.contributor.author | Kumar, R | - |
dc.date.accessioned | 2006-03-24T03:32:32Z | - |
dc.date.available | 2006-03-24T03:32:32Z | - |
dc.date.issued | 2004 | - |
dc.identifier.citation | Proceedings of the 6th International Workshop on Distributed Computing, IWDC- 2004, Kolkatta, India. P 361-372. LNCS 3326. | en |
dc.identifier.uri | http://hdl.handle.net/2080/269 | - |
dc.description | Copyright for this article belongs to Springer-verlag DOI: 10.1007/b104419 | en |
dc.description.abstract | In this paper, we propose a distributed contention resolution scheme to reduce blocking probability in optical burst-switching networks. The scheme takes priority, propagation delay from the ingress router, and the burst-size into account to resolve contention, and guarantees that at least one of the bursts succeeds when contention occurs.We use a control packet to delay transmission of the contending burst at ingress router.We compare the performance of our scheme, by simulation, and show that the proposed scheme outperforms the earlier scheme in reducing the blocking probability. For simulation, we generated bursty traffic using an M/Pareto distribution. | en |
dc.format.extent | 178371 bytes | - |
dc.format.mimetype | application/pdf | - |
dc.language.iso | en | - |
dc.publisher | Springer Verlag | en |
dc.subject | Contention Resolution | en |
dc.subject | Burst Switching | en |
dc.title | A Distributed Contention Resolution Scheme to Reduce Blocking Probability in Optical Burst Switching Networks | en |
dc.type | Article | en |
Appears in Collections: | Conference Papers |
Files in This Item:
File | Description | Size | Format | |
---|---|---|---|---|
Iwdc2004QoS.pdf | 360.95 kB | Adobe PDF | View/Open |
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.