Design of translucent optical networks: Partitioning and restoration

Date
2004
Authors
Karasan, E.
Arisoylu, M.
Editor(s)
Advisor
Supervisor
Co-Advisor
Co-Supervisor
Instructor
Source Title
Photonic network communications
Print ISSN
1387-974X
Electronic ISSN
Publisher
Kluwer
Volume
8
Issue
2
Pages
209 - 221
Language
English
Journal Title
Journal ISSN
Volume Title
Series
Abstract

We discuss the problem of designing translucent optical networks composed of restorable, transparent subnetworks interconnected via transponders. We develop an integer linear programming (ILP) formulation for partitioning an optical network topology into subnetworks, where the subnetworks are determined subject to the constraints that each subnetwork satisfies size limitations, and it is two-connected. A greedy heuristic partitioning algorithm is proposed for planar network topologies. We use section restoration for translucent networks where failed connections are rerouted within the subnetwork which contains the failed link. The network design problem of determining working and restoration capacities with section restoration is formulated as an ILP problem. Numerical results show that fiber costs with section restoration are close to those with path restoration for mesh topologies used in this study. It is also shown that the number of transponders with the translucent network architecture is substantially reduced compared to opaque networks.

Course
Other identifiers
Book Title
Citation
Published Version (Please cite this version)