Show simple item record

dc.contributor.authorYetginer, Emreen_US
dc.contributor.authorKarasan, Ezhanen_US
dc.coverage.spatialBoston, MA, United Statesen_US
dc.date.accessioned2016-02-08T11:57:07Zen_US
dc.date.available2016-02-08T11:57:07Zen_US
dc.date.issued2002en_US
dc.identifier.issn0277-786Xen_US
dc.identifier.urihttp://hdl.handle.net/11693/27583en_US
dc.descriptionDate of Conference: 29 July-1 August 2002en_US
dc.descriptionConference Name: ITCom 2002: The Convergence of Information Technologies and Communications, 2002en_US
dc.description.abstractIn this paper we study regenerator placement and traffic engineering of restorable paths in Generalized Multiprotocol Label Switching (GMPLS) networks. Regenerators are necessary in optical networks due to transmission impairments. We study a network architecture where there are regenerators at selected nodes and we propose two heuristic algorithms for the regenerator placement problem. Performances of these algorithms in terms of required number of regenerators and computational complexity are evaluated. In this network architecture with sparse regeneration, offline computation of working and restoration paths is studied with bandwidth reservation and path rerouting as the restoration scheme. We study two approaches for selecting working and restoration paths from a set of candidate paths and formulate each method as an Integer Linear Programming (ILP) problem. Traffic uncertainty model is developed in order to compare these methods based on their robustness with respect to changing traffic patterns. Traffic engineering methods are compared based on number of additional demands due to traffic uncertainty that can be carried. Regenerator placement algorithms are also evaluated from a traffic engineering point of view.en_US
dc.language.isoEnglishen_US
dc.source.titleProceedings of SPIE Vol. 4868, Scalability and Traffic Control in IP Networks IIen_US
dc.relation.isversionofhttp://dx.doi.org/10.1117/12.475266en_US
dc.subjectGMPLSen_US
dc.subjectRegenerator placementen_US
dc.subjectRestorationen_US
dc.subjectTraffic engineeringen_US
dc.subjectAlgorithmsen_US
dc.subjectComputational complexityen_US
dc.subjectComputer architectureen_US
dc.subjectHeuristic methodsen_US
dc.titleTraffic engineering and regenerator placement in GMPLS networks with restorationen_US
dc.typeConference Paperen_US
dc.departmentDepartment of Electrical and Electronics Engineeringen_US
dc.citation.spage163en_US
dc.citation.epage174en_US
dc.citation.volumeNumber4868en_US
dc.identifier.doi10.1117/12.475266en_US
dc.publisherSPIEen_US


Files in this item

Thumbnail

This item appears in the following Collection(s)

Show simple item record