基于 RPC 模型的访问控制策略压缩算法

摘要

Access control list (ACL)provides a basic access control on network device interfaces,and is one of the important means to maintain the security of network systems.However,ACL items have been growing along with the increase of network applications,while increasing the difficulty in ACL management,this also degrades the forwarding performance of network devices as well.Therefore to compress ACL is particularly important,but this problem has been proved to be NP-hard.Aiming at ACL compression problem,the paper proposes an approach based on mapping matrix and constructing independent unit space set to transform the problem into a problem of rectilinear polygon rectangle cover.Analysis shows that the approximation degree of the solution to the problem can break O (logn ),this offers a new thought for solving ACL compression problem.%访问控制列表（ACL）提供了对网络设备接口的一种基本访问控制，是维护网络系统安全的重要手段之一。随着网络应用的日益增多，ACL 条目也随之增加，使得管理 ACL 更加困难，降低了网络设备的转发性能。因此对 ACL 进行压缩显得尤为重要，但该问题已被证明是 NP 难。针对 ACL 压缩问题，提出基于矩阵映射和构建独立单元空间集的方法，将其转换为直线多边形的矩形覆盖问题。分析表明该问题的求解近似度可以突破 O（logn），为 ACL 压缩问题的求解提供了新的思路。