Subnetwork partitioning and section restoration in translucent optical networks

Simple item page
dc.citation.epage125en_US
dc.citation.spage114en_US
dc.citation.volumeNumber5285en_US
dc.contributor.authorKarasan, Ezhanen_US
dc.contributor.authorArısoylu, M.en_US
dc.coverage.spatialDallas, TX, United Statesen_US
dc.date.accessioned2016-02-08T11:55:08Zen_US
dc.date.available2016-02-08T11:55:08Zen_US
dc.date.issued2003en_US
dc.departmentDepartment of Electrical and Electronics Engineeringen_US
dc.descriptionDate of Conference: 13-17 October 2003en_US
dc.descriptionConference Name: OptiComm 2003: Optical Networking and Communications, 2003en_US
dc.description.abstractWe 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.en_US
dc.description.provenanceMade available in DSpace on 2016-02-08T11:55:08Z (GMT). No. of bitstreams: 1 bilkent-research-paper.pdf: 70227 bytes, checksum: 26e812c6f5156f83f0e77b261a471b5a (MD5) Previous issue date: 2003en
dc.identifier.doi10.1117/12.533305en_US
dc.identifier.issn0277-786Xen_US
dc.identifier.urihttp://hdl.handle.net/11693/27500en_US
dc.language.isoEnglishen_US
dc.publisherSPIEen_US
dc.relation.isversionofhttps://doi.org/10.1117/12.533305en_US
dc.source.titleProceedings of SPIE Vol. 5285, OptiComm 2003: Optical Networking and Communicationsen_US
dc.subjectOptical restorationen_US
dc.subjectSubnetwork partitioningen_US
dc.subjectTranslucent optical networksen_US
dc.subjectAlgorithmsen_US
dc.subjectCostsen_US
dc.subjectHeuristic methodsen_US
dc.subjectInteger programmingen_US
dc.subjectLinear programmingen_US
dc.subjectOptical communicationen_US
dc.subjectOptical fibersen_US
dc.titleSubnetwork partitioning and section restoration in translucent optical networksen_US
dc.typeConference Paperen_US

Files

Original bundle
Now showing 1 - 1 of 1
Thumbnail Image
Name:
Subnetwork Partitioning and Section Restoration in Translucent Optical Networks.pdf
Size:
638.92 KB
Format:
Adobe Portable Document Format
Description:
Full printable version
Download

Collections

Department of Electrical and Electronics Engineering