View source for 17957516. OPTIMIZING POLICY TREE SEARCHES WITH HYBRID RANGES OF POLICY SETS WHILE EXAMINING NETWORK TRAFFIC simplified abstract (Fortinet, Inc.)

=OPTIMIZING POLICY TREE SEARCHES WITH HYBRID RANGES OF POLICY SETS WHILE EXAMINING NETWORK TRAFFIC=


==Organization Name==

[[:Category:Fortinet, Inc.|Fortinet, Inc.]]


[[Category:Fortinet, Inc.]]

==Inventor(s)==

[[:Category:Shushan Wen of Pleasant Hill CA (US)|Shushan Wen of Pleasant Hill CA (US)]][[Category:Shushan Wen of Pleasant Hill CA (US)]]

[[:Category:Tianrui Wei of Santa Clara CA (US)|Tianrui Wei of Santa Clara CA (US)]][[Category:Tianrui Wei of Santa Clara CA (US)]]

==OPTIMIZING POLICY TREE SEARCHES WITH HYBRID RANGES OF POLICY SETS WHILE EXAMINING NETWORK TRAFFIC - A simplified explanation of the abstract==


This abstract first appeared for US patent application 17957516 titled 'OPTIMIZING POLICY TREE SEARCHES WITH HYBRID RANGES OF POLICY SETS WHILE EXAMINING NETWORK TRAFFIC

==Simplified Explanation==

The patent application describes a method to activate side nodes by partitioning a traversal node into deeper traversal nodes and leaf nodes, with a limit set on the number of leaf node policies. Traversal nodes above the limit are divided into deeper levels, while nodes at or below the limit are converted to leaf nodes containing a list of policies within the limit. During policy tree searching mode, a linear search is conducted to select and apply a policy corresponding to the leaf node to a data packet.

* Traversal node partitioning into deeper traversal nodes and leaf nodes
* Limit on number of leaf node policies
* Conversion of traversal nodes above limit into deeper levels
* Conversion of traversal nodes at or below limit into leaf nodes with policy lists
* Linear search for policy selection during policy tree searching mode

== Potential Applications ==
This technology could be applied in network routing, security policy enforcement, and data packet processing.

== Problems Solved ==
This technology solves the problem of efficiently managing and applying policies in a network environment with a large number of nodes and policies.

== Benefits ==
The benefits of this technology include improved policy management, optimized data packet processing, and enhanced network security.

== Potential Commercial Applications ==
A potential commercial application of this technology could be in network security software for enterprises.

== Possible Prior Art ==
One possible prior art could be the use of tree structures for policy management in network systems.

== Unanswered Questions ==

=== How does this technology handle dynamic changes in policies or network configurations? ===
The patent application does not specify how the system adapts to changes in policies or network settings.

=== What impact does the linear search process have on overall system performance? ===
The article does not discuss the potential performance implications of using a linear search for policy selection.


==Original Abstract Submitted==

To activate side nodes, a traversal node is partitioned into deeper traversal nodes and leaf nodes. A limit is set on a number of leaf node policies. Each traversal node above the limit is cut into a deeper level with a new traversal node. Each traversal node at or below the limit is converted to a leaf node populated with a list of policies within the limit. Once reaching a leaf node, during policy tree searching mode, linear searching a policy set corresponding to the leaf node to select a policy, and the selected policy to the data packet is applied



[[Category:H04L9/40]]