Routing optimization in optical burst switching networks

4Citations
Citations of this article
5Readers
Mendeley users who have this article in their library.

This article is free to access.

Abstract

This paper addresses the problem of routing optimization in optical burst switching (OBS) networks. We use a simplified analytical model of OBS network with an overall burst loss probability as the primary metric of interest. Since the objective function of optimization problem is nonlinear we propose two solutions based on a non-reduced link load (NR-LL) model and a reduced link load (R-LL) model. In order to find partial derivatives of the cost function we apply a calculation considered previously for circuit-switched networks. We derive exact partial derivatives of NR-LL model and we approximate the partial derivatives of R-LL model. Simulation results demonstrate that our solutions effectively reduce the overall burst loss probability over the shortest path routing. Moreover, in many cases, they over-perform an alternative routing. © IFIP International Federation for Information Processing 2007.

Cite

CITATION STYLE

APA

Klinkowski, M., Pióro, M., Careglio, D., Marciniak, M., & Solé-Pareta, J. (2007). Routing optimization in optical burst switching networks. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 4534 LNCS, pp. 201–210). Springer Verlag. https://doi.org/10.1007/978-3-540-72731-6_23

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