Showing papers in "Photonic Network Communications in 2022"
10 citations
8 citations
7 citations
4 citations
4 citations
3 citations
3 citations
2 citations
TL;DR: This paper solves virtualized passive optical network assignment and virtualized baseband unit placement using an integer linear programming formulation, an approximated heuristic using linear relaxation, and a proactive heuristic based on a specific kind of recurrent neural network.
2 citations
2 citations
TL;DR: This paper compares the results obtained by five different and widely used evolutionary and swarm-based algorithms in the search for maximizing the transmission rate in optical links and has observed that the differential evolution provided the best results in the analyzed scenarios.
TL;DR: This study offers a unique strategy for improving QoS in Fi-Wi networks based on a fuzzy-based Cat Swarm Optimization (CSO) algorithm, a strong metaheuristic swarm-based optimization technique that has garnered a lot of favorable comments since its inception.
TL;DR: This paper considers the problem of clustering nodes in a wireless visible light communication (VLC) network while simultaneously forming a spanning tree backbone and proposes mixed-integer linear and quadratic programming models based on classical combinatorial optimization problems.
TL;DR: In this article , the authors proposed a vectored fragmentation metric for characterizing the fragmentation, which includes both types of fragmentation, namely link fragmentation due to non-contiguity of available spectral resources on individual links or path fragmentation because of non-continuity on the paths of the connection requests.
Abstract: When circuits are set up and dismantled dynamically in elastic optical networks, the link spectrum becomes fragmented. The fragmentation limits the available path choices and may lead to significant blocking of connection requests. The fragmentation can be link fragmentation due to non-contiguity of available spectral resources on individual links or path fragmentation due to non-continuity of available spectral resources on the paths of the connection requests. The study of fragmentation and its management is essential to operate the networks efficiently. This paper proposes a vectored fragmentation metric for characterizing the fragmentation, which includes both types of fragmentation. We discuss the characteristics of this metric considering different network scenarios, where connection requests arrive and depart dynamically. To establish the functionality of this metric, we also test the utility of the metric in fragmentation management cases. We compare the different link-based fragmentation metrics and a path-based fragmentation metric with our Adapted vectored fragmentation metric to understand the efficacy of the proposed measure. We find the vectored fragmentation metric to be effective in this study.