Tomasz Nycz
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Previous Organizations / Institutes
The organizations / institutes from the scholar's other articles in the past ten years
Tomasz Nycz has a total of 10 co-authors. Here are the top co-authors by number of shared publications:
- Tadeusz Czachórski
Institute of Theoretical and Applied Informatics Polish Academy of Sciences
13 shared publications - Monika Nycz
Silesian University of Technology
8 shared publications - Ferhan Pekergin
Université Paris-Nord
6 shared publications - Krzysztof Grochla
Institute of Theoretical and Applied Informatics, Polish Academy of Sciences
2 shared publications - Adam Jozefiok
Institute of Theoretical and Applied Informatics
1 shared publication - Godlove Suila Kuaban
Institute of Theoretical and Applied Informatics, Polish Academy of Sciences, Gliwice, Poland
1 shared publication
Latest Publications
- 6 July 2025
- Published by Springer Nature
- p. 146-153
Modelling the Transient Evolution of Queues in Plugged-in Electric Vehicles (PEV) Fast Charging Stations
- 6 July 2025
- Published by Springer Nature
- p. 146-153
Modelling the Transient Evolution of Queues in Plugged-in Electric Vehicles (PEV) Fast Charging Stations
- Open Access
- 21 June 2024
- Published by Polish Academy of Sciences Chancellery in Bulletin Of The Polish Academy Of Sciences-Technical Sciences
- p. 150333
Dropping or marking: a review and evaluation of existing fluid-flow approximation models
Fluid-flow approximation is an approach to modelling and evaluating the performance of vast computer networks. Due to varying traffic and performance of transmission protocols reacting to traffic overloads, computer networks are in a permanent transient state. The fluid-flow method main advantage is its ability to analyse these transient states. The article reviews and organises several versions of this approach, indicating a few errors. The main reason for these errors is confusion or lack of distinction between the two versions of the Internet Protocol – when the queue of packets at a node is too long, they may be destroyed or only marked as redundant. The paper compares and evaluates these fluid-flow approximation models with mild and aggressive settings of RED parameters. The authors build a software system with hitherto unprecedented capabilities regarding the size of the networks to be analysed and with innovative way of organising the calculations. The paper shows how large differences imprecise assumptions can introduce in quantitative results.
- 21 June 2024
- Published by Polish Academy of Sciences Chancellery in Bulletin Of The Polish Academy Of Sciences-Technical Sciences
- p. 150333
Open AccessDropping or marking: a review and evaluation of existing fluid-flow approximation models
Fluid-flow approximation is an approach to modelling and evaluating the performance of vast computer networks. Due to varying traffic and performance of transmission protocols reacting to traffic overloads, computer networks are in a permanent transient state. The fluid-flow method main advantage is its ability to analyse these transient states. The article reviews and organises several versions of this approach, indicating a few errors. The main reason for these errors is confusion or lack of distinction between the two versions of the Internet Protocol – when the queue of packets at a node is too long, they may be destroyed or only marked as redundant. The paper compares and evaluates these fluid-flow approximation models with mild and aggressive settings of RED parameters. The authors build a software system with hitherto unprecedented capabilities regarding the size of the networks to be analysed and with innovative way of organising the calculations. The paper shows how large differences imprecise assumptions can introduce in quantitative results.
- Open Access
- 16 December 2021
- Published by MDPI AG in Mathematics
- Vol. 9 (24) , 3279
Fluid-Flow Approximation in the Analysis of Vast Energy-Aware Networks
The paper addresses two issues: (i) modeling dynamic flows transmitted in vast TCP/IP networks and (ii) modeling the impact of energy-saving algorithms. The approach is based on the fluid-flow approximation, which applies first-order differential equations to analyze the evolution of queues and flows. We demonstrate that the effective implementation of this method overcomes the constraints of storing large data in numerical solutions of transient problems in vast network topologies. The model is implemented and executed directly in a database system. It can analyze transient states in topologies of more than 100,000 nodes, i.e., the size which was not considered until now. We use it to investigate the impact of an energy-saving algorithm on the performance of a vast network. We find that it reduces network congestion and save energy costs but significantly lower network throughput.
- 16 December 2021
- Published by MDPI AG in Mathematics
- Vol. 9 (24) , 3279
Open AccessFluid-Flow Approximation in the Analysis of Vast Energy-Aware Networks
The paper addresses two issues: (i) modeling dynamic flows transmitted in vast TCP/IP networks and (ii) modeling the impact of energy-saving algorithms. The approach is based on the fluid-flow approximation, which applies first-order differential equations to analyze the evolution of queues and flows. We demonstrate that the effective implementation of this method overcomes the constraints of storing large data in numerical solutions of transient problems in vast network topologies. The model is implemented and executed directly in a database system. It can analyze transient states in topologies of more than 100,000 nodes, i.e., the size which was not considered until now. We use it to investigate the impact of an energy-saving algorithm on the performance of a vast network. We find that it reduces network congestion and save energy costs but significantly lower network throughput.
- Open Access
Diffusion Model of Preemptive-Resume Priority Systems and Its Application to Performance Evaluation of SDN Switches
The increasing use of Software-Defined Networks brings the need for their performance analysis and detailed analytical and numerical models of them. The primary element of such research is a model of a SDN switch. This model should take into account non-Poisson traffic and general distributions of service times. Because of frequent changes in SDN flows, it should also analyze transient states of the queues. The method of diffusion approximation can meet these requirements. We present here a diffusion approximation of priority queues and apply it to build a more detailed model of SDN switch where packets returned by the central controller have higher priority than other packets.
Open AccessDiffusion Model of Preemptive-Resume Priority Systems and Its Application to Performance Evaluation of SDN Switches
The increasing use of Software-Defined Networks brings the need for their performance analysis and detailed analytical and numerical models of them. The primary element of such research is a model of a SDN switch. This model should take into account non-Poisson traffic and general distributions of service times. Because of frequent changes in SDN flows, it should also analyze transient states of the queues. The method of diffusion approximation can meet these requirements. We present here a diffusion approximation of priority queues and apply it to build a more detailed model of SDN switch where packets returned by the central controller have higher priority than other packets.
- 4 August 2015
- Published by Springer Nature
- p. 251-259
Modelling Dynamics of TCP Flows in Very Large Network Topologies
- 4 August 2015
- Published by Springer Nature
- p. 251-259
Modelling Dynamics of TCP Flows in Very Large Network Topologies
- 28 May 2015
- Published by Springer Nature
- p. 371-381
An Analysis of the Extracted Parts of Opte Internet Topology
- 28 May 2015
- Published by Springer Nature
- p. 371-381
An Analysis of the Extracted Parts of Opte Internet Topology
- 25 September 2014
- Published by Springer Nature
- p. 249-256
Traffic Engineering: Erlang and Engset Models Revisited with Diffusion Approximation
- 25 September 2014
- Published by Springer Nature
- p. 249-256
Traffic Engineering: Erlang and Engset Models Revisited with Diffusion Approximation
- 1 January 2014
- Published by Springer Nature
- p. 58-72
Modelling Transient States in Queueing Models of Computer Networks: A Few Practical Issues
- 1 January 2014
- Published by Springer Nature
- p. 58-72
Modelling Transient States in Queueing Models of Computer Networks: A Few Practical Issues
- 29 September 2011
- Published by Springer Nature
- p. 215-221
Performance Evaluation of a Multiuser Interactive Networking System: A Comparison of Modelling Methods
- 29 September 2011
- Published by Springer Nature
- p. 215-221
Performance Evaluation of a Multiuser Interactive Networking System: A Comparison of Modelling Methods