.png){kind=icon}
返回
An innovative two-stage algorithm to optimize Firewall rule ordering
.png){kind=icon}
OA
AI
DOI：10.1016/j.cose.2023.103423.png)
.png){kind=icon}
.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
Packet classification activity performed by a FireWall (FW) introduces high latency in network communications due to the computation time required to check whether any packet matches one of the FW rules. Such a classification process is done by sequentially checking the list of rules until a match is found or the end of the list is reached. Given the complexity of FW rules in some environments, this latency could become relevant. This problem is addressed by ordering the list of FW rules to minimize the classification latency, where the rules with higher activation frequencies are placed accordingly starting from the top of the list. This is not always feasible because dependency constraints between rules could exist: swapping the positions of dependent rules results in a loss of the integrity of the implemented security policy. For this reason, the FW rule ordering problem belongs to the realm of constrained combinatorial optimization.This paper proposes a two-stage algorithm to address this problem. The first stage performs an innovative topological sorting algorithm aimed at finding an optimal ordering for the constrained rules, taking into account the fact that rule activation frequencies are influenced by inter-packet arrival time, which typically obeys Zipf's law. The second stage employs a genetic algorithm to find the optimal ordering of all rules within the list. The proposed approach is evaluated using different filtering lists of different complexity provided by ClassBench. A comparison with other state-of-the-art algorithms addressing the same problem is performed. Furthermore, the performance analysis is extended employing an exact optimization method. The results obtained show the effectiveness of the proposed algorithm in minimizing packet classification latency, while a short reordering time is required.
Keyword:
Firewall
Optimal rule ordering
Genetic algorithm
Directed acyclic graph
AI总结
对已上传原文的论文进行重点信息的提取，主要内容包括：简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
C
IF:
5.4
论文数:
4.6K
被引数:
1.4W
机构
引用论文
Adaptive Genetic Algorithm Based on Individual Similarity to Solve Multi-Objective Flexible Job-Shop Scheduling Problem.png)
IEEE ACCESS
OAAI
IEEE ACCESSIF3.6
OAAI分享收藏Government regulations in cyber security: Framework, standards and recommendations网络安全中的政府法规: 框架，标准和建议
PREAI
分享收藏Heuristic algorithms for solving a set of NP-hard single-machine scheduling problems with resource-dependent processing times求解一组处理时间依赖于资源的NP难单机调度问题的启发式算法
PREAI
分享收藏A self-learning genetic algorithm based on reinforcement learning for flexible job-shop scheduling problem基于强化学习的自学习遗传算法求解柔性作业车间调度问题
PREAI
分享收藏A hybrid algorithm for the university course timetabling problem using the improved parallel genetic algorithm and local searchAPPLIED INTELLIGENCE
APPLIED INTELLIGENCEIF3.5
PREAI
分享收藏
查看更多内容