TY - JOUR

T1 - Intrusion Response Systems for the 5G Networks and Beyond

T2 - A New Joint Security-vs-QoS Optimization Approach

AU - Bozorgchenani, Arash

AU - Zarakovitis, Charilaos C.

AU - Chien, Su Fong

AU - Ni, Qiang

AU - Gouglidis, Antonios

AU - Mallouli, Wissam

AU - Lim, Heng Siong

PY - 2024/1/26

Y1 - 2024/1/26

N2 - Network connectivity exposes the network infrastructure and assets to vulnerabilities that attackers can exploit. Protecting network assets against attacks requires the application of security countermeasures. Nevertheless, employing countermeasures incurs costs, such as monetary costs, along with time and energy to prepare and deploy the countermeasures. Thus, an Intrusion Response System (IRS) shall consider security and QoS costs when dynamically selecting the countermeasures to address the detected attacks. This has motivated us to formulate a joint Security-vs-QoS optimization problem to select the best countermeasures in an IRS. The problem is then transformed into a matching game-theoretical model. Considering the monetary costs and attack coverage constraints, we first derive the theoretical upper bound for the problem and later propose stable matching-based solutions to address the trade-off. The performance of the proposed solution, considering different settings, is validated over a series of simulations.

AB - Network connectivity exposes the network infrastructure and assets to vulnerabilities that attackers can exploit. Protecting network assets against attacks requires the application of security countermeasures. Nevertheless, employing countermeasures incurs costs, such as monetary costs, along with time and energy to prepare and deploy the countermeasures. Thus, an Intrusion Response System (IRS) shall consider security and QoS costs when dynamically selecting the countermeasures to address the detected attacks. This has motivated us to formulate a joint Security-vs-QoS optimization problem to select the best countermeasures in an IRS. The problem is then transformed into a matching game-theoretical model. Considering the monetary costs and attack coverage constraints, we first derive the theoretical upper bound for the problem and later propose stable matching-based solutions to address the trade-off. The performance of the proposed solution, considering different settings, is validated over a series of simulations.

KW - Computer Networks and Communications

KW - Computer Science Applications

KW - Control and Systems Engineering

U2 - 10.1109/tnse.2024.3358170

DO - 10.1109/tnse.2024.3358170

M3 - Journal article

SP - 1

EP - 14

JO - IEEE Transactions on Network Science and Engineering

JF - IEEE Transactions on Network Science and Engineering

SN - 2327-4697

ER -