Abstract
In multiple heterogeneous systems, one of key challenges of integrating policies is the conflict detection and resolution while preserving individual policy consistency. In this paper, the inheritance hierarchy of a security policy is formulated with a directed graph. Solving Inheritance Violation Problem (IVP) is formulated as a feedback arc set problem, which is NP-hard. Then some classical approximation algorithms are introduced. The IVP in two interoperating domains is converted into the problem of finding a minimum weight vertex cover problem in a bipartite graph, which is polynomial-time solvable.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
