IP Library Granted Patent US 12,470,430
Granted Patent B2
US 12,470,430 · App. 19/188,571 · Granted Nov 11, 2025

System and method for a global virtual network

Inventors: Joseph E. Rubenstein (Beijing, CN); Jørn Allan Dose Knutsen (Oslo, NO); Thibaud August Bernard Jean Saint-Martin (Aubignan, FR); Carlos Eduardo Oré (Saint-Herblain, FR); Fred Broussard (Indianapolis, IN)
Assignee: UMBRA Technologies Ltd.
H04L12/4633H04L45/12H04L45/64H04L61/4511H04L63/02
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,470,430
App. No.
19/188,571
Filed
Apr 24, 2025
Granted
Nov 11, 2025
Kind
B2
Art Unit
2445
USPC
709/249
Abstract

Systems and methods for connecting devices via a virtual global network are disclosed. In one embodiment the network system may comprise a first device in communication with a first endpoint device and a second device in communication with a second endpoint device. The first and second devices may be connected with a communication path. The communication path may comprise one or more intermediate tunnels connecting each endpoint device to one or more intermediate access point servers and one or more control servers.

Claims (23)

1 . A method comprising:

identifying, by one or more processors, a plurality of candidate packet-communication paths between a virtual overlay network endpoint device (EPD) and a remote destination reachable via at least one path that traverses at least one wide area network, the plurality of candidate packet-communication paths including at least two overlay candidate paths, each comprising a respective virtual overlay network tunnel path between the EPD and a respective remote egress-ingress point (EIP) of the virtual overlay network;

determining, by the one or more processors, a plurality of factors for each of the candidate packet-communication paths, the factors indicating a priority order, path latency, a path security rating, and, for each candidate path, at least one of packet loss rate, hop count, bandwidth, target region, and path loading;

selecting, by the one or more processors and for a given data flow targeted to the remote destination, a communication path from the plurality of candidate packet-communication paths, based at least in part on relative priority order factors of the candidate packet-communication paths and based at least in part on evaluating one or more data attributes and/or profile quality-of-service requirements for the given data flow against related factors of the plurality of factors for the selected communication path; and

forwarding packets for the given data flow from the EPD towards the remote destination through the selected communication path.

2 . The method of claim 1 , wherein selecting, by the one or more processors and for the given data flow targeted to the remote destination, the communication path from the plurality of candidate packet-communication paths, based at least in part on relative priority order factors of the candidate packet-communication paths and based at least in part on evaluating one or more data attributes and/or profile quality-of-service requirements for the given data flow against related factors of the plurality of factors for the selected communication path comprises determining a traffic type for the given data flow based at least in part of evaluating one or more data attributes and/or profile quality-of-service requirements for the given data flow, and basing the selection of the communication path at least in part on the determined traffic type.

3 . The method of claim 1 , wherein at least one of the candidate packet-communication paths breaks out of the virtual overlay network to a wide-area network at an EIP co-located with the EPD.

4 . The method of claim 3 , further comprising pre-defining a plurality of destination addresses for which selecting a communication path prefers a candidate packet-communication path that breaks out of the virtual overlay network to a wide-area network at the EIP co-located with the EPD.

5 . The method of claim 1 , wherein at least one of the overlay candidate paths is to an access-point server having an EIP in a same region as the EPD.

6 . The method of claim 5 , further comprising pre-defining a plurality of destination addresses for which selecting a communication path prefers an overlay candidate packet-communication path that breaks out of the virtual overlay network to a wide-area network at the access-point server having an EIP in the same region as the EPD.

7 . The method of claim 1 , wherein determining the plurality of factors for at least a given path of the candidate packet-communication paths that comprises multiple path segments comprises, for at least one of the plurality of factors, running tests on each path segment of the given path, a combination of path segments of the given path, and on a total network path from the EPD to the remote destination.

8 . The method of claim 1 , wherein at least one respective remote EIP of the virtual overlay network connects to a service provider cloud.

9 . The method of claim 1 , wherein two or more of the plurality of factors are expressed as respective scaled metrics, the method further comprising:

calculating a quality-of-service score for a given one of the candidate packet-communication paths by combining the respective scaled metrics for that path,

wherein evaluating one or more data attributes and/or profile quality-of-service requirements for the given data flow against related factors of the plurality of factors for the selected communication path comprises evaluating a profile quality-of-service requirement against the quality-of-service score.

10 . The method of claim 1 , wherein at least two of the overlay candidate paths each comprise a respective tunnel between the EPD and a first access point server.

11 . The method of claim 1 , wherein at least two given paths of the overlay candidate paths each comprise a respective tunnel between the EPD and a different one of first and second access point servers, wherein the priority order factors of the at least two given paths are related to priority orders of the first and second access point servers.

12 . The method of claim 1 , further comprising pre-defining a plurality of destination addresses for which selecting a communication path for a particular destination address of the plurality prefers an overlay candidate packet-communication path that breaks out of the virtual overlay network at an access-point server having an EIP in a respective remote region associated with that particular destination address.

13 . The method of claim 12 , wherein at least some of the plurality of destination addresses are stored in tables indexing blocks of destination addresses to respective remote regions.

14 . The method of claim 13 , wherein at least some of the blocks of destination addresses are stored as Classless Inter Domain Routing block ranges.

15 . The method of claim 1 , further comprising, in a case wherein none of the identified candidate packet-communication paths meet one or more requirements for the given data flow, dynamically building at least one new tunnel within the virtual overlay network and selecting a new communication path for the given data flow that utilizes the new tunnel.

16 . The method of claim 1 , wherein at least one of the overlay candidate paths comprises a logical path that joins two or more intermediate tunnels end-to-end in a path traversing the virtual overlay network.

17 . The method of claim 16 , wherein the logical path comprises an internal tunnel built through the two or more intermediate tunnels.

Assignments (4)
ASSIGNMENT OF ASSIGNOR'S INTEREST Recorded Jun 27, 2025
From: RUBENSTEIN, JOSEPH E.
To: UMBRA TECHNOLOGIES LTD.
Reel/Frame 071546/0835 →
ASSIGNMENT OF ASSIGNOR'S INTEREST Recorded Jun 27, 2025
From: RUBENSTEIN, JOSEPH E.; KNUTSEN, JORN ALLAN DOSE; SAINT-MARTIN, THIBAUD AUGUSTE BERNARD JEAN; ORE, CARLOS EDUARDO; BROUSSARD, FRED
To: UMBRA TECHNOLOGIES LTD.
Reel/Frame 071546/0901 →
ASSIGNMENT OF ASSIGNOR'S INTEREST Recorded Jun 27, 2025
From: RUBENSTEIN, JOSEPH E.
To: UMBRA TECHNOLOGIES LTD.
Reel/Frame 071546/0916 →
ASSIGNMENT OF ASSIGNOR'S INTEREST Recorded Jun 27, 2025
From: UMBRA TECHNOLOGIES LIMITED (CN)
To: UMBRA TECHNOLOGIES LTD. (UK)
Reel/Frame 071546/0958 →
Continuity (12)
Continuation 18390894 · Dec 20, 2023
Continuation 17589753 · Jan 31, 2022
Continuation 16815864 · Mar 11, 2020
Continuation 15546247
Continuation PCTIB2016000110 · Jan 5, 2016
Continuation PCTUS2015064242 · Dec 7, 2015
Provisional Application 62266060 · Dec 11, 2015
Provisional Application 62174394 · Jun 11, 2015
Provisional Application 62151174 · Apr 22, 2015
Provisional Application 62144293 · Apr 7, 2015
Provisional Application 62108987 · Jan 28, 2015
Related Publication 20250254063A1 · Aug 7, 2025
References Cited (154)
US 6209039B1 · Albright et al. · 2001 [cited by applicant]
US 6502135B1 · Munger et al. · 2002 [cited by applicant]
US 7069318B2 · Burbeck et al. · 2006 [cited by applicant]
US 7551623B1 · Feroz et al. · 2009 [cited by applicant]
US 7587487B1 · Gunturu · 2009 [cited by applicant]
US 7633909B1 · Jones et al. · 2009 [cited by applicant]
US 7801030B1 · Aggarwal et al. · 2010 [cited by applicant]
US 8107363B1 · Saluja · 2012 [cited by applicant]
US 8239915B1 · Satish et al. · 2012 [cited by applicant]
US 8401028B2 · Mihaly et al. · 2013 [cited by applicant]
US 8458786B1 · Kailash et al. · 2013 [cited by applicant]
US 8611335B1 · Wu et al. · 2013 [cited by applicant]
US 8687791B1 · Cordell et al. · 2014 [cited by applicant]
US 8688907B2 · Grube · 2014 [cited by examiner]
US 8788705B2 · Norrman · 2014 [cited by examiner]
US 8843241B2 · Saberi · 2014 [cited by examiner]
US 8854965B1 · Richards · 2014 [cited by applicant]
US 8861331B2 · Abbasi · 2014 [cited by examiner]
US 8891522B2 · Fletcher et al. · 2014 [cited by applicant]
US 8892772B1 · Filsfils · 2014 [cited by examiner]
US 8897130B2 · Matthews et al. · 2014 [cited by applicant]
US 9083748B2 · Monahan · 2015 [cited by examiner]
US 9106610B2 · Floyd, III · 2015 [cited by examiner]
US 9137027B2 · Matthews · 2015 [cited by examiner]
US 9137200B2 · Blau · 2015 [cited by examiner]
US 9220110B2 · Rune · 2015 [cited by examiner]
US 9231851B2 · Chen · 2016 [cited by examiner]
US 9264444B2 · Moore · 2016 [cited by examiner]
US 9288233B2 · Nakae · 2016 [cited by examiner]
US 9294497B1 · Ben-Or et al. · 2016 [cited by applicant]
US 9319332B2 · Thubert · 2016 [cited by examiner]
US 9331951B2 · Vaderna · 2016 [cited by examiner]
US 9338085B2 · Chiang · 2016 [cited by examiner]
US 9338135B2 · Prat et al. · 2016 [cited by applicant]
US 9344955B2 · Hakola · 2016 [cited by examiner]
US 9350635B2 · Vasseur · 2016 [cited by examiner]
US 9444676B2 · Lindem, III · 2016 [cited by examiner]
US 9444823B2 · Narayanan et al. · 2016 [cited by applicant]
US 9450817B1 · Bahadur et al. · 2016 [cited by applicant]
US 9461996B2 · Hayton et al. · 2016 [cited by applicant]
US 9479424B2 · Chunduri · 2016 [cited by examiner]
US 9485323B1 · Stickle · 2016 [cited by examiner]
US 9525696B2 · Kapoor et al. · 2016 [cited by applicant]
US 9565111B2 · Vasseur · 2017 [cited by examiner]
US 9565117B2 · Dahod et al. · 2017 [cited by applicant]
US 9590820B1 · Shukla · 2017 [cited by applicant]
US 9590892B2 · Shah Heydari · 2017 [cited by examiner]
US 9590902B2 · Lin et al. · 2017 [cited by applicant]
US 9609003B1 · Chmielewski et al. · 2017 [cited by applicant]
US 9647952B2 · Williams et al. · 2017 [cited by applicant]
US 9686121B2 · Stickle · 2017 [cited by examiner]
US 9722905B2 · Mermoud · 2017 [cited by examiner]
US 9749910B2 · Park · 2017 [cited by examiner]
US 9779111B2 · Larimore · 2017 [cited by examiner]
US 9807613B2 · Egner et al. · 2017 [cited by applicant]
US 9882804B2 · Thubert · 2018 [cited by examiner]
US 9898317B2 · Nakil et al. · 2018 [cited by applicant]
US 9948649B1 · Zhao et al. · 2018 [cited by applicant]
US 10015141B2 · Grube · 2018 [cited by examiner]
US 10019649B2 · Curington · 2018 [cited by examiner]
US 10061664B2 · Verkaik et al. · 2018 [cited by applicant]
US 10177957B1 · Hankins et al. · 2019 [cited by applicant]
US 10275267B1 · de Kadt et al. · 2019 [cited by applicant]
US 10331472B2 · Wang · 2019 [cited by applicant]
US 10521473B2 · Jin · 2019 [cited by examiner]
US 10587576B2 · Cooper et al. · 2020 [cited by applicant]
US 10684350B2 · Dupray · 2020 [cited by examiner]
US 10789367B2 · Durairaj et al. · 2020 [cited by applicant]
US 11032187B2 · Hassan · 2021 [cited by applicant]
US 11526403B1 · Ruslyakov et al. · 2022 [cited by applicant]
US 20040090972A1 · Barrett et al. · 2004 [cited by applicant]
US 20050180319A1 · Hutnik et al. · 2005 [cited by applicant]
US 20050208926A1 · Hamada · 2005 [cited by applicant]
US 20060031483A1 · Lund et al. · 2006 [cited by applicant]
US 20080240121A1 · Xiong et al. · 2008 [cited by applicant]
US 20090003223A1 · McCallum et al. · 2009 [cited by applicant]
US 20090106569A1 · Roh et al. · 2009 [cited by applicant]
US 20090122990A1 · Gundavelli et al. · 2009 [cited by applicant]
US 20090144443A1 · Vasseur et al. · 2009 [cited by applicant]
US 20090199290A1 · McCullough et al. · 2009 [cited by applicant]
US 20090217109A1 · Sekaran et al. · 2009 [cited by applicant]
US 20090304003A1 · Huynh Van · 2009 [cited by examiner]
US 20100250700A1 · O'Brien et al. · 2010 [cited by applicant]
US 20100275017A1 · Iyer et al. · 2010 [cited by applicant]
US 20100325309A1 · Cicic et al. · 2010 [cited by applicant]
US 20110007652A1 · Bai · 2011 [cited by applicant]
US 20110268435A1 · Mizutani et al. · 2011 [cited by applicant]
US 20120082057A1 · Welin et al. · 2012 [cited by applicant]
US 20130275570A1 · Treuhaft et al. · 2013 [cited by applicant]
US 20130283118A1 · Rayner · 2013 [cited by applicant]
US 20130286835A1 · Plamondon et al. · 2013 [cited by applicant]
US 20130287037A1 · Bush et al. · 2013 [cited by applicant]
US 20130308471A1 · Krzanowski et al. · 2013 [cited by applicant]
US 20130343180A1 · Kini et al. · 2013 [cited by applicant]
US 20140026179A1 · Devarajan et al. · 2014 [cited by applicant]
US 20140071835A1 · Sun et al. · 2014 [cited by applicant]
US 20140108665A1 · Arora et al. · 2014 [cited by applicant]
US 20140199962A1 · Mohammed et al. · 2014 [cited by applicant]
US 20140226456A1 · Khan et al. · 2014 [cited by applicant]
US 20140233577A1 · Hatano · 2014 [cited by examiner]
US 20140269728A1 · Jalan et al. · 2014 [cited by applicant]
US 20140289826A1 · Croome · 2014 [cited by applicant]
US 20140341023A1 · Kim et al. · 2014 [cited by applicant]
US 20140351939A1 · Moore · 2014 [cited by examiner]
US 20140359704A1 · Chen · 2014 [cited by applicant]
US 20140366119A1 · Floyd, III · 2014 [cited by examiner]
US 20150056960A1 · Egner et al. · 2015 [cited by applicant]
US 20150215303A1 · Shigapov · 2015 [cited by applicant]
US 20150271104A1 · Chikkamath et al. · 2015 [cited by applicant]
US 20160048938A1 · Jones et al. · 2016 [cited by applicant]
US 20160134543A1 · Zhang et al. · 2016 [cited by applicant]
US 20160226755A1 · Hammam et al. · 2016 [cited by applicant]
US 20160285977A1 · Ng et al. · 2016 [cited by applicant]
US 20170105142A1 · Hecht et al. · 2017 [cited by applicant]
US 20170230821A1 · Chong et al. · 2017 [cited by applicant]
US 20180024873A1 · Milliron et al. · 2018 [cited by applicant]
AU 2014381693B2 · 2016 [cited by applicant]
CN 1315088A · 2001 [cited by applicant]
CN 1829177A · 2006 [cited by applicant]
CN 102006646A · 2011 [cited by applicant]
CN 102209355A · 2011 [cited by applicant]
CN 102739434A · 2012 [cited by applicant]
WO 2009135411A1 · 2009 [cited by applicant]
WO WO2009146302A1 · 2009 [cited by examiner]
WO 2011088787A1 · 2011 [cited by applicant]
WO 2016073361A1 · 2016 [cited by applicant]
WO WO2017015667A1 · 2017 [cited by examiner]
WO 2018049649A1 · 2018 [cited by applicant]
Gong, L. et al., “Revenue-Driven Virtual Network Embedding Based on Global Resource Information”, Globecom 2013, Next Generation Networking Symposium, pp. 2294-2299, (Year: 2013) (6 pages). [cited by applicant]
Haeri, S. et al., “Global Resource Capacity Algorithm with Path Splitting for Virtual Network Embedding”, 2016 IEEE, pp. 666-669. (Year: 2016) (4 pages). [cited by applicant]
Baumgartner, A., et al., “Mobile core network virtualization: A model for combined virtual core network function placement and topology optimization,” Proceedings of the 2015 1st IEEE Conference on Network Softwarizatio… [cited by applicant]
Chen, Y., et al., “Resilient Virtual Network Service Provision in Network Virtualization Environments,” 2010 IEEE 16th International Conference on Parallel and Distributed Systems, Shanohai, China, 2010, pp. 51-58, doi:… [cited by applicant]
Szeto, W. et al., “A multi-commodity flow based approach to virtual network resource allocation,” GLOBECOM' 03. IEEE Global Telecommunications Conference (IEEE Cat. No. 03CH37489), San Francisco, CA, USA, 2003, pp. 3004… [cited by applicant]
Cisco Systems, Inc.'s Petition for Inter Partes Review of U.S. Pat. No. 10,630,505 dated Feb. 26, 2024, Paper 2 in IPR2024-00497, 82 pages. [cited by applicant]
UMBRA Technologies, Ltd.'s Preliminary Response dated Jun. 27, 2024, Paper 6 in IPR2024-00497, 19 pages. [cited by applicant]
Board's Decision Granting Institution of Inter Partes Review dated Sep. 5, 2024, Paper 9 in IPR2024-00497, 31 pages. [cited by applicant]
Patent Owner's Request for Director Review of Panel Decision Granting Institution dated Sep. 19, 2024, Paper 13 in IPR2024-00497, 13 pages. [cited by applicant]
Board's Order Denying Request for Director Review dated Dec. 3, 2024, Paper 20 in IPR2024-00497, 3 pages. [cited by applicant]
UMBRA Technologies, Ltd.'s Response dated Dec. 11, 2024, Paper 21 in IPR2024-00497, 25 pages. [cited by applicant]
Declaration of Dr. AL. Narasimha Reddy dated Feb. 25, 2024, Ex. 1003 in IPR2024-00497, 105 pages. [cited by applicant]
Mockapetris, P., Domain Names—Concepts and Facilities, ISi, Nov. 1987, Ex. 1008 in I PR2024-00497, 55 pages. [cited by applicant]
Awduche, D., et al., “Requirements for Traffic Engineering Over MPLS”, Network Working Group RFC 2702, Sep. 1999, 29 pages. [cited by applicant]
Peterson, L. & Davie, B., Computer Networks—A Systems Approach, Second Edition, 2000, Ex. 1011 in IPR2024-00497, 61 pages. [cited by applicant]
Deposition Transcript of Dr. AL. Narasimha Reddy dated Nov. 13, 2024, Ex. 2001 in IPR2024-00497, 28 pages. [cited by applicant]
Declaration of Dr. Micah Beck dated Dec. 11, 2024, Ex. 2002 in I PR2024-00497, 13 pages. [cited by applicant]
Deposition Transcript of Dr. AL. Narasimha Reddy dated Mar. 13, 2025, Ex. 2003 in IPR2024-00497, 31 pages. [cited by applicant]
Supplemental Declaration of Dr. AL. Narasimha Reddy dated Feb. 18, 2025, Ex. 1012 in IPR2024-00497, 11 pages. [cited by applicant]
Patent Owner's Demonstratives, for Oral Argument Hearing, dated Jun. 3, 2025, in IPR2024-00497, 82 pages. [cited by applicant]
Oral Hearing Transcript for hearing held Jun. 4, 2025 in IPR2024-00497, dated Jul. 9, 2025, 44 pages. [cited by applicant]
Patent Owner's Sur-Reply, dated Apr. 4, 2025 in IPR2024-00497, 29 pages. [cited by applicant]
Awduche, D., et al., “RSVP-TE: Extensions to RSVP for LSP Tunnels”, Network Working Group RFC 3209, Dec. 2001, 61 pages. [cited by applicant]
Katz, D., et al., “Traffic Engineering Extensions (TE) Extensions to OSPF Version 2”, Network Working Group RFC 3630, Sep. 2003, 14 pages. [cited by applicant]
Ishiguro, K., et al., “Traffic Engineering Extensions to OSPF Version 3”, Network Working Group RFC 5329, Sep. 2008, 12 pages. [cited by applicant]
Giacalone, S., et al., “OSPF Traffic Engineering (TE) Metric Extensions”, Network Working Group RFC 7471, Mar. 2015, 19 pages. [cited by applicant]