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

来源：

NETWORKED SYSTEMS, NETYS 2016 | 2016年 / 9944卷

关键词：

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 条

[21] NP-hard approximation problems in overlapping clustering
Barthélemy J.-P.
Brucker F.
Journal of Classification, 2001, 18 (2) : 159 - 183
[22] APPLYING THE GENETIC APPROACH TO SIMULATED ANNEALING IN SOLVING SOME NP-HARD PROBLEMS
LIN, FT
KAO, CY
HSU, CC
IEEE TRANSACTIONS ON SYSTEMS MAN AND CYBERNETICS, 1993, 23 (06): : 1752 - 1767
[23] The Simplest Families of Polytopes Associated with NP-Hard Problems
Maksimenko, A. N.
DOKLADY MATHEMATICS, 2015, 91 (01) : 53 - 55
[24] Solving NP-hard combinatorial problems in the practical sense
Ibaraki, T
ALGORITHMS AND COMPUTATION, PROCEEDINGS, 1997, 1350 : 1 - 1
[25] Faster exact solutions for some NP-hard problems
Drori, L
Peleg, D
THEORETICAL COMPUTER SCIENCE, 2002, 287 (02) : 473 - 499
[26] Parameterized algorithms of fundamental NP-hard problems: a survey
Li, Wenjun
Ding, Yang
Yang, Yongjie
Sherratt, R. Simon
Park, Jong Hyuk
Wang, Jin
HUMAN-CENTRIC COMPUTING AND INFORMATION SCIENCES, 2020, 10 (01)
[27] Probabilistic solutions to some NP-hard matrix problems
Vidyasagar, M
Blondel, VD
AUTOMATICA, 2001, 37 (09) : 1397 - 1405
[28] MATRIX REPRESENTATION AND GRADIENT FLOWS FOR NP-HARD PROBLEMS
WONG, WS
JOURNAL OF OPTIMIZATION THEORY AND APPLICATIONS, 1995, 87 (01) : 197 - 220
[29] Stochastic Enumeration Method for Counting NP-Hard Problems
Reuven Rubinstein
Methodology and Computing in Applied Probability, 2013, 15 : 249 - 291
[30] Trainyard is NP-Hard
Almanza, Matteo
Leucci, Stefano
Panconesi, Alessandro
THEORETICAL COMPUTER SCIENCE, 2018, 748 : 66 - 76

← 1 2 3 4 5 →