IP Library Granted Patent US 12,641,430
Granted Patent B2
US 12,641,430 · App. 18/809,807 · Granted May 26, 2026

Elastic security services load balancing in a wireless mesh network

Inventors: Zhuangzhi Duo (Fremont, CA); Atul Dhablania (San Jose, CA)
Assignee: SONICWALL INC.
H04W12/088G06F21/6218H04L67/5682H04W12/10H04W28/08H04W84/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,641,430
App. No.
18/809,807
Granted
May 26, 2026
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 by allowing different wireless nodes to receive and store content ratings regarding requested content in caches associated with respective wireless nodes. Apparatus and methods consistent with the present disclosure perform a load balancing function because they distribute content ratings to different nodes in a wireless network without increasing messaging traffic. As response messages regarding access requests are passed back to a requestor, cache memories at nodes along a communication path are updated to include information that cross-references data identifiers with received content ratings. The cross-referenced data identifiers and content ratings allow each respective wireless node along the communication path to block requests to bad content.

Claims (49)

1 . A method for controlling network traffic in a wireless mesh network, the method comprising:

receiving a request to access digital data at a first wireless mesh node, wherein a cache memory of the first wireless mesh node does not store information regarding the digital data;

identifying that a second wireless mesh node associated with processing requests for the digital data and to which the first wireless mesh node forwarded the request has failed;

forwarding the request from the first wireless mesh node to a third wireless mesh node associated with processing requests for the digital data and following failure of the second wireless mesh node;

receiving an indication from the third wireless mesh node that the request is blocked based on digital content associated with the request for digital data having a bad reputation rating indicated by stored information in a cache memory of the third wireless mesh node;

storing the indication that the requested digital content has the bad reputation rating at the cache memory of the first wireless mesh node; and

blocking a subsequent request to access the digital content, the subsequent request blocked by the first wireless mesh node based on the stored indication in the cache memory of the first wireless mesh node.

2 . The method of claim 1 , wherein the request includes a website access request that is associated with the bad reputation, and wherein the cache memory of the third wireless mesh node stores a rating indicating that the website is associated with the bad reputation.

3 . The method of claim 1 , wherein the third wireless mesh node blocks the request and sends the indication to the first mesh node, the indication indicating that the block was based on the bad reputation.

4 . The method of claim 1 , wherein the stored indication in the cache memory of the first wireless mesh node further indicates that a website requested by the request is associated with the bad reputation.

5 . The method of claim 1 , wherein the stored indication in the cache memory of the first wireless mesh node further indicates that digital content requested by the request is associated with the bad reputation, wherein the subsequent request concerns access to the digital content, and wherein the subsequent request is blocked without sending the request to a wireless access point.

6 . The method of claim 1 , wherein the request passes through one or more different sets of wireless mesh nodes based on one or more of relative device locations, relative signal strengths, and an operational status of one or more of the wireless mesh nodes in the wireless mesh network.

7 . The method of claim 1 , further comprising:

identifying that the request is a redundant request that has traversed multiple hops in the wireless mesh network before an indication of the bad reputation was passed back to the first wireless mesh node;

identifying a number of attempts associated with the redundant request; and

transmitting a message regarding the redundant request to a designated recipient based on the number of attempts meeting a threshold.

8 . A non-transitory computer-readable storage medium having embodied thereon a program executable by a processor to perform a method for controlling network traffic in a wireless mesh network, the method comprising:

receiving a request to access digital data at a first wireless mesh node, wherein a cache memory of the first wireless mesh node does not store information regarding the digital data;

identifying that a second wireless mesh node associated with processing requests for the digital data and to which the first wireless mesh node forwarded the request has failed;

forwarding the request from the first wireless mesh node to a third wireless mesh node associated with processing requests for the digital data and following failure of the second wireless mesh node;

receiving an indication from the third wireless mesh node that the request is blocked based on digital content associated with the request for digital data having a bad reputation rating indicated by stored information in a cache memory of the third wireless mesh node;

storing the indication that the requested digital content has the bad reputation rating at the cache memory of the first wireless mesh node; and

blocking a subsequent request to access the digital content, the subsequent request blocked by the first wireless mesh node based on the stored indication in the cache memory of the first wireless mesh node.

9 . The non-transitory computer-readable storage medium of claim 8 , wherein the request includes a website access request that is associated with the bad reputation, and wherein the cache memory of the third wireless mesh node stores a rating indicating that the website is associated with the bad reputation.

10 . The non-transitory computer-readable storage medium of claim 8 , wherein the third wireless mesh node blocks the request and sends the indication to the first mesh node, the indication indicating that the block was based on the bad reputation.

11 . The non-transitory computer-readable storage medium of claim 8 , wherein the stored indication in the cache memory of the first wireless mesh node further indicates that a website requested by the request is associated with the bad reputation.

12 . The non-transitory computer-readable storage medium of claim 8 , wherein the stored indication in the cache memory of the first wireless mesh node further indicates that digital content requested by the request is associated with the bad reputation, wherein the subsequent request concerns access to the digital content, and wherein the subsequent request is blocked without sending the request to a wireless access point.

13 . The non-transitory computer-readable storage medium of claim 8 , wherein the request passes through multiple wireless mesh nodes based on one or more of relative device locations, relative signal strengths, and an operational status of one or more of the multiple wireless mesh nodes in the wireless mesh network.

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

identify that the request is a redundant request that has traversed multiple hops in the wireless mesh network before an indication of the bad reputation was passed back to the first wireless mesh node;

identify a number of attempts associated with the redundant request; and

transmit a message regarding the redundant request to a designated recipient based on the number of attempts meeting a threshold.

15 . A system for controlling network traffic in a wireless mesh network, the system comprising:

local cache memory;

a communication interface that communications over a communication network, wherein the communication interface receives a request to access digital data, wherein the local cache memory does not store information regarding the digital data; and

a processor that executes instruction stored in memory, wherein the processor executes the instructions to identify that a second wireless mesh node associated with processing requests for the digital data and to which the request is forwarded has failed;

wherein the communication interface:

forwards the request to a third wireless mesh node associated with processing requests for the digital data and following failure of the second wireless mesh node; and

receives an indication from the third wireless mesh node that the request is blocked based on digital content associated with the request for digital data having a bad reputation rating indicated by stored information in a cache memory of the third wireless mesh node;

wherein the local cache memory further stores the indication that the requested digital content has the bad reputation rating; and

wherein the processor executes further instructions to block a subsequent request to access the digital content, the subsequent request blocked based on the stored indication in the local cache memory.

16 . The system of claim 15 , wherein the request includes a website access request that is associated with the bad reputation, and wherein the cache memory of the third wireless mesh node stores a rating indicating that the website is associated with the bad reputation.

17 . The system of claim 15 , wherein the third wireless mesh node blocks the request and sends the indication to the communication interface, the indication indicating that the block was based on the bad reputation.

18 . The system of claim 15 , wherein the stored indication in the local cache memory further indicates that a website requested by the request is associated with the bad reputation.

19 . The system of claim 15 , wherein the stored indication in the local cache memory further indicates that digital content requested by the request is associated with the bad reputation, wherein the subsequent request concerns access to the digital content, and wherein the subsequent request is blocked without sending the request to a wireless access point.

20 . The system of claim 15 , wherein the request passes through one or more different sets of wireless mesh nodes based on one or more of relative device locations, relative signal strengths, and an operational status of one or more of the wireless mesh nodes in the wireless mesh network.

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

identify that the request is a redundant request that has traversed multiple hops in the wireless mesh network before an indication of the bad reputation was passed back to the communication interface; and

identify a number of attempts associated with the redundant request, wherein the communication interface transmits a message regarding the redundant request to a designated recipient based on the number of attempts meeting a threshold.

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 Aug 21, 2024
From: DUO, ZHUANGZHI; DHABLANIA, ATUL
To: SONICWALL INC.
Reel/Frame 068350/0616 →
Continuity (4)
Continuation 18234152 · Aug 15, 2023
Continuation 17716860 · Apr 8, 2022
Continuation 16397951 · Apr 29, 2019
Related Publication 20240414540A1 · Dec 12, 2024
References Cited (113)
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 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 · 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 · 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 · 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 9723006B2 · Zhang · 2017 [cited by examiner]
US 9747497B1 · Sharma et al. · 2017 [cited by applicant]
US 9769266B2 · Stuntebeck · 2017 [cited by examiner]
US 9800584B1 · Andruschuk · 2017 [cited by examiner]
US 9826571B2 · Iyer · 2017 [cited by applicant]
US 9852292B2 · Thomas · 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 10476863B1 · Hanlon · 2019 [cited by examiner]
US 10713666B2 · Freishtat et al. · 2020 [cited by applicant]
US 10802760B2 · Zaretsky et al. · 2020 [cited by applicant]
US 10805797B2 · Bryksa · 2020 [cited by examiner]
US 10848440B2 · Zhao · 2020 [cited by applicant]
US 10957425B1 · Franks et al. · 2021 [cited by applicant]
US 10992678B1 · Gilman · 2021 [cited by applicant]
US 11062048B1 · Durham et al. · 2021 [cited by applicant]
US 11089103B1 · Parulkar · 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 11200345B2 · Lillibridge · 2021 [cited by examiner]
US 11232369B1 · Li et al. · 2022 [cited by applicant]
US 11310665B2 · Duo · 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 applicant]
US 11496511B1 · Guo · 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 · 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 20140041053A1 · Edwards · 2014 [cited by examiner]
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 · 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 · 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 20250193675A1 · Duo · 2025 [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/378,583 Office Action mailed Apr. 24, 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 Sep. 28, 2023. [cited by applicant]
U.S. Appl. No. 18/378,583, Office Action dated Apr. 24, 2024. [cited by applicant]