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.
Chapter PDF
Similar content being viewed by others
References
Qiao, C., Yoo, M.: Optical Burst Switching (OBS) – a New Paradigm for an Optical Internet. Journal of High Speed Networks 8(1), 69–84 (1999)
Klinkowski, M., Herrero, F., Careglio, D., Solé-Pareta, J.: Adaptive Routing Algorithms for Optical Packet Switching Networks. In: Proceedings of 9th IFIP Working Conference on Optical Network Design and Modelling ONDM2005 (2005)
Köhn, M., Gauger, C.M.: Dimensioning of SDH/WDM Multilayer Networks. Beiträge zur 4. ITG-Fachtagung Photonische Netze, 29-33 (2003)
Cameron, C., Zalesky, A., Zukerman, M.: Shortest Path Prioritized Random Deflection Routing (SP-PRDR) in Optical Burst Switched Networks. In: ICST International Workshop on Optical Burst Switching (WOBS). San Jose (2004)
Zalesky, A., Vu, H.L., Rosberg, Z., Wong, E.M., Zukerman, M.: Reduced Load Erlang Fixed Point Analysis of Optical Burst Switched Networks with Deflection Routing and Wavelength Reservation. In: Proceedings of the First International Workshop on Optical Burst Switching (2003)
Zhang, J., et al.: Explicit Routing for Traffic Engineering in Labelled Optical Burst-Switched WDM Networks. In: International Conference on Computational Science ICCS (2004)
Teng, J., Rouskas, G.: Traffic Engineering Approach to Path Selection in Optical Burst Switching Networks. Journal of Optical Networking 4(11) (2005)
Hyytia, E., Nieminen, L.: Linear Program Formulation for Routing Problem in OBS Networks. In: ISCC 2004. Proceedings of the 9th IEEE Symposium on Computers and Communications, IEEE Computer Society Press, Los Alamitos (2004)
Zukerman, M., et al.: Blocking Probabilities of Optical Burst Switching Networks Based on Reduced Load Fixed Point Approximations. In: Proceedings of INFOCOM Conference (2003)
Pioro, M., Wallstrom, B.: Multihour Optimization of Non-Hierarchical Circuit Switched Communication Networks with Sequential Routing. In: 11th International Teletraffic Congress ITC-11 (1985)
Harris, R.J.: The Modified Reduced Gradient Method for Optimally Dimensioning Telephone Networks. Australian Telecom. Research 10(1), 30–35 (1976)
Kelly, F.P.: Routing in Circuit-Switched Networks: Optimization, Shadow Prices and Decentralization. Advanced Applied Probability 20, 112–144 (1988)
Qiao, C.: Labeled Optical Burst Switching for IP-over-WDM Integration. IEEE Communication Magazine (December 2000)
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 2007 Springer Berlin Heidelberg
About this paper
Cite this paper
Klinkowski, M., Pióro, M., Careglio, D., Marciniak, M., Solé-Pareta, J. (2007). Routing Optimization in Optical Burst Switching Networks. In: Tomkos, I., Neri, F., Solé Pareta, J., Masip Bruin, X., Sánchez Lopez, S. (eds) Optical Network Design and Modeling. ONDM 2007. Lecture Notes in Computer Science, vol 4534. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-72731-6_23
Download citation
DOI: https://doi.org/10.1007/978-3-540-72731-6_23
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-72729-3
Online ISBN: 978-3-540-72731-6
eBook Packages: Computer ScienceComputer Science (R0)