Description

Network operators rely on security services to protect their IT infrastructures. Different kinds of network security policies are defined globally and distributed among multiple parties with security middle boxes deployed in networks. Due to the complexity of security policy inefficient and network employs and existing path wise approaches. This paper models the enforcement of security policy as covering problem and designing tools as computational geometry based policy space analysis (PSA) for set operations of security policy. This heuristic information reveals intrinsic complexities of Security policy and guides the design of our enforcement approach. Then the paper proposes that selects modes of number of enforcement network nodesto deploy multiple policy sub sets in a greedy manner. This approach can be employed on network topologies both data centre and service provider.