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 条

[31] Data-Driven Approximations to NP-Hard Problems
Milan, Anton
Rezatofighi, S. Hamid
Garg, Ravi
Dick, Anthony
Reid, Ian
THIRTY-FIRST AAAI CONFERENCE ON ARTIFICIAL INTELLIGENCE, 2017, : 1453 - 1459
[32] Many bounded versions of undecidable problems are NP-hard
Klingler, Andreas
van der Eyden, Mirte
Stengele, Sebastian
Reinhart, Tobias
De las Cuevas, Gemma
SCIPOST PHYSICS, 2023, 14 (06):
[33] A rapid convergent genetic algorithm for NP-hard problems
Oren, Liel
Thirer, Nonel
ARTIFICIAL INTELLIGENCE AND MACHINE LEARNING FOR MULTI-DOMAIN OPERATIONS APPLICATIONS, 2019, 11006
[34] ON THE COMPLEXITY OF TEST CASE GENERATION FOR NP-HARD PROBLEMS
SANCHIS, LA
INFORMATION PROCESSING LETTERS, 1990, 36 (03) : 135 - 140
[35] An investigation of the use of local search in NP-hard problems
Newth, D
Kirley, M
Green, DG
IECON 2000: 26TH ANNUAL CONFERENCE OF THE IEEE INDUSTRIAL ELECTRONICS SOCIETY, VOLS 1-4: 21ST CENTURY TECHNOLOGIES AND INDUSTRIAL OPPORTUNITIES, 2000, : 2710 - 2715
[36] An analytical study of NP-hard protein folding problems
Thilagavathi, N.
Amudha, T.
2014 INTERNATIONAL CONFERENCE ON INTELLIGENT COMPUTING APPLICATIONS (ICICA 2014), 2014, : 184 - 188
[37] NP-hard graph problems and boundary classes of graphs
Alekseev, V. E.
Boliac, R.
Korobitsyn, D. V.
Lozin, V. V.
THEORETICAL COMPUTER SCIENCE, 2007, 389 (1-2) : 219 - 236
[38] Typical performance of approximation algorithms for NP-hard problems
Takabe, Satoshi
Hukushima, Koji
JOURNAL OF STATISTICAL MECHANICS-THEORY AND EXPERIMENT, 2016,
[39] SOME POLYNOMIAL AND INTEGER DIVISIBILITY PROBLEMS ARE NP-HARD
PLAISTED, D
SIAM JOURNAL ON COMPUTING, 1978, 7 (04) : 458 - 464
[40] NP-HARD PROBLEMS IN HIERARCHICAL-TREE CLUSTERING
KRIVANEK, M
MORAVEK, J
ACTA INFORMATICA, 1986, 23 (03) : 311 - 323

← 1 2 3 4 5 →