Search Results (19)

Environmentally friendly materials with superior structural, physical, optical, and shielding capabilities are of great technological importance and are continually being investigated. In this work, novel multicomponent borate glasses with the composition xTiO₂-10BaO-5Al₂O₃-5WO₃-20Bi₂O₃-(60-x) B₂O₃, where 0 ≤ x ≤ 15 mol%, were produced via the melt-quenching technique. The increase in TiO₂ content results in a decrease in molar volume and a corresponding increase in density, indicating the formation of a compact, rigid, and mechanically hard glass network. Elastic constant measurements further confirmed this behavior. FTIR analysis confirms the transformation of BO₃ to BO₄ units, signifying improved network polymerization and structural stability. The prepared glasses exhibit an optical absorption edge in the visible region, demonstrating their strong ultraviolet light blocking capability. Incorporation of TiO₂ leads to an increase in refractive index, optical basicity, and polarizability, and a decrease in the optical band gap and metallization number; all of these suggest enhanced electron density and polarizability of the glass matrix. Radiation shielding properties were evaluated using Phy-X/PSD software. The outcomes illustrate that the Mass Attenuation Coefficient (MAC), Effective Atomic Number (Z_eff), Linear Attenuation Coefficient (LAC) increase, while Mean Free Path (MFP) and Half Value Layer (HVL) decrease with increasing TiO₂ at the expense of B₂O₃, confirming superior gamma-ray attenuation capability. Additionally, both TiO₂-doped and undoped samples show higher fast neutron removal cross sections (FNRCS) compared to several commercial glasses and concrete materials. Overall, the incorporation of TiO₂ significantly enhances the optical performance and radiation-shielding efficiency of the environmentally friendly glass system, making these potential candidates for advanced photonic devices and radiation-shielding applications. Full article

To support the 6G vision of seamless “space–air–ground-integrated” global coverage, optical satellite networks must enable high-speed, low-latency, and intelligent data transmission. However, conventional inter-satellite laser link-based optical transport networks suffer from inefficient bandwidth utilization and nonlinear latency accumulation caused by multi-hop routing, which severely limits their ability to support ultra-low-latency and real-time applications. To address the critical challenges of high topological complexity and stringent real-time requirements in satellite elastic optical networks, we propose an asynchronous advantage actor–critic-based quality of service-aware routing optimization mechanism for the optical inter-satellite link (OISL-AQROM). By establishing a quantitative model that correlates the optical service unit (OSU) C value with node hop count, the algorithm enhances the performance of latency-sensitive services in dynamic satellite environments. Simulation results conducted on a Walker-type low Earth orbit (LEO) constellation comprising 1152 satellites demonstrate that OISL-AQROM reduces end-to-end latency by 76.3% to 37.6% compared to the traditional heuristic multi-constrained shortest path first (MCSPF) algorithm, while supporting fine-grained dynamic bandwidth adjustment down to a minimum granularity of 2.6 Mbps. Furthermore, OISL-AQROM exhibits strong convergence and robust stability across diverse traffic loads, consistently outperforming MCSPF and deep deterministic policy gradient (DDPG) algorithm in overall efficiency, load adaptability, and operational reliability. The proposed algorithm significantly improves service quality and transmission efficiency in commercial mega-constellation optical satellite networks, demonstrating engineering applicability and potential for practical deployment in future 6G infrastructure. Full article

To meet the increasing demands for data, elastic optical networks (EONs) require highly efficient resource management. While classical Routing and Spectrum Assignment (RSA) algorithms establish a path and allocate spectrum, advanced versions such as Routing, Modulation-format-selection, and Spectrum Assignment (RMSA) also optimize modulation format selection. However, these approaches often lack adaptability to diverse network aspects. The hybrid routing and spectrum assignment (HRSA) algorithm offers a more flexible and robust approach by providing multiple choices between route (resource savings) and spectrum prioritization (fragmentation mitigation and network load balancing) for each network node pair. Despite its potential, the adaptive nature of HRSA introduces complexity, and the influence of topological features on its decisions remains not fully understood. This knowledge gap hinders the ability to optimize network design and resource allocation fully. This paper examines how topological features influence HRSA’s adaptive decisions regarding routing and spectrum assignment prioritization for source-destination node pairs in EONs. By employing machine learning approaches—Decision Tree (DT), Random Forest (RF), Extreme Gradient Boosting (XGBoost), and Support Vector Machine (SVM)—we model and identify the key topological features that influence HRSA’s decision-making. Then, we compare the models generated by each approach and extract insights using an a posteriori analysis technique to evaluate feature importance. Our results show the algorithm’s behavior is highly predictable (over 91% accuracy), with decisions driven primarily by the network’s structure and node metrics. This work advances the understanding of how topological features influence the RSA problem. Full article

In this paper, we propose a grouping-based dynamic routing, core, and spectrum allocation (RCSA) method for preventing spectrum fragmentation and inter-core crosstalk in elastic optical path networks based on multi-core fiber environments. Multi-core fibers enable us to considerably enhance the transmission capacity of optical links; however, this induces inter-core crosstalk, which degrades the quality of optical signals. We should thus avoid using the same frequency bands in adjacent cores in order to ensure high-quality communications. However, this simple strategy leads to inefficient use of frequency-spectrum resources, resulting in spectrum fragmentation and a high blocking probability for lightpath establishment. The proposed method allows one to overcome this difficulty by grouping lightpath-setup requests according to their required number of frequency slots. By assigning lightpath-setup requests belonging to the same group to cores according to their priority, the proposed method aims to suppress inter-core crosstalk. Furthermore, the proposed method is designed to mitigate spectrum fragmentation by determining the prioritized frequency bandwidth for lightpath-setup requests according to their required number of frequency slots. We show that the proposed method reduces the blocking of lightpath establishment while suppressing inter-core crosstalk through simulation experiments. Full article

This paper considers the online routing, modulation, spectrum, and core allocation problem in elastic optical networks. Three algorithms are proposed to minimize the bandwidth blocking probability while taking into account the impact of interference from established lightpaths. These algorithms are based on a sequence of alternative paths, ordered in terms of increasing lengths, determined by Yen’s algorithm. Each of the algorithms for the selected single or dual lightpath enforces the constraints of spectrum continuity, contiguity of the slots, and non-overlapping of the spectra with the established lightpaths, maximizes the number of bits per symbol, and selects a specific core on each link of the path. Simulation studies performed for two sample networks showed that the crosstalk has a significant impact on the bandwidth blocking probability. The best results were obtained by iterating over all paths and all slots, selecting the lightpath with the lowest average crosstalk per slot, consisting of the most loaded cores. Full article

The poor timeliness of routing has always been an urgent problem in practical operator networks, especially in situations with large-scale networks and multiple network domains. In this article, a pruning idea of routing integrated with Dijkstra’s shortest path searching is utilized to accelerate the process of routing in large-scale multi-domain elastic optical networks (EONs). The layered-graph approach is adopted in the spectrum allocation stage. To this end, an efficient heuristic algorithm is proposed, called “Branch-and-Bound based Routing and Layered Graph based Spectrum Allocation algorithm (BBR-LGSA)”, which is an integrated RSA algorithm. Notably, the significant reduction in algorithm time complexity is not only reflected in the pruning method used in the routing stage but also in the construction of auxiliary graphs during the spectrum allocation stage utilizing the Branch-and-Bound method. Simulation results show that the proposed BBR-LGSA significantly reduces the average running time by nearly 78% with higher spectrum utilization in large-scale multi-domain EONs, compared with benchmark algorithms. In addition, the impact of key parameters on performance comparisons of different algorithms is evaluated. Full article

The C+L band elastic optical networks (C+L-EONs) increase the network capacity significantly. However, the introduction of an L band enhances the inter-channel stimulated Raman scattering effect (ISRS), consequently deteriorating the quality of transmission (QoT) of the signal. Furthermore, spectrum allocation leads to spectrum fragmentation inevitably, which escalates the bandwidth blocking rate. In addition, in C+L-EONs, a single fiber carries more services, and once one of the links fails, a huge number of requests will be interrupted, resulting in huge economic losses. Therefore, this paper proposes a survivability routing, band, modulation, and spectrum allocation (RBMSA) algorithm that effectively guarantees service survivability and reduces the impact of ISRS and spectrum fragmentation. The algorithm employs shared backup path protection and a band partitioning method, whereby the spectrum resource of the primary path is assigned in the L band and the backup path is assigned in the C band in order to minimize the impact of ISRS on the QoT of the request while ensuring the survivability of the network. Furthermore, a fragmentation metric accounting for both the free and shared spectrum resource is proposed to mitigate both free and shared spectrum fragmentation. The simulation results reveal that the proposed RBMSA algorithm reduces the bandwidth blocking probability (BBP) and the fragmentation rate (FR) by 47.7% and 21.3%, respectively, and improves the optical signal-to-noise ratio (OSNR) by 4.17 dB in NSFNET. In COST239, the BBP, FR, and OSNR are 22.1%, 21.5%, and 4.71 dB, respectively. Full article

With the increase in global wireless traffic, the use of large-scale satellite networking to provide ubiquitous access is one of the essential trends of future 6G network development. Elastic optical satellite networks (EOSNs) are widely considered a flexible solution for future satellite communication. However, with the continuous proliferation of network devices and users, the growing disparity between user demands and the limited bandwidth and capacity of the network is becoming increasingly noticeable. This has led to issues such as constrained network resource utilization and resource fragmentation. Therefore, EOSNs must efficiently address the challenge of allocating scarce bandwidth resources. Effective traffic grooming methods will be applied to EOSNs to solve the problem of bandwidth shortage. This paper proposed a dynamic traffic grooming algorithm based on virtualization-plane-aided optimization (DTG-VPO) to facilitate the bandwidth allocation for EOSNs. Firstly, the nodes of the alternative paths were graded, and the weights of the subsequent hop links were modified. Then, the path was evaluated using link weights, alternative paths were selected in the virtual and physical topologies, respectively, and a path set was constructed. Finally, a resource block evaluation parameter was designed to quantify the quality of candidate resource blocks and rank them. A series of simulations have evaluated the traffic-blocking probability and wavelength utilization under different traffic loads. The link resource was more fully utilized compared with other traffic grooming algorithms. The blocking probability can be reduced by 75%, while wavelength utilization can be improved by 8.1%. Full article

This paper addresses serialized approaches of the routing, modulation level, and spectrum assignment (RMLSA) problem in elastic optical networks, using multiple sequential sub-sets of requests, under Integer Linear Programming (ILP). The literature has reported two-stage serial optimization methods referred to as RML+SA, which retain computational efficiency when the problem grows, compared to the classical one-stage RMLSA optimization approach. However, there still remain numerous issues in terms of the spectrum used that can be improved when compared to the RMLSA solution. Consequently, this paper proposes RML+SA solutions considering multiple sequential sub-sets of requests, split traffic flow, as well as path-oriented and link-oriented routing models. Simulation results on different test scenarios determine that: (a) the multiple sequential sub-sets of request-based models improve computation time without worsening the spectrum usage when compared to just one set of requests optimization approaches, (b) divisible traffic flow approaches show promise in cases where the number of request sub-sets is low compared to the non-divisible counterpart, and (c) path-oriented routing succeeds in improving the used spectrum by increasing the number of candidate routes compared to link-oriented routing. Full article

The elastic optical network (EON) adopting virtual network function (VNF) is a new type of network, in which the routing, spectrum, and data center allocation are key and challenging problems, and solving these three problems simultaneously can not only improve the network efficiency for network providers, but also let users obtain better service. However, few existing works handle these three problems simultaneously. To tackle the three problems simultaneously, given a set of network function chains (i.e., a set of tasks), we set up a new multi-objective optimization model in which the total length of paths for all tasks is minimized, the totally occupied spectrums are minimized, and the loads on all data centers are most balanced, simultaneously. To solve the model, we design two new evolutionary algorithms. The experiments are conducted on 16 cases of 4 widely used types of networks, and the results indicate that the proposed model and algorithms are effective. Full article

The article discusses an online problem of routing and spectrum allocation with dedicated path protection in elastic optical networks. We propose three novel algorithms to solve this problem. The first of them is the minimum-cost–maximum-flow heuristic algorithm, which calculates the solution assuming that the spectrum units on the working and dedicated backup path are the same. Such an assumption, on the one hand, increases the bandwidth blocking probability; however, on the other hand, it enables a simple, cheap and fast way to connect customers to the network during the implementation phase of elastic optical networks. The next two algorithms, which determine the exact solutions, are based on the branch and bound method. The first calculates the working and dedicated backup paths with the minimum total occupied bandwidth, called the total cost, while the second calculates the paths with the minimum total length. These algorithms enable the performance evaluation of the proposed heuristic algorithm and provide the answer as to what should be optimized, the total cost or the total length of paths, in order to minimize the bandwidth blocking probability. Extensive simulation research has shown that the proposed heuristic algorithm can be used in elastic optical networks, but with a small network load. Moreover, it is shown that the optimization of the total cost of paths provides a slightly lower blocking probability than the optimization of the total length of paths. Full article

Mixed-Fixed/Flex-Grid Optical Networks (MFGONs) are a new paradigm that emerged during the brown-field migration from fixed-grid Wavelength Division Multiplexing (WDM) optical networks to flex-grid Elastic Optical Networks (EONs). Based on the flex-grid, we can accommodate IP traffic directly to the optical layer by configuration. Considering the different granularities of spectrum resources and complex constraints in MFGONs, it is difficult to apply Routing and Wavelength/Spectrum Allocation (RWA/RSA) algorithms proposed in either fixed-grid or flex-grid optical networks. This paper first proposes two concepts, i.e., Link Spectrum Compactness (LSC) and Radiancy of Nodes (RoNs), to evaluate different scenarios of candidate paths for the end-to-end requests in MFGONs. Then, based on these two concepts, a Spectrum Entropy (SE) model is proposed in MFGONs. Here, the SE is the metric that combines LSC and RoNs to judge the fragmentation of network resources, and the value of SE is treated as the cost of candidate paths during the RSA operation. Finally, an SE-minimized RSA algorithm in MFGONs is designed. Simulation results prove that the proposed algorithm can effectively reduce the Bandwidth Blocking Ratio (BBR) and increase the revenues for upgrading the nodes compared to the state-of-the-art RSA algorithm. Particularly, the performance improvement is more obvious for highly connected networks. Full article

Ship targets in ORSIs (Optical Remote Sensing Images) have the characteristics of various scales, and most of them are medium and small-scale targets. When the existing target detection algorithms are applied to ship target detection in ORSIs, the detection accuracy is low. There are two main reasons for the above problems, one is the mismatch of the receptive fields, and the other is the lack of feature information. For resolving the problem that multi-scale ship targets are difficult to detect, this paper proposes a ship target detection algorithm based on feature enhancement. Firstly, EIRM (Elastic Inception Residual Module) is proposed for feature enhancement, which can capture feature information of different dimensions and provide receptive fields of different scales for mid- and low-level feature maps. Secondly, the SandGlass-L block is proposed by replacing the ReLu6 activation function of the SandGlass block with the Leaky ReLu activation function. Leaky ReLu solves the problem of 0 output when ReLu6 has negative input, so the SandGlass-L block can retain more feature information. Finally, based on SandGlass-L, SGLPANet (SandGlass-L Path Aggregation Network) is proposed to alleviate the problem of information loss caused by dimension transformation and retain more feature information. The backbone network of the algorithm in this paper is CSPDarknet53, and the SPP module and EIRM act after the backbone network. The neck network is SGLPANet. Experiments on the NWPU VHR-10 dataset show that the algorithm in this paper can well solve the problem of low detection accuracy caused by mismatched receptive fields and missing feature information. It not only improves the accuracy of ship target detection, but also achieves good results when extended to other categories. At the same time, the extended experiments on the LEVIR dataset show that the algorithm also has certain applicability on different datasets. Full article

The recent decade has witnessed a tremendous growth of Internet traffic, which is expected to continue climbing for the foreseeable future. As a new paradigm, Spectrum-sliced Elastic Optical Path (SLICE) networks promise abundant (elastic) bandwidth to address the traffic explosion, while bearing other inherent advantages including enhanced signal quality and extended reachability. The fundamental problem in SLICE networks is to route each traffic demand along a lightpath with continuously and consecutively available sub-carriers, which is known as the Routing and Spectrum Allocation (RSA) problem. Given its NP-Hardness, the solutions to the RSA problem can be classified into two categories: optimal solutions using link-based, path-based, and channel-based Integer Linear Programming (ILP) models, which require extensive computational time; and sub-optimal heuristic and meta-heuristic algorithms, which have no guarantee on the solution quality. In this work, inspired by a channel-based ILP model, we propose a novel primal-dual framework to address the RSA problem, which can obtain a near-optimal solution with guaranteed per-instance closeness to the optimal solution. Full article

We present a novel algorithm for dynamic routing with dedicated path protection which, as the presented simulation results suggest, can be efficient and exact. We present the algorithm in the setting of optical networks, but it should be applicable to other networks, where services have to be protected, and where the network resources are finite and discrete, e.g., wireless radio or networks capable of advance resource reservation. To the best of our knowledge, we are the first to propose an algorithm for this long-standing fundamental problem, which can be efficient and exact, as suggested by simulation results. The algorithm can be efficient because it can solve large problems, and it can be exact because its results are optimal, as demonstrated and corroborated by simulations. We offer a worst-case analysis to argue that the search space is polynomially upper bounded. Network operations, management, and control require efficient and exact algorithms, especially now, when greater emphasis is placed on network performance, reliability, softwarization, agility, and return on investment. The proposed algorithm uses our generic Dijkstra algorithm on a search graph generated “on-the-fly” based on the input graph. We corroborated the optimality of the results of the proposed algorithm with brute-force enumeration for networks up to 15 nodes large. We present the extensive simulation results of dedicated-path protection with signal modulation constraints for elastic optical networks of 25, 50, and 100 nodes, and with 160, 320, and 640 spectrum units. We also compare the bandwidth blocking probability with the commonly-used edge-exclusion algorithm. We had 48,600 simulation runs with about 41 million searches. Full article