IP Library Granted Patent US 12,224,912
Granted Patent B2
US 12,224,912 · App. 18/519,576 · Granted Feb 11, 2025

Relay node management for overlay networks

Inventors: Jeffrey Michael Ahrenholz (Mercer Island, WA); Dustin Orion Lundquist (Vashon, WA)
Assignee: TYCO FIRE & SECURITY GMBH
H04L41/12H04L43/08H04L45/64
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,224,912
App. No.
18/519,576
Granted
Feb 11, 2025
Kind
B2
Abstract

Embodiments are directed to managing communication over networks. A gateway identifier (GID), a network address, source nodes, relays, or the like, may be determined based on an overlay network. Two or more relays may be ranked based on metrics associated with each relay such that a top ranked relay is designated as a preferred relay.

Claims (52)

1. A method, comprising:

collecting metrics relating to a plurality of relays of an underlay network, the underlay network providing overlay traffic of network traffic via at least some of the plurality of relays, from source nodes of the overlay traffic to target nodes of a respective target gateway, the plurality of relays comprising a multi-tenant relay;

in response to a source node providing first overlay traffic, directed to a target node associated with a target gateway identifier (GID) of a target gateway:

determining a ranking of the plurality of relays, according to the metrics of the plurality of relays;

designating a relay of the plurality of relays, as a preferred relay according to the ranking of the relay, the preferred relay used to determine a target network address based on the target GID, to provide the network traffic to the target gateway; and

routing the first overlay traffic from the source node, via the preferred relay, to the target GID of the target gateway, to cause the target gateway to provide the first overlay traffic to the target node.

2. The method of claim 1 , further comprising:

determining, responsive to routing the first overlay traffic from the source node, via the preferred relay, to the target GID of the target gateway, to reattempt routing of the first overlay traffic to the target GID of the target gateway; and

routing the first overlay traffic from the source node, via the plurality of relays other than the preferred relays, to the target GID of the target gateway.

3. The method of claim 1 , further comprising:

ranking, responsive to collecting the metrics, each of the plurality of relays according to the metrics of respective relays of the plurality of relays.

4. The method of claim 3 ,

wherein the collecting the metrics comprises collecting, at a plurality of time instances, the metrics relating to the plurality of relays,

wherein the first overlay traffic is provided at a first time instance, and

wherein the ranking is determined according to the metrics of the plurality of relays associated with a time instance of the plurality of time instances closest to the first time instance.

5. The method of claim 1 , wherein determining the ranking of the plurality of relays is according to the metrics of the plurality of relays, the source node, and the target gateway.

6. The method of claim 5 , wherein the ranking of the plurality of relays is based on a path between the source node and the target gateway.

7. The method of claim 1 , further comprising, in response to the target node being accessible to the source node through a local area network, employing a source gateway to forward network traffic from the source node to the target gateway, wherein the target gateway provides the forwarded network traffic to the target node.

8. The method of claim 1 , wherein the target GID is determined based on the overlay network, the source node provides the first overlay traffic via a first underlay network, and wherein the target network address is in a second underlay network.

9. The method of claim 1 , further comprising:

determining one or more routes for each user employing a respective relay to communication on the overlay network; and

determining the ranking for each respective relay for a corresponding route.

10. A system comprising:

one or more network computers comprising memory storing instructions, and one or more processors configured to execute the instructions to cause the one or more network computers to:

collect metrics relating to a plurality of relays of an underlay network, the underlay network providing overlay traffic of network traffic via at least some of the plurality of relays, from source nodes of the overlay traffic to target nodes of a respective target gateway, the plurality of relays comprising a multi-tenant relay; and

in response to a source node providing first overlay traffic, directed to a target node associated with a target gateway identifier (GID) of a target gateway, the one or more network computers configured to:

determine a ranking of the plurality of relays, according to the metrics of the plurality of relays;

designate a relay of the plurality of relays, as a preferred relay according to the ranking of the relay, the preferred relay used to determine a target network address based on the target GID, to provide the network traffic to the target gateway; and

route the first overlay traffic from the source node, via the preferred relay, to the target GID of the target gateway, to cause the target gateway to provide the first overlay traffic to the target node.

11. The system of claim 10 , wherein the instructions cause the one or more network computers to:

determine, responsive to routing the first overlay traffic from the source node, via the preferred relay, to the target GID of the target gateway, to reattempt routing of the first overlay traffic to the target GID of the target gateway; and

route the first overlay traffic from the source node, via the plurality of relays other than the preferred relays, to the target GID of the target gateway.

12. The system of claim 10 , wherein the instructions cause the one or more network computers to:

rank, responsive to collecting the metrics, each of the plurality of relays according to the metrics of respective relays of the plurality of relays.

13. The system of claim 12 ,

wherein the metrics relating to the plurality of relays are collected at a plurality of time instances,

wherein the first overlay traffic is provided at a first time instance, and

wherein the ranking is determined according to the metrics of the plurality of relays associated with a time instance of the plurality of time instances closest to the first time instance.

14. The system of claim 10 , wherein the ranking of the plurality of relays is determined according to the metrics of the plurality of relays, the source node, and the target gateway.

15. The system of claim 14 , wherein the ranking of the plurality of relays is based on a path between the source node and the target gateway.

16. The system of claim 10 , wherein the instructions cause the one or more network computers to, in response to the target node being accessible to the source node through a local area network, employ a source gateway to forward network traffic from the source node to the target gateway, wherein the target gateway provides the forwarded network traffic to the target node.

17. The system of claim 10 , wherein the target GID is determined based on the overlay network, the source node provides the first overlay traffic via a first underlay network, and wherein the target network address is in a second underlay network.

18. The system of claim 10 , wherein the instructions cause the one or more network computers to:

determine one or more routes for each user employing a respective relay to communication on the overlay network; and

determine the ranking for each respective relay for a corresponding route.

19. The system of claim 10 , further comprising the plurality of relays.

20. A non-transitory computer readable medium storing instructions that, when executed by one or more processors of a network computer, cause the network computer to:

collect metrics relating to a plurality of relays of an underlay network, the underlay network providing overlay traffic of network traffic via at least some of the plurality of relays, from source nodes of the overlay traffic to target nodes of a respective target gateway, the plurality of relays comprising a multi-tenant relay; and

in response to a source node providing first overlay traffic, directed to a target node associated with a target gateway identifier (GID) of a target gateway, the one or more network computers configured to:

determine a ranking of the plurality of relays, according to the metrics of the plurality of relays;

designate a relay of the plurality of relays, as a preferred relay according to the ranking of the relay, the preferred relay used to determine a target network address based on the target GID, to provide the network traffic to the target gateway; and

route the first overlay traffic from the source node, via the preferred relay, to the target GID of the target gateway, to cause the target gateway to provide the first overlay traffic to the target node.

Assignments (3)
ASSIGNMENT OF ASSIGNOR'S INTEREST Recorded Apr 9, 2024
From: JOHNSON CONTROLS TYCO IP HOLDINGS LLP
To: TYCO FIRE & SECURITY GMBH
Reel/Frame 067056/0552 →
ASSIGNMENT OF ASSIGNOR'S INTEREST Recorded Nov 27, 2023
From: AHRENHOLZ, JEFFREY MICHAEL; LUNDQUIST, DUSTIN ORION
To: TEMPERED NETWORKS, INC.
Reel/Frame 065667/0609 →
ASSIGNMENT OF ASSIGNOR'S INTEREST Recorded Nov 27, 2023
From: TEMPERED NETWORKS, INC.
To: JOHNSON CONTROLS TYCO IP HOLDINGS LLP
Reel/Frame 065667/0683 →
Continuity (3)
Continuation 17246520 · Apr 30, 2021
Continuation 17079248 · Oct 23, 2020
Related Publication 20240097986A1 · Mar 21, 2024
References Cited (139)
US 5835727A · Wong et al. · 1998 [cited by applicant]
US 6158010A · Moriconi et al. · 2000 [cited by applicant]
US 6981156B1 · Stern et al. · 2005 [cited by applicant]
US 7209956B2 · Mache · 2007 [cited by applicant]
US 7324533B1 · Deliberato et al. · 2008 [cited by applicant]
US 7373660B1 · Guichard et al. · 2008 [cited by applicant]
US 7395349B1 · Szabo et al. · 2008 [cited by applicant]
US 7796593B1 · Ghosh et al. · 2010 [cited by applicant]
US 7881199B2 · Krstulich · 2011 [cited by applicant]
US 7996894B1 · Chen et al. · 2011 [cited by applicant]
US 8224971B1 · Miller et al. · 2012 [cited by applicant]
US 8429400B2 · Khalid et al. · 2013 [cited by applicant]
US 8489701B2 · Manion et al. · 2013 [cited by applicant]
US 8607301B2 · Carrasco · 2013 [cited by applicant]
US 8630183B2 · Miyata · 2014 [cited by applicant]
US 8832211B1 · Lebedev et al. · 2014 [cited by applicant]
US 8886827B2 · Goel et al. · 2014 [cited by applicant]
US 8959513B1 · Swaminathan · 2015 [cited by applicant]
US 9264522B1 · Reeves et al. · 2016 [cited by applicant]
US 9774586B1 · Roche et al. · 2017 [cited by applicant]
US 10158545B1 · Marrone et al. · 2018 [cited by applicant]
US 10911418B1 · Fuchs et al. · 2021 [cited by applicant]
US 10924419B1 · Chitalia · 2021 [cited by examiner]
US 10999154B1 · Ahrenholz · 2021 [cited by examiner]
US 11831514B2 · Ahrenholz · 2023 [cited by examiner]
US 20020026532A1 · Maeda et al. · 2002 [cited by applicant]
US 20020073182A1 · Zakurdaev et al. · 2002 [cited by applicant]
US 20020143855A1 · Traversat et al. · 2002 [cited by applicant]
US 20030061479A1 · Kimura · 2003 [cited by applicant]
US 20030081620A1 · Danner et al. · 2003 [cited by applicant]
US 20030123436A1 · Joseph et al. · 2003 [cited by applicant]
US 20040024905A1 · Liao et al. · 2004 [cited by applicant]
US 20040143628A1 · Bradford et al. · 2004 [cited by applicant]
US 20040268121A1 · Shelest et al. · 2004 [cited by applicant]
US 20050014500A1 · Muhonen et al. · 2005 [cited by applicant]
US 20050052999A1 · Oliver et al. · 2005 [cited by applicant]
US 20050265355A1 · Havala et al. · 2005 [cited by applicant]
US 20060190458A1 · Mishina et al. · 2006 [cited by applicant]
US 20060233166A1 · Bou-Diab et al. · 2006 [cited by applicant]
US 20070019641A1 · Pai et al. · 2007 [cited by applicant]
US 20070081530A1 · Nomura et al. · 2007 [cited by applicant]
US 20070226781A1 · Chen et al. · 2007 [cited by applicant]
US 20070230352A1 · Kokku et al. · 2007 [cited by applicant]
US 20070258440A1 · Watanabe · 2007 [cited by applicant]
US 20080072282A1 · Willis et al. · 2008 [cited by applicant]
US 20080082823A1 · Starrett et al. · 2008 [cited by applicant]
US 20080151916A1 · Jetcheva et al. · 2008 [cited by applicant]
US 20080232360A1 · Mihaly et al. · 2008 [cited by applicant]
US 20080288614A1 · Gil et al. · 2008 [cited by applicant]
US 20080307519A1 · Curcio et al. · 2008 [cited by applicant]
US 20090010168A1 · Yurchenko et al. · 2009 [cited by applicant]
US 20090034738A1 · Starrett · 2009 [cited by applicant]
US 20090059906A1 · Cullen · 2009 [cited by applicant]
US 20090129374A1 · Yurchenko et al. · 2009 [cited by applicant]
US 20090210518A1 · Verma et al. · 2009 [cited by applicant]
US 20090210541A1 · Chandolu et al. · 2009 [cited by applicant]
US 20090310518A1 · Jayaram et al. · 2009 [cited by applicant]
US 20100014533A1 · Hirano et al. · 2010 [cited by applicant]
US 20100024026A1 · Ylonen et al. · 2010 [cited by applicant]
US 20100027442A1 · Chockler et al. · 2010 [cited by applicant]
US 20100042747A1 · Hascalovici et al. · 2010 [cited by applicant]
US 20100214959A1 · Kuehnel et al. · 2010 [cited by applicant]
US 20100218235A1 · Ganot · 2010 [cited by applicant]
US 20100254395A1 · Smith et al. · 2010 [cited by applicant]
US 20110016509A1 · Huang et al. · 2011 [cited by applicant]
US 20110035466A1 · Panigrahe · 2011 [cited by applicant]
US 20110090892A1 · Cooke · 2011 [cited by applicant]
US 20110103393A1 · Meier et al. · 2011 [cited by applicant]
US 20110141881A1 · Joshi et al. · 2011 [cited by applicant]
US 20120110203A1 · Ozawa · 2012 [cited by applicant]
US 20120163196A1 · Jansen et al. · 2012 [cited by applicant]
US 20120304243A1 · Li et al. · 2012 [cited by applicant]
US 20130010621A1 · Yoshiuchi et al. · 2013 [cited by applicant]
US 20130018993A1 · Hui et al. · 2013 [cited by applicant]
US 20130046414A1 · Ree · 2013 [cited by applicant]
US 20130083725A1 · Mallya et al. · 2013 [cited by applicant]
US 20130198830A1 · Nemoto et al. · 2013 [cited by applicant]
US 20130254264A1 · Hankinson et al. · 2013 [cited by applicant]
US 20130283364A1 · Chang et al. · 2013 [cited by applicant]
US 20140026207A1 · Wang et al. · 2014 [cited by applicant]
US 20140133354A1 · Scharf et al. · 2014 [cited by applicant]
US 20140150070A1 · Peterson · 2014 [cited by applicant]
US 20140223507A1 · Xu · 2014 [cited by applicant]
US 20140282817A1 · Singer et al. · 2014 [cited by applicant]
US 20140282850A1 · Mattes et al. · 2014 [cited by applicant]
US 20140307744A1 · Dunbar et al. · 2014 [cited by applicant]
US 20140348131A1 · Duan et al. · 2014 [cited by applicant]
US 20150024677A1 · Gopal et al. · 2015 [cited by applicant]
US 20150046997A1 · Gupta et al. · 2015 [cited by applicant]
US 20150057766A1 · Ejiri et al. · 2015 [cited by applicant]
US 20150067033A1 · Martinsen et al. · 2015 [cited by applicant]
US 20150124823A1 · Pani et al. · 2015 [cited by applicant]
US 20150135259A1 · Ilyadis et al. · 2015 [cited by applicant]
US 20150281074A1 · Kubota · 2015 [cited by applicant]
US 20150365316A1 · Liao et al. · 2015 [cited by applicant]
US 20150372828A1 · Hao et al. · 2015 [cited by applicant]
US 20160028624A1 · Song et al. · 2016 [cited by applicant]
US 20160036861A1 · Mattes et al. · 2016 [cited by applicant]
US 20160134528A1 · Lin · 2016 [cited by examiner]
US 20160149804A1 · Mirza · 2016 [cited by applicant]
US 20160255542A1 · Hughes et al. · 2016 [cited by applicant]
US 20160261641A1 · Mattes et al. · 2016 [cited by applicant]
US 20170019430A1 · Cohn · 2017 [cited by applicant]
US 20170142208A1 · Hammer et al. · 2017 [cited by applicant]
US 20170238215A1 · Jin · 2017 [cited by applicant]
US 20170373936A1 · Hooda et al. · 2017 [cited by applicant]
US 20180083968A1 · Xu et al. · 2018 [cited by applicant]
US 20180084060A1 · Xie et al. · 2018 [cited by applicant]
US 20180124183A1 · Kozat et al. · 2018 [cited by applicant]
US 20180234459A1 · Kung et al. · 2018 [cited by applicant]
US 20190068592A1 · Mattela et al. · 2019 [cited by applicant]
US 20190132152A1 · Wang et al. · 2019 [cited by applicant]
US 20190149401A1 · Ramachandran et al. · 2019 [cited by applicant]
US 20190158397A1 · Liu · 2019 [cited by applicant]
US 20190372876A1 · Marrone et al. · 2019 [cited by applicant]
US 20190372888A1 · Michael · 2019 [cited by examiner]
US 20190394107A1 · Marrone et al. · 2019 [cited by applicant]
US 20200067341A1 · Glover et al. · 2020 [cited by applicant]
US 20200177503A1 · Hooda et al. · 2020 [cited by applicant]
US 20200314006A1 · Mackie · 2020 [cited by examiner]
US 20210084048A1 · Kannan et al. · 2021 [cited by applicant]
US 20210377128A1 · Kapadia · 2021 [cited by examiner]
US 20220046084A1 · Nair · 2022 [cited by examiner]
WO WO2007038872A1 · 2007 [cited by applicant]
WO WO2008039506A2 · 2008 [cited by applicant]
WO WO2011159842A2 · 2011 [cited by applicant]
WO WO2019246331A1 · 2019 [cited by applicant]
Aoyagi, S. et al., “ELA: A Fully Distributed VPN System Over Peer-to-Peer Network,” IEEE Computer Society, Proceedings of the 2005 Symposium on Applications and the Internet (SAINT'05), Feb. 4, 2005 (4 pages). [cited by applicant]
Asguard Networks, Inc., “Gray Matter Systems Announces Asguard Networks Partnership at 2012 Gray Matter Systems Training and User Group Meeting,” URL: http://www.asguardnetworks.com/news/, Aug. 9, 2012, retrieved from i… [cited by applicant]
Asguard Networks, Inc., “SimpleConnectTM Product Information,” URL: http://www.asguardnetworks.com/product/, retrieved from internet on Nov. 9, 2012 (1 Page). [cited by applicant]
Asguard Networks, Inc., “SimpleConnectTM Quick Start Documentation Guide,” Revision 1, Dec. 13, 2012 (18 pages). [cited by applicant]
Asguard Networks, Inc., “Welcome to Asguard Networks,” URL: http://www. asguardnetworks.com/, retrieved from internet on Oct. 23, 2012 (1 page). [cited by applicant]
Benyamina, D. et al., “Wireless Mesh Networks Design—A Survey,” IEEE Communications Survey & Tutorials, vol. 14, No. 2, Second Quarter 2012 (pp. 299-310). [cited by applicant]
Henderson, T. et al., “HIP-based Virtual Private LAN Service (HIPLS),” Network Working Group, Internet-Draft, The Boeing Company, Nov. 6, 2012 (pp. 1-16). [cited by applicant]
International Search Report and Written Opinion on PCT Appl. No. PCT/US2014/023632 dated Jun. 23, 2014 (15 pages). [cited by applicant]
International Search Report and Written Opinion on PCT Appl. No. PCT/US2015/042993 dated Nov. 11, 2015 (11 pages). [cited by applicant]
Lawton, G., “Machine-to-Machine Technology gears up for growth,” IEEE Computer Society, Sep. 2004 (pp. 12-15). [cited by applicant]
Trusted Computing Group, “Architect's Guide: ICS Security Using TNC Technology,” Oct. 2013 (pp. 1-6). [cited by applicant]
Trusted Computing Group, Incorporated, “TCG Trusted Network Connect: IF-MAP Metadata for ICS Security,” Specification Version 1.0, Revision 44, May 8, 2014 (pp. 1-64). [cited by applicant]