Generating packet processing graphs
AssigneeMetaswitch Networks Ltd.
InventorsMichael Jeffrey EVANS, Christian Dominic LUND
Life of this patent
Estimating the term…
Loading patent…
AssigneeMetaswitch Networks Ltd.
InventorsMichael Jeffrey EVANS, Christian Dominic LUND
Estimating the term…
A graph data structure for a packet processing system is generated. The structure comprises graph data objects representing classifier nodes of a packet processing graph. The classifier nodes include a root node and leaf nodes. The root node is connected to each of the leaf nodes through respective corresponding packet processing paths through the graph. Each graph data object includes node match data indicative of at least one match to be applied by the respective classifier node. One or more n-type match graph data objects are identified, which include node match data indicative of an n-type match corresponding to content from n header field types. One or more (n+m)-type match graph data objects are identified, which include node match data indicative of an (n+m)-type match corresponding to a combination of content from a (n+m) different header field types. n and m are integer values of 1 or more.
A method of generating a graph data structure for a packet processing system, the method comprising:
A system for generating a graph data structure for a packet processing system, the system comprising:
Dependencies are inferred from the claim text.