Publication:
OPTIMIZATION METHODS APPLIED TO NETWORK PLANNING PROBLEMS

Simple item page
dc.contributor.advisorBEGHELLI, ALEJANDRA
dc.contributor.departmentUniversidad Tecnica Federico Santa Maria UTFSM ELECTRONICAes_CL
dc.coverage.spatialUniversidad Técnica Federico Santa María UTFSM. Casa Central Valparaísoes_CL
dc.creatorTARIFEÑO GAJARDO, MARCO ANTONIO
dc.date.accessioned2017-12-27T19:26:25Z
dc.date.available2017-12-27T19:26:25Z
dc.date.issued2016
dc.descriptionCatalogado desde la version PDF de la tesis.es_CL
dc.description.abstract.es_CL
dc.description.abstractThis thesis focuses on the feasibility of solving network planning prob- lems that include non-linear aspects by means of integer linear pro- gramming (ILP).In the specialized literature, most network planning problems solved by applying ILP models do not include non-linear expressions in a direct way. However, non-linear expressions are very common when including constraints related to key network performance metrics as the blocking rate or the availability. To circumvent the difficulties of solving such problems, researchers have usually resorted to not includ- ing non-linear aspects or using meta-heuristics and heuristics, which do not guarantee an optimal solution. Such sub-optimal solutions lead to higher budget requirements or under performing networks and thus, as long as the optimal solution can be found in acceptable running times, it is preferred to other alternatives. The use of logarithm func- tions (to linearize some expressions) and mixed zero-one models have also be used, but not for the problems addressed in this thesis.In this thesis 3 network planning problems including non-linear ex- pressions were solved by means of ILP. The first problem was the dimensioning of network nodes and links in a dynamic wavelength- division multiplexed (WDM) network equipped with reconfigurable optical add-drop multiplexers (ROADM) as switching nodes. The network had to be dimensioned in such a way that the maximum blocking probability experienced by point-to-point connections would not exceed a maximum threshold. To date, no ILP works have ad- dressed the problem of dimensioning for a specific blocking value. The second problem consisted on dimensioning and configuring the backup resources of a static WDM network using shared-path protection as survivability mechanism. The network had to be dimensioned guar- anteeing that the availability of every connection would not decrease under a given target value. A new way of dealing with the non-linear expression for the availability target, the inclusion of an availability- based priority scheme for the access to the shared resources and the equations to consider the wavelength continuity constraint are the main contributions of this work. Finally, the dimensioning of work- ing and backup wavelengths of the dynamic WDM network operat- ing as the physical substrate of a network virtualization system was solved. In this system, virtual networks must be guaranteed a maxi- mum blocking and minimum availability. No previous work has dealt with these constraints.The strategies used in this thesis to solve non-linear network plan- ning problems could be used as a starting point to solve problems in different network contexts that include important non-linear aspects.Keywords: network planning, integer linear programming, mixed zero-one models, WDM networks, blocking, availability, ROADM-based networks, shared path protection, network virtualization.eng
dc.description.degreeDOCTOR EN INGENIERÍA ELECTRÓNICA
dc.format.extent171 h.
dc.format.mediumCD ROM
dc.format.mimetypeapplication/pdf
dc.identifier.barcode3560900232163
dc.identifier.urihttp://hdl.handle.net/11673/23151
dc.rights.accessRightsA - Internet abierta www.repositorio.usm.cl y otros repositorios a la que la USM se adscriba
dc.subjectAVAILABILITYes_CL
dc.subjectBLOCKINGes_CL
dc.subjectINTEGER LINEAR PROGRAMMINGes_CL
dc.subjectMIXED ZERO-ONE MODELSes_CL
dc.subjectNETWORK PLANNINGes_CL
dc.subjectNETWORK VIRTUALIZATIONes_CL
dc.subjectROADM-BASED NETWORKSes_CL
dc.subjectSHARED PATH PROTECTIONes_CL
dc.subjectWDM NETWORKSes_CL
dc.titleOPTIMIZATION METHODS APPLIED TO NETWORK PLANNING PROBLEMSes_CL
dc.typeTesis Pregradoes_CL
dc.type.driverinfo:eu-repo/semantics/doctoralThesis
dspace.entity.typePublication
usm.date.thesisregistration2013
usm.identifier.thesis4500001858
Files
Original bundle
Now showing 1 - 1 of 1
Thumbnail Image
Name:
3560900232163UTFSM.pdf
Size:
2.24 MB
Format:
Adobe Portable Document Format
Description:
Download
Collections
TESIS de Postgrado de acceso ABIERTO