Abstract
All-optical telecommunication networks allow for switching connections by lightpaths which can pass several network links without any opto-electronic conversion. Upon arrival of a connection request, it must be decided online, i.e., without knowledge of future requests, if it is accepted and in that case on which lightpaths the connection is routed. This online problem with the goal of maximizing the total profit gained by accepted requests is called Dynamic Singleclass Call Admission Problem (Dsca). We present existing and new algorithms for Dsca as well as their theoretical and practical evaluation.
Supported by the DFG research center “Mathematics for key technologies” in Berlin
This paper gives a brief summary of [9]. The accomplished research is based on a joint project with T-Systems Nova GmbH, financed by the DFN.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
We’re sorry, something doesn't seem to be working properly.
Please try refreshing the page. If that doesn't work, please contact support so we can address the problem.
References
Bala K., Stern, T., Simchi K., Bala K. (1995) Routing in a Linear Lightwave Networks. IEEE/ACM Transactions on Networking 3, 459–469
Birman A., Kershenbaum, A. (1995) Routing and Wavelength Assignment Methods in Single-hop All-optical Networks with Blocking. Proceedings of the INFO-COM’ 95, 431–438
Borodin A., El-Yaniv R. (1998) Online Computation and Competitive Analysis. Cambridge University Press
Chlamtac I., Ganz A., Karmi G. (1992) Lightpath Communications: An Approach to High Bandwidth Optical WAN’s. IEEE Transactions on Communications 40, 1171–1182
Krumke S. O., Poensgen D. (2002) Online Call Admission in Optical Networks with Larger Demands. Proceedings of the 28th International Workshop on Graph-Theoretic Concepts in Computer Science 2573, Springer, 333–344
Hülsermann R., Jäger M., Krumke S. O., Poensgen D., Rambau J., Tuch-scherer A. (2003) Dynamic Routing Algorithms in Transparent Optical Networks. Proceedings of the 7th IFIP Working Conference Optical Network Design & Modelling, Kluwer Academic Press, 293–312
Mokhtar A., Azizoglu M. (1998) Adaptive Wavelength Routing in All-optical Networks. IEEE/ACM Transactions on Networking 6, no. 2, 197–206
Poensgen D. (2003) Facets of Online Optimization. Dissertation, Technische Uni-versität Berlin, Cuvillier Verlag Göttingen
Tuchscherer A. (2003) Dynamical Configuration of Transparent Optical Telecommunication Networks. Diploma Thesis, Technische Universität Berlin
Zhang Z., Acampora M. (1995) A Heuristic Wavelength Assignment Algorithm for Multi-hop WDM Networks with Wavelength Routing and Wavelength Reuse. IEEE/ACM Transactions on Networking 3, 281–288
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2005 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Tuchscherer, A. (2005). Dynamical Configuration of Transparent Optical Telecommunication Networks. In: Fleuren, H., den Hertog, D., Kort, P. (eds) Operations Research Proceedings 2004. Operations Research Proceedings, vol 2004. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-27679-3_4
Download citation
DOI: https://doi.org/10.1007/3-540-27679-3_4
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-24274-1
Online ISBN: 978-3-540-27679-1
eBook Packages: Business and EconomicsBusiness and Management (R0)