Show simple item record

dc.contributor.advisorKaraşan, Ezhan
dc.contributor.authorGamgam, Onur Berkay
dc.date.accessioned2016-09-09T13:20:54Z
dc.date.available2016-09-09T13:20:54Z
dc.date.copyright2016-09
dc.date.issued2016-09
dc.date.submitted2016-09-08
dc.identifier.urihttp://hdl.handle.net/11693/32214
dc.descriptionCataloged from PDF version of article.en_US
dc.descriptionThesis (M.S.): Bilkent University, Department of Electrical and Electronics Engineering, İhsan Doğramacı Bilkent University, 2016.en_US
dc.descriptionIncludes bibliographical references (leaves 58-61).en_US
dc.description.abstractDue to the rapid and diverse increase in the tra c load on the optical networks, e cient utilization of the network resources becomes an important issue. Using di erent modulation formats and coding rates in optical signal transmission, it is possible to assign di erent spectral e ciency and optical reach for each tra c requests. To satisfy the quality of transmission (QoT) for the distances beyond optical reach, optical - electronic - optical (O/E/O) 3R regeneration of the optical signal is required. During the regeneration process, the spectral e ciency and thus optical reach of the resultant signal can also be set. In these circumstances, by selecting speci c regenerator node locations and assigning di erent line rates for each tra c request, the network utilization can be optimized. Joint selection of regenerator placement (RP), routing and adaptive modulation and coding (AMC) pro le in elastic optical networks (EON) is studied to propose an o ine RP algorithm for a given network topology with link length and link capacity constraints. For a given RP, an Integer Linear Programming (ILP) model is formulated to perform routing and AMC pro le assignment for each tra c demand. We use two di erent approaches for determining candidate paths for routing: In the rst set, k shortest paths (KSP) are utilized for all cases. In the second set, namely regenerator location dependent path selection (RLDPS), the candidate paths are determined according to the given RP. To nd the minimum cost RP among all possibilities, Tabu Search based regenerator placement algorithm (TSRPA) is proposed. Results show that adaptively selecting the candidate paths based on the regenerator locations reduces network utilization either by decreasing the number of regenerator nodes by up to 66.6% or decreasing link capacity utilization by up to 5.09% as compared to selecting candidate paths as xed k shortest paths. The regenerator node location distribution obtained with RLDPS concentrated on smaller number of nodes compared to the results obtained with KSP. By placing regenerators at a signi cantly less number of nodes, capital expenditures (CAPEX) are reduced by RLDPS.en_US
dc.description.statementofresponsibilityby Onur Berkay Gamgam.en_US
dc.format.extentxii, 61 leaves : charts (some color)en_US
dc.language.isoEnglishen_US
dc.rightsinfo:eu-repo/semantics/openAccessen_US
dc.subjectElastic Optical Networksen_US
dc.subjectDesign Optimizationen_US
dc.subjectRegenerator Placementen_US
dc.subjectTabu Searchen_US
dc.titleRegenerator placement in elastic optical networks with adaptive modulation and codingen_US
dc.title.alternativeEsnek optik ağlarda adaptif modulasyon ve kodlama ile yenileyici yerleştirilmesien_US
dc.typeThesisen_US
dc.departmentDepartment of Electrical and Electronics Engineeringen_US
dc.publisherBilkent Universityen_US
dc.description.degreeM.S.en_US
dc.identifier.itemidB154020
dc.embargo.release2017-03-01


Files in this item

Thumbnail

This item appears in the following Collection(s)

Show simple item record