Piotr Arabas
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Research Subjects
Piotr Arabas has a total of 24 co-authors. Here are the top co-authors by number of shared publications:
- Ewa Niewiadomska-Szynkiewicz
Warsaw University of Technology
11 shared publications Andrzej Sikora
7 shared publications- Krzysztof Malinowski
Department of Neurophysiology, Neuropsychology and Neuroinformatics, Medical University of Gdansk, 80-210 Gdansk, Poland
5 shared publications - Michał Karpowicz
NASK Research Institute, Wawozowa 18, 02-796 Warsaw, Poland
5 shared publications - Joanna Kołodziej
Faculty of Computer Science and Mathematics, Krakow University of Technology, Warszawska St., 24, 31-155 Krakow, Poland
4 shared publications Mariusz Kamola
4 shared publications
Latest Publications
- 12 April 2025
- Published by Springer Nature in International Journal of Information Security
- Vol. 24 (3) , 1-18
Filter aggregation for DDoS prevention systems: hardware perspective
- 12 April 2025
- Published by Springer Nature in International Journal of Information Security
- Vol. 24 (3) , 1-18
Filter aggregation for DDoS prevention systems: hardware perspective
- Open Access
Router Activation Heuristics for Energy-Saving ECMP and Valiant Routing in Data Center Networks
This paper addresses the energy conservation problem in computing systems. The focus is on energy-efficient routing protocols. We formulated and solved a network-wide optimization problem for calculating energy-aware routing for the recommended network configuration. Considering the complexity of the mathematical models of data center networks and the limitations of calculating routing by solving large-scale optimization problems, and methods described in the literature, we propose an alternative solution. We designed and developed several efficient heuristics for equal-cost multipath (ECMP) and Valiant routing that reduce the energy consumption in the computer network interconnecting computing servers. Implementing these heuristics enables the selection of routing paths and relay nodes based on current and predicted internal network load. The utility and efficiency of our methods were verified by simulation. The test cases were carried out on several synthetic network topologies, giving encouraging results. Similar results of using our efficient heuristic algorithm and solving the optimization task confirmed the usability and effectiveness of our solution. Thus, we produced well-justified recommendations for energy-aware computing system design to conclude the paper.
Open AccessRouter Activation Heuristics for Energy-Saving ECMP and Valiant Routing in Data Center Networks
This paper addresses the energy conservation problem in computing systems. The focus is on energy-efficient routing protocols. We formulated and solved a network-wide optimization problem for calculating energy-aware routing for the recommended network configuration. Considering the complexity of the mathematical models of data center networks and the limitations of calculating routing by solving large-scale optimization problems, and methods described in the literature, we propose an alternative solution. We designed and developed several efficient heuristics for equal-cost multipath (ECMP) and Valiant routing that reduce the energy consumption in the computer network interconnecting computing servers. Implementing these heuristics enables the selection of routing paths and relay nodes based on current and predicted internal network load. The utility and efficiency of our methods were verified by simulation. The test cases were carried out on several synthetic network topologies, giving encouraging results. Similar results of using our efficient heuristic algorithm and solving the optimization task confirmed the usability and effectiveness of our solution. Thus, we produced well-justified recommendations for energy-aware computing system design to conclude the paper.
- 20 February 2023
- Published by War Studies University in Cybersecurity and Law
- Vol. 9 (1) , 298-315
Wykorzystanie drzew sufiksowych do efektywnej prezentacji podobieństw sesji z systemu pułapek honeypot
The article presents a prototype of a system for analyzing data from a honeypot network. A special attention is paid to finding similarities in the collected ssh sessions. The algorithm proposed looks for generalized patterns in the session using suffix trees. The patterns can be used for a...
- 20 February 2023
- Published by War Studies University in Cybersecurity and Law
- Vol. 9 (1) , 298-315
Wykorzystanie drzew sufiksowych do efektywnej prezentacji podobieństw sesji z systemu pułapek honeypot
The article presents a prototype of a system for analyzing data from a honeypot network. A special attention is paid to finding similarities in the collected ssh sessions. The algorithm proposed looks for generalized patterns in the session using suffix trees. The patterns can be used for a...
- Open Access
Energy-Aware Activity Control for Wireless Sensing Infrastructure Using Periodic Communication and Mixed-Integer Programming
This paper addresses the energy conservation problem in wireless sensor networks, in which sensor data are aggregated into packages and then transmitted periodically to the base station according to an established schedule. We formulate two mixed integer programming problems, first for minimum total energy usage and second for min-max per node energy usage. We present two algorithms for slot allocation that exploit the periodic nature of the data collection process by allocating a subset of nodes to subsequent frames. A mixed-integer solver solves the resulting mathematical programming task. The performed numerical experiments show that the proposed approach is appropriate for relatively small networks when minimizing the total energy consumption problem. Hopefully, the problem may be solved for medium size networks when a maximum node energy consumption performance index is used.
Open AccessEnergy-Aware Activity Control for Wireless Sensing Infrastructure Using Periodic Communication and Mixed-Integer Programming
This paper addresses the energy conservation problem in wireless sensor networks, in which sensor data are aggregated into packages and then transmitted periodically to the base station according to an established schedule. We formulate two mixed integer programming problems, first for minimum total energy usage and second for min-max per node energy usage. We present two algorithms for slot allocation that exploit the periodic nature of the data collection process by allocating a subset of nodes to subsequent frames. A mixed-integer solver solves the resulting mathematical programming task. The performed numerical experiments show that the proposed approach is appropriate for relatively small networks when minimizing the total energy consumption problem. Hopefully, the problem may be solved for medium size networks when a maximum node energy consumption performance index is used.
- 1 February 2021
- Published by Elsevier in Simulation Modelling Practice and Theory
- Vol. 107
Modeling and simulation of hierarchical task allocation system for energy-aware HPC clouds
- 1 February 2021
- Published by Elsevier in Simulation Modelling Practice and Theory
- Vol. 107
Modeling and simulation of hierarchical task allocation system for energy-aware HPC clouds
- Open Access
- 28 December 2018
- Published by National Institute of Telecommunications in Journal of Telecommunications and Information Technology
- Vol. 4 (2018) , 26-36
Energy Aware Data Centers and Networks: a Survey
The past years have brought about a great variety of clusters and clouds. This, combined with their increasing size and complexity, has resulted in an obvious need for power-saving control mechanisms. Upon presenting a basis on which such solutions - namely low-level power control interfaces, CPU governors and network topologies – are constructed, the paper summarizes network and cluster resources control algorithms. Finally, the need for integrated, hierarchical control is expressed, and specific examples are provided.
- 28 December 2018
- Published by National Institute of Telecommunications in Journal of Telecommunications and Information Technology
- Vol. 4 (2018) , 26-36
Open AccessEnergy Aware Data Centers and Networks: a Survey
The past years have brought about a great variety of clusters and clouds. This, combined with their increasing size and complexity, has resulted in an obvious need for power-saving control mechanisms. Upon presenting a basis on which such solutions - namely low-level power control interfaces, CPU governors and network topologies – are constructed, the paper summarizes network and cluster resources control algorithms. Finally, the need for integrated, hierarchical control is expressed, and specific examples are provided.
- 1 January 2018
- Published by Elsevier in Future Generation Computer Systems
- Vol. 78, 302-315
Design and implementation of energy-aware application-specific CPU frequency governors for the heterogeneous distributed computing systems
- 1 January 2018
- Published by Elsevier in Future Generation Computer Systems
- Vol. 78, 302-315
Design and implementation of energy-aware application-specific CPU frequency governors for the heterogeneous distributed computing systems
- Open Access
- 17 November 2016
- Published by Wiley in Concurrency and Computation: Practice and Experience
- Vol. 28 (18) , 4557
Control system for reducing energy consumption in backbone computer network
- 17 November 2016
- Published by Wiley in Concurrency and Computation: Practice and Experience
- Vol. 28 (18) , 4557
Open AccessControl system for reducing energy consumption in backbone computer network
- 5 March 2016
- Published by Wydawnictwo SIGMA-NOT, sp. z.o.o. in PRZEGLĄD ELEKTROTECHNICZNY
- Vol. 1 (3) , 36-43
Wykorzystanie informacji z rejestrów procesora do identyfikacji modelu poboru mocy przez serwer
- 5 March 2016
- Published by Wydawnictwo SIGMA-NOT, sp. z.o.o. in PRZEGLĄD ELEKTROTECHNICZNY
- Vol. 1 (3) , 36-43
Wykorzystanie informacji z rejestrów procesora do identyfikacji modelu poboru mocy przez serwer