Policy Decomposition for Evaluation Performance Improvement of PDP. (7th May 2014)

• Record Type: Journal Article
• Authors: Deng, Fan; Chen, Ping; Zhang, Li-Yong; Wang, Xian-Qing; Li, Sun-De; Xu, Hui
• Other Names: Xiao Manyu Academic Editor.
• Is Part Of: Mathematical problems in engineering. Volume 2014(2014)
• Publication Date: 2014-05-07
• Subjects: Engineering mathematics -- Periodicals; 510.2462
• DOI: 10.1155/2014/610278
• Languages: English
• ISSNs: 1024-123X

Abstract

Abstract : In conventional centralized authorization models, the evaluation performance of policy decision point (PDP) decreases obviously with the growing numbers of rules embodied in a policy. Aiming to improve the evaluation performance of PDP, a distributed policy evaluation engine called XDPEE is presented. In this engine, the unicity of PDP in the centralized authorization model is changed by increasing the number of PDPs. A policy should be decomposed into multiple subpolicies each with fewer rules by using a decomposition method, which can have the advantage of balancing the cost of subpolicies deployed to each PDP. Policy decomposition is the key problem of the evaluation performance improvement of PDPs. A greedy algorithm with O(nlgn) time complexity for policy decomposition is constructed. In experiments, the policy of the LMS, VMS, and ASMS in real applications is decomposed separately into multiple subpolicies based on the greedy algorithm. Policy decomposition guarantees that the cost of subpolicies deployed to each PDP is equal or approximately equal. Experimental results show that (1) the method of policy decomposition improves the evaluation performance of PDPs effectively and that (2) the evaluation time of PDPs reduces with the growing numbers of PDPs.