IP Library › Granted Patent US 12,744,737
Granted Patent B2
US 12,744,737 · App. 18/760,273 · Granted Sep 22, 2026

Traffic control in a communication network

Inventors: James Lapic (Kirkland, WA); Bradley Robert Biltz (Fletcher, NC); Alison Billings (Seattle, WA); Joel David Niemeyer (Seattle, WA)
Assignee: ZIPWHIP, LLC
H04L47/24H04L41/5022H04L41/5093H04L47/805H04L51/212H04L51/226
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,744,737
App. No.
18/760,273
Granted
Sep 22, 2026
Kind
B2
Abstract

An example method of traffic control in a communication network includes the operations of: receiving, by a processing device, a message associated with a communication address of a party originating the message; determining a class of service associated with the communication address; identifying a network resource locator contained in the message; responsive to detecting, in a chain of redirects associated with the network resource locator, an identifier of a related entity represented by one of: a trusted entity or a known bad actor, adjusting the class of service based on the related entity; selecting one or more links having their respective reliabilities corresponding to the adjusted class of service; and forwarding the message via the one or more links.

Claims (42)

1 . A method, comprising:

receiving, by one or more processors, a message associated with a communication address of a party originating the message;

determining a class of service associated with the communication address;

identifying, among a plurality of message queues, a message queue associated with the communication address;

responsive to validating the communication address, elevating a priority of the identified message queue; and

assigning the message to the identified message queue.

2 . The method of claim 1 , further comprising:

adjusting an aggression level of a spam filter with respect to messages originated from the communication address.

3 . The method of claim 1 , wherein determining the class of service is performed based on one or more attributes of the message.

4 . The method of claim 1 , wherein determining the class of service is performed based on one or more metrics of network traffic.

5 . The method of claim 1 , wherein determining the class of service further comprises:

performing semantic pattern analysis of the message.

6 . The method of claim 1 , wherein determining the class of service further comprises:

comparing the message with another message received from a verified communication address.

7 . A system, comprising:

a memory; and

one or more processors, coupled to the memory, the one or more processors configured to:

receive a message associated with a communication address of a party originating the message;

determine a class of service associated with the communication address;

identify, among a plurality of message queues, a message queue associated with the communication address;

responsive to validating the communication address, elevate a priority of the identified message queue; and

assign the message to the identified message queue.

8 . The system of claim 7 , wherein the one or more processors are further configured to:

adjust an aggression level of a spam filter with respect to messages originated from the communication address.

9 . The system of claim 7 , wherein determining the class of service is performed based on one or more attributes of the message.

10 . The system of claim 7 , wherein determining the class of service is performed based on one or more metrics of network traffic.

11 . The system of claim 7 , wherein determining the class of service further comprises:

performing semantic pattern analysis of the message.

12 . The system of claim 7 , wherein determining the class of service further comprises:

comparing the message with another message received from a verified communication address.

13 . A non-transitory computer-readable storage medium comprising executable instructions which, when executed by one or more processors, cause the one or more processors to:

receive a message associated with a communication address of a party originating the message;

determine a class of service associated with the communication address;

identify, among a plurality of message queues, a message queue associated with the communication address;

responsive to validating the communication address, elevate a priority of the identified message queue; and

assign the message to the identified message queue.

14 . The non-transitory computer-readable storage medium of claim 13 , further comprising executable instructions which, when executed by the one or more processors, cause the one or more processors to:

adjust an aggression level of a spam filter with respect to messages originated from the communication address.

15 . The non-transitory computer-readable storage medium of claim 13 , wherein determining the class of service is performed based on one or more attributes of the message.

16 . The non-transitory computer-readable storage medium of claim 13 , wherein determining the class of service is performed based on one or more metrics of network traffic.

17 . The non-transitory computer-readable storage medium of claim 13 , wherein determining the class of service further comprises:

performing semantic pattern analysis of the message.

Assignments (2)
MERGER AND CHANGE OF NAME Recorded Jul 10, 2024
From: ZIPWHIP, INC.; ZEUS MERGER SUB II, LLC
To: ZIPWHIP, LLC
Reel/Frame 067947/0750 →
ASSIGNMENT OF ASSIGNOR'S INTEREST Recorded Jul 3, 2024
From: LAPIC, JAMES; BILTZ, BRADLEY ROBERT; BILLINGS, ALISON; NIEMEYER, JOEL DAVID
To: ZIPWHIP, INC.
Reel/Frame 067903/0306 →
Continuity (3)
Continuation 18195092 · May 9, 2023
Continuation 17357752 · Jun 24, 2021
Related Publication 20240356856A1 · Oct 24, 2024
References Cited (22)
US 8819819B1 · Johnston et al. · 2014 [cited by applicant]
US 9177293B1 · Gagnon et al. · 2015 [cited by applicant]
US 10075417B2 · Baughman et al. · 2018 [cited by applicant]
US 10334050B2 · Kentley-Klay et al. · 2019 [cited by applicant]
US 10705856B2 · Irani et al. · 2020 [cited by applicant]
US 10761839B1 · Migoya et al. · 2020 [cited by applicant]
US 20090182818A1 · Krywaniuk · 2009 [cited by applicant]
US 20100095377A1 · Krywaniuk · 2010 [cited by applicant]
US 20120314677A1 · Gilder · 2012 [cited by applicant]
US 20140373145A1 · Wardman et al. · 2014 [cited by applicant]
US 20150180791A1 · Bentley et al. · 2015 [cited by applicant]
US 20150188829A1 · Satpathy et al. · 2015 [cited by applicant]
US 20160094566A1 · Parekh · 2016 [cited by applicant]
US 20160285804A1 · Mankovskii · 2016 [cited by examiner]
US 20170111375A1 · Provos et al. · 2017 [cited by applicant]
US 20170230323A1 · Jakobsson · 2017 [cited by applicant]
US 20200067861A1 · Leddy et al. · 2020 [cited by applicant]
US 20200257853A1 · Hussain et al. · 2020 [cited by applicant]
US 20200311154A1 · Turner et al. · 2020 [cited by applicant]
US 20200387398A1 · Xia · 2020 [cited by applicant]
US 20230283632A1 · Jursa et al. · 2023 [cited by applicant]
WO 2005081109A1 · 2005 [cited by applicant]