Nina Skorin-Kapov

Nina Skorin-Kapov


Research Focus & Metrics

Academic Career Length

12Years (2015-Present)

(Calculated once Scilit publication data is synced: current year − year of first publication + 1)

Representative Publications

View All Publications
17 December 2015 in Journal of Lightwave Technology
Verified
Journal Article
Closed access
MFMarija Furdek
Marija Furdek
NSNina Skorin-Kapov
Nina Skorin-Kapov
LWLena Wosinska
Lena Wosinska
Due to the high data rates in optical networks, physical-layer attacks targeting service degradation, such as power jamming, can potentially lead to large data and revenue losses. Conventional network survivability approaches which establish link-disjoint working and backup paths to protect from component faults may not provide adequate protection for such attacks. Namely, the working and the backup paths, although link-disjoint, might both be affected by a single attack scenario due to specific attack propagation characteristics. To enhance the existing survivability approaches, we utilize the concept of an attack group (AG) which incorporates these characteristics to identify connections which can simultaneously be affected by a single attack. We apply this concept to dedicated path protection (DPP) and develop attack-aware DPP (AA-DPP) approaches which aim to establish AG-disjoint primary and backup paths in a cost-effective manner. We provide a two-step ILP formulation for the routing and wavelength assignment of the working and backup paths, as well as a heuristic for larger problem instances. Numerical results indicate that the proposed approaches provide dedicated path protection schemes with enhanced attack protection without using more resources (i.e., wavelengths, average path lengths) than standard DPP methods.

10 August 2023 in Omega
Verified
Journal Article
Open access
NSNina Skorin-Kapov
Nina Skorin-Kapov
LMLuka Mesarić
Luka Mesarić
FGFernando Pereñíguez García
Fernando Pereñíguez García
LSLea Skorin-Kapov
Lea Skorin-Kapov

6 March 2023 in Journal of Optical Communications and Networking
Verified
Journal Article
Closed access
PPPablo Pavon-Marino
Pablo Pavon-Marino
NSNina Skorin-Kapov
Nina Skorin-Kapov
ANAntonio Napoli
Antonio Napoli
In this paper, we investigate a novel problem for dimensioning optical networks with digital subcarrier-based point-to-multipoint (P2MP) coherent transceivers, which we refer to as tree-determination, routing, and spectrum assignment (TRSA). Given a physical optical fiber network with P2MP transceivers and a target IP topology with associated capacity requirements, the TRSA problem involves partitioning capacity demands into logical hub–spoke trees and associated transceiver allocation, along with light-tree routing and spectrum assignment. We propose a heuristic algorithm to solve the TRSA problem with and without fault tolerance for arbitrary network topologies. The algorithms are used to evaluate potential cost benefits of P2MP transceivers for different IP densities and loads in a case study on a metro-network reference scenario. Results indicate that P2MP equipment can bring significant transceiver cost and equipment savings in comparison to point-to-point solutions, although such savings come at a trade-off with increased spectrum occupation.

10 February 2021 in Electronics
Verified
Journal Article
Open access
PDF file
NSNina Skorin-Kapov
Nina Skorin-Kapov
RSRicardo Santos
Ricardo Santos
HGHakim Ghazzai
Hakim Ghazzai
AKAndreas Kassler
Andreas Kassler
In this paper, we consider the reconfiguration of wireless backhaul networks with mechanically steerable antennas in the presence of changing traffic demands. Reconfiguration requires the scheduling and coordination of several operations, including antenna alignment and link establishment/removal, with minimal disruption to existing user traffic. Previously, we proposed a Mixed Integer Linear Program (MILP) to orchestrate such reconfiguration with minimal packet loss. While the MILP solves the problem optimally for a limited number of discrete reconfiguration time slots, it does not scale well. In this paper, we propose an iterative randomized greedy algorithm to obtain suboptimal solutions in reduced time. The algorithm schedules the reconfiguration of wireless links by ranking them according to a set of attributes with associated weights and selecting them according to a randomized greedy function. Results on six different network scenarios indicate that the proposed algorithm can achieve good quality solutions in significantly less time. Furthermore, by extending the reconfiguration time beyond the maximum number of time slots solvable by the MILP, the proposed heuristic can obtain superior solutions for some problem instances. The number of iterations of the algorithm can be tuned for its applicability in both offline and online planning scenarios.

23 July 2019 in arXiv
Verified
Preprint
Open access
PDF file
RSRicardo Ramalho dos Santos
Ricardo Ramalho dos Santos
NSNina Skorin-Kapov
Nina Skorin-Kapov
HGHakim Ghazzai
Hakim Ghazzai
AKAndreas Kassler
Andreas Kassler
Future mobile traffic growth will require 5G cellular networks to densify the deployment of small cell base stations (BS). As it is not feasible to form a backhaul (BH) by wiring all BSs to the core network, directional mmWave links can be an attractive solution to form BH links, due to their large available capacity. When small cells are powered on/off or traffic demands change, the BH may require reconfiguration, leading to topology and traffic routing changes. Ideally, such reconfiguration should be seamless and should not impact existing traffic. However, when using highly directional BH antennas which can be dynamically rotated to form new links, this can become time-consuming, requiring the coordination of BH interface movements, link establishment and traffic routing. In this paper, we propose greedy-based heuristic algorithms to solve the BH reconfiguration problem in real-time. We numerically compare the proposed algorithms with the optimal solution obtained by solving a mixed integer linear program (MILP) for smaller instances, and with a sub-optimal reduced MILP for larger instances. The obtained results indicate that the greedy-based algorithms achieve good quality solutions with significantly decreased execution time.