IP Library › Granted Patent US 12,745,087
Granted Patent B2
US 12,745,087 · App. 18/984,055 · Granted Sep 22, 2026

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

Inventor: Zhuangzhi Duo (Fremont, CA)
Assignee: SONICWALL INC.
H04W12/088H04W12/122H04W80/06H04W84/18
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,745,087
App. No.
18/984,055
Granted
Sep 22, 2026
Kind
B2
Abstract

The present disclosure is directed to distributing processing capabilities throughout different nodes in a wireless mesh network. Methods and apparatus consistent with the present disclosure increase the efficiency of communications in a wireless mesh network because they help minimize the need to forward communications to other nodes in the wireless mesh network such that an evaluation can be performed. Apparatus and methods consistent with the present disclosure may distribute ratings or verdicts associated with previous requests to access data to different nodes in a wireless mesh network without generating additional wireless communications through the wireless mesh network. Apparatus and methods consistent with the present disclosure distribute content ratings to different nodes in a wireless network such that different wireless nodes may block redundant requests to undesired content without increasing messaging traffic.

Claims (28)

1 . A method for distributing rating information in a wireless mesh network, the method comprising:

receiving an access request sent over a communication network at a first mesh node in a network that includes a plurality of mesh nodes;

identifying that a second wireless mesh node among the plurality of mesh nodes has failed;

sending the access request from the first mesh node to a third mesh node designated as an alternate among the plurality of mesh nodes;

sending a communication from the alternate mesh node to the first mesh node, the communication indicating that the access request is associated with a bad reputation in accordance with stored reputation information in cache memory of the alternate mesh node; and

blocking the access request from being sent to one or more computing devices in the network, the access request being blocked by the alternate mesh node;

providing the bad reputation for storage in memory of a computing device; and blocking, by the computing device, a subsequent access request that identifies a same link that is associated with the access request received by the first mesh node.

2 . The method of claim 1 , wherein the access request identifies a website, and wherein the stored reputation information indicates that the website is associated with the bad reputation.

3 . The method of claim 1 , wherein a cache memory of the first mesh node did not initially store information regarding the bad reputation, and further comprising updating the cache memory of the first mesh node to store the information regarding the bad reputation.

4 . The method of claim 1 , further comprising sending a message from the first mesh node to a sending computing device that sent the access request associated with the bad reputation.

5 . The method of claim 1 , further comprising: receiving a previous access request in the network, the previous access request associated with a same website as the access request received at the first mesh node; forwarding the previous access request to a subset of the plurality of mesh nodes that included the alternate mesh node but not the first mesh node; and storing the bad reputation in the cache memory of the alternate mesh node based on the previous access request.

6 . The method of claim 4 , further comprising storing the bad reputation in a respective cache memory of each other mesh node in the subset based on the previous access request.

7 . The method of claim 1 , wherein the computing device determines a number of times that the computing device has attempted to access the same link and prevents one or more redundant access requests associated with the same link from being sent by the computing device to the network.

8 . The method of claim 1 , wherein the computing device generates a warning message regarding the one or more redundant access requests.

9 . The method of claim 1 , wherein the computing device sends a notification regarding the one or more redundant access requests to an administrator device.

10 . A system for distributing rating information in a wireless mesh network, the system comprising: a plurality of mesh nodes that includes: a first mesh node that receives an access request sent over a communication network, a second mesh node, wherein the first mesh node identifies that the second wireless mesh node has failed, and a third mesh node designated as an alternate among the plurality of mesh nodes, wherein the first mesh node sends the access request to the alternate mesh node, and wherein the alternate mesh node: sends a communication to the first mesh node, the communication indicating that the access request is associated with a bad reputation in accordance with stored reputation information in cache memory of the alternate mesh node, and blocks the access request from being sent to one or more computing devices in the network, wherein the bad reputation is further provided for storage in memory of a computing device, and wherein the computing device blocks a subsequent access request that identifies a same link that is associated with the access request received by the first mesh node.

11 . The system of claim 10 , wherein the access request identifies a website, and wherein the stored reputation information indicates that the website is associated with the bad reputation.

12 . The system of claim 10 , wherein a cache memory of the first mesh node did not initially store information regarding the bad reputation, and wherein the first mesh node updates the cache memory of the first mesh node to store the information regarding the bad reputation.

13 . The system of claim 10 , wherein the first mesh node further sends a message to a sending computing device that sent the access request associated with the bad reputation.

14 . The system of claim 10 , wherein the plurality of nodes includes a subset that includes the alternate mesh node but not the first mesh node, wherein the subset is forwarded a previous access request associated with a same website as the access request received at the first mesh node, and wherein the bad reputation is stored in the cache memory of the alternate mesh node based on the previous access request.

15 . The system of claim 14 , wherein the bad reputation is further stored in a respective cache memory of each other mesh node in the subset based on the previous access request.

16 . The system of claim 10 , wherein the computing device determines a number of times that the computing device has attempted to access the same link and prevents one or more redundant access requests associated with the same link from being sent by the computing device to the network.

17 . The system of claim 10 , wherein the computing device generates a warning message regarding the one or more redundant access requests.

18 . The system of claim 10 , wherein the computing device sends a notification regarding the one or more redundant access requests to an administrator device.

19 . A non-transitory, computer-readable storage medium having embodied thereon a program executable by a processor to perform a method for distributing rating information in a wireless mesh network, the method comprising: receiving an access request sent over a communication network at a first mesh node in a network that includes a plurality of mesh nodes; identifying that a second wireless mesh node among the plurality of mesh nodes has failed; sending the access request from the first mesh node to a third mesh node designated as an alternate among the plurality of mesh nodes; sending a communication from the alternate mesh node to the first mesh node, the communication indicating that the access request is associated with a bad reputation in accordance with stored reputation information in cache memory of the alternate mesh node; and blocking the access request from being sent to one or more computing devices in the network, the access request being blocked by the alternate mesh node; providing the bad reputation for storage in memory of a computing device; and blocking, by the computing device, a subsequent access request that identifies a same link that is associated with the access request received by the first mesh node.

20 . The method of claim 1 , wherein the bad reputation is identified based on a universal resource locator (URL) associated with the access request.

21 . The system of claim 10 , wherein the bad reputation is identified based on a universal resource locator (URL) associated with the access request.

22 . The non-transitory, computer-readable storage medium of claim 19 , wherein the bad reputation is identified based on a universal resource locator (URL) associated with the access request.

Assignments (3)
SECURITY INTEREST Recorded Jul 9, 2026
From: SONICWALL US HOLDINGS INC.; SONICWALL INC.; BANYAN SECURITY, INC.
To: UBS AG, STAMFORD BRANCH
Reel/Frame 075961/0674 →
SECURITY INTEREST Recorded Jul 9, 2026
From: SONICWALL US HOLDINGS INC.; SONICWALL INC.; BANYAN SECURITY, INC.
To: UBS AG, STAMFORD BRANCH
Reel/Frame 075961/0907 →
ASSIGNMENT OF ASSIGNOR'S INTEREST Recorded Mar 4, 2025
From: DUO, ZHUANGZHI
To: SONICWALL INC.
Reel/Frame 070395/0414 →
Continuity (6)
Continuation 18384103 · Oct 26, 2023
Continuation 18088273 · Dec 23, 2022
Continuation 17111391 · Dec 3, 2020
Continuation In Part 16397951 · Apr 29, 2019
Provisional Application 62943126 · Dec 3, 2019
Related Publication 20250193675A1 · Jun 12, 2025
References Cited (109)
US 7711605B1 · Santeufemia et al. · 2010 [cited by applicant]
US 8074279B1 · Lin et al. · 2011 [cited by applicant]
US 8107414B2 · Wang et al. · 2012 [cited by applicant]
US 8108933B2 · Mahaffey · 2012 [cited by applicant]
US 8175047B2 · Seok et al. · 2012 [cited by applicant]
US 8228912B2 · Robinson et al. · 2012 [cited by applicant]
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 et al. · 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 · Pilouras · 2014 [cited by applicant]
US 8902903B2 · Palchaudhuri et al. · 2014 [cited by applicant]
US 8918881B2 · Bettini et al. · 2014 [cited by applicant]
US 8949978B1 · Lin et al. · 2015 [cited by applicant]
US 8958399B1 · Hemacki 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 9449172B2 · Kuenemund et al. · 2016 [cited by applicant]
US 9455959B1 · Garg et al. · 2016 [cited by applicant]
US 9509636B2 · Kalkunte · 2016 [cited by applicant]
US 9530000B2 · Lange et al. · 2016 [cited by applicant]
US 9578591B2 · Bhargava et al. · 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 et al. · 2017 [cited by applicant]
US 9948649B1 · Zhao et al. · 2018 [cited by applicant]
US 10111099B2 · Hunt et al. · 2018 [cited by applicant]
US 10158662B1 · Salehpour · 2018 [cited by examiner]
US 10218697B2 · Cockerill · 2019 [cited by examiner]
US 10277631B1 · Gemeniano · 2019 [cited by applicant]
US 10320784B1 · Talmor et al. · 2019 [cited by applicant]
US 10417887B2 · Amini et al. · 2019 [cited by applicant]
US 10509910B2 · Mahaffey · 2019 [cited by examiner]
US 10713666B2 · Freishtat et al. · 2020 [cited by applicant]
US 10802760B2 · Zaretsky et al. · 2020 [cited by applicant]
US 10848440B2 · Zhao et al. · 2020 [cited by applicant]
US 10957425B1 · Franks et al. · 2021 [cited by applicant]
US 10965675B2 · Zhang · 2021 [cited by examiner]
US 10992678B1 · Gilman · 2021 [cited by applicant]
US 11057392B2 · Harris · 2021 [cited by examiner]
US 11062048B1 · Durham et al. · 2021 [cited by applicant]
US 11089103B1 · Parulkar et al. · 2021 [cited by applicant]
US 11113721B2 · George et al. · 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 11374977B2 · Rahkonen · 2022 [cited by examiner]
US 11375434B2 · Laari et al. · 2022 [cited by applicant]
US 11392496B2 · Kazi · 2022 [cited by applicant]
US 11438963B2 · Duo · 2022 [cited by applicant]
US 11449819B2 · Heath et al. · 2022 [cited by applicant]
US 11496511B1 · Guo et al. · 2022 [cited by applicant]
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 12069489B2 · Duo et al. · 2024 [cited by applicant]
US 12170900B2 · Duo · 2024 [cited by applicant]
US 12238825B2 · Duo · 2025 [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 20150150006A1 · Fitzgerald et al. · 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 et al. · 2015 [cited by applicant]
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 et al. · 2018 [cited by applicant]
US 20180343200A1 · Jana et al. · 2018 [cited by applicant]
US 20190045558A1 · Zhang et al. · 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 · 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 20240049358A1 · Duo · 2024 [cited by applicant]
US 20240056813A1 · Duo · 2024 [cited by applicant]
US 20240414540A1 · Duo et al. · 2024 [cited by applicant]
U.S. Appl. No. 16/397,951, Office Action dated Apr. 29, 2021. [cited by applicant]
U.S. Appl. No. 17/716,860, Office Action dated Dec. 30, 2022. [cited by applicant]
U.S. Appl. No. 17/899,959, Office Action dated Jan. 20, 2023. [cited by applicant]
U.S. Appl. No. 18/378,583, Office Action dated Apr. 24, 2024 [cited by applicant]
U.S. Appl. No. 18/088,273, Office Action dated Jun. 8, 2023. [cited by applicant]