Home << 1 >>
List View
 | 
Citations
 | 
Details
   web
Records
Author Beghelli, A.; Prieto, P.
Title Creativity under pressure: Using distant semantic fields for fast activation of divergent thinking in engineering students Type
Year 2018 Publication Proceedings of the DESIGN 2018 15th International Design Conference Abbreviated Journal Design
Volume 5 Issue Pages 2391-2402
Keywords
Abstract
Address
Corporate Author Thesis
Publisher Place of Publication Editor
Language Summary Language Original Title
Series Editor Series Title Abbreviated Series Title
Series Volume Series Issue Edition
ISSN ISBN Medium
Area Expedition Conference
Notes Approved
Call Number UAI @ eduardo.moreno @ Serial 1289
Permanent link to this record
 
 
Author Borquez-Paredes, D.; Beghelli, A.; Leiva, A.; Jara, N.; Lozada, A.; Morales, P.; Saavedra, G.; Olivares, R.
Title Agent-based distributed protocol for resource discovery and allocation of virtual networks over elastic optical networks Type
Year 2022 Publication Journal of Optical Communications and Networking Abbreviated Journal J. Opt. Commun. Netw.
Volume 14 Issue 8 Pages 667-679
Keywords Optical fiber networks; Resource management; SubstratesVirtual links; ProtocolsVirtualization; Optical fiber communication
Abstract Network virtualization is a key enabling technology for “Infrastructure as a Service” provisioning, increasing the flexibility and cost savings offered to customers. By extending the concept of server virtualization to the network infrastructure, the allocation of different, independent virtual networks over a single physical network is carried out on demand. A fundamental challenge in network virtualization systems is to choose which physical nodes and links to use for hosting virtual networks in the physical infrastructure, known as the “virtual network allocation” problem. All virtual network allocation proposals on elastic optical networks assume a centralized operation, deploying a single node with access to the network state global information and assigning resources accordingly. However, such configuration might exhibit the inherent problems of centralized systems: survivability and scalability. In this paper, we present a distributed protocol for resource discovery, mapping, and allocation of network virtualization systems. The distributed protocol is generic enough as to be used with different substrate networks. However, in this paper, it has been adapted to work over an elastic optical network infrastructure, where further considerations regarding the spectrum continuity and contiguity constraints must also be taken into account. The distributed protocol is based on the concept of alliances: upon the arrival of a virtual network request, agents located in the physical network nodes compete to form the first alliance able to host the virtual network. Because the first alliances to be formed are also the ones composed by nearby nodes, a good network resource usage is achieved. The feasibility of the distributed protocol was studied by evaluating its ability to successfully establish virtual networks within acceptable time and with low bandwidth consumption from the coordination messages.
Address
Corporate Author Thesis
Publisher Place of Publication Editor
Language Summary Language Original Title
Series Editor Series Title Abbreviated Series Title
Series Volume Series Issue Edition
ISSN 1943-0620 ISBN Medium
Area Expedition Conference
Notes WOS:000837452500002 Approved
Call Number UAI @ alexi.delcanto @ Serial 1632
Permanent link to this record
 
 
Author Borquez-Paredes, D.; Beghelli, A.; Leiva, A.; Murrugarra, R.
Title Does fragmentation avoidance improve the performance of dynamic spectrum allocation in elastic optical networks? Type
Year 2018 Publication Photonic Network Communications Abbreviated Journal Photonic Netw. Commun.
Volume 35 Issue 3 Pages 287-299
Keywords Flexible grid optical networks; Greedy algorithm; Deadlock avoidance; Fragmentation
Abstract Most spectrum allocation algorithms in elastic optical networks apply a greedy approach: A new connection is allocated as long as there are enough spectrum slots to accommodate it. Recently, a different approach was proposed. Named Deadlock-Avoidance (DA), it only establishes a new connection if the portion of spectrum left after allocating it is zero (full-link utilization) or is big enough to accommodate future requests. Otherwise, the connection request is blocked as a way to avoid fragmentation. The performance of DA has been evaluated in a single-link scenario, where its performance is not affected by the slot continuity constraint. In this paper, we evaluate for the first time the blocking performance and fragmentation level of DA in a fully dynamic network scenario with different bitrates and number of slots for a single link, a 4-node bus and a mesh topology. The performance was evaluated by simulation, and a lower bound was also derived using a continuous Markov chain model. Results are obtained for DA and three greedy algorithms: First Fit, Exact Fit and First-Last Fit. Results show that DA significantly decreases fragmentation, and thus, it exhibits a much lower blocking due to fragmentation than the greedy algorithms. However, this decrease is compensated by a new type of blocking due to the selective acceptance of connections. As a result, the extra computational complexity of DA does not compensate a gain in performance.
Address [Borquez-Paredes, Danilo; Beghelli, Alejandra; Murrugarra, Ruth] Univ Adolfo Ibanez, Fac Engn & Sci, Campus Vina del Mar, Vina Del Mar, Chile, Email: danilo.borquez@edu.uai.cl;
Corporate Author Thesis
Publisher Springer Place of Publication Editor
Language English Summary Language Original Title
Series Editor Series Title Abbreviated Series Title
Series Volume Series Issue Edition
ISSN 1387-974x ISBN Medium
Area Expedition Conference
Notes WOS:000430478400001 Approved
Call Number UAI @ eduardo.moreno @ Serial 846
Permanent link to this record
 
 
Author Calderón, F.; Lozada, A.; Morales, P.; Bórquez-Paredes, D.; Jara, N.; Olivares, R.; Saavedra, G.; Beghelli, A.; Leiva, A,
Title Heuristic Approaches for Dynamic Provisioning in Multi-band Elastic Optical Networks Type
Year 2022 Publication IEEE Communications Letters Abbreviated Journal IEEE Commun. Lett.
Volume 26 Issue 2 Pages 379-383
Keywords Elastic Optical Networks; Multi-band; Band Allocation
Abstract Multi-band elastic optical networks are a promising alternative to meet the bandwidth demand of the ever-growing Internet traffic. In this letter, we propose a family of band allocation algorithms for multi-band elastic optical networks. Employing simulation, we evaluate the blocking performance of 3 algorithms of such a family and compare their performance with the only heuristic proposed to date. Results show that the three new algorithms outperform the previous proposal, with up to one order of magnitude improvement. We expect these results to help advance the area of dynamic resource allocation in multi-band elastic optical networks.
Address
Corporate Author Thesis
Publisher Place of Publication Editor
Language Summary Language Original Title
Series Editor Series Title Abbreviated Series Title
Series Volume Series Issue Edition
ISSN 1089-7798 ISBN Medium
Area Expedition Conference
Notes WOS:000754246100037 Approved
Call Number UAI @ alexi.delcanto @ Serial 1489
Permanent link to this record
 
 
Author Calderon, F.; Lozada, A.; Morales, P.; Borquez-Paredes, D.; Jara, N.; Olivares, R.; Saavedra, G.; Beghelli, A.; Leiva, A.
Title Heuristic Approaches for Dynamic Provisioning in Multi-Band Elastic Optical Networks Type
Year 2022 Publication IEEE Communications Letters Abbreviated Journal IEEE Commun. Lett.
Volume 26 Issue 2 Pages 379-383
Keywords Resource management; Partitioning algorithms; Modulation; Bit rate; Signal to noise ratio; Optical scattering
Abstract Multi-band elastic optical networks are a promising alternative to meet the bandwidth demand of the ever-growing Internet traffic. In this letter, we propose a family of band allocation algorithms for multi-band elastic optical networks. Employing simulation, we evaluate the blocking performance of 3 algorithms of such a family and compare their performance with the only heuristic proposed to date. Results show that the three new algorithms outperform the previous proposal, with up to one order of magnitude improvement. We expect these results to help advance the area of dynamic resource allocation in multi-band elastic optical networks.
Address
Corporate Author Thesis
Publisher Place of Publication Editor
Language Summary Language Original Title
Series Editor Series Title Abbreviated Series Title
Series Volume Series Issue Edition
ISSN 1089-7798 ISBN Medium
Area Expedition Conference
Notes WOS:000754246100037 Approved
Call Number UAI @ alexi.delcanto @ Serial 1733
Permanent link to this record
 
 
Author Ferran, S.; Beghelli, A.; Huerta-Canepa, G.; Jensen, F.
Title Correctness assessment of a crowdcoding project in a computer programming introductory course Type
Year 2018 Publication Computer Applications In Engineering Education Abbreviated Journal Comput. Appl. Eng. Educ.
Volume 26 Issue 1 Pages 162-170
Keywords automated code correctness assessment; computer programming education; crowdcoding; software crowdsourcing
Abstract Crowdcoding is a programming model that outsources a software project implementation to the crowd. As educators, we think that crowdcoding could be leveraged as part of the learning path of engineering students from a computer programming introductory course to solve local community problems. The benefits are twofold: on the one hand the students practice the concepts learned in class and, on the other hand, they participate in real-life problems. Nevertheless, several challenges arise when developing a crowdcoding platform, the first one being how to check the correctness of student's code without giving an extra burden to the professors in the course. To overcome this issue, we propose a novel system that does not resort to expert review; neither requires knowing the right answers beforehand. The proposed scheme automatically clusters the student's codes based solely on the output they produce. Our initial results show that the largest cluster contains the same codes selected as correct by the automated and human testing, as long as some conditions apply.
Address [Ferran, Sebastian; Beghelli, Alejandra; Huerta-Canepa, Gonzalo; Jensen, Federico] Univ Adolfo Ibanez, Fac Engn & Sci, Ave Padre Hurtado 750, Vina Del Mar, Chile, Email: alejandra.beghelli@uai.cl
Corporate Author Thesis
Publisher Wiley Place of Publication Editor
Language English Summary Language Original Title
Series Editor Series Title Abbreviated Series Title
Series Volume Series Issue Edition
ISSN 1061-3773 ISBN Medium
Area Expedition Conference
Notes WOS:000419898700013 Approved
Call Number UAI @ eduardo.moreno @ Serial 822
Permanent link to this record
 
 
Author Leiva, A.; Machuca, C.M.; Beghelli, A.; Olivares, R.
Title Migration Cost Analysis for Upgrading WDM Networks Type
Year 2013 Publication Ieee Communications Magazine Abbreviated Journal IEEE Commun. Mag.
Volume 51 Issue 11 Pages 87-93
Keywords
Abstract We present a generic step-by-step methodology for evaluating the total cost of migrating from a capacity-exhausted WDM network to different upgraded alternatives. The presented methodology is the first effort to provide a generic evaluation framework (allowing the evaluation of scenarios with different traffic growth rates, optical technologies, network architectures, and resource allocation algorithms) that considers both capital and operational expenditures of the upgraded alternatives to then identify the lowest-cost option. Previous works have just evaluated specific scenarios or only CapEx or OpEx (not both). As a way of illustration, the proposed methodology was applied to compare the migration cost of two upgrading scenarios. The methodology allowed identifying the lowest-cost alternative, categorizing the key cost factors of CapEx and OpEx, and evaluating its impact on the migration cost. Surprisingly, results for the study case presented show that migrating to an automatically provisioned network does not necessarily lead to cost savings.
Address [Leiva, Ariel] Pontificia Univ Catolica Valparaiso, Valparaiso, Chile, Email: ariel.leiva@ucv.cl;
Corporate Author Thesis
Publisher Ieee-Inst Electrical Electronics Engineers Inc Place of Publication Editor
Language English Summary Language Original Title
Series Editor Series Title Abbreviated Series Title
Series Volume Series Issue Edition
ISSN 0163-6804 ISBN Medium
Area Expedition Conference
Notes WOS:000327426500013 Approved
Call Number UAI @ eduardo.moreno @ Serial 329
Permanent link to this record
 
 
Author Leiva, A.; Pavez, N.; Beghelli, A.; Olivares, R.
Title A Joint RSA Algorithm for Dynamic Flexible Optical Networking Type
Year 2015 Publication Ieee Latin America Transactions Abbreviated Journal IEEE Latin Am. Trans.
Volume 13 Issue 11 Pages 3531-3537
Keywords Dynamic optical networks; flexible grid; Routing and Spectrum Allocation
Abstract We propose a novel algorithm to solve the Routing and Spectrum Allocation (RSA) problem in dynamic flexible grid optical networks. Unlike most previous proposals, the algorithm solves the R and SA problems jointly by exhaustively searching the solution space and taking the network state into account. As a result, the shortest possible path with enough spectrum availability is allocated to establish the connections. Simulation results show that, in terms of blocking ratio, our proposal significantly outperforms previously proposed algorithms. In some cases, the performance is better by more than one order of magnitude.
Address [Leiva, A.; Pavez, N.] Pontificia Univ Catolica Valparaiso, Valparaiso, Chile, Email: ariel.leiva@ucv.cl;
Corporate Author Thesis
Publisher Ieee-Inst Electrical Electronics Engineers Inc Place of Publication Editor
Language Spanish Summary Language Original Title
Series Editor Series Title Abbreviated Series Title
Series Volume Series Issue Edition
ISSN 1548-0992 ISBN Medium
Area Expedition Conference
Notes WOS:000369488700006 Approved
Call Number UAI @ eduardo.moreno @ Serial 592
Permanent link to this record
 
 
Author Leiva, A.; Shumada, R.; Beghelli, A.; Olivares, R.
Title Algoritmo RMLSA para redes ópticas flexibles en operación dinámica Type
Year 2018 Publication Ingeniare Abbreviated Journal Ingeniare
Volume 26 Issue 3 Pages
Keywords
Abstract
Address
Corporate Author Thesis
Publisher Place of Publication Editor
Language Summary Language Original Title
Series Editor Series Title Abbreviated Series Title
Series Volume Series Issue Edition
ISSN 0718-3305 ISBN Medium
Area Expedition Conference
Notes Approved
Call Number UAI @ eduardo.moreno @ Serial 1288
Permanent link to this record
 
 
Author Lozada, A.; Calderon, F.; Kasaneva, J.N.; Borquez-Paredes, D.; Olivares, R.; Beghelli, A.; Jara, N.; Leiva, A.; Saavedra, G.
Title Impact of Amplification and Regeneration Schemes on the Blocking Performance and Energy Consumption of Wide-Area Elastic Optical Networks Type
Year 2021 Publication IEEE Access Abbreviated Journal IEEE Access
Volume 9 Issue Pages 134355-134368
Keywords Repeaters; Erbium-doped fiber amplifiers; Energy consumption; Optical signal processing; Optical polarization; Gain; Optical pumping; Elastic optical networks; resource assignment; translucent configuration; transparent configuration
Abstract This paper studies the physical layer's impact on the blocking probability and energy consumption of wide-area dynamic elastic optical networks (EONs). For this purpose, we consider five network configurations, each named with a network configuration identifier (NCI) from 1 to 5, for which the Routing, Modulation Level, and Spectrum Assignment (RMLSA) problem is solved. NCI 1-4 are transparent configurations based on all-EDFA, hybrid Raman/EDFA amplifiers (with different Raman gain ratio Gamma(R)), all-DFRA, and alternating span configuration (EDFA and DFRA). NCI 5 is a translucent configuration based on all-EDFA and 3R regenerators. We model the physical layer for every network configuration to determine the maximum achievable reach of optical signals. Employing simulation, we calculate the blocking probability and the energy consumption of the different network configurations. In terms of blocking, our results show that NCI 2 and 3 offer the lowest blocking probability, with at least 1 and 3 orders of magnitude of difference with respect to NCI 1 and 5 at high and low traffic loads, respectively. In terms of energy consumption, the best performing alternatives are the ones with the worst blocking (NCI 1), while NCI 3 exhibits the highest energy consumption with NCI Gamma(R) = 0.75 following closely. This situation highlights a clear trade-off between blocking performance and energy cost that must be considered when designing a dynamic EON. Thus, we identify NCI 2 using Gamma(R) = 0.25 as a promising alternative to reduce the blocking probability significantly in wide-area dynamic EONs without a prohibitive increase in energy consumption.
Address
Corporate Author Thesis
Publisher Place of Publication Editor
Language Summary Language Original Title
Series Editor Series Title Abbreviated Series Title
Series Volume Series Issue Edition
ISSN 2169-3536 ISBN Medium
Area Expedition Conference
Notes WOS:000704486300001 Approved
Call Number UAI @ alexi.delcanto @ Serial 1480
Permanent link to this record
 
 
Author Morales, P.; Lozada, A.; Borquez-Paredes, D.; Olivares, R.; Saavedra, G.; Leiva, A.; Beghelli, A.; Jara, N.
Title Improving the Performance of SDM-EON Through Demand Prioritization: A Comprehensive Analysis Type
Year 2021 Publication IEEE Access Abbreviated Journal IEEE Access
Volume 9 Issue Pages 63475-63490
Keywords Modulation; Optical fiber networks; Optical modulation; Routing; Resource management; Bandwidth; Optical variables control; Elastic optical networks; space-division multiplexing; resource assignment; network capacity; physical-layer impairments
Abstract This paper studies the impact of demand-prioritization on Space-Division Multiplexing Elastic Optical Networks (SDM-EON). For this purpose, we solve the static Routing, Modulation Level, Spatial Mode, and Spectrum Assignment (RMLSSA) problem using 34 different explainable demand-prioritization strategies. Although previous works have applied heuristics or meta-heuristics to perform demand-prioritization, they have not focused on identifying the best prioritization strategies, their inner operation, and the implications behind their good performance by thorough profiling and impact analysis. We focus on a comprehensive analysis identifying the best explainable strategies to sort network demands in SDM-EON, considering the physical-layer impairments found in optical communications. Also, we show that simply using the common shortest path routing might lead to higher resource requirements. Extensive simulation results show that up to 8.33% capacity savings can be achieved on average by balanced routing, up to a 16.69% capacity savings can be achieved using the best performing demand-prioritization strategy compared to the worst-performing ones, the most used demand-prioritization strategy in the literature (serving demands with higher bandwidth requirements first) is not the best-performing one but the one sorting based on the path lengths, and using double-criteria strategies to break ties is key for a good performance. These results are relevant showing that a good combination of routing and demand-prioritization heuristics impact significantly on network performance. Additionally, they increase the understanding about the inner workings of good heuristics, a valuable knowledge when network settings forbid using more computationally complex approaches.
Address
Corporate Author Thesis
Publisher Place of Publication Editor
Language Summary Language Original Title
Series Editor Series Title Abbreviated Series Title
Series Volume Series Issue Edition
ISSN 2169-3536 ISBN Medium
Area 2169-3536 Expedition Conference
Notes WOS:000645846600001 Approved
Call Number UAI @ alexi.delcanto @ Serial 1371
Permanent link to this record
 
 
Author Moreno, E.; Beghelli, A.; Cugini, F.
Title Traffic engineering in segment routing networks Type
Year 2017 Publication Computer Networks Abbreviated Journal Comput. Netw.
Volume 114 Issue Pages 23-31
Keywords Segment routing; Integer Linear Programming; Heuristic
Abstract Segment routing (SR) has been recently proposed as an alternative traffic engineering (TE) technology enabling relevant simplifications in control plane operations. In the literature, preliminary investigations on SR have focused on label encoding algorithms and experimental assessments, without carefully addressing some key aspects of SR in terms of the overall network TE performance. In this study, ILP models and heuristics are proposed and successfully utilized to assess the TE performance of SR-based packet networks. Results show that the default SR behavior of exploiting equal cost multiple paths (ECMP) may lead to several drawbacks, including higher network resource utilization with respect to cases where ECMP is avoided. Moreover, results show that, by properly performing segment list computations, it is possible to achieve very effective TE solutions by just using a very limited number of stacked labels, thus successfully exploiting the benefits of the SR technology. (C) 2017 Elsevier B.V. All rights reserved.
Address [Moreno, Eduardo] Univ Adolfo Ibanez, Fac Sci & Engn, Santiago, Chile, Email: eduardo.moreno@uai.cl
Corporate Author Thesis
Publisher Elsevier Science Bv Place of Publication Editor
Language English Summary Language Original Title
Series Editor Series Title Abbreviated Series Title
Series Volume Series Issue Edition
ISSN 1389-1286 ISBN Medium
Area Expedition Conference
Notes WOS:000395214000003 Approved
Call Number UAI @ eduardo.moreno @ Serial 708
Permanent link to this record
 
 
Author Pinto-Rios, J.; Calderon, F.; Leiva, A.; Hermosilla, G.; Beghelli, A.; Borquez-Paredes, D.; Lozada, A.; Jara, N.; Olivares, R.; Saavedra, G.
Title Resource Allocation in Multicore Elastic Optical Networks: A Deep Reinforcement Learning Approach Type
Year 2023 Publication Complexity Abbreviated Journal Complexity
Volume 2023 Issue Pages 4140594
Keywords SPECTRUM ASSIGNMENT; ARCHITECTURE; CROSSTALK; EFFICIENT; CORE
Abstract A deep reinforcement learning (DRL) approach is applied, for the first time, to solve the routing, modulation, spectrum, and core allocation (RMSCA) problem in dynamic multicore fiber elastic optical networks (MCF-EONs). To do so, a new environment was designed and implemented to emulate the operation of MCF-EONs – taking into account the modulation format-dependent reach and intercore crosstalk (XT) – and four DRL agents were trained to solve the RMSCA problem. The blocking performance of the trained agents was compared through simulation to 3 baselines RMSCA heuristics. Results obtained for the NSFNet and COST239 network topologies under different traffic loads show that the best-performing agent achieves, on average, up to a four-times decrease in blocking probability with respect to the best-performing baseline heuristic method.
Address
Corporate Author Thesis
Publisher Place of Publication Editor
Language Summary Language Original Title
Series Editor Series Title Abbreviated Series Title
Series Volume Series Issue Edition
ISSN 1076-2787 ISBN Medium
Area Expedition Conference
Notes WOS:000947244300001 Approved
Call Number UAI @ alexi.delcanto @ Serial 1772
Permanent link to this record
 
 
Author Prieto, P.; Bride, J.C.; Beghelli, A.; Canessa, E.; Barra, C.
Title I like it elegant: imprinting personalities into product shapes Type
Year 2020 Publication International Journal of Design Creativity and Innovation Abbreviated Journal Int. J. Des. Creativity Innov.
Volume 8 Issue 1 Pages 5-20
Keywords
Abstract
Address
Corporate Author Thesis
Publisher Place of Publication Editor
Language Summary Language Original Title
Series Editor Series Title Abbreviated Series Title
Series Volume Series Issue Edition
ISSN 2165-0349 ISBN Medium
Area Expedition Conference
Notes Approved
Call Number UAI @ eduardo.moreno @ Serial 1307
Permanent link to this record
 
 
Author Prieto, P.; Briede, J.C.; Beghelli, A.; Canessa, E.; Barra, C.
Title I like it elegant: imprinting personalities into product shapes Type
Year 2020 Publication International Journal Of Design Creativity And Innovation Abbreviated Journal Int. J. Des. Creat. Innov.
Volume 8 Issue 1 Pages 5-20
Keywords Design methodology; concept generation; inspiration
Abstract The ability of designing personality-based products is key for their successful launch in the market, since customers prefer products that have a similar personality to their own. However, the creative process designers use to imprint a given personality into a product is still a ?black-box? and lengthy process that requires expertise and successive customer validation. The research challenge here is how to systematize the creative process of defining new geometries of a product with an intended personality. Due to the complexity of this challenge, the focus of this paper is solely about the process of defining the shape of a product with a given personality. A 5-step systematic method to extract and define the key form aspects of a specific personality is defined to do this. The use of the method is exemplified by developing a shape which is representative of an elegant personality and its suitability is tested using questionnaires answered by both design and non-design trained people. Results show that customers better recognize the personality imprinted on the object when the steps of the proposed method are fully complied with. This work will assist designers with the creative process of product form definition.
Address [Prieto, Pablo; Briede, Juan C.] Univ Tecn Federico Santa Maria, Engn Design Dept, Valparaiso, Chile, Email: pablo.prieto@usm.cl
Corporate Author Thesis
Publisher Taylor & Francis Ltd Place of Publication Editor
Language English Summary Language Original Title
Series Editor Series Title Abbreviated Series Title
Series Volume Series Issue Edition
ISSN 2165-0349 ISBN Medium
Area ESCI Expedition Conference
Notes WOS:000492377800001 Approved
Call Number UAI @ eduardo.moreno @ Serial 1059
Permanent link to this record
 
 
Author Tarifeno-Gajardo, M.; Beghelli, A.; Moreno, E.
Title Availability-Driven Optimal Design of Shared Path Protection in WDM Networks Type
Year 2016 Publication Networks Abbreviated Journal Networks
Volume 68 Issue 3 Pages 224-237
Keywords optical networks; shared path protection; prioritized shared protection; availability-guarantees; integer linear programming; heuristic; wavelength division multiplexing networks
Abstract Availability, defined as the fraction of time a network service is operative, is a key network service parameter. Dedicated protection increases availability but also the cost. Shared protection instead decreases the cost, but also the availability. In this article, we formulate and solve an integer linear programming (ILP) model for the problem of minimizing the backup resources required by a shared-protected static optical network whilst guaranteeing an availability target per connection. The main research challenge is dealing with the nonlinear expression for the availability constraint. Taking the working/backup routes and the availability requirements as input data, the ILP model identifies the set of connections sharing backup resources in any given network link. We also propose a greedy heuristic to solve large instances in much shorter time than the ILP model with low levels of relative error (2.49% average error in the instances studied) and modify the ILP model to evaluate the impact of wavelength conversion. Results show that considering availability requirements can lead up to 56.4% higher backup resource requirements than not considering them at all, highlighting the importance of availability requirements in budget estimation. (C) 2016 Wiley Periodicals, Inc.
Address [Tarifeno-Gajardo, Marco] Univ Tecn Federico Santa Maria, Dept Elect Engn, Valparaiso, Chile, Email: marco.tarifeno@postgrado.usm.cl
Corporate Author Thesis
Publisher Wiley-Blackwell Place of Publication Editor
Language English Summary Language Original Title
Series Editor Series Title Abbreviated Series Title
Series Volume Series Issue Edition
ISSN 0028-3045 ISBN Medium
Area Expedition Conference
Notes WOS:000388289300005 Approved
Call Number UAI @ eduardo.moreno @ Serial 678
Permanent link to this record