GRAPH-THEORETIC TECHNIQUE OF ANALYZING AND OPTIMIZING POLICY DEPLOYMENT

摘要

A method and a device for managing state changes (Init, Run, Suspend, Resume, End) of a managed entity (302) includes a memory (906) and a processor (904) adapted to represent each state change of a managed entity (302) as a separate node (1-5) in a graph (300), represent a state transition as an edge (Eij) connecting a first node with a first state value to a second node with a second state value, and determine a cost (C) of each edge (Eij) that is part of a set of edges (E) that form at least two paths connecting the first node and the second by applying at least one policy (P) to each edge (Eij), the first and second nodes representing an initial and a final state change of the managed entity (302).