Risk based session resumption
US-2023171280-A1 · Jun 1, 2023 · US
US2025392571A1 · US · A1
| Field | Value |
|---|---|
| Publication number | US-2025392571-A1 |
| Application number | US-202418752226-A |
| Country | US |
| Kind code | A1 |
| Filing date | Jun 24, 2024 |
| Priority date | Jun 24, 2024 |
| Publication date | Dec 25, 2025 |
| Grant date | — |
A practical reading order for non-experts. Skip the full description unless you need deep technical detail.
What the patent document calls the invention.
A short plain-language summary of the technical disclosure.
Who owns or filed the patent and who is credited as inventor.
Filing, priority, publication, and grant dates set the timeline.
The legal scope of protection — read this for what is actually claimed.
Technology tags used to group this patent with similar filings.
Prior art links and similar publications in this corpus.
Official abstract text for this publication.
Systems and methods for probability-based inline rule inspection include performing inline monitoring between one or more endpoints and the internet; receiving a payload based on the inline monitoring; and performing traffic inspection of the payload based on one or more rules, wherein each of the one or more rules are inspected based on a probability assigned thereto, and wherein the probability assigned to each of the one or more rules can be a function of an execution time of each of the one or more rules and a historic effectiveness of each of the one or more rules.
Opening claim text (preview).
What is claimed is: 1 . A method comprising steps of: performing inline monitoring between one or more endpoints and the internet; receiving a payload based on the inline monitoring; and performing traffic inspection of the payload based on one or more rules, wherein each of the one or more rules are inspected based on a probability assigned thereto. 2 . The method of claim 1 , wherein each of the one or more rules are inspected concurrently for the payload. 3 . The method of claim 2 , wherein each of the one or more rules are inspected concurrently by different processors. 4 . The method of claim 1 , wherein the probability assigned to each of the one or more rules is based on an execution time of each of the one or more rules. 5 . The method of claim 1 , wherein the probability assigned to each of the one or more rules is based on a historic effectiveness of each of the one or more rules. 6 . The method of claim 1 , wherein the probability assigned to each of the one or more rules is a function of an execution time of each of the one or more rules and a historic effectiveness of each of the one or more rules. 7 . The method of claim 6 , wherein the execution time of each of the one or more rules and the historic effectiveness of each of the one or more rules is based on global log data. 8 . The method of claim 6 , wherein the execution time of each of the one or more rules and the historic effectiveness of each of the one or more rules is based on tenant-based log data, wherein the inline monitoring is performed for a specific tenant. 9 . The method of claim 6 , wherein the steps further include: selecting the one or more rules from a plurality of rules based on a probability assigned to each of the plurality of rules. 10 . The method of claim 9 , wherein the selecting is performed at preconfigured time intervals, and wherein the one or more selected rules are inspected for every payload encountered during a duration of a time interval subsequent to the selecting. 11 . A non-transitory computer-readable medium comprising instructions that, when executed, cause one or more processors to perform steps of: performing inline monitoring between one or more endpoints and the internet; receiving a payload based on the inline monitoring; and performing traffic inspection of the payload based on one or more rules, wherein each of the one or more rules are inspected based on a probability assigned thereto. 12 . The non-transitory computer-readable medium of claim 11 , wherein each of the one or more rules are inspected concurrently for the payload. 13 . The non-transitory computer-readable medium of claim 12 , wherein each of the one or more rules are inspected concurrently by different processors. 14 . The non-transitory computer-readable medium of claim 11 , wherein the probability assigned to each of the one or more rules is based on an execution time of each of the one or more rules. 15 . The non-transitory computer-readable medium of claim 11 , wherein the probability assigned to each of the one or more rules is based on a historic effectiveness of each of the one or more rules. 16 . The non-transitory computer-readable medium of claim 11 , wherein the probability assigned to each of the one or more rules is a function of an execution time of each of the one or more rules and a historic effectiveness of each of the one or more rules. 17 . The non-transitory computer-readable medium of claim 16 , wherein the execution time of each of the one or more rules and the historic effectiveness of each of the one or more rules is based on global log data. 18 . The non-transitory computer-readable medium of claim 16 , wherein the execution time of each of the one or more rules and the historic effectiveness of each of the one or more rules is based on tenant-based log data, wherein the inline monitoring is performed for a specific tenant. 19 . The non-transitory computer-readable medium of claim 16 , wherein the steps further include: selecting the one or more rules from a plurality of rules based on a probability assigned to each of the plurality of rules. 20 . The non-transitory computer-readable medium of claim 19 , wherein the selecting is performed at preconfigured time intervals, and wherein the one or more selected rules are inspected for every payload encountered during a duration of a time interval subsequent to the selecting.
Traffic policing · CPC title
Rule management · CPC title
Related publications grouped by family.
Answers are generated from the same data shown on this page.