Ireneusz Olszewski
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Ireneusz Olszewski has a total of 3 co-authors. Here are the top co-authors by number of shared publications:
- Bożena Woźna-Szcześniak
Department of Mathematics and Computer Science, Faculty of Science and Technology, Jan Dlugosz University in Czestochowa, al. Armii Krajowej 13/15, 42-200 Czestochowa, Poland
3 shared publications - Ireneusz Szcześniak
Department of Computer Science, Częstochowa University of Technology, ul. J. H. Dąbrowskiego 73, 42-200 Czestochowa, Poland
3 shared publications - Ireneusz Szcześniak1 shared publication
Latest Publications
- Open Access
- 25 February 2025
- Published by MDPI AG in Applied Sciences
- Vol. 15 (5) , 2487
Bounded Model Checking of Dense-Timed Deontic Interpreted Systems: A Satisfiability Modulo Theories Approach
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 (). Additionally, we present an SMT-based BMC approach tailored for 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.- 25 February 2025
- Published by MDPI AG in Applied Sciences
- Vol. 15 (5) , 2487
Open AccessBounded Model Checking of Dense-Timed Deontic Interpreted Systems: A Satisfiability Modulo Theories Approach
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 (). Additionally, we present an SMT-based BMC approach tailored for 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. - Open Access
Routing Algorithms for SDM Flexible Optical Networks
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.
Open AccessRouting Algorithms for SDM Flexible Optical Networks
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.
- Open Access
Is dynamic dedicated path protection tractable?
Intractable is the problem of finding two link-disjoint paths of minimal cost if the path cost is limited since it can be a special case of the partition problem. In optical networks, this limit can be introduced by the signal modulation reach. Even without this limit, the existing literature suggested the problem intractable because of the spectrum continuity and contiguity constraints, but we show that the problem can be solved exactly with the recently-proposed generic Dijkstra algorithm over a polynomially-bounded search space, thus proving the problem tractable.
Open AccessIs dynamic dedicated path protection tractable?
Intractable is the problem of finding two link-disjoint paths of minimal cost if the path cost is limited since it can be a special case of the partition problem. In optical networks, this limit can be introduced by the signal modulation reach. Even without this limit, the existing literature suggested the problem intractable because of the spectrum continuity and contiguity constraints, but we show that the problem can be solved exactly with the recently-proposed generic Dijkstra algorithm over a polynomially-bounded search space, thus proving the problem tractable.
- Open Access
The Trade-Offs between Optimality and Feasibility in Online Routing with Dedicated Path Protection in Elastic Optical Networks
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.
Open AccessThe Trade-Offs between Optimality and Feasibility in Online Routing with Dedicated Path Protection in Elastic Optical Networks
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.
- Open Access
- 5 February 2020
- Published by Springer Nature in Journal of Network and Systems Management
- Vol. 28 (4) , 1036-1054
Modified Dual-Path Allocation Algorithm in Elastic Optical Networks
Dual-path allocation problem is considered to be a case of multipath routing in Elastic Optical Networks. In this article, the optimization problem is formulated and a dual-path allocation algorithm that solves this problem proposed. In the considered problem all traffic for each request is broken into two equal parts, which are directed along two link-disjoint paths. After any link failure, half of the traffic for each affected request is realized. The proposed algorithm is based on the two weight matrices: the elements of the first one depend on the actual length of the links and their utilization, while the elements of the second one assume unit values if the links exist in the network. The proposed algorithm rejects smaller requests and provides a much lower bandwidth blocking probability than other analyzed algorithms.
- 5 February 2020
- Published by Springer Nature in Journal of Network and Systems Management
- Vol. 28 (4) , 1036-1054
Open AccessModified Dual-Path Allocation Algorithm in Elastic Optical Networks
Dual-path allocation problem is considered to be a case of multipath routing in Elastic Optical Networks. In this article, the optimization problem is formulated and a dual-path allocation algorithm that solves this problem proposed. In the considered problem all traffic for each request is broken into two equal parts, which are directed along two link-disjoint paths. After any link failure, half of the traffic for each affected request is realized. The proposed algorithm is based on the two weight matrices: the elements of the first one depend on the actual length of the links and their utilization, while the elements of the second one assume unit values if the links exist in the network. The proposed algorithm rejects smaller requests and provides a much lower bandwidth blocking probability than other analyzed algorithms.
- Open Access
- 27 November 2017
- Published by Walter de Gruyter GmbH in International Journal of Electronics and Telecommunications
- Vol. 63 (4) , 423-429
Spectrum Allocation Policy in Elastic Optical Networks
The considered problem covers routing and spectrum allocation problem (RSA problem) in Elastic Optical Networks while maintaining the spectrum continuity constraints, non-overlapping spectra constraints for adjacent connections on individual links of the network and spectrum contiguity constraints of the connection. In this article the modified version of the First Fit spectrum slot allocation policy for Fixed Alternate Routing in flexible optical networks has been proposed. The Fixed Alternate Routing with proposed spectrum allocation policy rejects fewer requests, provides less bandwidth blocking probability and less spectrum fragmentation than Fixed Alternate Routing with well-known First Fit and Exact Fit spectrum allocation policies. However, the cost of improving these parameters is a higher computational complexity of the proposed allocation policy.
- 27 November 2017
- Published by Walter de Gruyter GmbH in International Journal of Electronics and Telecommunications
- Vol. 63 (4) , 423-429
Open AccessSpectrum Allocation Policy in Elastic Optical Networks
The considered problem covers routing and spectrum allocation problem (RSA problem) in Elastic Optical Networks while maintaining the spectrum continuity constraints, non-overlapping spectra constraints for adjacent connections on individual links of the network and spectrum contiguity constraints of the connection. In this article the modified version of the First Fit spectrum slot allocation policy for Fixed Alternate Routing in flexible optical networks has been proposed. The Fixed Alternate Routing with proposed spectrum allocation policy rejects fewer requests, provides less bandwidth blocking probability and less spectrum fragmentation than Fixed Alternate Routing with well-known First Fit and Exact Fit spectrum allocation policies. However, the cost of improving these parameters is a higher computational complexity of the proposed allocation policy.
- Open Access
- 5 May 2017
- Published by Springer Nature in Photonic Network Communications
- Vol. 34 (3) , 323-333
Improved dynamic routing algorithms in elastic optical networks
- 5 May 2017
- Published by Springer Nature in Photonic Network Communications
- Vol. 34 (3) , 323-333
Open AccessImproved dynamic routing algorithms in elastic optical networks
- 28 October 2016
- Published by Springer Nature
- p. 215-225
Latin Multiplication in Telemetry Hot Potato Wireless Sensor Networks Analysis
- 28 October 2016
- Published by Springer Nature
- p. 215-225
Latin Multiplication in Telemetry Hot Potato Wireless Sensor Networks Analysis
- 1 January 2015
- Published by Springer Nature
- p. 309-318
Dynamic Routing and Spectrum Assignment for Varying Traffic in Flexible Optical Networks
- 1 January 2015
- Published by Springer Nature
- p. 309-318
Dynamic Routing and Spectrum Assignment for Varying Traffic in Flexible Optical Networks
- 1 January 2014
- Published by Springer Nature
- p. 407-417
Routing and Spectrum Assignment in Spectrum Flexible Transparent Optical Networks
- 1 January 2014
- Published by Springer Nature
- p. 407-417
Routing and Spectrum Assignment in Spectrum Flexible Transparent Optical Networks