An Approach to Resolve NP-Hard Problems of Firewalls

被引:0
|
作者
Khoumsi, Ahmed [1 ]
Erradi, Mohamed [2 ]
Ayache, Meryeme [2 ]
Krombi, Wadie [2 ]
机构
[1] Univ Sherbrooke, Dept Elect & Comp Engn, Sherbrooke, PQ, Canada
[2] Mohammed V Univ, ENSIAS, Rabat, Morocco
来源
关键词
D O I
10.1007/978-3-319-46140-3_19
中图分类号
TP3 [计算技术、计算机技术];
学科分类号
0812 ;
摘要
Firewalls are a common solution to protect information systems from intrusions. In this paper, we apply an automata-based methodology to resolve several NP-Hard problems which have been shown in the literature to be fundamental for the study of firewall security policies. We also compute space and time complexities of our resolution methods.
引用
收藏
页码:229 / 243
页数:15
相关论文
共 50 条
  • [1] A categorical approach to NP-hard optimization problems
    Leal, LAD
    Claudio, DM
    Toscani, LV
    Menezes, PB
    COMPUTER AIDED SYSTEMS THEORY - EUROCAST 2003, 2003, 2809 : 62 - 73
  • [2] A Differential Approach for Several NP-hard Optimization Problems
    Jena, Sangram K.
    Subramani, K.
    Velasquez, Alvaro
    ARTIFICIAL INTELLIGENCE AND IMAGE ANALYSIS, ISAIM 2024, IWCIA 2024, 2024, 14494 : 68 - 80
  • [3] Most Tensor Problems Are NP-Hard
    Hillar, Christopher J.
    Lim, Lek-Heng
    JOURNAL OF THE ACM, 2013, 60 (06)
  • [4] DECOMPOSITION OF ARITHMETICAL NP-HARD PROBLEMS
    MEJZLIK, P
    INTERNATIONAL JOURNAL OF COMPUTER MATHEMATICS, 1993, 48 (1-2) : 31 - 38
  • [5] Dynamic Programming for NP-Hard Problems
    Wang, Xiaodong
    Tian, Jun
    CEIS 2011, 2011, 15
  • [6] POLYNOMIAL BOUNDING FOR NP-HARD PROBLEMS
    CAMERINI, PM
    MAFFIOLI, F
    MATHEMATICAL PROGRAMMING STUDY, 1980, 12 (APR): : 115 - 119
  • [7] The Fault Tolerance of NP-Hard Problems
    Glasser, Christian
    Pavan, A.
    Travers, Stephen
    LANGUAGE AND AUTOMATA THEORY AND APPLICATIONS, 2009, 5457 : 374 - +
  • [8] The fault tolerance of NP-hard problems
    Glasser, Christian
    Pavan, A.
    Travers, Stephen
    INFORMATION AND COMPUTATION, 2011, 209 (03) : 443 - 455
  • [9] NP-HARD MODULE ROTATION PROBLEMS
    AHN, K
    SAHNI, S
    IEEE TRANSACTIONS ON COMPUTERS, 1993, 42 (12) : 1506 - 1510
  • [10] On the solution of NP-hard linear complementarity problems
    Joaquim J. Júdice
    Ana M. Faustino
    Isabel Martins Ribeiro
    Top, 2002, 10 (1) : 125 - 145