3 citations · 3 across the 1 of their papers we have counts for
5 papers
Generic Dijkstra
Ireneusz Szcześniak, Bożena Woźna-Szcześniak, Ireneusz Olszewski
The recently-proposed generic Dijkstra algorithm finds shortest paths in networks with continuous and contiguous resources. While the algorithm was proposed in the context of optic…
Towards an efficient and exact algorithm for dynamic dedicated path protection
Ireneusz Szcześniak, Ireneusz Olszewski, 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 algor…
Generic Dijkstra for optical networks
Ireneusz Szcześniak, Andrzej Jajszczyk, 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, both in a wavelength-division multiplexed network…
Performance of Interoperator Fixed-Mobile Network Sharing
Ireneusz Szcześniak, Andrzej R. Pach, Bożena Woźna-Szcześniak
We evaluate the downstream performance of our novel interoperator fixed-mobile network sharing, in which operators exchange data in their access networks. We propose a performance…
Itinerant routing in elastic optical networks
Ireneusz Szcześniak, Artur Gola, Andrzej Jajszczyk +2
We state a new problem of \emph{itinerant routing} in elastic optical networks, which we define as the establishment and reconfiguration of an \emph{itinerant connection}. In an it…