Ireneusz Olszewski

Dr. Ireneusz Olszewski


Research Focus & Metrics

Academic Career Length

17Years (2010-Present)

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

Representative Publications

View All Publications
5 May 2017 in Photonic Network Communications
Verified
Journal Article
Open access
PDF file
IOIreneusz Olszewski
Ireneusz Olszewski
The considered Routing, Modulation Level and Spectrum Allocation (RMLSA) problem covers path length minimization while still meeting the spectrum continuity constraints, non-overlapping spectra constraints, spectrum contiguity constraints, and choice of modulation level. In this problem, the relationship between spectrum connection and bit rate of the incoming request has been taken into account. In this paper, two algorithms have been proposed. The first one is based on a set of shortest paths whose lengths are determined by the number of links in the network. The second one is a modified version of Dijkstra’s algorithm. Modification of this algorithm is based on introduction of weights of the network links depending on the utilization of the links and the introduction of a aggregated spectrum of the path that is being selected. Extensive research has shown that algorithms reject the lower traffic volume as compared to well-known algorithms proposed in literature.

27 November 2017 in International Journal of Electronics and Telecommunications
Verified
Journal Article
Open access
PDF file
IOIreneusz Olszewski
Ireneusz Olszewski
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.

5 February 2020 in Journal of Network and Systems Management
Verified
Journal Article
Open access
PDF file
IOIreneusz Olszewski
Ireneusz Olszewski
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.

1 January 2010
Verified
Book Chapter
Closed access
PDF file
IOIreneusz Olszewski
Ireneusz Olszewski

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.