公开(公告)号：US09910642B2

公开(公告)日：2018-03-06

申请号：US15165369

申请日：2016-05-26

Applicant: Cisco Technology, Inc.

Inventor： Samer Salam ,  Shashi Kumar Bansal ,  Swaroop Shastri

IPC: G06F9/44

CPC classification number: G06F8/33 ,  G06F8/311

Abstract: In one embodiment, a computing system identifies one or more terminal nodes in a digraph, and then back-walks primitives up the digraph from each terminal node to a corresponding parent terminal node or a root of the digraph, whichever is first. The system then identifies chains of back-walked primitives for each of the one or more terminal nodes (e.g., where each chain consists of a respective terminal node and any primitives either a) up to but not including a corresponding parent terminal node or else b) up to and including the root of the digraph when the back-walking reaches the root). Based on this, the system can then merge each set of any two or more chains of the identified chains that intersect on a decision operation into a corresponding new single chain, and maps each of the chains to a respective rule.

公开(公告)号：US20170344346A1

公开(公告)日：2017-11-30

申请号：US15165369

申请日：2016-05-26

Applicant: Cisco Technology, Inc.

Inventor： Samer Salam ,  Shashi Kumar Bansal ,  Swaroop Shastri

IPC: G06F9/44

CPC classification number: G06F8/33 ,  G06F8/311

Abstract: In one embodiment, a computing system identifies one or more terminal nodes in a digraph, and then back-walks primitives up the digraph from each terminal node to a corresponding parent terminal node or a root of the digraph, whichever is first. The system then identifies chains of back-walked primitives for each of the one or more terminal nodes (e.g., where each chain consists of a respective terminal node and any primitives either a) up to but not including a corresponding parent terminal node or else b) up to and including the root of the digraph when the back-walking reaches the root). Based on this, the system can then merge each set of any two or more chains of the identified chains that intersect on a decision operation into a corresponding new single chain, and maps each of the chains to a respective rule.