Ireneusz Szczesniak

Learn More
A software package, dxhdf5, for importing HDF5 data into OpenDX is discussed. HDF5 is a hierarchical, self-describing data format that is rapidly becoming a standard for storing large, portable data sets, such as those generated through high-performance computing. OpenDX, formerly IBM Data Explorer, is a visualization package for examining data of any(More)
We present an approximate analytical method for the evaluation of packet loss probability in synchronous optical packet-switched networks which operate under limited deflection routing with the contention resolution method based on priorities. Packets are lost because they are removed by nodes. They are removed because they experience too many deflections(More)
We present an optimal and efficient algorithm for finding a shortest path in an elastic optical network. The algorithm is an adaptation of the Dijkstra shortest path algorithm, where we take into account the spectrum continuity and contiguity constraints, and a limit on the path length. The adaptation redefines the node label in the Dijkstra algorithm,(More)
We propose the novel idea of interoperator fixed-mobile network sharing, which can be software-defined and readily-deployed. We study the benefits which the sharing brings in terms of resiliency, and show that, with the appropriate placement of a few active nodes, the mean service downtime can be reduced more than threefold by providing interoperator(More)
Optical packet switching has been researched for about two decades, but it has not been deployed in commercial networks yet. Nonetheless, the research on optical packet switching continues as it promises to perform better than electronic hardware. We report on the established results of optical packet switching, and examine the reasons for its current state.
This paper presents an analytical methodology to obtain steady state throughput of a uniformly and fully loaded regular network. The network operates using deflection routing under the condition that a data packet is allowed to experience a finite number of deflections. Unlike the published analytical methods, the proposed method allows the analysis of a(More)
We present an approximate analytical method for the evaluation of packet loss probability in synchronous optical packet-switched networks which operate under limited deflection routing with the contention resolution method based on priorities. Packets are lost because they experience too many deflections and stay prohibitively long in the network. The(More)
We present the hive network, a new three-dimensional network, and furnish it with an efficient routing algorithm. The network is built by interconnecting several identical honeycomb networks placed next to each other like real honeycombs in a hive. The mathematical measure of a network's complexity , hereinafter referred to as " the complexity " , is(More)
—We state a new problem of itinerant routing in elastic optical networks, which we define as the establishment and reconfiguration of an itinerant connection. In an itinerant connection, one of the connection end nodes is allowed to change. Itinerant routing could also be considered a form of connection restoration, where a connection has to be restored to(More)