Share Email Print
cover

Proceedings Paper

Subnetwork partitioning and section restoration in translucent optical networks
Author(s): Ezhan Karasan; Mustafa Arisoylu
Format Member Price Non-Member Price
PDF $14.40 $18.00
cover GOOD NEWS! Your organization subscribes to the SPIE Digital Library. You may be able to download this paper for free. Check Access

Paper Abstract

We 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.

Paper Details

Date Published: 1 October 2003
PDF: 12 pages
Proc. SPIE 5285, OptiComm 2003: Optical Networking and Communications, (1 October 2003); doi: 10.1117/12.533305
Show Author Affiliations
Ezhan Karasan, Bilkent Univ. (Turkey)
Mustafa Arisoylu, Univ. of California/San Diego (United States)


Published in SPIE Proceedings Vol. 5285:
OptiComm 2003: Optical Networking and Communications
Arun K. Somani; Zhensheng Zhang, Editor(s)

© SPIE. Terms of Use
Back to Top