|   | 
Details
   web
Records
Author (up) 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 (up) 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 (up) Calderon, F.I.; Lozada, A.; Borquez-Paredes, D.; Olivares, R.; Davalos, E.J.; Saavedra, G.; Jara, N.; Leiva, A.
Title BER-Adaptive RMLSA Algorithm for Wide-Area Flexible Optical Networks Type
Year 2020 Publication Ieee Access Abbreviated Journal IEEE Access
Volume 8 Issue Pages 128018-128031
Keywords Elastic optical networks; routing; modulation level; spectrum allocation; bit error rate; quality of service
Abstract Wide-area optical networks face significant transmission challenges due to the relentless growth of bandwidth demands experienced nowadays. Network operators must consider the relationship between modulation format and maximum reach for each connection request due to the accumulation of physical layer impairments in optical fiber links, to guarantee a minimum quality of service (QoS) and quality of transmission (QoT) to all connection requests. In this work, we present a BER-adaptive solution to solve the routing, modulation format, and spectrum assignment (RMLSA) problem for wide-area elastic optical networks. Our main goal is to maximize successful connection requests in wide-area networks while choosing modulation formats with the highest efficiency possible. Consequently, our technique uses an adaptive bit-error-rate (BER) threshold to achieve communication with the best QoT in the most efficient manner, using the strictest BER value and the modulation format with the smallest bandwidth possible. Additionally, the proposed algorithm relies on 3R regeneration devices to enable long-distances communications if transparent communication cannot be achieved. We assessed our method through simulations for various network conditions, such as the number of regenerators per node, traffic load per user, and BER threshold values. In a scenario without regenerators, the BER-Adaptive algorithm performs similarly to the most relaxed fixed BER threshold studied in blocking probability. However, it ensures a higher QoT to most of the connection requests. The proposed algorithm thrives with the use of regenerators, showing the best performance among the studied solutions, enabling long-distance communications with a high QoT and low blocking probability.
Address [Ignacio Calderon, Felipe; Leiva, Ariel] Pontificia Univ Catolica Valparaiso, Sch Elect Engn, Valparaiso 2362804, Chile, Email: ariel.leiva@pucv.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 2169-3536 ISBN Medium
Area Expedition Conference
Notes WOS:000551856900001 Approved
Call Number UAI @ eduardo.moreno @ Serial 1208
Permanent link to this record
 

 
Author (up) 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 (up) 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 (up) 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 (up) 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 (up) 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