IP Library › Granted Patent US 12,615,284
Granted Patent B2
US 12,615,284 · App. 18/421,967 · Granted Apr 28, 2026

Optimizing network traffic obfuscation based on aggregated network performance

Inventors: John P. Keyerleber (Richmond Heights, OH); Adam Uccello (Austin, TX)
Assignee: SCATR, CORP
H04L63/1441
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,615,284
App. No.
18/421,967
Granted
Apr 28, 2026
Kind
B2
Abstract

In some examples, a method includes receiving, from a plurality of agents executing on scatter network devices, network performance metrics, at least some of the scatter network devices serving as endpoints for logical communication channels formed via a communication channel provider for which a first Internet service provider provides Internet backhaul and the logical communication channels traverse a first relay; aggregating the network performance metrics received from the plurality of agents; analyzing the aggregated network performance metrics to determine operational characteristics of a network; determining, based on the operational characteristics of the network, that the Internet service provider has transitioned from the first Internet service provider to a second Internet service provider to provide the Internet backhaul; and responsive to the determining, providing an instruction to the plurality of agents to modify operational settings of the agents to form logical communication channels that traverse a second relay.

Claims (43)

1 . A method of optimizing network traffic obfuscation based on aggregated network performance, comprising:

receiving, from a plurality of agents executing on scatter network devices, network performance metrics, at least some of the scatter network devices serving as endpoints for logical communication channels formed via a communication channel provider for which a first Internet service provider provides Internet backhaul and the logical communication channels traverse a first relay;

aggregating the network performance metrics received from the plurality of agents;

analyzing the aggregated network performance metrics to determine operational characteristics of a network;

determining, based on the operational characteristics of the network, that the Internet service provider has transitioned from the first Internet service provider to a second Internet service provider to provide the Internet backhaul; and

responsive to the determining, providing an instruction to the plurality of agents to modify operational settings of the agents to form logical communication channels that traverse a second relay.

2 . The method of claim 1 , further comprising analyzing the aggregated network performance metrics according to statistical analysis.

3 . The method of claim 1 , further comprising analyzing the aggregated network performance metrics according to machine learning processing.

4 . The method of claim 1 , wherein the first relay is optimized for the first Internet service provider, and wherein the second relay is optimized for the second Internet service provider.

5 . The method of claim 1 , further comprising determining that the Internet service provider has transitioned from the first Internet service provider to the second Internet service provider to provide the Internet backhaul responsive to determining that a plurality of scatter network devices each having logical communication channels that traverse the first relay are experiencing network performance issues.

6 . The method of claim 1 , wherein the instruction is a profile according to which the agents form the logical communication channels.

7 . A method of optimizing network traffic obfuscation based on aggregated network performance, comprising:

obfuscating, by a scatter network node comprising at least one non-transitory memory and at least one processor, a first plurality of data packets according to a first machine learning (“ML”) obfuscation model of a plurality of ML obfuscation models associated with a logical communication channel;

transmitting, by the scatter network node, the obfuscated first plurality of data packets via the logical communication channel to a counterpart scatter network node;

transmitting, by an agent stored in the at least one non-transitory memory and executable by the at least one processor, performance metrics associated with the logical communication channel to a server;

receiving, by the agent from the server, a control input configured to cause the scatter network node to select, by the agent, a second ML obfuscation model of the plurality of ML obfuscation models;

obfuscating, by the scatter network node, a second plurality of data packets according to the second ML obfuscation model; and

transmitting, by the scatter network node, the obfuscated second plurality of data packets via the logical communication channel to the counterpart scatter network node.

8 . The method of claim 7 , wherein the performance metrics associated with the logical communication channel indicate that performance of the logical communication channel is less than a threshold.

9 . The method of claim 8 , wherein, responsive to the performance of the logical communication channel being less than the threshold, the method further comprises:

processing, by the server and via a machine learning process, the performance metrics to determine a cause of the performance of the logical communication channel being less than the threshold;

determining by the server, an operational modification for the agent to increase the performance of the logical communication channel; and

providing the operational modification to the agent.

10 . The method of claim 9 , wherein the operational modification is a change from the first ML obfuscation model to the second ML obfuscation model.

11 . The method of claim 9 , wherein the operational modification is a change to a profile according to which the agent forms the logical communication channel.

12 . The method of claim 9 , wherein the operational modification is a change from the logical communication channel to a second logical communication channel.

13 . The method of claim 9 , wherein the operational modification is a change to a weighting of a parameter of a rewards function according to which operation of the scatter network element is scored.

14 . The method of claim 9 , wherein the operational modification is a change to routing of the logical communication channel.

15 . A server, comprising:

at least one non-transitory memory;

at least one processor;

a network traffic obfuscation application stored in the at least one non-transitory memory that, when executed by the at least one processor:

receives, from a plurality of agents executing on scatter network devices, network performance metrics for a plurality of logical communication channels established among a plurality of communication mediums;

aggregates the network performance metrics received from the plurality of agents;

analyzes the aggregated network performance metrics via machine learning processing to determine operational characteristics of a network;

determines that at least one of the operational characteristics is less than a threshold;

responsive to determining that the at least one of the operational characteristics is less than the threshold, determines a modification to operation of at least one of the plurality of agents to increase the operational characteristics; and

transmits the modification to the scatter network devices.

16 . The server of claim 15 , wherein the network performance metrics include bandwidth, latency, throughput, and obfuscation characteristics.

17 . The server of claim 15 , wherein the modification is a change to a weighting of a parameter of a rewards function according to which operation of the scatter network devices are scored.

18 . The server of claim 15 , wherein the modification is a change to a profile according to which at least some of the plurality of agents form logical communication channels.

19 . The server of claim 15 , wherein the modification is a change from routing via a first network relay to routing via a second network relay.

20 . The server of claim 15 , wherein executing the application further causes the at least one processor to perform border gateway protocol surveillance of a network in which at least some of the scatter network devices operate.

Assignments (2)
ASSIGNMENT OF ASSIGNOR'S INTEREST Recorded Jul 30, 2024
From: SCATR, LLC
To: SCATR, CORP
Reel/Frame 068117/0434 →
ASSIGNMENT OF ASSIGNOR'S INTEREST Recorded Jan 26, 2024
From: KEYERLEBER, JOHN P.; UCCELLO, ADAM
To: SCATR, CORP.
Reel/Frame 066264/0407 →
Continuity (1)
Related Publication 20250240320A1 · Jul 24, 2025
References Cited (144)
US 6502135B1 · Munger et al. · 2002 [cited by applicant]
US 6765866B1 · Wyatt · 2004 [cited by applicant]
US 6990111B2 · Lemoff et al. · 2006 [cited by applicant]
US 7382782B1 · Ferguson et al. · 2008 [cited by applicant]
US 7697528B2 · Parry et al. · 2010 [cited by applicant]
US 7782782B1 · Ferguson et al. · 2010 [cited by applicant]
US 7895348B2 · Twitchell, Jr. · 2011 [cited by applicant]
US 7984495B1 · Aravind · 2011 [cited by applicant]
US 8274980B2 · Sato et al. · 2012 [cited by applicant]
US 8358658B2 · Flynn et al. · 2013 [cited by applicant]
US 8416686B2 · Ferguson et al. · 2013 [cited by applicant]
US 8924716B2 · Miyabayashi et al. · 2014 [cited by applicant]
US 8955110B1 · Twitchell, Jr. · 2015 [cited by applicant]
US 9116734B1 · Twitchell, Jr. et al. · 2015 [cited by applicant]
US 9185046B2 · Ferguson et al. · 2015 [cited by applicant]
US 9225699B2 · Biradar et al. · 2015 [cited by applicant]
US 9241026B2 · Twitchell · 2016 [cited by applicant]
US 9495194B1 · Twitchell, Jr. et al. · 2016 [cited by applicant]
US 9535805B2 · Ananthanarayanan et al. · 2017 [cited by applicant]
US 9629063B2 · Brown et al. · 2017 [cited by applicant]
US 9794797B2 · Hoffberg · 2017 [cited by applicant]
US 10356061B2 · Fiske · 2019 [cited by applicant]
US 10432526B2 · Gafni et al. · 2019 [cited by applicant]
US 10469375B2 · Twitchell, Jr. · 2019 [cited by applicant]
US 10541907B2 · Twitchell, Jr. et al. · 2020 [cited by applicant]
US 10637685B2 · Goel et al. · 2020 [cited by applicant]
US 10686729B2 · Sindhu et al. · 2020 [cited by applicant]
US 10715327B1 · Ramanujan et al. · 2020 [cited by applicant]
US 10826711B2 · Barry · 2020 [cited by applicant]
US 10826876B1 · Sinn et al. · 2020 [cited by applicant]
US 10833972B2 · Vaughan et al. · 2020 [cited by applicant]
US 10904367B2 · Goel et al. · 2021 [cited by applicant]
US 10965586B2 · Goel et al. · 2021 [cited by applicant]
US 11153276B1 · Keyerleber · 2021 [cited by applicant]
US 11171934B2 · Fiske · 2021 [cited by applicant]
US 11178262B2 · Goel et al. · 2021 [cited by applicant]
US 11184147B2 · Ghorbani · 2021 [cited by applicant]
US 11381557B2 · Kim et al. · 2022 [cited by applicant]
US 11469922B2 · Goel et al. · 2022 [cited by applicant]
US 11533617B2 · Mihelich et al. · 2022 [cited by applicant]
US 11558422B2 · Twitchell, Jr. et al. · 2023 [cited by applicant]
US 11601359B2 · Goel et al. · 2023 [cited by applicant]
US 11637694B2 · Islamov · 2023 [cited by applicant]
US 11777839B2 · Sindhu et al. · 2023 [cited by applicant]
US 11805127B1 · Sundar et al. · 2023 [cited by applicant]
US 11895015B1 · Budhia et al. · 2024 [cited by applicant]
US 12021972B2 · Wang et al. · 2024 [cited by applicant]
US 12120028B1 · Andrews et al. · 2024 [cited by applicant]
US 12335160B2 · Andrews et al. · 2025 [cited by applicant]
US 20010050914A1 · Akahane et al. · 2001 [cited by applicant]
US 20010054158A1 · Jarosz · 2001 [cited by applicant]
US 20020191797A1 · Perlman · 2002 [cited by applicant]
US 20030112755A1 · McDysan · 2003 [cited by applicant]
US 20040103205A1 · Larson et al. · 2004 [cited by applicant]
US 20060008082A1 · Gluck et al. · 2006 [cited by applicant]
US 20070217424A1 · Kim et al. · 2007 [cited by applicant]
US 20100149988A1 · Matsubara et al. · 2010 [cited by applicant]
US 20110179136A1 · Twitchell, Jr. · 2011 [cited by applicant]
US 20110271096A1 · Bharrat et al. · 2011 [cited by applicant]
US 20120204032A1 · Wilkins et al. · 2012 [cited by applicant]
US 20140115341A1 · Robertson · 2014 [cited by applicant]
US 20150326603A1 · Deisinger et al. · 2015 [cited by applicant]
US 20150350245A1 · Twitchell, Jr. et al. · 2015 [cited by applicant]
US 20150350246A1 · Bergman · 2015 [cited by applicant]
US 20160065370A1 · Le Saint et al. · 2016 [cited by applicant]
US 20160119291A1 · Zollinger et al. · 2016 [cited by applicant]
US 20160255054A1 · Wan et al. · 2016 [cited by applicant]
US 20170019256A1 · Rhelimi · 2017 [cited by applicant]
US 20170033925A1 · DeNeut et al. · 2017 [cited by applicant]
US 20170126626A1 · Datta et al. · 2017 [cited by applicant]
US 20170149740A1 · Mansour et al. · 2017 [cited by applicant]
US 20170331794A1 · Lokman et al. · 2017 [cited by applicant]
US 20170372048A1 · Liu et al. · 2017 [cited by applicant]
US 20180316598A1 · Twitchell, Jr. · 2018 [cited by applicant]
US 20180375663A1 · Le Saint et al. · 2018 [cited by applicant]
US 20190014092A1 · Malek et al. · 2019 [cited by applicant]
US 20190294464A1 · Twitchell, Jr. et al. · 2019 [cited by applicant]
US 20190373458A1 · Dandekar et al. · 2019 [cited by applicant]
US 20200014619A1 · Shelar et al. · 2020 [cited by applicant]
US 20200154272A1 · Uy et al. · 2020 [cited by applicant]
US 20200195439A1 · Suresh et al. · 2020 [cited by applicant]
US 20200211002A1 · Steinberg · 2020 [cited by applicant]
US 20200213111A1 · Leavy et al. · 2020 [cited by applicant]
US 20200213151A1 · Srivatsan et al. · 2020 [cited by applicant]
US 20200226258A1 · Nix · 2020 [cited by applicant]
US 20200259640A1 · Leavy et al. · 2020 [cited by applicant]
US 20210051146A1 · Stolbikov et al. · 2021 [cited by applicant]
US 20210105301A1 · Anderson et al. · 2021 [cited by applicant]
US 20210144004A1 · Gray et al. · 2021 [cited by applicant]
US 20210168138A1 · Paruchuri · 2021 [cited by applicant]
US 20210184854A1 · Pizot et al. · 2021 [cited by applicant]
US 20210297351A1 · Vegesna et al. · 2021 [cited by applicant]
US 20210328779A1 · Ruan · 2021 [cited by applicant]
US 20210328976A1 · Leavy et al. · 2021 [cited by applicant]
US 20210352471A1 · Hallock · 2021 [cited by applicant]
US 20210360026A1 · Anderson et al. · 2021 [cited by applicant]
US 20220247678A1 · Atwal et al. · 2022 [cited by applicant]
US 20220392286A1 · Elrad et al. · 2022 [cited by applicant]
US 20230006993A1 · Bilgin et al. · 2023 [cited by applicant]
US 20230097712A1 · Sullivan et al. · 2023 [cited by applicant]
US 20230164086A1 · York et al. · 2023 [cited by applicant]
US 20230188347A1 · Sarin · 2023 [cited by applicant]
US 20230198914A1 · Ranjan et al. · 2023 [cited by applicant]
US 20230208748A1 · Goel et al. · 2023 [cited by applicant]
US 20240007367A1 · Demchenko · 2024 [cited by applicant]
US 20240028367A1 · Mathew et al. · 2024 [cited by applicant]
US 20240214803A1 · Dandekar et al. · 2024 [cited by applicant]
US 20240275596A1 · Stolbikov et al. · 2024 [cited by applicant]
US 20240380726A1 · Ban et al. · 2024 [cited by applicant]
US 20250240320A1 · Keyerleber · 2025 [cited by examiner]
CN 112333152A · 2021 [cited by applicant]
EP 3651407A1 · 2024 [cited by applicant]
WO 2018160863A1 · 2018 [cited by applicant]
WO 2023134844A1 · 2023 [cited by applicant]
Notice of Allowance dated Jun. 11, 2024, U.S. Appl. No. 18/194,413, filed Mar. 31, 2023. [cited by applicant]
Office Action dated Nov. 27, 2024, U.S. Appl. No. 18/345,829, filed Jun. 30, 2023. [cited by applicant]
Syed, et al., “Zero Trust Architecture (ZTA): A Comprehensive Survey”, IEEE Access—Digital Object Identifier, vol. 10, 37 pages, 2022. [cited by applicant]
Shu, et al., “Secure Data Collection in Wireless Sensor Networks Using Randomized Dispersive Routes”, IEEE Transactions on Mobile Computing, vol. 9, No. 7, Jul. 2010, 14 pages. [cited by applicant]
Andrews, John G., et al., “Secure Data Routing With Channel Resiliency,” filed Sep. 11, 2024, U.S. Appl. No. 11/882,552. [cited by applicant]
Notice of Allowance dated Feb. 21, 2025, U.S. Appl. No. 18/345,847, filed Jun. 30, 2023. [cited by applicant]
Office Action dated Apr. 23, 2025, U.S. Appl. No. 18/361,721, filed Jul. 28, 2023. [cited by applicant]
Office Action dated May 7, 2025, U.S. Appl. No. 18/345,819, filed Jun. 30, 2023. [cited by applicant]
Notice of Allowance dated May 20, 2025, U.S. Appl. No. 18/345,829, filed Jun. 30, 2023. [cited by applicant]
Office Action dated Jul. 11, 2025, U.S. Appl. No. 18/345,837, filed Jun. 30, 2023. [cited by applicant]
Notice of Allowance dated Jun. 22, 2021, U.S. Appl. No. 16/683,146, filed Nov. 13, 2019. [cited by applicant]
Office Action dated Apr. 12, 2023, U.S. Appl. No. 17/481,914, filed Sep. 22, 2022. [cited by applicant]
Final Office Action dated Jul. 24, 2023, U.S. Appl. No. 17/481,914, filed Sep. 22, 2022. [cited by applicant]
Advisory Action dated Oct. 5, 2023, U.S. Appl. No. 17/481,914, filed Sep. 22, 2022. [cited by applicant]
Examiner's Answer to Appeal Brief dated Feb. 23, 2024, U.S. Appl. No. 17/481,914, filed Sep. 22, 2022. [cited by applicant]
Office Action dated Feb. 13, 2024, U.S. Appl. No. 18/194,413, filed Mar. 31, 2023. [cited by applicant]
Keyerleber, John P., et al., “Secure Data Routing and Randomization,” filed Nov. 13, 2019, U.S. Appl. No. 16/683,146. [cited by applicant]
Keyerleber, John P., et al., “Secure Data Routing and Randomization,” filed Sep. 22, 2021, U.S. Appl. No. 17/481,914. [cited by applicant]
Andrews, John G., et al., “Secure Data Routing With Channel Resiliency,” filed Mar. 31, 2023, U.S. Appl. No. 18/194,413. [cited by applicant]
Andrews, John G., et al., “Out of Band Key Exchange,” filed Jun. 30, 2023, U.S. Appl. No. 18/345,819. [cited by applicant]
Andrews, John G., et al., “Network Traffic Obfuscation,” filed Jun. 30, 2023, U.S. Appl. No. 18/345,829. [cited by applicant]
Andrews, John G., et al., “Endpoint Validation Security,” filed Jun. 30, 2023, U.S. Appl. No. 18/345,837. [cited by applicant]
Andrews, John G., et al., “Secure Data Routing With Dynamic Packet Spoofing ,” filed Jun. 30, 2023, U.S. Appl. No. 18/345,847. [cited by applicant]
Andrews, John G., et al., ““Secure Data Routing Andrandomization in Windows,”” filed Jul. 28, 2023, U.S. Appl. No. 18/361,721. [cited by applicant]
Keyerleber, John P., “Machine Learning Driven Network Traffic Obfuscation,” filed Jan. 24, 2024, U.S. Appl. No. 18/421,960. [cited by applicant]
Keyerleber, et al., “Optimizing Network Traffic Obfuscation Based on Network Performance Using Reinforcement Learning,” filed Jan. 24, 2024, U.S. Appl. No. 18/421,965. [cited by applicant]
Notice of Allowance dated Sep. 3, 2025, U.S. Appl. No. 18/345,819, filed Jun. 30, 2023. [cited by applicant]
Notice of Allowance dated Dec. 9, 2025, U.S. Appl. No. 18/361,721, filed Jul. 28, 2023. [cited by applicant]
Notice of Allowance dated Oct. 27, 2025, U.S. Appl. No. 18/345,837, filed Jun. 30, 2023. [cited by applicant]
Decision on Appeal dated Nov. 18, 2025, U.S. Appl. No. 17/481,914, filed Sep. 22, 2022. [cited by applicant]