Grzegorz Zalewski
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
Grzegorz Zalewski has a total of 7 co-authors. Here are the top co-authors by number of shared publications:
- Włodzimierz Ogryczak
Warsaw University of Technology
4 shared publications - Krzysztof Walkowiak
Department of Systems and Computer Networks, Wrocaw University of Science and Technology, Wrocaw, Poland
2 shared publications - Miroslaw Klinkowski
National Institute of Telecommunications, Warsaw, Poland
2 shared publications - Janusz Granat
National Institute of Telecommunications
1 shared publication - Marek Jaworski
National Institute of Telecommunications, Szachowa 1, 04-894 Warsaw, Poland
1 shared publication - Marek Makowski
International Institute for Applied Systems Analysis
1 shared publication
Latest Publications
- Open Access
- 31 December 2024
- Published by National Institute of Telecommunications in Journal of Telecommunications and Information Technology
- Vol. 4 (2024) , 86-92
Efficiency and Fairness Optimization in Energy Management
The paper proposes a solution to the problem of distributing electricity originating from various sources. In the proposed model, each source has a different cost of acquisition and is characterized by varying energy efficiency factors. Additionally, in the case of renewable sources, the costs of storing energy are taken into consideration as well. This work presents a fair and cost-efficient approach to distributing the demands of energy providers. A model has been developed and verified for the purpose of corroborating the process.
- 31 December 2024
- Published by National Institute of Telecommunications in Journal of Telecommunications and Information Technology
- Vol. 4 (2024) , 86-92
Open AccessEfficiency and Fairness Optimization in Energy Management
The paper proposes a solution to the problem of distributing electricity originating from various sources. In the proposed model, each source has a different cost of acquisition and is characterized by varying energy efficiency factors. Additionally, in the case of renewable sources, the costs of storing energy are taken into consideration as well. This work presents a fair and cost-efficient approach to distributing the demands of energy providers. A model has been developed and verified for the purpose of corroborating the process.
- 16 January 2020
- Published by Institute of Electrical and Electronics Engineers (IEEE) in Journal of Lightwave Technology
- Vol. 38 (7) , 1625-1635
Machine Learning Assisted Optimization of Dynamic Crosstalk-Aware Spectrally-Spatially Flexible Optical Networks
We focus on optimization of dynamic spectrally-spatially flexible optical networks (SS-FONs), in which distance-adaptive, spectral super-channel (SCh) transmission is realized over weakly-coupled multi-core fibers (MCFs). In such networks, the inter-core crosstalk (XT) effect in MCFs impairs the quality of transmission (QoT) of optical signals, which has a negative impact on overall network performance. In this context, a key issue is selection of a modulation format (MF) for a particular lightpath, since each MF offers a different tradeoff between spectral efficiency (number of occupied frequency slices) and transmission reach, and both these elements are in a close relation with the experienced XT. In fact, it is difficult to quantify the impact of the MFs used in a given network on the deterioration in QoT due to the XT effect and on overall network performance, as the levels of XT experienced by particular lightpaths depend directly on ongoing transmissions in neighbor MCF cores, and those (i.e., established lightpaths) are subject to stochastic changes in dynamic SS-FONs. Therefore, in this work, we propose an approach that selects a MF for a lightpath based only on the transmission distance, i.e., length of the applied routing path. In particular, for each considered MF, we define a Modulation format Distance Limit (MDL) parameter that is used to select the MF for a lightpath by a simple comparison of the considered routing path length against the MDL parameter. To facilitate the very complex process of determining the best values of the MDL parameter, we propose a machine learning (ML) approach, namely, supervised learning regression method, with the overall goal to optimize network performance in terms of bandwidth blocking probability (BBP). Extensive simulation experiments performed in different network scenarios show that the proposed method ML allows to achieve performance gains when compared to various reference approaches, including a more computationally expensive method that is based on dynamic (flexible) selection of MFs.
- 16 January 2020
- Published by Institute of Electrical and Electronics Engineers (IEEE) in Journal of Lightwave Technology
- Vol. 38 (7) , 1625-1635
Machine Learning Assisted Optimization of Dynamic Crosstalk-Aware Spectrally-Spatially Flexible Optical Networks
We focus on optimization of dynamic spectrally-spatially flexible optical networks (SS-FONs), in which distance-adaptive, spectral super-channel (SCh) transmission is realized over weakly-coupled multi-core fibers (MCFs). In such networks, the inter-core crosstalk (XT) effect in MCFs impairs the quality of transmission (QoT) of optical signals, which has a negative impact on overall network performance. In this context, a key issue is selection of a modulation format (MF) for a particular lightpath, since each MF offers a different tradeoff between spectral efficiency (number of occupied frequency slices) and transmission reach, and both these elements are in a close relation with the experienced XT. In fact, it is difficult to quantify the impact of the MFs used in a given network on the deterioration in QoT due to the XT effect and on overall network performance, as the levels of XT experienced by particular lightpaths depend directly on ongoing transmissions in neighbor MCF cores, and those (i.e., established lightpaths) are subject to stochastic changes in dynamic SS-FONs. Therefore, in this work, we propose an approach that selects a MF for a lightpath based only on the transmission distance, i.e., length of the applied routing path. In particular, for each considered MF, we define a Modulation format Distance Limit (MDL) parameter that is used to select the MF for a lightpath by a simple comparison of the considered routing path length against the MDL parameter. To facilitate the very complex process of determining the best values of the MDL parameter, we propose a machine learning (ML) approach, namely, supervised learning regression method, with the overall goal to optimize network performance in terms of bandwidth blocking probability (BBP). Extensive simulation experiments performed in different network scenarios show that the proposed method ML allows to achieve performance gains when compared to various reference approaches, including a more computationally expensive method that is based on dynamic (flexible) selection of MFs.
- 30 August 2019
- Published by Springer Nature
- p. 77-83
Fair Resource Allocation by Gini Index Minimization
- 30 August 2019
- Published by Springer Nature
- p. 77-83
Fair Resource Allocation by Gini Index Minimization
- 27 September 2017
- Published by Springer Nature
- p. 217-229
Network Dimensioning with Minimum Unfairness Cost for the Efficiency
- 27 September 2017
- Published by Springer Nature
- p. 217-229
Network Dimensioning with Minimum Unfairness Cost for the Efficiency
- Open Access
- 30 December 2016
- Published by National Institute of Telecommunications in Journal of Telecommunications and Information Technology
- Vol. 4 (2016) , 15-21
Network Dimensioning with Maximum Revenue Efficiency for the Fairness Index
Network dimensioning is a specific kind of the resource allocation problem. One of the tasks in the network optimization is to maximize the total flow on given pairs of nodes (so-called demands or paths between source and target). The task can be more complicated when different revenue/profit gained from each unit of traffic stream allocated on each demand is taken into account. When the total revenue is maximized the problem of starvation of less attractive paths can appear. Therefore, it is important to include some fairness criteria to preserve connections between all the demands on a given degree of quality, also for the least attractive paths. In this paper, a new bicriteria ratio optimization method which takes into account both, the revenue and the fairness is proposed. Mathematical model is built in a form of linear programming. The solutions are analyzed with some statistical measures to evaluate their quality, with respect to fairness and efficiency. In particular, the Gini’s coefficient is used for this purpose.
- 30 December 2016
- Published by National Institute of Telecommunications in Journal of Telecommunications and Information Technology
- Vol. 4 (2016) , 15-21
Open AccessNetwork Dimensioning with Maximum Revenue Efficiency for the Fairness Index
Network dimensioning is a specific kind of the resource allocation problem. One of the tasks in the network optimization is to maximize the total flow on given pairs of nodes (so-called demands or paths between source and target). The task can be more complicated when different revenue/profit gained from each unit of traffic stream allocated on each demand is taken into account. When the total revenue is maximized the problem of starvation of less attractive paths can appear. Therefore, it is important to include some fairness criteria to preserve connections between all the demands on a given degree of quality, also for the least attractive paths. In this paper, a new bicriteria ratio optimization method which takes into account both, the revenue and the fairness is proposed. Mathematical model is built in a form of linear programming. The solutions are analyzed with some statistical measures to evaluate their quality, with respect to fairness and efficiency. In particular, the Gini’s coefficient is used for this purpose.
- Open Access
- 30 September 2016
- Published by National Institute of Telecommunications in Journal of Telecommunications and Information Technology
- Vol. 3 (2016) , 18-24
Comparison of Selected Fair-optimization Methods for Flow Maximization between Given Pairs of Nodes in Telecommunications Network
Dimensioning of telecommunications networks requires the allocation of the ows (bandwidth) to given trac demands for the source-destination pairs of nodes. Unit ow allocated to the given demand is associated with revenue that may vary for dierent demands. Problem the decision-making basic algorithms to maximize the total revenue may lead to the solutions that are unacceptable, due to "starvation" or "locking" of some demand paths less attractive with respect to the total revenue. Therefore, the fair optimization approaches must be applied. In this paper, two fair optimization methods are analyzed: the method of ordered weighted average (OWA) and the reference point method (RPM). The study assumes that ows can be bifurcated thus realized in multiple path schemes. To implement optimization model the AMPL was used with general-purpose linear programming solvers. As an example of the data, the Polish backbone network was used.
- 30 September 2016
- Published by National Institute of Telecommunications in Journal of Telecommunications and Information Technology
- Vol. 3 (2016) , 18-24
Open AccessComparison of Selected Fair-optimization Methods for Flow Maximization between Given Pairs of Nodes in Telecommunications Network
Dimensioning of telecommunications networks requires the allocation of the ows (bandwidth) to given trac demands for the source-destination pairs of nodes. Unit ow allocated to the given demand is associated with revenue that may vary for dierent demands. Problem the decision-making basic algorithms to maximize the total revenue may lead to the solutions that are unacceptable, due to "starvation" or "locking" of some demand paths less attractive with respect to the total revenue. Therefore, the fair optimization approaches must be applied. In this paper, two fair optimization methods are analyzed: the method of ordered weighted average (OWA) and the reference point method (RPM). The study assumes that ows can be bifurcated thus realized in multiple path schemes. To implement optimization model the AMPL was used with general-purpose linear programming solvers. As an example of the data, the Polish backbone network was used.