By Topic

Cost optimization using regenerator site concentration and routing in ROADM networks

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$33 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

10 Author(s)
Balagangadhar G Bathula ; AT&T Labs - Research, Middle-town, New Jersey, USA ; Rakesh K. Sinha ; Angela L. Chiu ; Mark D. Feuer
more authors

The advent of colorless and non-directional reconfigurable optical-add-drop multiplexers (ROADMs) will enable flexible pre-deployment of optoelectronic regenerators in future optical networks. Compared to the current practice of installing regenerators only when a circuit needs them, pre-deployment will allow service providers to achieve rapid provisioning and restoration. The pre-deployed regenerators should be concentrated in a selected subset of ROADM sites in order to attain high utilization and to reduce operational costs. We prove that the resulting optimization problem is NP-hard and present an efficient heuristic for this problem that takes into account both the cost of individual circuits (regenerator cost and transmission line system cost) and the probability of a given circuit request, as well as the number of regenerator sites. We provide various methods to reduce the number of regenerator sites, if low probability demands are allowed to have slightly costlier paths. Specific network examples show that the proposed heuristic has near optimal performance under most studied scenarios. We present results for several different cost models. We have also evaluated the heuristic for survivable optical networks, in which a second, disjoint path must be supported for each circuit. An extended version of this paper containing proofs, pseudo-codes and additional experimental results is available online [1].

Published in:

Design of Reliable Communication Networks (DRCN), 2013 9th International Conference on the

Date of Conference:

4-7 March 2013