|
|
Borquez-Paredes, D., Beghelli, A., Leiva, A., Jara, N., Lozada, A., Morales, P., et al. (2022). Agent-based distributed protocol for resource discovery and allocation of virtual networks over elastic optical networks. J. Opt. Commun. Netw., 14(8), 667–679.
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.
|
|
|
|
Borquez-Paredes, D., Beghelli, A., Leiva, A., & Murrugarra, R. (2018). Does fragmentation avoidance improve the performance of dynamic spectrum allocation in elastic optical networks? Photonic Netw. Commun., 35(3), 287–299.
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.
|
|
|
|
Calderon, F., Lozada, A., Morales, P., Borquez-Paredes, D., Jara, N., Olivares, R., et al. (2022). Heuristic Approaches for Dynamic Provisioning in Multi-Band Elastic Optical Networks. IEEE Commun. Lett., 26(2), 379–383.
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.
|
|
|
|
Calderon, F. I., Lozada, A., Borquez-Paredes, D., Olivares, R., Davalos, E. J., Saavedra, G., et al. (2020). BER-Adaptive RMLSA Algorithm for Wide-Area Flexible Optical Networks. IEEE Access, 8, 128018–128031.
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.
|
|
|
|
Leiva, A., Machuca, C. M., Beghelli, A., & Olivares, R. (2013). Migration Cost Analysis for Upgrading WDM Networks. IEEE Commun. Mag., 51(11), 87–93.
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.
|
|
|
|
Leiva, A., Pavez, N., Beghelli, A., & Olivares, R. (2015). A Joint RSA Algorithm for Dynamic Flexible Optical Networking. IEEE Latin Am. Trans., 13(11), 3531–3537.
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.
|
|
|
|
Leiva, A., Shumada, R., Beghelli, A., & Olivares, R. (2018). Algoritmo RMLSA para redes ópticas flexibles en operación dinámica. Ingeniare, 26(3).
|
|
|
|
Lopez, D., Leiva, A. M., Arismendi, W., & Vidal, G. (2019). Influence of design and operational parameters on the pathogens reduction in constructed wetland under the climate change scenario. Rev. Environ. Sci. Bio-Technol., 18(1), 101–125.
Abstract: Under the climate change scenario, constructed wetlands (CWs) as an engineered system for treating domestic wastewater will face different challenges. Some of them are: (a) the increase of pathogens concentration in wastewater due to the rise of global temperature; (b) higher precipitation that can cause an increase of pathogens due to runoff; (c) the reuse of treated wastewater related to the water scarcity. These problems can affect the capacity of CWs for removal pathogens. In this context, the objective of this review is to provide an overview of the influence of design and operational parameters on pathogens reduction in CWs. To accomplish with this purpose, the published information (>30 studies) about the reduction of pathogens and the operational and design parameters in different CWs configurations and were gathered. With this data, statistical analyses were performed considering the most relevant variables which significantly influence the removal of pathogens in CWs. For this, principal component analyses (PCA) were achieved for determining, separately, the correlation of operational parameters with fecal coliform (FC) and total coliform (TC) removal. The results of PCA showed that FC and TC were correlated positively with mass removal rates of chemical oxygen demand (COD) and biological oxygen Demand (BOD5), total suspended solids (TSS) removal and the size of support medium. This study is the first approach that analyzes together the design and operational parameters which influence the pathogen removal in CWs. For this reason, these parameters and the increase on microorganism concentrations due to the climate change have to be considered for the future design of CWs.
|
|
|
|
Lozada, A., Calderon, F., Kasaneva, J. N., Borquez-Paredes, D., Olivares, R., Beghelli, A., et al. (2021). Impact of Amplification and Regeneration Schemes on the Blocking Performance and Energy Consumption of Wide-Area Elastic Optical Networks. IEEE Access, 9, 134355–134368.
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.
|
|
|
|
Morales, P., Lozada, A., Borquez-Paredes, D., Olivares, R., Saavedra, G., Leiva, A., et al. (2021). Improving the Performance of SDM-EON Through Demand Prioritization: A Comprehensive Analysis. IEEE Access, 9, 63475–63490.
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.
|
|
|
|
Pinto-Rios, J., Calderon, F., Leiva, A., Hermosilla, G., Beghelli, A., Borquez-Paredes, D., et al. (2023). Resource Allocation in Multicore Elastic Optical Networks: A Deep Reinforcement Learning Approach. Complexity, 2023, 4140594.
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.
|
|
