Ireneusz Szcześniak

Dr. Ireneusz Szcześniak

orcid

Research Focus & Metrics

Academic Career Length

20Years (2007-Present)

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

Representative Publications

View All Publications
30 September 2019 in Journal of Optical Communications and Networking
Verified
Journal Article
Closed access
PDF file
ISIreneusz Szcześniak
Ireneusz Szcześniak
AJAndrzej Jajszczyk
Andrzej Jajszczyk
BWBożena Woźna-Szcześniak
Bożena Woźna-Szcześniak
We present the generic Dijkstra shortest-path algorithm: an efficient algorithm for finding a shortest path in an optical network, in both a wavelength-division multiplexed network and an elastic optical network (EON). The proposed algorithm is an enabler of real-time softwarized control of large-scale networks and is not limited to optical networks. The Dijkstra algorithm is a generalization of the breadth-first search, and we generalize the Dijkstra algorithm further to resolve the continuity and contiguity constraints of the frequency slot units required in EONs. Specifically, we generalize the notion of a label, change what we iterate with, and reformulate the edge relaxation so that vertices are revisited, loops avoided, and worse labels discarded. We also use the typical constriction during edge relaxation to take care of the signal modulation constraints. The algorithm can be used with various spectrum allocation policies. We motivate and discuss the algorithm design, and provide our free, reliable, and generic implementation using the Boost Graph Library. We carried out 85,000 simulation runs for realistic and random networks (Gabriel graphs) of 75 vertices with about a billion shortest-path searches, and found that the proposed algorithm outperforms considerably three other competing optimal algorithms that are frequently used.

27 August 2021 in Entropy
Verified
Journal Article
Open access
PDF file
ISIreneusz Szcześniak
Ireneusz Szcześniak
IOIreneusz Olszewski
Ireneusz Olszewski
BWBożena Woźna-Szcześniak
Bożena Woźna-Szcześniak
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.

23 February 2017 in Journal of Lightwave Technology
Verified
Journal Article
Closed access
ISIreneusz Szcześniak
Ireneusz Szcześniak
AGArtur Gola
Artur Gola
AJAndrzej Jajszczyk
Andrzej Jajszczyk
APAndrzej R. Pach
Andrzej R. Pach
BWBożena Woźna-Szcześniak
Bożena Woźna-Szcześniak
We state a new problem of itinerant routing in elastic optical networks, which we define as the establishment and reconfiguration of an itinerant connection. In an itinerant connection, one of the connection end nodes is allowed to change. Itinerant routing could also be considered a form of connection restoration, where a connection has to be restored to a different end node. With the introduction and growth of mobile-network services and content-oriented services, and the eventual deployment of elastic optical networks, there is a need to support this itinerant routing in the elastic optical networks. We present and discuss two major use cases of the itinerant routing, and propose a novel reconfiguration algorithm. Our algorithm does not deteriorate the network performance, and requires half as many new links to configure in comparison with the complete shortest-path reconfiguration algorithm. The performance evaluation was carried out with 46 800 simulation runs using randomly-generated realistic transport networks.

29 June 2022 in Entropy
Verified
Journal Article
Open access
PDF file
IOIreneusz Olszewski
Ireneusz Olszewski
ISIreneusz Szcześniak
Ireneusz Szcześniak
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.

25 February 2025 in Applied Sciences
Verified
Journal Article
Open access
PDF file
BWBożena Woźna-Szcześniak
Bożena Woźna-Szcześniak
ISIreneusz Szcześniak
Ireneusz Szcześniak
IOIreneusz Olszewski
Ireneusz Olszewski
Automated verification through the analysis of system models is often recommended to evaluate the correctness of safety-critical systems. Failures in such systems can have serious effects on both individuals and hardware. Historically, many automated verification techniques, including model checking, have been proposed and used to ensure the reliable development of real-time multi-agent systems (RTMASs). This paper investigates the use of Satisfiability Modulo Theories-based bounded model checking (SMT-based BMC) for the existential fragment of deontic epistemic metric temporal logic (EMTLKD), interpreted on models generated by dense-timed deontic interpreted systems (DTDISs). Specifically, we address the translation of the existential model checking problem for EMTLKD into the existential model checking problem for a variant of a deontic epistemic linear temporal logic (ELTLKDq). Additionally, we present an SMT-based BMC approach tailored for ELTLKDq and illustrate its effectiveness using a faulty train controller system as a representative example. Our approach is particularly applicable to engineering domains requiring high-assurance verification, such as railway control, autonomous vehicle coordination, and industrial automation. By formally verifying both timing and compliance constraints, our method supports engineers and system designers in developing more reliable and certifiable safety-critical systems before deployment.

30 October 2024 in Entropy
Verified
Journal Article
Open access
PDF file
IOIreneusz Olszewski
Ireneusz Olszewski
ISIreneusz Szcześniak
Ireneusz Szcześniak
BWBożena Woźna-Szcześniak
Bożena Woźna-Szcześniak
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.