IP Library Granted Patent US 12,341,743
Granted Patent B2
US 12,341,743 · App. 18/232,052 · Granted Jun 24, 2025

Managing electronic messages with a message transfer agent

Inventors: Michael O'Brien (Skerries, IE); Kevin Baker (Blackrock, IE); James Kebinger (Oak Park, IL); Michael Axiak (Somerville, MA)
Assignee: HUBSPOT, INC.
H04L51/234G06N3/08G06N7/01G06N20/00G06Q10/107G06Q30/0248G06Q30/0277H04L51/08H04L51/18H04L51/212H04L51/42H04L51/48H04L61/5007
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,341,743
App. No.
18/232,052
Filed
Aug 9, 2023
Granted
Jun 24, 2025
Kind
B2
Art Unit
2454
USPC
709/206
Abstract

Provided herein are systems and methods for providing concurrent connection maximization. Operations include repeatedly increasing a quantity of logical connections between a source email sender and a destination email recipient server and tracking a quantity of logical connections; receiving a connection refusal signal and recording the tracked quantity of logical connections as active upon receipt; storing in a recipient status data set the active quantity of logical connections; and upon initiation of a new message send request to a recipient at the destination email recipient server, configuring a plurality of concurrent connections to the destination email recipient server based on the tracked quantity of logical connections and stored for the destination email recipient server; and sending messages over a portion of the plurality of concurrent connections within a threshold indicated by the tracked quantity of logical connections stored for the destination email recipient server.

Claims (45)

1. A method, comprising:

receiving a message, the message includes a recipient list;

evaluating a message delivery readiness indicator for at least one recipient in the recipient list;

removing the at least one recipient from the recipient list based upon a message delivery readiness indicator indicating a lack of readiness with respect to the at least one recipient;

generating customized messages for remaining recipients within the recipient list based on the message;

calculating a probability of engagement metric for each customized message, wherein the probability of engagement metric is a calculation of a likelihood that each recipient of each respective customized message will open the customized message;

selecting a message transfer agent node connected to a server executing a message routing preparation module;

selecting an address of a networked server for transmitting a customized message via a message transfer agent to a remaining recipient within the recipient list, wherein the address and the message transfer agent node are selected based upon the probability of engagement metric; and

transmitting, by the networked server using the message transfer agent node and the address via the transfer message agent, the customized message to the remaining recipient.

2. The method of claim 1 , further comprising unlocking the recipient list when bytes of the customized messages have been received by message transfer agent.

3. The method of claim 1 , comprising:

generating a recipient contact record for each remaining recipient in the recipient list for which the recipient contact record does not exist and updating the recipient contact record based on a comparison of recipient information in the recipient list with a corresponding recipient contact record for each remaining recipient for which the recipient contact record exists.

4. The method of claim 3 , wherein the recipient contact record is compared to a contact record in a contact management system of an enterprise.

5. The method of claim 1 , further comprising executing an application programming interface (API) function to process a call made to the API function from a client messaging server.

6. The method of claim 1 , further comprising requesting information for at least one recipient from a client message application by accessing an API of the client message application.

7. The method of claim 1 , further comprising accessing a workflow of a client server to obtain the recipient list.

8. The method of claim 1 , further comprising processing a script that enables access to recipient list information on a client server to obtain the recipient list.

9. The method of claim 1 , further comprising receiving a plurality of mutually exclusive recipient lists that separate included recipients from excluded recipients.

10. The method of claim 1 , further comprising tagging a recipient information record for the remaining recipient as one of included, excluded, suppressed, bad, malicious, and unreachable.

11. A system comprising:

a memory comprising machine executable code; and

a processor coupled to the memory, the processor configured to execute the machine executable code to cause the processor to perform operation comprising:

receiving a message, the message includes a recipient list;

evaluating a message delivery readiness indicator for at least one recipient in the recipient list;

removing the at least one recipient from the recipient list based upon a message delivery readiness indicator indicating a lack of readiness with respect to the at least one recipient;

generating customized messages for remaining recipients within the recipient list based on the message;

calculating a probability of engagement metric for each customized message, wherein the probability of engagement metric is a calculation of a likelihood that each recipient of each respective customized message will open the customized message;

selecting a message transfer agent node connected to a server executing a message routing preparation module;

selecting an address of a networked server for transmitting a customized message via a message transfer agent to a remaining recipient within the recipient list, wherein the address and the message transfer agent node are selected based upon the probability of engagement metric; and

transmitting, by the networked server using the message transfer agent node and the address via the transfer message agent, the customized message to the remaining recipient.

12. The system of claim 11 , wherein the operations comprise:

generating a recipient contact record for each remaining recipient in the recipient list for which the recipient contact record does not exist and updating the recipient contact record based on a comparison of recipient information in the recipient list with a corresponding recipient contact record for each remaining recipient for which the recipient contact record exists.

13. The system of claim 11 , further comprising unlocking the recipient list when bytes of the customized messages have been received by message transfer agent.

14. The system of claim 11 , further comprising receiving a plurality of mutually exclusive recipient lists that separate included recipients from excluded recipients.

15. The system of claim 11 , further comprising tagging a recipient information record for the remaining recipient as one of included, excluded, suppressed, bad, malicious, and unreachable.

16. A non-transitory machine-readable storage medium comprising instructions that when executed by a machine, causes the machine to perform operations comprising:

receiving a message, the message includes a recipient list;

evaluating a message delivery readiness indicator for at least one recipient in the recipient list;

removing the at least one recipient from the recipient list based upon a message delivery readiness indicator indicating a lack of readiness with respect to the at least one recipient;

generating customized messages for remaining recipients within the recipient list based on the message;

calculating a probability of engagement metric for each customized message, wherein the probability of engagement metric is a calculation of a likelihood that each recipient of each respective customized message will open the customized message;

selecting a message transfer agent node connected to a server executing a message routing preparation module;

selecting an address of a networked server for transmitting a customized message via a message transfer agent to a remaining recipient within the recipient list, wherein the address and the message transfer agent node are selected based upon the probability of engagement metric; and

transmitting, by the networked server using the message transfer agent node and the address via the transfer message agent, the customized message to the remaining recipient.

17. The non-transitory machine-readable storage medium of claim 16 , further comprising unlocking the recipient list when bytes of the customized messages have been received by message transfer agent.

Assignments (1)
SECURITY INTEREST Recorded Feb 12, 2026
From: HUBSPOT, INC.
To: BANK OF AMERICA, N.A.
Reel/Frame 074818/0036 →
Continuity (5)
Continuation 17443213 · Jul 22, 2021
Division 16595602 · Oct 8, 2019
Division 15884264 · Jan 30, 2018
Provisional Application 62451974 · Jan 30, 2017
Related Publication 20230388263A1 · Nov 30, 2023
References Cited (137)
US 7136941B2 · Nguyen et al. · 2006 [cited by applicant]
US 7580982B2 · Owen et al. · 2009 [cited by applicant]
US 7584114B2 · Estrada et al. · 2009 [cited by applicant]
US 7792835B2 · Bohannon et al. · 2010 [cited by applicant]
US 7831676B1 · Nagar · 2010 [cited by applicant]
US 7984297B2 · Bohannon et al. · 2011 [cited by applicant]
US 7992145B2 · Emerson et al. · 2011 [cited by applicant]
US 8006261B1 · Haberman et al. · 2011 [cited by applicant]
US 8224902B1 · Glasser · 2012 [cited by examiner]
US 8442969B2 · Gross · 2013 [cited by applicant]
US 8594618B2 · Meyer et al. · 2013 [cited by applicant]
US 8706800B1 · Ahmed et al. · 2014 [cited by applicant]
US 8719356B2 · Dillingham et al. · 2014 [cited by applicant]
US 9304862B2 · Simon et al. · 2016 [cited by applicant]
US 9305104B2 · Wu et al. · 2016 [cited by applicant]
US 9317816B2 · Zeng et al. · 2016 [cited by applicant]
US 9356947B2 · Shraim et al. · 2016 [cited by applicant]
US 10115060B2 · Chestnut et al. · 2018 [cited by applicant]
US 10217058B2 · Gamon et al. · 2019 [cited by applicant]
US 10387559B1 · Wendt et al. · 2019 [cited by applicant]
US 10853082B1 · Aleti et al. · 2020 [cited by applicant]
US 10992780B1 · Rudrappa Goniwada et al. · 2021 [cited by applicant]
US 20020099697A1 · Jensen-Grey · 2002 [cited by applicant]
US 20020152254A1 · Teng · 2002 [cited by applicant]
US 20020199194A1 · Ali · 2002 [cited by applicant]
US 20030097617A1 · Goeller et al. · 2003 [cited by applicant]
US 20030208472A1 · Pham · 2003 [cited by applicant]
US 20040034652A1 · Hofmann · 2004 [cited by applicant]
US 20040111327A1 · Kidd · 2004 [cited by applicant]
US 20040122803A1 · Dom et al. · 2004 [cited by applicant]
US 20040254998A1 · Horvitz · 2004 [cited by examiner]
US 20040260621A1 · Foster · 2004 [cited by applicant]
US 20050160166A1 · Kraenzel · 2005 [cited by applicant]
US 20050188028A1 · Brown, Jr. et al. · 2005 [cited by applicant]
US 20050210111A1 · Fukudome · 2005 [cited by applicant]
US 20050265319A1 · Clegg et al. · 2005 [cited by applicant]
US 20060095556A1 · Arnold et al. · 2006 [cited by applicant]
US 20060168057A1 · Warren · 2006 [cited by examiner]
US 20060212931A1 · Shull et al. · 2006 [cited by applicant]
US 20060224673A1 · Stern et al. · 2006 [cited by applicant]
US 20060242140A1 · Wnek · 2006 [cited by applicant]
US 20070011073A1 · Gardner et al. · 2007 [cited by applicant]
US 20070136430A1 · Qureshi et al. · 2007 [cited by applicant]
US 20070203996A1 · Davitz et al. · 2007 [cited by applicant]
US 20070299777A1 · Shraim et al. · 2007 [cited by applicant]
US 20080034432A1 · Bohannon et al. · 2008 [cited by applicant]
US 20080168269A1 · Wilson · 2008 [cited by applicant]
US 20080172606A1 · White · 2008 [cited by applicant]
US 20090013041A1 · Farmer et al. · 2009 [cited by applicant]
US 20090019003A1 · Bohannon et al. · 2009 [cited by applicant]
US 20090119268A1 · Bandaru et al. · 2009 [cited by applicant]
US 20090138711A1 · Heimbigner · 2009 [cited by applicant]
US 20090248813A1 · Sawhney · 2009 [cited by applicant]
US 20100161506A1 · Bosenick et al. · 2010 [cited by applicant]
US 20100161735A1 · Sharma · 2010 [cited by applicant]
US 20100186088A1 · Banerjee et al. · 2010 [cited by applicant]
US 20100228777A1 · Imig et al. · 2010 [cited by applicant]
US 20100235915A1 · Memon et al. · 2010 [cited by applicant]
US 20100312837A1 · Bodapati et al. · 2010 [cited by applicant]
US 20110029504A1 · King et al. · 2011 [cited by applicant]
US 20110149725A1 · Zhao et al. · 2011 [cited by applicant]
US 20110179067A1 · Dalvi et al. · 2011 [cited by applicant]
US 20110258218A1 · Hayes et al. · 2011 [cited by applicant]
US 20120053887A1 · Nurmi · 2012 [cited by applicant]
US 20120191546A1 · Phelan et al. · 2012 [cited by applicant]
US 20120197862A1 · Woytowitz et al. · 2012 [cited by applicant]
US 20120198056A1 · Shama et al. · 2012 [cited by applicant]
US 20120316904A1 · Eder · 2012 [cited by applicant]
US 20130007627A1 · Monaco · 2013 [cited by applicant]
US 20130047034A1 · Salomon et al. · 2013 [cited by applicant]
US 20130054622A1 · Karmarkar et al. · 2013 [cited by applicant]
US 20130073336A1 · Heath · 2013 [cited by applicant]
US 20130110614A1 · Wagner · 2013 [cited by examiner]
US 20130138555A1 · Shishkov · 2013 [cited by applicant]
US 20130238715A1 · Sanyal et al. · 2013 [cited by applicant]
US 20130325755A1 · Arquette · 2013 [cited by examiner]
US 20130339456A1 · Nikolayev et al. · 2013 [cited by applicant]
US 20140006139A1 · Aggarwal et al. · 2014 [cited by applicant]
US 20140025683A1 · Howland et al. · 2014 [cited by applicant]
US 20140025763A1 · Furlong et al. · 2014 [cited by applicant]
US 20140105508A1 · Arora · 2014 [cited by applicant]
US 20140108309A1 · Frank et al. · 2014 [cited by applicant]
US 20140156681A1 · Lee et al. · 2014 [cited by applicant]
US 20140214974A1 · Kurzanski et al. · 2014 [cited by applicant]
US 20140236663A1 · Smith · 2014 [cited by applicant]
US 20140258169A1 · Wong et al. · 2014 [cited by applicant]
US 20140279622A1 · Bharadwaj et al. · 2014 [cited by applicant]
US 20140280453A1 · Mattison et al. · 2014 [cited by applicant]
US 20140328172A1 · Kumar et al. · 2014 [cited by applicant]
US 20140372363A1 · Chestnut et al. · 2014 [cited by applicant]
US 20140372566A1 · Milne et al. · 2014 [cited by applicant]
US 20150006647A1 · Steinberg et al. · 2015 [cited by applicant]
US 20150032826A1 · Gunaratnam · 2015 [cited by applicant]
US 20150032827A1 · Tyler et al. · 2015 [cited by applicant]
US 20150081611A1 · Shivakumar · 2015 [cited by applicant]
US 20150100896A1 · Shmarovoz et al. · 2015 [cited by applicant]
US 20150154664A1 · Dawson et al. · 2015 [cited by applicant]
US 20150188874A1 · Feinstein · 2015 [cited by applicant]
US 20150248490A1 · Myslinski · 2015 [cited by applicant]
US 20150286357A1 · Penha et al. · 2015 [cited by applicant]
US 20150312187A1 · Menna et al. · 2015 [cited by applicant]
US 20150324469A1 · Keyngnaert et al. · 2015 [cited by applicant]
US 20150347924A1 · Zeng et al. · 2015 [cited by applicant]
US 20150379018A1 · Gur et al. · 2015 [cited by applicant]
US 20150381552A1 · Vijay et al. · 2015 [cited by applicant]
US 20160012364A1 · Filgueiras · 2016 [cited by applicant]
US 20160020917A1 · Tuatini et al. · 2016 [cited by applicant]
US 20160026720A1 · Lehrer et al. · 2016 [cited by applicant]
US 20160036750A1 · Yuan · 2016 [cited by applicant]
US 20160063560A1 · Hameed et al. · 2016 [cited by applicant]
US 20160078455A1 · O'Donnell et al. · 2016 [cited by applicant]
US 20160119260A1 · Ghafourifar et al. · 2016 [cited by applicant]
US 20160180248A1 · Regan · 2016 [cited by applicant]
US 20160226808A1 · Lin · 2016 [cited by applicant]
US 20160232540A1 · Gao et al. · 2016 [cited by applicant]
US 20160156858A1 · Lee et al. · 2016 [cited by applicant]
US 20160307191A1 · Turgeman et al. · 2016 [cited by applicant]
US 20160315969A1 · Goldstein · 2016 [cited by applicant]
US 20160359793A1 · Kraios · 2016 [cited by applicant]
US 20170005954A1 · Shaltiel et al. · 2017 [cited by applicant]
US 20170031894A1 · Bettersworth et al. · 2017 [cited by applicant]
US 20170068982A1 · Vangala et al. · 2017 [cited by applicant]
US 20170103439A1 · Kolb et al. · 2017 [cited by applicant]
US 20170103441A1 · Kolb et al. · 2017 [cited by applicant]
US 20170186042A1 · Wong et al. · 2017 [cited by applicant]
US 20170221089A1 · Zhu et al. · 2017 [cited by applicant]
US 20170264577A1 · Ganin et al. · 2017 [cited by applicant]
US 20170289287A1 · Modi et al. · 2017 [cited by applicant]
US 20170317962A1 · Chen · 2017 [cited by examiner]
US 20170337569A1 · Sasson · 2017 [cited by applicant]
US 20170353410A1 · Gonzales · 2017 [cited by applicant]
US 20180039696A1 · Zhai et al. · 2018 [cited by applicant]
US 20180097759A1 · Brechbuhl et al. · 2018 [cited by applicant]
US 20180097828A1 · Coskun · 2018 [cited by applicant]
US 20180121986A1 · Akkiraju et al. · 2018 [cited by applicant]
US 20180336495A1 · Chestnut et al. · 2018 [cited by applicant]
US 20200067861A1 · Leddy et al. · 2020 [cited by applicant]