IP Library Granted Patent US 12,238,825
Granted Patent B2
US 12,238,825 · App. 18/378,583 · Granted Feb 25, 2025

Method for providing an elastic content filtering security service in a mesh network

Inventor: Zhuangzhi Duo (Fremont, CA)
Assignee: SONICWALL INC.
H04W84/18H04W40/12H04W40/246
View Patent ↗
Loading inventors, assignments & file history…
Monitor This Case
Get email alerts when status or documents change.
Order Certified Copies
Most orders are placed with the USPTO same day — all within 24 business hours.
Order via The Patent Place →
Pre-filled with this patent's details
Quick Facts
Patent No.
US 12,238,825
App. No.
18/378,583
Granted
Feb 25, 2025
Kind
B2
Abstract

The present disclosure distributes processing capabilities throughout different nodes in a wireless network. Methods and apparatus consistent with the present disclosure increase the efficiency of communications in a wireless network because they help minimize the need to forward communications to other nodes in the network. Apparatus and methods consistent with the present disclosure perform a function of elastic content filtering because rating information may be stored in different memories of different mesh nodes according to rules or profiles associated with a wireless mesh network as responses to requests are sent back along a route in a wireless mesh network in a manner that may not increase an amount of network traffic. When, however, network traffic dips below a threshold level, additional messages may be sent to certain mesh nodes that update rating information stored at those certain mesh nodes.

Claims (45)

1. A method for distributing rating information, the method comprising:

storing in memory of a mesh portal device:

routing information that identifies one or more communication routes within a wireless mesh network, each of the communication routes including a set of one or more wireless mesh nodes, and

reputation information that correlates a reputation with a first access request for a website;

transferring the first access request along a first one of the communication routes that includes a first set of one or more wireless mesh nodes, wherein the wireless mesh nodes of the first route store the reputation information in cache memory;

identifying that an amount of communication traffic along the first route has dropped below a threshold level;

determining that the reputation correlated with the first access request is not stored at one or more wireless mesh nodes along a second route; and

transmitting the reputation information to the wireless mesh nodes along the second route when the amount of communication traffic is identified as having dropped below the threshold.

2. The method of claim 1 , further comprising assigning one or more time-to-live (TTL) values for each route based on a number of possible routes for wireless traffic associated with each of the wireless mesh nodes in the route.

3. The method of claim 2 , wherein the TTL values are inversely proportional to the number of possible routes when wireless mesh traffic is evenly distributed between a set of routes that includes the first route and the second route.

4. The method of claim 1 , wherein the wireless mesh nodes along the second route are configured to block access in response to access requests for content associated with a negative reputation.

5. The method of claim 1 , further comprising dynamically increasing wireless network traffic associated with actively transmitting reputation information to one or more wireless mesh nodes along a third route, wherein one or more of the wireless mesh nodes along the third route are known not to store reputation information associated with content previously requested by one or more computing devices in communication with the wireless mesh network.

6. The method of claim 1 , further comprising identifying the amount of communication traffic by determining a number of wireless messages received by the wireless mesh network over a period of time.

7. The method of claim 1 , further comprising:

identifying that the amount of communication traffic through the wireless mesh network exceeds the threshold level along the first route; and

transmitting updated reputation information to the wireless mesh nodes along the second route without increasing the wireless network traffic.

8. A non-transitory computer-readable storage medium having embodied thereon a program executable by a processor to implement a method for distributing rating information, the method comprising:

storing in memory of a mesh portal device: route information that identifies one or more communication routes within a wireless mesh network, each of the communication routes including a set of one or more wireless mesh nodes, and reputation information that correlates a reputation with a first access request for a website;

transferring the first access request along a first one of the communication routes that includes a first set of one or more wireless mesh nodes, wherein the wireless mesh nodes of the first route store the reputation information in cache memory;

identifying that an amount of communication traffic along the first route has dropped below a threshold level;

determining that the reputation correlated with the first access request is not stored at one or more wireless mesh nodes along a second route; and

transmitting the reputation information to the wireless mesh nodes along the second route when the amount of communication traffic is identified as having dropped below the threshold.

9. The non-transitory computer-readable storage medium of claim 8 , the program further executable to assign one or more time-to-live (TTL) values for each route based on a number of possible routes for wireless traffic associated with each of the wireless mesh nodes in the route.

10. The non-transitory computer-readable storage medium of claim 9 , wherein the TTL values are inversely proportional to a number of possible routes when wireless mesh traffic is evenly distributed between a set of routes that includes the first route and the second route.

11. The non-transitory computer-readable storage medium of claim 8 , wherein the wireless mesh nodes along the second route are configured to block access to access requests attempting to access content with a negative reputation.

12. The non-transitory computer-readable storage medium of claim 8 , the program further executable to dynamically increase wireless network traffic associated with actively transmitting reputation information to one or more wireless mesh nodes along a third route, wherein one or more of the wireless mesh nodes along the third route are known not to store reputation information associated with content previously requested by one or more computing devices in communication with the wireless mesh network.

13. The non-transitory computer-readable storage medium of claim 8 , the program further executable to identify the amount of communication traffic by determining a number of wireless messages received by the wireless mesh network over a period of time.

14. The non-transitory computer-readable storage medium of claim 8 , the program further executable to:

identify that the amount of communication traffic through the wireless mesh network exceeds the threshold level along the first route; and

transmit updated reputation information to the wireless mesh nodes along the second route without increasing the wireless network traffic.

15. A system for distributing rating information, the system comprising:

memory that stores: routing information that identifies one or more communication routes within a wireless mesh network, each of the communication routes including a set of one or more wireless mesh nodes, and reputation information that correlates a reputation with a first access request for a website;

a communication interface that communicates over a communication network, wherein the communication interface transfers the first access request along a first one of the communication routes that includes a first set of one or more wireless mesh nodes, wherein the wireless mesh nodes of the first route store the reputation information in cache memory; and

a processor that executes instructions stored in memory, wherein the processor executes the instructions to:

identify that an amount of communication traffic along the first route has dropped below a threshold level; and

determine that the reputation correlated with the first access request is not stored at one or more wireless mesh nodes along a second route,

wherein the communication interface transmits the reputation information to the wireless mesh nodes along the second route when the amount of communication traffic is identified as having dropped below the threshold.

16. The system of claim 15 , wherein the processor executes further instructions to assign one or more time-to-live (TTL) values for each route, wherein each TTL value is assigned based on a number of possible routes for wireless traffic associated with each of the wireless mesh nodes in the route.

17. The system of claim 16 , wherein the TTL values are inversely proportional to a number of possible routes when wireless mesh traffic is evenly distributed between a set of routes that includes the first route and the second route.

18. The system of claim 15 , wherein the wireless mesh nodes along the second route are configured to block access to access requests attempting to access content with a negative reputation.

19. The system of claim 15 , wherein the processor executes further instructions to dynamically increase wireless network traffic associated with actively transmitting reputation information to one or more wireless mesh nodes along a third route, wherein the wireless mesh nodes along the third route are known not to store reputation information associated with content previously requested by one or more computing devices in communication with the wireless mesh network.

20. The system of claim 15 , wherein the processor executes further instructions to identify the amount of communication traffic by determining a number of wireless messages received by the wireless mesh network over a period of time.

21. The system of claim 15 , wherein the processor executes further instructions to:

identify that the amount of communication traffic through the wireless mesh network exceeds the threshold level along the first route; and

transmit updated reputation information to the wireless mesh nodes along the second route without increasing the wireless network traffic.

Assignments (2)
FIRST LIEN IP SUPPLEMENT Recorded Jun 30, 2025
From: SONICWALL INC.
To: UBS AG, STAMFORD BRANCH, AS COLLATERAL AGENT
Reel/Frame 071758/0159 →
ASSIGNMENT OF ASSIGNOR'S INTEREST Recorded Oct 25, 2023
From: DUO, ZHUANGZHI
To: SONICWALL INC.
Reel/Frame 065335/0598 →
Continuity (5)
Continuation 17899959 · Aug 31, 2022
Continuation 17111388 · Dec 3, 2020
Continuation In Part 16397951 · Apr 29, 2019
Provisional Application 62942814 · Dec 3, 2019
Related Publication 20240049358A1 · Feb 8, 2024
References Cited (95)
US 7711605B1 · Santeufemia et al. · 2010 [cited by applicant]
US 8074279B1 · Lin et al. · 2011 [cited by applicant]
US 8107414B2 · Wang · 2012 [cited by applicant]
US 8108933B2 · Mahaffey · 2012 [cited by applicant]
US 8175047B2 · Seok et al. · 2012 [cited by applicant]
US 8228912B2 · Robinson · 2012 [cited by examiner]
US 8230087B2 · Alve · 2012 [cited by applicant]
US 8284744B2 · Mukai et al. · 2012 [cited by applicant]
US 8620402B2 · Parker, III et al. · 2013 [cited by applicant]
US 8695092B2 · Manianchira · 2014 [cited by applicant]
US 8700771B1 · Ramankutty et al. · 2014 [cited by applicant]
US 8745733B2 · Niemela · 2014 [cited by applicant]
US 8773258B2 · Vosch et al. · 2014 [cited by applicant]
US 8789195B2 · Bianco et al. · 2014 [cited by applicant]
US 8893241B2 · Piliouras · 2014 [cited by applicant]
US 8902903B2 · Palchaudhuri · 2014 [cited by examiner]
US 8949978B1 · Lin et al. · 2015 [cited by applicant]
US 8958399B1 · Hernacki et al. · 2015 [cited by applicant]
US 8966582B1 · Ainslie · 2015 [cited by applicant]
US 9124636B1 · Rathor · 2015 [cited by applicant]
US 9270698B2 · Gopal et al. · 2016 [cited by applicant]
US 9384334B2 · Burba et al. · 2016 [cited by applicant]
US 9455959B1 · Garg · 2016 [cited by applicant]
US 9509636B2 · Kalkunte · 2016 [cited by applicant]
US 9530000B2 · Lange et al. · 2016 [cited by applicant]
US 9578591B2 · Bhargava · 2017 [cited by applicant]
US 9686297B2 · Starink et al. · 2017 [cited by applicant]
US 9747497B1 · Sharma et al. · 2017 [cited by applicant]
US 9826571B2 · Iyer · 2017 [cited by examiner]
US 9948649B1 · Zhao et al. · 2018 [cited by applicant]
US 10111099B2 · Hunt et al. · 2018 [cited by applicant]
US 10277631B1 · Gemeniano · 2019 [cited by applicant]
US 10320784B1 · Talmor · 2019 [cited by applicant]
US 10417887B2 · Amini · 2019 [cited by applicant]
US 10713666B2 · Freishtat et al. · 2020 [cited by applicant]
US 10802760B2 · Zaretsky et al. · 2020 [cited by applicant]
US 10848440B2 · Zhao · 2020 [cited by examiner]
US 10957425B1 · Franks et al. · 2021 [cited by applicant]
US 10992678B1 · Gilman · 2021 [cited by examiner]
US 11062048B1 · Durham et al. · 2021 [cited by applicant]
US 11089103B1 · Parulkar · 2021 [cited by applicant]
US 11140170B2 · Barouch et al. · 2021 [cited by applicant]
US 11182810B1 · Pandey et al. · 2021 [cited by applicant]
US 11232369B1 · Li et al. · 2022 [cited by applicant]
US 11310665B2 · Duo et al. · 2022 [cited by applicant]
US 11348003B2 · Adibowo · 2022 [cited by applicant]
US 11375434B2 · Laari · 2022 [cited by applicant]
US 11392496B2 · Kazi · 2022 [cited by applicant]
US 11438963B2 · Duo · 2022 [cited by applicant]
US 11449819B2 · Heath · 2022 [cited by examiner]
US 11496511B1 · Guo · 2022 [cited by examiner]
US 11540132B2 · Duo · 2022 [cited by applicant]
US 11729621B2 · Duo et al. · 2023 [cited by applicant]
US 11800598B2 · Duo · 2023 [cited by applicant]
US 11863987B2 · Duo · 2024 [cited by applicant]
US 20070047543A1 · Shin et al. · 2007 [cited by applicant]
US 20100186065A1 · Chung et al. · 2010 [cited by applicant]
US 20110078242A1 · Davi et al. · 2011 [cited by applicant]
US 20110239287A1 · Pak et al. · 2011 [cited by applicant]
US 20130074159A1 · Lin et al. · 2013 [cited by applicant]
US 20130139243A1 · Poola et al. · 2013 [cited by applicant]
US 20130191904A1 · Piliouras · 2013 [cited by applicant]
US 20130254833A1 · Nicodemus et al. · 2013 [cited by applicant]
US 20140043985A1 · Hall et al. · 2014 [cited by applicant]
US 20140279623A1 · Mislove et al. · 2014 [cited by applicant]
US 20140280761A1 · Rothschild et al. · 2014 [cited by applicant]
US 20150015006A1 · Fitzgerald · 2015 [cited by applicant]
US 20150188964A1 · Sharma et al. · 2015 [cited by applicant]
US 20150324555A1 · Burba et al. · 2015 [cited by applicant]
US 20150327068A1 · Hunt · 2015 [cited by examiner]
US 20160005029A1 · Ivey et al. · 2016 [cited by applicant]
US 20160028798A1 · Agrawal et al. · 2016 [cited by applicant]
US 20170337596A1 · Larkin · 2017 [cited by applicant]
US 20180288618A1 · Kumar · 2018 [cited by applicant]
US 20180343200A1 · Jana et al. · 2018 [cited by applicant]
US 20190045558A1 · Zhang · 2019 [cited by applicant]
US 20190082224A1 · Bradley et al. · 2019 [cited by applicant]
US 20190138720A1 · Grewal et al. · 2019 [cited by applicant]
US 20200027093A1 · Volk · 2020 [cited by applicant]
US 20200097666A1 · Weldemariam et al. · 2020 [cited by applicant]
US 20200344610A1 · Duo et al. · 2020 [cited by applicant]
US 20200359349A1 · Duo et al. · 2020 [cited by applicant]
US 20210160962A1 · Duo · 2021 [cited by applicant]
US 20210176639A1 · Duo · 2021 [cited by applicant]
US 20210209600A1 · Fontana et al. · 2021 [cited by applicant]
US 20220240091A1 · Duo et al. · 2022 [cited by applicant]
US 20220418041A1 · Duo · 2022 [cited by applicant]
US 20230209350A1 · Duo · 2023 [cited by applicant]
US 20230403558A1 · Duo et al. · 2023 [cited by applicant]
US 20240414540A1 · Duo · 2024 [cited by applicant]
U.S. Appl. No. 16/397,951 Office Action mailed Apr. 29, 2021. [cited by applicant]
U.S. Appl. No. 17/716,860 Office Action mailed Dec. 30, 2022. [cited by applicant]
U.S. Appl. No. 17/899,959 Office Action mailed Jan. 20, 2023. [cited by applicant]
U.S. Appl. No. 18/088,273 Office Action mailed Jun. 8, 2023. [cited by applicant]
U.S. Appl. No. 18/088,273 Notice of Allowance mailed Sep. 28, 2023. [cited by applicant]
Cited By (1)
US 12,641,430