基于后序遍历请求树的访问控制策略匹配算法

An Access Control Policy Matching Algorithm Based on Postorder Traversal of Request Tree

为解决传统访问控制策略匹配算法中因产生大量无用路径而导致性能低下的问题,提出了一种改进的基于后序遍历请求树的策略匹配算法。该算法对请求树的节点进行后序遍历,并采用及时截止剪枝方法,避免了大量无用路径的产生,有效降低了匹配输出结果大小,提高了策略匹配效率。实验证明,该算法较之传统的策略匹配算法大大提升了性能。

In order to resolve the problems of poor performance caused by generating a lot of useless paths in traditional access control policy matching algorithms, this paper proposed a policy matching algorithm based on postorder traversal of request tree. This algorithm uses a method called ＂timely interrupt pruning＂ to postorder traverse the nodes of request tree, so a lot of useless paths can be avoid. By using this algorithm, the matching output size can be reduced effectively,and the efficiency of policy matching can be improved. The experiment results show that this algorithm can improve the performance greatly, compared with traditional algorithms.