REACT: reactive resilience for critical infrastructures using graph-coloring techniques

被引:8
|
作者
Marsa-Maestre, Ivan [1 ]
Manuel Gimenez-Guzman, Jose [1 ]
Orden, David [2 ]
de la Hoz, Enrique [1 ]
Klein, Mark [3 ]
机构
[1] Univ Alcala, Comp Engn Dept, Alcala De Henares, Spain
[2] Univ Alcala, Dept Phys & Math, Alcala De Henares, Spain
[3] MIT, Ctr Collect Intelligence, Cambridge, MA USA
关键词
Network security; Network theory (graphs); Optimization; Simulated annealing; ZERO DAY SAFETY; OPTIMIZATION; CLOUD; NEGOTIATION; NETWORKS; RISK;
D O I
10.1016/j.jnca.2019.07.003
中图分类号
TP3 [计算技术、计算机技术];
学科分类号
0812 ;
摘要
Nowadays society is more and more dependent on critical infrastructures. Critical network infrastructures (CNI) are communication networks whose disruption can create a severe impact. In this paper we propose REACT, a distributed framework for reactive network resilience, which allows networks to reconfigure themselves in the event of a security incidents so that the risk of further damage is mitigated. Our framework takes advantage of a risk model based on multilayer networks, as well as a graph-coloring problem conversion, to identify new, more resilient configurations for networks in the event of an attack. We propose two different solution approaches, and evaluate them from two different perspectives, with a number of centralized optimization techniques. Experiments show that our approaches outperform the reference approaches in terms of risk mitigation and performance.
引用
收藏
页数:14
相关论文
共 18 条
  • [1] USING TABU SEARCH TECHNIQUES FOR GRAPH-COLORING
    HERTZ, A
    DEWERRA, D
    COMPUTING, 1987, 39 (04) : 345 - 351
  • [2] GRAPH-COLORING USING EIGENVALUE DECOMPOSITION
    ASPVALL, B
    GILBERT, JR
    SIAM JOURNAL ON ALGEBRAIC AND DISCRETE METHODS, 1984, 5 (04): : 526 - 538
  • [3] Graph-Coloring and Treescan Register Allocation Using Repairing
    Colombet, Quentin
    Boissinot, Benoit
    Brisk, Philip
    Hack, Sebastian
    Rastello, Fabrice
    PROCEEDINGS OF THE PROCEEDINGS OF THE 14TH INTERNATIONAL CONFERENCE ON COMPILERS, ARCHITECTURES AND SYNTHESIS FOR EMBEDDED SYSTEMS (CASES '11), 2011, : 45 - 54
  • [4] A diagnosis algorithm by using graph-coloring under the PMC model
    Zhu, Qiang
    Guo, Guodong
    Tang, Wenliang
    Zhang, Cun-Quan
    JOURNAL OF COMBINATORIAL OPTIMIZATION, 2016, 32 (03) : 960 - 969
  • [5] Mobility-Aware Content Caching Using Graph-Coloring
    Javedankherad, Mostafa
    Zeinalpour-Yazdi, Zolfa
    Ashtiani, Farid
    IEEE TRANSACTIONS ON VEHICULAR TECHNOLOGY, 2022, 71 (05) : 5666 - 5670
  • [6] A diagnosis algorithm by using graph-coloring under the PMC model
    Qiang Zhu
    Guodong Guo
    Wenliang Tang
    Cun-Quan Zhang
    Journal of Combinatorial Optimization, 2016, 32 : 960 - 969
  • [7] SCHEDULING OF COMMUNICATION CHANNELS IN PACKET NETWORKS USING A GRAPH-COLORING ALGORITHM
    KHEJFEC, EM
    AVTOMATIKA I VYCHISLITELNAYA TEKHNIKA, 1988, (05): : 37 - 40
  • [9] RESOURCE-ALLOCATION IN A DYNAMICALLY PARTITIONABLE BUS NETWORK USING A GRAPH-COLORING ALGORITHM
    WOO, TK
    SU, SYW
    NEWMANWOLFE, R
    IEEE TRANSACTIONS ON COMMUNICATIONS, 1991, 39 (12) : 1794 - 1801
  • [10] USING TABU SEARCH TECHNIQUES FOR GRAPH COLORING.
    Hertz, A.
    de Werra, D.
    Computing (Vienna/New York), 1987, 39 (04): : 345 - 351