×

Data structure for policy-based remediation selection

  • US 8,336,103 B2
  • Filed: 06/21/2010
  • Issued: 12/18/2012
  • Est. Priority Date: 09/03/2004
  • Status: Active Grant
First Claim
Patent Images

1. A non-transitory machine-actionable memory comprising:

  • one or more machine-actionable records arranged according to a data structure, the data structure including links that respectively map betweenat least one R_ID field, the contents of which denote an identification (ID) of a remediation (R_ID);

    at least one POL_ID field, the contents of which denotes an ID of at least one policy (POL_ID), the at-least-one policy respectively defining a condition violation of which is potentially indicative of unauthorized activity or manipulation of the device; and

    wherein;

    each of the at least one POL_ID field is an index to identify at least one R_ID respectively corresponding thereto; and

    the data structure for at least one of the one-or-more machine-actionable records includes;

    two or more POL_ID fields, the contents of which denote two or more POL_IDs, respectively;

    a plurality of ACT_ID fields, the contents of which denote a plurality of ACT_IDs, respectively;

    two or more SS links relating one or more among the plurality of ACT_ID fields as a subset (SS) thereof, respectively;

    two or more CE_ID fields, the contents of which denote two or more CE_ID fields; and

    at least one of the following;

    at least two P-55 links between the two or more POL ID_fields, respectively, and the two or more subsets,at least two R-P links between the at-least-one R_ID field and the two or more POL_ID fields, respectively,at least two R-SS links between the at-least-one R_ID field and the two or more subsets, respectively, andat least two R-AS links between the at-least-one R_ID field and the two or more CE_ID fields, respectively.

View all claims
  • 0 Assignments
Timeline View
Assignment View
    ×
    ×