An official website of the United States government
Space division multiplexed elastic optical networks (SDM-EONs) enhance service provisioning by offering increased fiber capacity through the use of flexible spectrum allocation, multiple spatial modes, and efficient modulations. In these networks, the problem of allocating resources for connections involves assigning routes, modulations, cores, and spectrum (RMCSA). However, the presence of intercore crosstalk (XT) between ongoing connections on adjacent cores can degrade signal transmission, necessitating proper handling during resource assignment. The use of multiple modulations in translucent optical networks presents a challenge in balancing spectrum utilization and XT accumulation. In this paper, we propose a dual-optimized RMCSA algorithm called the Capacity Loss Aware Resource Assignment Algorithm (CLARA+), which optimizes network capacity utilization to improve resource availability and network performance. A two-step machine-learning-enabled optimization is used to improve the resource allocations by balancing the tradeoff between spectrum utilization and XT accumulation with the help of feature extraction from the network. Extensive simulations demonstrate that CLARA+ significantly reduces bandwidth blocking probability and enhances resource utilization across various scenarios. We show that our strategy applied to a few algorithms from the literature improves the bandwidth blocking probability by up to three orders of magnitude. The algorithm effectively balances spectrum utilization and XT accumulation more efficiently compared to existing algorithms in the literature.
more »
« less
Link-protection and FIPP p-cycle designs in translucent elastic optical networks
Elastic optical networks (EONs) are able to provide high spectrum utilization efficiency due to flexibility in resource assignment. In translucent EONs, by employing regenerators and using advanced modulation formats for transmission, spectrum efficiency can be further improved. Survivability is regarded as an important aspect of EONs, and p-cycle protection is considered to be an attractive scheme due to its fast restoration and high protection efficiency. In this paper, we propose methods for evaluating and selecting p-cycles for both link protection (LP) and failure-independent path protection (FIPP) to survive single-link failures. After considering the various factors that affect the performance of a p-cycle, we propose two evaluation metrics for LP and FIPP, namely, individual p-cycle cost and set of cycles cost. Based on these metrics, we propose two algorithms for selecting a set of p-cycles in translucent EONs: Traffic Independent P-cycle Selection (TIPS), which selects a set of cycles without knowledge of the traffic, and Traffic-Oriented P-cycle Selection (TOPS), which takes given traffic information into account. A routing and spectrum assignment algorithm is designed for translucent EONs, and our p-cycle design algorithms are evaluated using both static and dynamic traffic models. Simulation results show that the proposed algorithms have better performance than commonly used baseline algorithms. We also compare the performance of LP p-cycles and FIPP p-cycles.
more »
« less
- Award ID(s):
- 1818858
- PAR ID:
- 10145185
- Publisher / Repository:
- Optical Society of America
- Date Published:
- Journal Name:
- Journal of Optical Communications and Networking
- Volume:
- 12
- Issue:
- 7
- ISSN:
- 1943-0620; JOCNBB
- Format(s):
- Medium: X Size: Article No. 163
- Size(s):
- Article No. 163
- Sponsoring Org:
- National Science Foundation
More Like this
-
-
Service provisioning can be enhanced with spectrally spatially flexible optical networks (SS-FONs) with multicore fibers; however, intercore crosstalk (XT) is a dominant impairment that complicates the problem of maintaining the quality of transmission (QoT) and resource allocation. The selection of modulation formats (MFs), due to their unique XT sensitivities, further increases the complexity. The routing, modulation, core, and spectrum assignment (RMCSA) problem must select the resources carefully to exploit the available capacity while meeting the desired QoT. In this paper, we propose an RMCSA algorithm called the tridental resource assignment (TRA) algorithm for transparent SS-FONs, and its variant, translucency-aware TRA (TaTRA), for translucent SS-FONs. TRA balances three different factors that affect network performance under dynamic resource allocation. We consider translucent networks with flexible regeneration and with and without modulation and spectrum conversion. Our resource assignment approach includes both an offline network planning component to calculate path priorities and an online/dynamic provisioning component to allocate resources. Extensive simulation experiments performed in realistic network scenarios indicate that TRA and TaTRA significantly reduce the bandwidth blocking probability by several orders of magnitude in some cases.more » « less
-
Matching markets with historical data are abundant in many applications, e.g., matching candidates to jobs in hiring, workers to tasks in crowdsourcing markets, and jobs to servers in cloud services. In all these applications, a match consumes one or more shared and limited resources and the goal is to best utilize these to maximize a global objective. Additionally, one often has historical data and hence some statistics (usually first-order moments) of the arriving agents (e.g., candidates, workers, and jobs) can be learnt. To model these scenarios, we propose a unifying framework, called Multi- Budgeted Online Assignment with Known Adversarial Distributions. In this model,we have a set of offline servers with different deadlines and a set of online job types. At each time, a job of type j arrives. Assigning this job to a server i yields a profit w(i, j) while consuming a(i,j) -- a vector lying in [0, 1]^K -- quantities of distinct resources. The goal is to design an (online) assignment policy that maximizes the total expected profit without violating the (hard) budget constraint. We propose and theoretically analyze two linear programming (LP) based algorithms which are almost optimal among all LP-based approaches. We also propose several heuristics adapted from our algorithms and compare them to other LP-agnostic algorithms using both synthetic as well as real-time cloud scheduling and public safety datasets. Experimental results show that our proposed algorithms are effective and significantly out-perform the baselines. Moreover, we show empirically the trade-off between fairness and efficiency of our algorithms which does well even on fairness metrics without explicitly optimizing for it.more » « less
-
The increasing demand for flexible and efficient optical networks has led to the development of Software-Defined Elastic Optical Networks (SD-EONs). These networks leverage the programmability of Software-Defined Networking (SDN) and the adaptability of Elastic Optical Networks (EONs) to optimize network performance under dynamic traffic conditions. However, existing simulation tools often fall short in terms of transparency, flexibility, and advanced functionality, limiting their utility in cutting-edge research. In this paper, we present a Flexible Unified Simulator for Intelligent Optical Networking (FUSION), a fully open-source simulator designed to address these limitations and provide a comprehensive platform for SD-EON research. FUSION integrates traditional routing and spectrum assignment algorithms with advanced machine learning and reinforcement learning techniques, including support for the Stable Baselines 3 library. The simulator also offers robust unit testing, a fully functional Graphical User Interface (GUI), and extensive documentation to ensure usability and reliability. Performance evaluations demonstrate the effectiveness of FUSION in modeling complex network scenarios, showcasing its potential as a powerful tool for advancing SD-EON research.more » « less
-
A fine-grained flexible frequency grid for elastic optical transmission and space division multiplexing in conjunction with spectrally efficient modulations is an excellent solution to the coming capacity crunch. In space division multiplexed elastic optical networks (SDM-EONs), the routing, modulation, core, and spectrum assignment (RMCSA) problem is an important lightpath resource assignment problem. Intercore cross talk (XT) reduces the quality of parallel transmissions on separate cores, and the RMCSA algorithm must ensure that XT requirements are satisfied while optimizing network performance. There is an indirect trade-off between spectrum utilization and XT tolerance; while higher modulations are more spectrum efficient, they are also less tolerant of XT since they permit fewer connections on neighboring cores on the overlapping spectra. Numerous XT-aware RMCSA algorithms restrict the number of litcores, cores on which overlapping spectra are occupied, to guarantee XT constraints are met. In this paper, we present a machine learning (ML) aided threshold optimization strategy that enhances the performance ofanyRMCSA algorithm for any network model. We show that our strategy applied to a few algorithms from the literature improves the bandwidth blocking probability by up to three orders of magnitude. We also present the RMCSA algorithm called spectrum-wastage-avoidance-based resource allocation (SWARM), which is based on the idea of spectrum wastage due to spectrum requirements and XT constraints. We note that SWARM not only outperforms other RMCSA algorithms, but also its ML-optimized variant outperforms other ML-optimized RMCSA algorithms.more » « less
