Latest revision as of 03:41, 2 February 2021

Abstract

In this paper we study regenerator placement and traffic engineering of restorable paths in Generalized Multipro-tocol Label Switching (GMPLS) networks. Regenerators are necessary in optical networks due to transmission impairments. We study a network architecture where there are regenerators at selected nodes and we propose two heuristic algorithms for the regenerator placement problem. Performances of these algorithms in terms of required number of regenerators and computational complexity are evaluated. In this network architecture with sparse regeneration, offline computation of working and restoration paths is studied with bandwidth reservation and path rerouting as the restoration scheme. We study two approaches for selecting working and restoration paths from a set of candidate paths and formulate each method as an Integer Linear Programming (ILP) prob-lem. Traffic uncertainty model is developed in order to compare these methods based on their robustness with respect to changing traffic patterns. Traffic engineering methods are compared based on number of additional demands due to traffic uncertainty that can be carried. Regenerator placement algorithms are also evaluated from a traffic engineering point of view.© (2002) COPYRIGHT SPIE--The International Society for Optical Engineering. Downloading of the abstract is permitted for personal use only.

Original document

The different versions of the original document can be found in:

• http://dx.doi.org/10.1117/12.475266

• http://hdl.handle.net/11693/27583

• http://repository.bilkent.edu.tr/bitstream/11693/27583/1/Traffic%20engineering%20and%20regenerator%20placement%20in%20GMPLS%20networks%20with%20restoration.pdf

• https://ui.adsabs.harvard.edu/abs/2002SPIE.4868..163Y/abstract,

https://www.spiedigitallibrary.org/conference-proceedings-of-spie/4868/1/Traffic-engineering-and-regenerator-placement-in-GMPLS-networks-with-restoration/10.1117/12.475266.full,

https://proceedings.spiedigitallibrary.org/proceeding.aspx?articleid=877840,

https://academic.microsoft.com/#/detail/2056143709