Konstanty Junosza-Szaniawski
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Research Subjects
Konstanty Junosza-Szaniawski has a total of 53 co-authors. Here are the top co-authors by number of shared publications:
- Paweł Rzążewski
Warsaw University of Technology Warsaw Poland
12 shared publications - Jan Kratochvíl
Charles University, Prague, Czech Republic
6 shared publications Joanna Chybowska-Sokół
Warsaw Univ Technol, Warsaw, Poland
4 shared publicationsMathieu Liedloff
Laboratoire d'Informatique Fondamentale d'Orléans, Université d'Orléans, Orléans Cedex 2, France
4 shared publications- Zbigniew Lonc
Warsaw University of Technology
3 shared publications - Armin Fügenschuh
Brandenburg University of Technology
2 shared publications
Latest Publications
Maximizing SDN Resilience to Node‐Targeted Attacks—A Game‐Theoretic Approach
This paper studies a strategic conflict between two players—a telecommunications network operator seeking to maximize network availability after an attack and an attacker seeking to minimize it—using a game‐theoretic framework. The analysis focuses on software‐defined networking (SDN), where the separation of the transport and control planes introduces a critical vulnerability: transport switches must maintain connectivity to controllers located at selected nodes in order to operate. Following an attack, switches (and any co‐located controllers) at targeted nodes are disabled together with their transport links. As a consequence, not only directly attacked switches fail, but also those that lose connectivity to operational controllers, further reducing network availability. This setting gives rise to a zero‐sum matrix game in which the operator selects controller placements while the attacker chooses attack targets, with each player unaware of the other's decision. The payoff of the game is the number of surviving switches (for the operator) and the number of disabled switches (for the attacker), and both players adopt mixed strategies, represented by optimized decision probability distributions. To compute these strategies, we develop a column‐generation optimization framework based on a primal–dual pair of non‐compact linear programming formulations. Controller placements and attack sets are generated via integer programming pricing problems. The resulting method remains computationally efficient even for large‐scale networks with a vast number of possible placement and attack combinations. The proposed approach has been implemented and tested on two representative network instances. The results demonstrate both the effectiveness of the game model and the computational efficiency and scalability of the solution method.
Maximizing SDN Resilience to Node‐Targeted Attacks—A Game‐Theoretic Approach
This paper studies a strategic conflict between two players—a telecommunications network operator seeking to maximize network availability after an attack and an attacker seeking to minimize it—using a game‐theoretic framework. The analysis focuses on software‐defined networking (SDN), where the separation of the transport and control planes introduces a critical vulnerability: transport switches must maintain connectivity to controllers located at selected nodes in order to operate. Following an attack, switches (and any co‐located controllers) at targeted nodes are disabled together with their transport links. As a consequence, not only directly attacked switches fail, but also those that lose connectivity to operational controllers, further reducing network availability. This setting gives rise to a zero‐sum matrix game in which the operator selects controller placements while the attacker chooses attack targets, with each player unaware of the other's decision. The payoff of the game is the number of surviving switches (for the operator) and the number of disabled switches (for the attacker), and both players adopt mixed strategies, represented by optimized decision probability distributions. To compute these strategies, we develop a column‐generation optimization framework based on a primal–dual pair of non‐compact linear programming formulations. Controller placements and attack sets are generated via integer programming pricing problems. The resulting method remains computationally efficient even for large‐scale networks with a vast number of possible placement and attack combinations. The proposed approach has been implemented and tested on two representative network instances. The results demonstrate both the effectiveness of the game model and the computational efficiency and scalability of the solution method.
- Open Access
- 1 January 2025
- Published by Croatian Communications and Information Society in Journal of Communications Software and Systems
- Vol. 21 (1) , 1-12
Critical Function Placement based on Service Chains in Multi-administrative Federated Networks
Although the Service Function Chains (SFCs) embedding problem is broadly investigated in the literature, few works address it in a sliced multi-administrative network federation. In this work, we provide several insights into the problem. First, we describe a new federated-level topology abstraction. Second, we introduce a novel optimization model and heuristic (for large scale), which solve SFC embedding. Third, we conduct experiments on various multi-domain topologies and compare the algorithms regarding resource allocation efficiency and runtime. We analyze the trade-off between slice deployment costs and link utilization. Finally, we emulate two security scenarios on Containernet, Docker, and Open vSwitch architecture.
- 1 January 2025
- Published by Croatian Communications and Information Society in Journal of Communications Software and Systems
- Vol. 21 (1) , 1-12
Open AccessCritical Function Placement based on Service Chains in Multi-administrative Federated Networks
Although the Service Function Chains (SFCs) embedding problem is broadly investigated in the literature, few works address it in a sliced multi-administrative network federation. In this work, we provide several insights into the problem. First, we describe a new federated-level topology abstraction. Second, we introduce a novel optimization model and heuristic (for large scale), which solve SFC embedding. Third, we conduct experiments on various multi-domain topologies and compare the algorithms regarding resource allocation efficiency and runtime. We analyze the trade-off between slice deployment costs and link utilization. Finally, we emulate two security scenarios on Containernet, Docker, and Open vSwitch architecture.
- 12 November 2024
- Published by Elsevier in Discrete Mathematics
- Vol. 348 (2)
Partial packing coloring and quasi-packing coloring of the triangular grid
- 12 November 2024
- Published by Elsevier in Discrete Mathematics
- Vol. 348 (2)
Partial packing coloring and quasi-packing coloring of the triangular grid
- 18 October 2024
- Published by Elsevier in Theoretical Computer Science
- Vol. 1020
Online coloring of disk graphs
- 18 October 2024
- Published by Elsevier in Theoretical Computer Science
- Vol. 1020
Online coloring of disk graphs
- 14 April 2023
- Published by Elsevier in Discrete Mathematics
- Vol. 346 (7)
Coloring distance graphs on the plane
- 14 April 2023
- Published by Elsevier in Discrete Mathematics
- Vol. 346 (7)
Coloring distance graphs on the plane
- 15 February 2022
- Published by Elsevier in Journal of Combinatorial Theory, Series A
- Vol. 189
Fractional meanings of nonrepetitiveness
- 15 February 2022
- Published by Elsevier in Journal of Combinatorial Theory, Series A
- Vol. 189
Fractional meanings of nonrepetitiveness
- Open Access
- 1 January 2022
- Published by University of Zielona Góra, Poland in International Journal of Applied Mathematics and Computer Science
- Vol. 32 (1) , 35-49
Exact and approximation algorithms for sensor placement against DDoS attacks
In a distributed denial of service (DDoS) attack, the attacker gains control of many network users through a virus. Then the controlled users send many...
- 1 January 2022
- Published by University of Zielona Góra, Poland in International Journal of Applied Mathematics and Computer Science
- Vol. 32 (1) , 35-49
Open AccessExact and approximation algorithms for sensor placement against DDoS attacks
In a distributed denial of service (DDoS) attack, the attacker gains control of many network users through a virus. Then the controlled users send many...
- Open Access
- 26 September 2020
- Published by Polish Information Processing Society PTI in Annals of Computer Science and Information Systems
- Vol. 21, 295-301
Exact and approximation algorithms for sensor placement against DDoS attacks
- 26 September 2020
- Published by Polish Information Processing Society PTI in Annals of Computer Science and Information Systems
- Vol. 21, 295-301
Open AccessExact and approximation algorithms for sensor placement against DDoS attacks
- 1 September 2020
- Published by Elsevier in Discrete Applied Mathematics
- Vol. 284, 53-60
Strong chromatic index of -free graphs- 1 September 2020
- Published by Elsevier in Discrete Applied Mathematics
- Vol. 284, 53-60
Strong chromatic index of -free graphs- 1 April 2020
- Published by Elsevier in Discrete Applied Mathematics
- Vol. 277, 82-91
Bundling all shortest paths
- 1 April 2020
- Published by Elsevier in Discrete Applied Mathematics
- Vol. 277, 82-91
Bundling all shortest paths