IP Library › Granted Patent US 12,676,916
Granted Patent B2
US 12,676,916 · App. 18/310,675 · Granted Jul 7, 2026

Publish-subscribe broker network overlay system

Inventors: Harvey Rubin (New York, NY); John Grossmann (Massapequa Park, NY)
Assignee: All Purpose Networks, Inc.
H04L67/55H04L63/0428H04L63/062H04L63/105H04L67/562
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,676,916
App. No.
18/310,675
Filed
May 2, 2023
Granted
Jul 7, 2026
Kind
B2
Art Unit
2491
USPC
370/329
Abstract

Systems and methods for a publish-subscribe broker network that distributes data packets between authorized entities and includes one or more publish-subscribe brokers. Each publish-subscribe broker is reachable by an entity attempting to connect thereto via a transport network configured to transport IP packets. The publish-subscribe brokers are configured to check credentials of entities attempting to connect to the publish-subscribe broker network and ensure that first and second entities are authorized for publishing packets on the secured named channel or for receiving published packets via the secured named channel. Cipher keys are used by the first and second authorized entities to encrypt and decrypt messages distributed via the publish-subscribe broker network and the publish-subscribe brokers are configured to route encrypted messages as data packets on behalf of the first authorized entity to the second authorized entity using the secured named channel.

Claims (71)

1 . A non-transitory computer-readable medium storing instructions that, when executed by at least one processor, cause the at least one processor to:

generate a first publish-subscribe broker structured to form a publish-subscribe broker network with a second publish-subscribe broker, wherein:

the publish-subscribe broker network includes a third publish-subscribe broker,

the first publish-subscribe broker and the second publish-subscribe broker execute on respective host computers, and

the publish-subscribe broker network comprises a secured named channel and another secured named channel;

receive, via the first publish-subscribe broker, an encrypted message from a first authorized entity;

prior to routing the encrypted message from the first publish-subscribe broker through the second publish-subscribe broker, check, via the first publish-subscribe broker, credentials of the first authorized entity to verify that the first authorized entity is authorized to publish the encrypted message on the secured named channel;

publish, via the first publish-subscribe broker, the encrypted message on the secured named channel by routing the encrypted message from the first publish-subscribe broker through the second publish-subscribe broker to a second authorized entity subscribed to the secured named channel, the second authorized entity being subscribed to the secured named channel via the second publish-subscribe broker;

publish, via the first publish-subscribe broker, the encrypted message on the secured named channel by routing the encrypted message from the first publish-subscribe broker through the third publish-subscribe broker to a third authorized entity subscribed to the secured named channel, the third authorized entity subscribed to the secured named channel via the third publish-subscribe broker;

distribute a cipher key, via a key management application, to the first authorized entity, the second authorized entity, and the third authorized entity, wherein the cipher key is for the encrypted message;

receive, via the first publish-subscribe broker, another encrypted message from the first authorized entity;

publish, via the first publish-subscribe broker, the another encrypted message on the another secured named channel by routing the another encrypted message from the first publish-subscribe broker through the third publish-subscribe broker to the third authorized entity when the third authorized entity is subscribed to the another secured named channel via the third publish-subscribe broker, wherein the another encrypted message is routed, via the first publish-subscribe broker, through the second publish-subscribe broker before the third publish-subscribe broker; and

generate a service application structured to:

connect to the publish-subscribe broker network and provide, to an authorized entity connecting to the publish-subscribe broker network, an IP address and a port number of a closest publish-subscribe broker, of the publish-subscribe broker network, that is the closest to a physical location of the authorized entity.

2 . The non-transitory computer-readable medium of claim 1 , wherein a single connection between the second authorized entity and the second publish-subscribe broker is used to send and receive data packets between the second authorized entity and both the first authorized entity and the third authorized entity.

3 . The non-transitory computer-readable medium of claim 1 , wherein the secured named channel is a multi-party channel with a prescribed set of authorized publisher entities and a prescribed set of authorized subscriber entities.

4 . The non-transitory computer-readable medium of claim 3 , wherein the prescribed set of authorized publisher entities for the multi-party channel includes those entities that are authorized to publish on the multi-party channel via at least one of:

an original secure channel registration; or

an authorized update to the original secure channel registration.

5 . The non-transitory computer-readable medium of claim 4 , wherein the prescribed set of authorized subscriber entities on the multi-party channel includes entities authorized to subscribe on the multi-party channel via at least one of:

an original secure channel registration; or

an authorized update to the original secure channel registration.

6 . The non-transitory computer-readable medium of claim 5 , wherein the multi-party channel allows for one-to-many, many-to-one, and many-to-many communications among authorized entities.

7 . A method comprising:

generating, via at least one processor, a first publish-subscribe broker structured to form a publish-subscribe broker network with a second publish-subscribe broker, wherein:

the publish-subscribe broker network includes a third publish-subscribe broker,

the first publish-subscribe broker and the second publish-subscribe broker execute on respective host computers, and

the publish-subscribe broker network comprises a secured named channel and another secured named channel;

receiving, via the first publish-subscribe broker, an encrypted message from a first authorized entity;

prior to routing the encrypted message from the first publish-subscribe broker through the second publish-subscribe broker, checking, via the first publish-subscribe broker, credentials of the first authorized entity to verify that the first authorized entity is authorized to publish the encrypted message on the secured named channel;

publishing, via the first publish-subscribe broker, the encrypted message on the secured named channel by routing the encrypted message from the first publish-subscribe broker through the second publish-subscribe broker to a second authorized entity subscribed to the secured named channel, the second authorized entity being subscribed to the secured named channel via the second publish-subscribe broker;

publishing, via the first publish-subscribe broker, the encrypted message on the secured named channel by routing the encrypted message from the first publish-subscribe broker through the third publish-subscribe broker to a third authorized entity subscribed to the secured named channel, the third authorized entity subscribed to the secured named channel via the third publish-subscribe broker;

distributing a cipher key, via a key management application executing on the at least one processor, to the first authorized entity, the second authorized entity, and the third authorized entity, wherein the cipher key is for the encrypted message;

receiving, via the first publish-subscribe broker, another encrypted message from the first authorized entity;

publishing, via the first publish-subscribe broker, the another encrypted message on the another secured named channel by routing the another encrypted message from the first publish-subscribe broker through the third publish-subscribe broker to the third authorized entity when the third authorized entity is subscribed to the another secured named channel via the third publish-subscribe broker, wherein the another encrypted message is routed, via the first publish-subscribe broker, through the second publish-subscribe broker before the third publish-subscribe broker; and

generating, via the at least one processor, a service application structured to:

connect to the publish-subscribe broker network and provide, to an authorized entity connecting to the publish-subscribe broker network, an IP address and a port number of a closest publish-subscribe broker, of the publish-subscribe broker network, that is the closest to a physical location of the authorized entity.

8 . The method of claim 7 further comprising:

sending and receiving, via a single connection between the second authorized entity and the second publish-subscribe broker, data packets between the second authorized entity and both the first authorized entity and the third authorized entity.

9 . The method of claim 7 , wherein the secured named channel is a multi-party channel with a prescribed set of authorized publisher entities and a prescribed set of authorized subscriber entities.

10 . The method of claim 9 , wherein the prescribed set of authorized publisher entities for the multi-party channel includes those entities that are authorized to publish on the multi-party channel via at least one of:

an original secure channel registration; or

an authorized update to the original secure channel registration.

11 . The method of claim 10 , wherein the prescribed set of authorized subscriber entities on the multi-party channel includes entities authorized to subscribe on the multi-party channel via at least one of:

an original secure channel registration; or

an authorized update to the original secure channel registration.

12 . The method of claim 11 , wherein the multi-party channel allows for one-to-many, many-to-one, and many-to-many communications among authorized entities.

13 . A system comprising:

at least one processor and a memory device that stores an application that, when loaded into the at least one processor, causes the at least one processor to:

generate a first publish-subscribe broker structured to form a publish-subscribe broker network with a second publish-subscribe broker, wherein:

the publish-subscribe broker network includes a third publish-subscribe broker,

the first publish-subscribe broker and the second publish-subscribe broker execute on respective host computers, and

the publish-subscribe broker network comprises a secured named channel and another secured named channel;

receive, via the first publish-subscribe broker, an encrypted message from a first authorized entity;

prior to routing the encrypted message from the first publish-subscribe broker through the second publish-subscribe broker, check, via the first publish-subscribe broker, credentials of the first authorized entity to verify that the first authorized entity is authorized to publish the encrypted message on the secured named channel;

publish, via the first publish-subscribe broker, the encrypted message on the secured named channel by routing the encrypted message from the first publish-subscribe broker through the second publish-subscribe broker to a second authorized entity subscribed to the secured named channel, the second authorized entity being subscribed to the secured named channel via the second publish-subscribe broker;

publish, via the first publish-subscribe broker, the encrypted message on the secured named channel by routing the encrypted message from the first publish-subscribe broker through the third publish-subscribe broker to a third authorized entity subscribed to the secured named channel, the third authorized entity subscribed to the secured named channel via the third publish-subscribe broker;

distribute a cipher key, via a key management application, to the first authorized entity, the second authorized entity, and the third authorized entity, wherein the cipher key is for the encrypted message;

receive, via the first publish-subscribe broker, another encrypted message from the first authorized entity;

publish, via the first publish-subscribe broker, the another encrypted message on the another secured named channel by routing the another encrypted message from the first publish-subscribe broker through the third publish-subscribe broker to the third authorized entity when the third authorized entity is subscribed to the another secured named channel via the third publish-subscribe broker, wherein the another encrypted message is routed, via the first publish-subscribe broker, through the second publish-subscribe broker before the third publish-subscribe broker; and

generate a service application structured to:

connect to the publish-subscribe broker network and provide, to an authorized entity connecting to the publish-subscribe broker network, an IP address and a port number of a closest publish-subscribe broker, of the publish-subscribe broker network, that is the closest to a physical location of the authorized entity.

14 . The system of claim 13 , wherein a single connection between the second authorized entity and the second publish-subscribe broker is used to send and receive data packets between the second authorized entity and both the first authorized entity and the third authorized entity.

15 . The system of claim 13 , wherein the secured named channel is a multi-party channel with a prescribed set of authorized publisher entities and a prescribed set of authorized subscriber entities.

16 . The system of claim 15 , wherein the prescribed set of authorized publisher entities for the multi-party channel includes those entities that are authorized to publish on the multi-party channel via at least one of:

an original secure channel registration; or

an authorized update to the original secure channel registration.

17 . The system of claim 16 , wherein the prescribed set of authorized subscriber entities on the multi-party channel includes entities authorized to subscribe on the multi-party channel via at least one of:

an original secure channel registration; or

an authorized update to the original secure channel registration.

18 . The system of claim 17 , wherein the multi-party channel allows for one-to-many, many-to-one, and many-to-many communications among authorized entities.

Assignments (1)
ASSIGNMENT OF ASSIGNOR'S INTEREST Recorded May 2, 2023
From: RUBIN, HARVEY; GROSSMANN, JOHN
To: ALL PURPOSE NETWORKS, INC.
Reel/Frame 063505/0428 →
Continuity (6)
Continuation 17022938 · Sep 16, 2020
Continuation 16444031 · Jun 18, 2019
Continuation In Part 16191794 · Nov 15, 2018
Provisional Application 62619241 · Jan 19, 2018
Provisional Application 62614625 · Jan 8, 2018
Related Publication 20230353655A1 · Nov 2, 2023
References Cited (276)
US 5592611A · Midgely et al. · 1997 [cited by applicant]
US 6182143B1 · Hastings et al. · 2001 [cited by applicant]
US 6202093B1 · Bolam et al. · 2001 [cited by applicant]
US 6298455B1 · Knapman et al. · 2001 [cited by applicant]
US 6854014B1 · Amin et al. · 2005 [cited by applicant]
US 7286545B1 · Tester et al. · 2007 [cited by applicant]
US 7370013B1 · Aziz et al. · 2008 [cited by applicant]
US 7437375B2 · Borthakur et al. · 2008 [cited by applicant]
US 7590098B2 · Ganesh · 2009 [cited by applicant]
US 7636583B2 · Ode et al. · 2009 [cited by applicant]
US 8046626B2 · Donovan et al. · 2011 [cited by applicant]
US 8099122B1 · Chen · 2012 [cited by applicant]
US 8280309B2 · Monk et al. · 2012 [cited by applicant]
US 8280390B2 · Yamada et al. · 2012 [cited by applicant]
US 8521141B2 · Aguirre et al. · 2013 [cited by applicant]
US 8532652B1 · Edara et al. · 2013 [cited by applicant]
US 8559957B2 · Hunzinger · 2013 [cited by applicant]
US 8565689B1 · Rubin et al. · 2013 [cited by applicant]
US 8630647B2 · Magadi Rangaiah et al. · 2014 [cited by applicant]
US 8706852B2 · Kunze et al. · 2014 [cited by applicant]
US 8867380B2 · Gorokhov et al. · 2014 [cited by applicant]
US 8934869B2 · Edara et al. · 2015 [cited by applicant]
US 9031511B2 · Rubin et al. · 2015 [cited by applicant]
US 9084143B2 · Rubin et al. · 2015 [cited by applicant]
US 9084155B2 · Rubin et al. · 2015 [cited by applicant]
US 9094803B2 · Rubin et al. · 2015 [cited by applicant]
US 9107094B2 · Rubin et al. · 2015 [cited by applicant]
US 9125064B2 · Rubin et al. · 2015 [cited by applicant]
US 9125123B2 · Rubin et al. · 2015 [cited by applicant]
US 9131385B2 · Rubin et al. · 2015 [cited by applicant]
US 9137675B2 · Rubin · 2015 [cited by applicant]
US 9144075B2 · Rubin et al. · 2015 [cited by applicant]
US 9144082B2 · Rubin et al. · 2015 [cited by applicant]
US 9179352B2 · Rubin et al. · 2015 [cited by applicant]
US 9179354B2 · Rubin et al. · 2015 [cited by applicant]
US 9179392B2 · Rubin et al. · 2015 [cited by applicant]
US 9219541B2 · Rubin et al. · 2015 [cited by applicant]
US 9253696B2 · Rubin et al. · 2016 [cited by applicant]
US 9311198B2 · Rubin et al. · 2016 [cited by applicant]
US 9503927B2 · Rubin et al. · 2016 [cited by applicant]
US 9544213B2 · Gatta et al. · 2017 [cited by applicant]
US 9553831B2 · Pignataro et al. · 2017 [cited by applicant]
US 9578574B2 · Rubin et al. · 2017 [cited by applicant]
US 9743310B2 · Rubin et al. · 2017 [cited by applicant]
US 9817657B2 · Hill et al. · 2017 [cited by applicant]
US 9843973B2 · Rubin et al. · 2017 [cited by applicant]
US 9882950B2 · Rubin et al. · 2018 [cited by applicant]
US 9942792B2 · Rubin et al. · 2018 [cited by applicant]
US 9974091B2 · Rubin et al. · 2018 [cited by applicant]
US 10116455B2 · Rubin et al. · 2018 [cited by applicant]
US 10320871B2 · Rubin et al. · 2019 [cited by applicant]
US 10341921B2 · Rubin et al. · 2019 [cited by applicant]
US 10383133B2 · Rubin et al. · 2019 [cited by applicant]
US 10827019B2 · Rubin et al. · 2020 [cited by applicant]
US 10841851B2 · Rubin et al. · 2020 [cited by applicant]
US 10884883B2 · Rubin et al. · 2021 [cited by applicant]
US 11026090B2 · Rubin et al. · 2021 [cited by applicant]
US 11422906B2 · Rubin et al. · 2022 [cited by applicant]
US 11490311B2 · Rubin et al. · 2022 [cited by applicant]
US 11647440B2 · Rubin et al. · 2023 [cited by applicant]
US 11683390B2 · Rubin et al. · 2023 [cited by applicant]
US 11711741B2 · Rubin et al. · 2023 [cited by applicant]
US 12229027B2 · Rubin et al. · 2025 [cited by applicant]
US 20020137538A1 · Chen et al. · 2002 [cited by applicant]
US 20020160778A1 · Hiramatsu et al. · 2002 [cited by applicant]
US 20040122906A1 · Goodman et al. · 2004 [cited by applicant]
US 20040131040A1 · Gruhl et al. · 2004 [cited by applicant]
US 20040190702A1 · Mayer et al. · 2004 [cited by applicant]
US 20040208151A1 · Haverinen et al. · 2004 [cited by applicant]
US 20040254993A1 · Mamas · 2004 [cited by applicant]
US 20050020295A1 · Attar et al. · 2005 [cited by applicant]
US 20050097317A1 · Trostle et al. · 2005 [cited by applicant]
US 20050108418A1 · Bedi et al. · 2005 [cited by applicant]
US 20050206564A1 · Mao et al. · 2005 [cited by applicant]
US 20050251556A1 · Ginis et al. · 2005 [cited by applicant]
US 20050251811A1 · Ginis et al. · 2005 [cited by applicant]
US 20060035662A1 · Jeong et al. · 2006 [cited by applicant]
US 20060056285A1 · Krajewski et al. · 2006 [cited by applicant]
US 20060083201A1 · He et al. · 2006 [cited by applicant]
US 20060085507A1 · Zhao et al. · 2006 [cited by applicant]
US 20060104262A1 · Kant et al. · 2006 [cited by applicant]
US 20060155578A1 · Eisenberger et al. · 2006 [cited by applicant]
US 20060173985A1 · Moore · 2006 [cited by applicant]
US 20070014259A1 · Fajardo et al. · 2007 [cited by applicant]
US 20070067389A1 · Bedi et al. · 2007 [cited by applicant]
US 20070067409A1 · Eslambolchi et al. · 2007 [cited by applicant]
US 20070073847A1 · Lee · 2007 [cited by applicant]
US 20070097942A1 · Gorokhov et al. · 2007 [cited by applicant]
US 20070135168A1 · Liu · 2007 [cited by applicant]
US 20070155385A1 · Balasubramanian et al. · 2007 [cited by applicant]
US 20070192326A1 · Angal et al. · 2007 [cited by applicant]
US 20070204339A1 · Bou-Diab · 2007 [cited by applicant]
US 20070276956A1 · Dorai et al. · 2007 [cited by applicant]
US 20070281642A1 · Gorokhov · 2007 [cited by applicant]
US 20070288637A1 · Layton et al. · 2007 [cited by applicant]
US 20070293226A1 · Lee et al. · 2007 [cited by applicant]
US 20080018459A1 · Derrick et al. · 2008 [cited by applicant]
US 20080033845A1 · Mcbride et al. · 2008 [cited by applicant]
US 20080089287A1 · Sagfors et al. · 2008 [cited by applicant]
US 20080101218A1 · Lei et al. · 2008 [cited by applicant]
US 20080103854A1 · Adam et al. · 2008 [cited by applicant]
US 20080123673A1 · Lee · 2008 [cited by applicant]
US 20080130580A1 · Chaponniere et al. · 2008 [cited by applicant]
US 20080134202A1 · Craggs et al. · 2008 [cited by applicant]
US 20080233967A1 · Montojo et al. · 2008 [cited by applicant]
US 20080242251A1 · Kraemer et al. · 2008 [cited by applicant]
US 20080242301A1 · Osterling et al. · 2008 [cited by applicant]
US 20080261602A1 · Livneh · 2008 [cited by applicant]
US 20090086867A1 · Banu et al. · 2009 [cited by applicant]
US 20090109889A1 · Budampati et al. · 2009 [cited by applicant]
US 20090138572A1 · Banks et al. · 2009 [cited by applicant]
US 20090170514A1 · Yokoyama et al. · 2009 [cited by applicant]
US 20090201881A1 · Chun et al. · 2009 [cited by applicant]
US 20090219849A1 · Alpert et al. · 2009 [cited by applicant]
US 20090233545A1 · Sutskover et al. · 2009 [cited by applicant]
US 20090279430A1 · Huber et al. · 2009 [cited by applicant]
US 20090325491A1 · Bell et al. · 2009 [cited by applicant]
US 20100033374A1 · Van Rensburg et al. · 2010 [cited by applicant]
US 20100039987A1 · Hegde et al. · 2010 [cited by applicant]
US 20100054196A1 · Hui · 2010 [cited by applicant]
US 20100056059A1 · Lakshmanan et al. · 2010 [cited by applicant]
US 20100075705A1 · van Rensburg et al. · 2010 [cited by applicant]
US 20100080153A1 · Kahn et al. · 2010 [cited by applicant]
US 20100085978A1 · Ramankutty et al. · 2010 [cited by applicant]
US 20100127931A1 · Rensburg et al. · 2010 [cited by applicant]
US 20100131554A1 · Cooper · 2010 [cited by applicant]
US 20100136979A1 · Yang et al. · 2010 [cited by applicant]
US 20100165931A1 · Nimbalker et al. · 2010 [cited by applicant]
US 20100173639A1 · Li et al. · 2010 [cited by applicant]
US 20100184444A1 · Suo et al. · 2010 [cited by applicant]
US 20100191576A1 · Raleigh · 2010 [cited by applicant]
US 20100208658A1 · Vesterinen · 2010 [cited by applicant]
US 20100210218A1 · Iwamura et al. · 2010 [cited by applicant]
US 20100226267A1 · Jang et al. · 2010 [cited by applicant]
US 20100238845A1 · Love et al. · 2010 [cited by applicant]
US 20100246544A1 · Brisebois et al. · 2010 [cited by applicant]
US 20100268836A1 · Jabri et al. · 2010 [cited by applicant]
US 20100272062A1 · Velev et al. · 2010 [cited by applicant]
US 20100306365A1 · Gale et al. · 2010 [cited by applicant]
US 20100333111A1 · Kothamasu et al. · 2010 [cited by applicant]
US 20110058505A1 · Pan et al. · 2011 [cited by applicant]
US 20110069666A1 · Kahn et al. · 2011 [cited by applicant]
US 20110105146A1 · Chandrasekaran · 2011 [cited by applicant]
US 20110173678A1 · Kaippallimalil et al. · 2011 [cited by applicant]
US 20110182256A1 · Fodor et al. · 2011 [cited by applicant]
US 20110194530A1 · Tinnakornsrisuphap et al. · 2011 [cited by applicant]
US 20110269421A1 · Moore et al. · 2011 [cited by applicant]
US 20110292915A1 · Prakash et al. · 2011 [cited by applicant]
US 20110300852A1 · Krishnaswamy et al. · 2011 [cited by applicant]
US 20110319025A1 · Siomina et al. · 2011 [cited by applicant]
US 20120033613A1 · Lin et al. · 2012 [cited by applicant]
US 20120063402A1 · Arvidsson et al. · 2012 [cited by applicant]
US 20120063419A1 · Zhao et al. · 2012 [cited by applicant]
US 20120092442A1 · Tapia et al. · 2012 [cited by applicant]
US 20120092990A1 · Tapia et al. · 2012 [cited by applicant]
US 20120102329A1 · Mittal et al. · 2012 [cited by applicant]
US 20120135738A1 · Yoshihara et al. · 2012 [cited by applicant]
US 20120140633A1 · Stanwood et al. · 2012 [cited by applicant]
US 20120142280A1 · Banu et al. · 2012 [cited by applicant]
US 20120149388A1 · West et al. · 2012 [cited by applicant]
US 20120165015A1 · Gupta et al. · 2012 [cited by applicant]
US 20120170548A1 · Rajagopalan et al. · 2012 [cited by applicant]
US 20120176977A1 · Gao et al. · 2012 [cited by applicant]
US 20120182987A1 · Gallant · 2012 [cited by applicant]
US 20120198032A1 · Fitzgerald et al. · 2012 [cited by applicant]
US 20120252474A1 · Tiirola et al. · 2012 [cited by applicant]
US 20120258754A1 · Banu et al. · 2012 [cited by applicant]
US 20120263089A1 · Gupta et al. · 2012 [cited by applicant]
US 20120287986A1 · Paniconi et al. · 2012 [cited by applicant]
US 20120294400A1 · Banu et al. · 2012 [cited by applicant]
US 20120300748A1 · Lindström et al. · 2012 [cited by applicant]
US 20120303746A1 · Yu et al. · 2012 [cited by applicant]
US 20120307697A1 · Mukhopadhyay · 2012 [cited by applicant]
US 20130003591A1 · Novak et al. · 2013 [cited by applicant]
US 20130017855A1 · Hui et al. · 2013 [cited by applicant]
US 20130028200A1 · Nory et al. · 2013 [cited by applicant]
US 20130031575A1 · Gallant et al. · 2013 [cited by applicant]
US 20130072167A1 · Aguirre et al. · 2013 [cited by applicant]
US 20130095863A1 · Dhanda et al. · 2013 [cited by applicant]
US 20130121135A1 · Berg et al. · 2013 [cited by applicant]
US 20130131840A1 · Govindaraj et al. · 2013 [cited by applicant]
US 20130142183A1 · Lee et al. · 2013 [cited by applicant]
US 20130143541A1 · Henderson et al. · 2013 [cited by applicant]
US 20130151623A1 · Weiser et al. · 2013 [cited by applicant]
US 20130152153A1 · Weiser et al. · 2013 [cited by applicant]
US 20130163424A1 · Goerke et al. · 2013 [cited by applicant]
US 20130208683A1 · Yuen et al. · 2013 [cited by applicant]
US 20130243075A1 · Dalela et al. · 2013 [cited by applicant]
US 20130336174A1 · Rubin et al. · 2013 [cited by applicant]
US 20130336176A1 · Rubin et al. · 2013 [cited by applicant]
US 20130336179A1 · Rubin et al. · 2013 [cited by applicant]
US 20130337822A1 · Rubin et al. · 2013 [cited by applicant]
US 20130339455A1 · Bajaj et al. · 2013 [cited by applicant]
US 20140003394A1 · Rubin et al. · 2014 [cited by applicant]
US 20140010129A1 · Rubin et al. · 2014 [cited by applicant]
US 20140019626A1 · Hubler et al. · 2014 [cited by applicant]
US 20140025781A1 · Ye et al. · 2014 [cited by applicant]
US 20140056224A1 · Rubin et al. · 2014 [cited by applicant]
US 20140105062A1 · Mcdysan et al. · 2014 [cited by applicant]
US 20140105216A1 · Mcdysan · 2014 [cited by applicant]
US 20140153402A1 · Rubin · 2014 [cited by applicant]
US 20140185516A1 · Rubin et al. · 2014 [cited by applicant]
US 20140214968A1 · Bhogal et al. · 2014 [cited by applicant]
US 20140219152A1 · Antó et al. · 2014 [cited by applicant]
US 20140233524A1 · Jang et al. · 2014 [cited by applicant]
US 20140286354A1 · Van De Poel et al. · 2014 [cited by applicant]
US 20140310358A1 · Pignataro et al. · 2014 [cited by applicant]
US 20140334360A1 · Rubin et al. · 2014 [cited by applicant]
US 20140334449A1 · Rubin et al. · 2014 [cited by applicant]
US 20140335839A1 · Rubin et al. · 2014 [cited by applicant]
US 20140335881A1 · Rubin et al. · 2014 [cited by applicant]
US 20140341039A1 · Rubin et al. · 2014 [cited by applicant]
US 20140373124A1 · Rubin et al. · 2014 [cited by applicant]
US 20140376378A1 · Rubin et al. · 2014 [cited by applicant]
US 20150079945A1 · Rubin et al. · 2015 [cited by applicant]
US 20150134750A1 · Srinivasan · 2015 [cited by examiner]
US 20150281996A1 · Rubin et al. · 2015 [cited by applicant]
US 20150301912A1 · Rubin et al. · 2015 [cited by applicant]
US 20160050075A1 · Rubin et al. · 2016 [cited by applicant]
US 20160174121A1 · Rubin et al. · 2016 [cited by applicant]
US 20160364553A1 · Smith et al. · 2016 [cited by applicant]
US 20160366111A1 · Smith et al. · 2016 [cited by applicant]
US 20160381699A1 · Rubin et al. · 2016 [cited by applicant]
US 20170034839A1 · Rubin et al. · 2017 [cited by applicant]
US 20170127326A1 · Rubin et al. · 2017 [cited by applicant]
US 20170244657A1 · Baldwin et al. · 2017 [cited by applicant]
US 20170367002A1 · Rubin et al. · 2017 [cited by applicant]
US 20180063762A1 · Rubin et al. · 2018 [cited by applicant]
US 20180084021A1 · Rubin et al. · 2018 [cited by applicant]
US 20180096412A1 · Scott-nash et al. · 2018 [cited by applicant]
US 20180167476A1 · Hoffner · 2018 [cited by examiner]
US 20180227933A1 · Rubin et al. · 2018 [cited by applicant]
US 20180316639A1 · Cullen · 2018 [cited by applicant]
US 20180359811A1 · Verzun et al. · 2018 [cited by applicant]
US 20190075193A1 · Mamas · 2019 [cited by applicant]
US 20190215694A1 · Rubin et al. · 2019 [cited by applicant]
US 20190253469A1 · Rubin et al. · 2019 [cited by applicant]
US 20190274080A1 · Rubin et al. · 2019 [cited by applicant]
US 20190327320A1 · Rubin et al. · 2019 [cited by applicant]
US 20190349733A1 · Nolan · 2019 [cited by examiner]
US 20210006632A1 · Rubin et al. · 2021 [cited by applicant]
US 20210076281A1 · Rubin et al. · 2021 [cited by applicant]
US 20210263813A1 · Rubin et al. · 2021 [cited by applicant]
US 20210297917A1 · Rubin et al. · 2021 [cited by applicant]
US 20210368410A1 · Rubin et al. · 2021 [cited by applicant]
US 20220398176A1 · Rubin et al. · 2022 [cited by applicant]
US 20230397074A1 · Rubin et al. · 2023 [cited by applicant]
US 20250321840A1 · Rubin et al. · 2025 [cited by applicant]
CN 102356596A · 2012 [cited by applicant]
CN 102428739A · 2012 [cited by applicant]
EP 1331791A2 · 2003 [cited by applicant]
WO 2008150264A1 · 2008 [cited by applicant]
WO 2012037637A1 · 2012 [cited by applicant]
WO 2013144950A1 · 2013 [cited by applicant]
WO 2013188629A2 · 2013 [cited by applicant]
WO 2013188629A3 · 2014 [cited by applicant]
WO 2015148816A1 · 2015 [cited by applicant]
WO 2019135830A1 · 2019 [cited by applicant]
WO 2020101747A1 · 2020 [cited by applicant]
“The Narada Brokering User's Guide”, Community Grid Labs, Indiana University, www.naradabrokering.org., Version 3.3.0, Chapter 12, Security Framework, Last updated Nov. 11, 2009, pp. 1-117. [cited by applicant]
13804614.9, “European Application Serial No. 13804614.9, Extended Search Report mailed Feb. 26, 2016”, All Purpose Networks LLC, 7 pages. [cited by applicant]
15769729.3, “European Application Serial No. 15769729.3, Extended European Search Report mailed Nov. 10, 2017”, All Purpose Networks LLC, 12 Pages. [cited by applicant]
18151636.0, “European Application Serial No. 18151636.0, Extended European Search Report mailed Jun. 12, 2018”, All Purpose Networks, Inc., 7 pages. [cited by applicant]
18898155.9, “European Application Serial No. 18898155.9, Extended European Search Report mailed Dec. 16, 2020”, All Purpose Networks, Inc., 9 pages. [cited by applicant]
Kim, H. , “Securing the Internet of Things via Locally Centralized, Globally Distributed Authentication and Authorization”, Doctoral dissertation UC Berkeley, 2017, 117 pages. [cited by applicant]
Kim, Hokeun , “Securing the Internet of Things via Locally Centralized, Globally Distributed Authentication and Authorization”, UC Berkeley UC Berkeley Electronic Theses and Dissertations,, 2017, 118 pages. [cited by applicant]
Pallickara, Shrideep et al., “A Framework for Secure End-to-End Delivery of Messages in Publish/Subscribe Systems”, Proceedings of the 7th IEEE/ACM International Conference on Grid Computing (GRID 2006), Barcelona, Spai… [cited by applicant]
Pallickara, Shrideep et al., “A Security Framework for Distributed Brokering Systems”, http://grids.ucs.indiana.edu/ptliupages/publications/NB-SecurityFramework_acmcss.pdf, (accessed Jan. 8, 2018), 2003, 15 pages. [cited by applicant]
PCT/US18/61222, “International Application Serial No. PCT/US18/61222, International Preliminary Report on Patentability mailed Jul. 23, 2020”, All Purpose Networks, Inc., 12 pages. [cited by applicant]
PCT/US18/61222, “International Application Serial No. PCT/US18/61222, International Search Report and Written Opinion mailed Feb. 12, 2019”, All Purpose Networks, Inc., 13 pages. [cited by applicant]
PCT/US2013/045581, “International Application Serial No. PCT/US2013/045581, International Preliminary Report On Patentability With Written Opinion mailed Dec. 24, 2014”, All Purpose Networks LLC, 14 Pages. [cited by applicant]
PCT/US2013/045581, “International Application Serial No. PCT/US2013/045581, International Search Report and Written Opinion mailed Feb. 19, 2014”, All Purpose Networks LLC, 23 Pages. [cited by applicant]
PCT/US2015/022773, “International Application Serial No. PCT/US2015/022773, International Preliminary Report on Patentability and Written Opinion mailed Oct. 13, 2016”, All Purpose Networks LLC, 20 Pages. [cited by applicant]
PCT/US2015/022773, “International Application Serial No. PCT/US2015/022773, International Search Report and Written Opinion mailed Jul. 29, 2015”, All Purpose Networks LLC, 23 Pages. [cited by applicant]
PCT/US2019/037617, “International Application Serial No. PCT/US2019/037617, International Preliminary Report on Patentability mailed May 27, 2021”, All Purpose Networks, Inc., 13 pages. [cited by applicant]
PCT/US2019/037617, “International Application Serial No. PCT/US2019/037617, International Search Report and Written Opinion mailed Sep. 9, 2019”, All Purpose Networks, Inc., 12 pages. [cited by applicant]