Mariusz Żal

Dr. Mariusz Żal

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
3 April 2008 in IEEE Journal on Selected Areas in Communications
Verified
Journal Article
Closed access
GDGrzegorz Danilewicz
Grzegorz Danilewicz
WKWojciech Kabaciński
Wojciech Kabaciński
MMMarek Michalski
Marek Michalski
MŻMariusz Żal
Mariusz Żal
A new control algorithm for log2(N, 0, p) switching networks composed of 2 x 2 switching elements has been proposed recently. Under this algorithm, log2(N,0,p) switching networks with even number of stages are wide-sense nonblocking (WSNB) if p is the same as for the rearrangeable nonblocking (RNB) one. The considerred algorithm and WSNB conditions did not take into account crosstalk constraint, which is an important factor in photonic switching. This paper enhanced this algorithm to the case when crosstalk in the switching fabric is not allowed. WSNB conditions for this enhanced algorithm are also derived. It is shown, that the number of planes required is less than those derived earlier in other papers for WSNB multiplane banyan- type switching fabrics under crosstalk constraint. Under this algorithm, log2( N,0,p) switching networks with odd number of stages and with zero crosstalk are WSNB if p is the same as for RNB one.

1 November 2016 in Optical Switching and Networking
Verified
Journal Article
Closed access
WKWojciech Kabaciński
Wojciech Kabaciński
JKJanusz Kleban
Janusz Kleban
MMMarek Michalski
Marek Michalski
MŻMariusz Żal
Mariusz Żal

1 June 2009
Verified
Conference Paper
Closed access
WKWojciech Kabaciński
Wojciech Kabaciński
JKJanusz Kleban
Janusz Kleban
MMMarek Michalski
Marek Michalski
MŻMariusz Żal
Mariusz Żal
APAchille Pattavina
Achille Pattavina
GMGuido Maier
Guido Maier
In this paper we consider the rearrangeable multi-plane banyan-type switching fabrics, called also log 2 (N, 0, p) switching networks, with even number of stages. For such networks different rearranging algorithms have been proposed for both: one-at-a-time and simultaneous connection models. In this paper we consider the one-at-a-time connection model, where connections arrive to the system one-by-one, and in case of blocking rearrangements are realized. To our knowledge, known algorithms require several rearrangements, and the number of such rearrangements have not been considered in the literature. We propose the new rearranging algorithm for the multi-plane banyan-type switching fabric composed of even number of stages. This algorithm leads to success using only one rearrangement. We also introduce the modified version of this new algorithm, in which rearrangement of an existing connecting path can be realized without its interruption.

30 March 2023 in Sensors
Verified
Journal Article
Open access
PDF file
EAEnass Abuelela
Enass Abuelela
MŻMariusz Żal
Mariusz Żal
WKWojciech Kabaciński
Wojciech Kabaciński
In this paper, we investigate the three-stage, wavelength–space–wavelength switching fabric architecture for nodes in elastic optical networks. In general, this switching fabric has r input and output switches with wavelength-converting capabilities and one center-stage space switch that does not change the spectrum used by a connection. This architecture is most commonly denoted by the WSW1 (r, n, k) switching network. We focus on this switching fabric serving simultaneous connection routing. Such routing takes place mostly in synchronous packet networks, where packets for switching arrive at the inputs of a switching network at the same time. Until now, only switching fabrics with up to three inputs and outputs have been extensively investigated. Routing in switching fabrics of greater capacity is estimated based on routing in switches with two or three inputs and outputs. We now improve the results for the switching fabrics with four inputs and outputs and use these results to estimate routing in the switching fabric with an arbitrary number of inputs and outputs. We propose six routing algorithms based on matrix decomposition for simultaneous connection routing. For the proposed routing algorithms, we derive criteria under which they always succeed. The proposed routing algorithms allow the construction of nonblocking switching fabrics with a lower number of wavelength converters and the reduction of the overall switching fabric cost.

1 July 2019 in Optical Switching and Networking
Verified
Journal Article
Closed access
MŻMariusz Żal
Mariusz Żal

7 June 2021
Verified
Conference Paper
Closed access
EAEnass Abuelela
Enass Abuelela
MŻMariusz Żal
Mariusz Żal
This paper presents novel six rearrangeable control algorithms suitable for Elastic Optical Network (EON). The proposed algorithms are based on simultaneous routing and matrix decomposition. We investigated the wavelength-space-wavelength switching fabrics, known as the WSW1, for previously developed three-stage architecture. In our proposal, we develop these algorithms for the four inputs/outputs WSW1 switching fabrics. The three-stage architecture of WSW1 was intensively considered only for a smaller number of inputs/outputs. We were able to achieve better results than previously proposed algorithms considering the same number of inputs/outputs. The switching fabric working under the proposed algorithms offers a smaller construction cost than the switching fabric controlled by previously known algorithms. This is expressed by the number of wavelength converters.