Design of translucent optical networks: Partitioning and restoration
dc.citation.epage | 221 | en_US |
dc.citation.issueNumber | 2 | en_US |
dc.citation.spage | 209 | en_US |
dc.citation.volumeNumber | 8 | en_US |
dc.contributor.author | Karasan, E. | en_US |
dc.contributor.author | Arisoylu, M. | en_US |
dc.date.accessioned | 2016-02-08T10:26:11Z | |
dc.date.available | 2016-02-08T10:26:11Z | |
dc.date.issued | 2004 | en_US |
dc.department | Department of Electrical and Electronics Engineering | en_US |
dc.description.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. | en_US |
dc.description.provenance | Made available in DSpace on 2016-02-08T10:26:11Z (GMT). No. of bitstreams: 1 bilkent-research-paper.pdf: 70227 bytes, checksum: 26e812c6f5156f83f0e77b261a471b5a (MD5) Previous issue date: 2004 | en |
dc.identifier.doi | 10.1023/B:PNET.0000033979.26662.f4 | en_US |
dc.identifier.issn | 1387-974X | |
dc.identifier.uri | http://hdl.handle.net/11693/24234 | |
dc.language.iso | English | en_US |
dc.publisher | Kluwer | en_US |
dc.relation.isversionof | http://dx.doi.org/10.1023/B:PNET.0000033979.26662.f4 | en_US |
dc.source.title | Photonic network communications | en_US |
dc.subject | Section restoration | en_US |
dc.subject | Subnetwork partitioning | en_US |
dc.subject | Translucent optical networks | en_US |
dc.subject | Constraint theory | en_US |
dc.subject | Integer programming | en_US |
dc.subject | Linear programming | en_US |
dc.subject | Network protocols | en_US |
dc.subject | Optical communication | en_US |
dc.subject | Optical devices | en_US |
dc.subject | Optimization | en_US |
dc.subject | Problem solving | en_US |
dc.subject | Restoration | en_US |
dc.subject | Routers | en_US |
dc.subject | Telecommunication traffic | en_US |
dc.subject | Transponders | en_US |
dc.subject | Optical cross connects (OXC) | en_US |
dc.subject | Section restoration | en_US |
dc.subject | Subnetwork partionings | en_US |
dc.subject | Translucent optical networks | en_US |
dc.subject | Telecommunication networks | en_US |
dc.title | Design of translucent optical networks: Partitioning and restoration | en_US |
dc.type | Article | en_US |
Files
Original bundle
1 - 1 of 1
Loading...
- Name:
- Design of Translucent Optical Networks Partitioning and Restoration.pdf
- Size:
- 392.79 KB
- Format:
- Adobe Portable Document Format
- Description:
- Full printable version