Wojciech Kabaciński

Prof. Wojciech Kabaciński

orcid

Research Focus & Metrics

Academic Career Length

42Years (1985-Present)

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

Representative Publications

View All Publications
28 April 2016 in Journal of Lightwave Technology
Verified
Journal Article
Closed access
WKWojciech Kabaciński
Wojciech Kabaciński
MMMarek Michalski
Marek Michalski
RRRemigiusz Rajewski
Remigiusz Rajewski
The paper considers optical node architectures for elastic optical networks. They use switching fabric topologies which are similar to the three-stage Clos switching networks. These architectures employ wavelength switching in the first and the third stages, and space switching in the second stage, and are also called W-S-W switching fabrics. In elastic optical networks, the optical spectrum is divided into frequency slot units. One frequency slot unit uses 12.5 GHz of bandwidth and an optical path may use m adjacent frequency slot units. Such connection is called an m-slot connection. For each architecture, strict-sense nonblocking conditions are derived and proved for such m-slot connections. The number of center stage switches and the number of frequency slot units in interstage links are calculated and evaluated. The considered architectures are compared to each other. When the maximum number of frequency slot units that may be used by one connection, is not too high, these architectures can be implemented in practice.

19 September 2016 in Journal of Optical Communications and Networking
Verified
Journal Article
Closed access
PDF file
GDGrzegorz Danilewicz
Grzegorz Danilewicz
WKWojciech Kabaciński
Wojciech Kabaciński
RRRemigiusz Rajewski
Remigiusz Rajewski
In elastic optical networks, a connection may occupy a frequency slot that spreads over m adjacent frequency slot units (FSUs). Such connection (called m-slot connection) also must be realized in optical nodes used in these networks. The paper considers two architectures of the three-stage switching fabric that can be used in such network nodes. The switching fabric applies space switching in the first and the third stages and wavelength switching in the second stage [the space-wavelength-space (S-W-S) switching fabric]. For both architectures, denoted by SWS1 and SWS2, we derived and proved the strict-sense nonblocking conditions when m-slot connections are set up. The number of center stage wavelength switches is calculated and evaluated. The switching fabrics are compared with the strict-sense nonblocking wavelength-space-wavelength (W-S-W) switching fabric. It is shown that the number of center stage switches does not depend on the number of FSUs available in input and output fibers but only on the maximum number of FSUs, which can be used by one connection and the number of input/output fibers in one input/output space switch. When the number of FSUs in one connection is, for instance, limited to 5, only 11 center stage switches are needed for nonblocking operation in one of the architectures. Moreover, for switching fabrics with a greater number of maximum FSUs in one connection and a greater number of FSUs in one input or output fiber, the S-W-S switching fabrics can be practically realized, unlike the W-S-W switching fabric.

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 February 1995 in IEEE Transactions on Communications
Verified
Journal Article
Closed access
WKWojciech Kabaciński
Wojciech Kabaciński

1 July 2017 in Optical Switching and Networking
Verified
Journal Article
Closed access
WKWojciech Kabaciński
Wojciech Kabaciński
MMMarek Michalski
Marek Michalski
MAMustafa Abdulsahib
Mustafa Abdulsahib

11 December 2006 in IEEE Journal on Selected Areas in Communications
Verified
Journal Article
Closed access
WKWojciech Kabaciński
Wojciech Kabaciński
MMMarek Michalski
Marek Michalski
A new control algorithm for the multiplane baseline switching network is proposed in this paper. This algorithm chooses a plane for a new connection in such a way that this new connection blocks the lowest number of possible future connections in the plane. We have proved, that when using this algorithm connections can be routed without blocking when the number of planes in the switching network is the same as in the rearrangeable one for even number of stages. When the switching network contains the odd number of stages, required number of planes is greater than in the rearrangeable switching network but less than in the strict-sense nonblocking one. Different implementations of the proposed algorithm are also considered. It should be noted, that the algorithm can determine the plane for a new connection in O(N0.5) time or even in O(1) time depending on the implementation. The overall time complexity of the proposed algorithm is from O(N3.5 log2 N) to O(N log2 N) depending on its implementation and number of processors used