Karasan, EzhanArısoylu, M.2016-02-082016-02-0820030277-786Xhttp://hdl.handle.net/11693/27500Date of Conference: 13-17 October 2003Conference Name: OptiComm 2003: Optical Networking and Communications, 2003We discuss the problem of designing translucent optical networks composed of restorable, transparent subnetworks interconnected via transponders. We formulate the problem of designing restorable subnetworks in translucent networks as an Integer Linear Programming (ILP) problem, where the subnetworks are determined subject to the constraints that each subnetwork satisfies size limitations and it is 2-connected. A greedy heuristic algorithm for the same problem is also proposed for planar network topologies. We propose section restoration for translucent networks where failed connections are rerouted inside 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 section restoration generates fiber costs which are close to those with the path restoration technique for the mesh topologies used in this study. It is also shown that the number of transponders with the translucent optical network is substantially reduced compared to opaque networks.EnglishOptical restorationSubnetwork partitioningTranslucent optical networksAlgorithmsCostsHeuristic methodsInteger programmingLinear programmingOptical communicationOptical fibersConference Paper10.1117/12.533305