A distributed contention resolution scheme to reduce blocking probability in optical burst switching networks

0Citations
Citations of this article
2Readers
Mendeley users who have this article in their library.
Get full text

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. © Springer-Verlag Berlin Heidelberg 2004.

Cite

CITATION STYLE

APA

Turuk, A. K., & Kumar, R. (2004). A distributed contention resolution scheme to reduce blocking probability in optical burst switching networks. Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), 3326, 361–372. https://doi.org/10.1007/978-3-540-30536-1_40

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free