|   | 
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.
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
Area 2169-3536 Expedition Conference
Notes WOS:000645846600001 Approved
Call Number UAI @ alexi.delcanto @ Serial 1371
Permanent link to this record

Author 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 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