DISTRIBUTED PROCESSING FOR DETERMINING NETWORK PATHS

• US 20190373521A1
• Filed: 08/20/2019
• Published: 12/05/2019
• Est. Priority Date: 04/07/2017
• Status: Active Grant

• Current Assignee: Vapor Corp.
• Original Assignee: Vapor Corp.
• Inventors: Crawford, Colton Malone
• Granted Patent: US 10,945,166 B2
• Time in Patent Office: Days
• CPC Class Codes: G06F 16/27 Replication, distribution or synchronisation of data between databases or within a distributed database system; Distributed database system architectures therefor
• CPC Class Codes: G06F 16/9024 Graphs; Linked lists G06F16/9027 takes precedence
• CPC Class Codes: H04L 2209/80 Wireless network architectures or network communication protocols for wireless network security H04W12/00
• CPC Class Codes: H04L 67/10 in which an application is distributed across nodes in the network software deployment G06F8/60; multiprogramming arrangements G06F9/46
• CPC Class Codes: H04L 67/104 Peer-to-peer [P2P] networks
• CPC Class Codes: H04L 67/1065 Discovery involving distributed pre-established resource-based relationships among peers, e.g. based on distributed hash tables [DHT] pre-configuration of logical or physical connections H04L67/1053
• CPC Class Codes: H04L 67/12 specially adapted for proprietary or special-purpose networking environments, e.g. medical networks, sensor networks, networks in vehicles or remote metering networks
• CPC Class Codes: H04L 67/146 Markers for unambiguous identification of a particular session, e.g. session cookie or URL-encoding
• CPC Class Codes: H04L 67/148 Migration or transfer of sessions
• CPC Class Codes: H04L 67/52 specially adapted for the location of the user terminal
• CPC Class Codes: H04L 69/40 for recovering from a failure of a protocol instance or entity, e.g. service redundancy protocols, protocol state redundancy or protocol service redirection management of faults, events, alarms or notifications in data switching networks H04L41/06
• CPC Class Codes: H04L 9/0643 Hash functions, e.g. MD5, SHA, HMAC or f9 MAC
• CPC Class Codes: H04L 9/3236 using cryptographic hash functions
• CPC Class Codes: H04L 9/3239 involving non-keyed hash functions, e.g. modification detection codes [MDCs], MD5, SHA or RIPEMD
• CPC Class Codes: H04L 9/50 using hash chains, e.g. blockchains or hash trees
• CPC Class Codes: H04W 36/0083 Determination of parameters used for hand-off, e.g. generation or modification of neighbour cell lists
• CPC Class Codes: H04W 36/008355 Determination of target cell based on user equipment [UE] properties, e.g. UE service capabilities
• CPC Class Codes: H04W 36/00837 Determination of triggering parameters for hand-off

Abstract

Provided is a process including: advertising a plurality of values corresponding to computing components to peer nodes of a peer-to-peer network; storing the plurality of values in a tamper-evident, distributed ledger; determining a target data center in the distributed computing environment, wherein the target data center performs computations based on data sent from a mobile computing device, and wherein the target data center executes a peer node of the peer-to-peer network; determining a network path that is linked to the target data center based on a distance to the target data center; and transferring a packet from the target data center, wherein the packet traverses the network path and comprises one or more computation results from the target data center.

Claims

1. A tangible, non-transitory, machine-readable medium storing instructions that when executed by one or more processors effectuate operations comprising:

advertising, with a computer system, a plurality of values corresponding to computing components to peer nodes of a peer-to-peer network;

storing, with the computer system, the plurality of values in a tamper-evident, distributed ledger encoding records of a plurality of previous values in a directed acyclic graph of cryptographic hash pointers, wherein the tamper-evident, distributed ledger is stored on the peer-to-peer network;

determining, with the computer system, a target data center among a plurality of geographically distributed candidate data centers, wherein the target data center performs computations based on data sent from a mobile computing device, and wherein the target data center executes a peer node of the peer-to-peer network;

determining, with the computer system, a network path that is linked to the target data center based on a distance to the target data center, wherein the distance value is determined based on from the plurality of values stored in the tamper-evident, distributed ledger; and

transferring, with the computer system, a packet from the target data center, wherein the packet traverses the network path and comprises one or more computation results from the target data center.

2. The medium of claim 1, wherein:

the peer-to-peer network is an ad hoc peer-to-peer network of untrusted computing devices;

a plurality of peers on the peer-to-peer network are identified by a unique identifier based on a respective public key of an asymmetric encryption protocol; and

wherein at least one link in the network path is authenticated by peers cryptographically signing a message with a private cryptographic key corresponding to the public cryptographic key; and

a routing table accessible to the peer-to-peer network stores the link of the network path.

3. The medium of claim 1, further comprising storing a target data center identifier and a measure of utilization of the target data center in the tamper-evident, distributed ledger.

4. The medium of claim 3, wherein the operations further comprise calling a distributed application program interface (API) with an invocation of a smart contract on the peer-to-peer network, wherein operations to execute the smart contract comprise:

storing an entity identifier associated with an entity causing an invocation of the distributed API; and

wherein the entity identifier is associated with the utilization of the target data center.

5. The medium of claim 1, wherein the operations further comprise determining whether the distributed, tamper-evident ledger shows evidence of tampering based on a comparison of a hash value stored in a first block with a hash value stored in a second block, wherein the first block corresponds with a first time point stored in a local version of a blockchain of a first peer computing node, and wherein the second block corresponds with a second time point stored in a local version of a blockchain of a second peer computing node.

6. The medium of claim 1, wherein the operations to determine the target data center comprise:

invoking a smart contract being executed on the peer-to-peer network, wherein a criterion encoded in the smart contract comprises at least one of a latency threshold or a bandwidth threshold;

performing a comparison of a performance metric value stored in the distributed, tamper-evident ledger with the criterion; and

selecting the data center corresponding with the performance metric value as the target data center.

7. The medium of claim 1, the operations further comprising:

a distributed application being executed on the peer-to-peer network determines one or more parameters of a handoff of a wireless data session from a first base station to a second base station such that the mobile computing device continues the wireless data session with the second base station after the handoff;

a first data center hosting peer nodes in the peer-to-peer network is used to compute results based on data from the mobile computing device before the handoff;

the operations further comprise determining that the first data center is used to compute results based on data from the mobile computing device after the handoff; and

the second base station is at a first end of the network path and the first data center is at a second end of the network path.

8. The medium of claim 1, wherein:

a distributed application being executed on the peer-to-peer network determines one or more parameters of a handoff of a wireless data session from a first base station to a second base station such that the mobile computing device continues the wireless data session with the second base station after the handoff;

a first data center hosting peer nodes in the peer-to-peer network is used to compute results based on data from the mobile computing device before the handoff and a second data center hosting peer nodes in the peer-to-peer network is used to compute results based on data from the mobile computing device after the handoff;

the first data center is at a first end of the network path and the second data center is at a second end of the network path; and

the operations further comprise transferring program state for a dynamic federated cluster that moves with the mobile computing device onto the second data center.

9. The medium of claim 1, wherein the plurality of values comprise at least one of an encoding, available bandwidth, broadcast range or strength, available wireless spectrum, quality of service, signal-to-noise-ratio, signal-to-interference-plus-noise ratio, system temperature, cooling equipment status, available number of flops, available amount of random access memory, number of linked computing components, or identifier of a linked computing component.

10. The medium of claim 1, wherein generating the network path comprises using multipath routing to determine a plurality of network paths, wherein each of the plurality of network paths share a first end and a second end.

11. The medium of claim 1, wherein the network path is a first network path, and wherein the operations further comprise:

determining an anticipated base station that is predicted to receive signals the mobile computing device based on a geolocation of the mobile computing device; and

generating a second network path, wherein the second network path includes a link to the anticipated base station.

12. The medium of claim 1, wherein the operations further comprise:

determining that a computation based on data from the mobile computing device is permitted by a candidate data center is based on an identifier communicated by a request; and

setting the candidate data center as the target data center.

13. The medium of claim 1, the operations comprising:

obtaining, with one or more processors, a distributed-application address of a distributed application being executed on the peer-to-peer network, wherein

the distributed-application address is a cryptographic hash value that uniquely identifies the distributed application among a plurality of distributed applications executable on the peer nodes, and wherein

the distributed application is accessible via one or more of the peer nodes identified by entries in a distributed hash table linked to a key value in the distributed hash table corresponding to the distributed-application address; and

calling a distributed application program interface of the distributed application with a request to generate the network path.

14. The medium of claim 1, the wherein the operations further comprise:

determining that a link in the network path has become inaccessible; and

in response to this determination, generating a second network path that does not include the inaccessible link.

15. The medium of claim 1, wherein the network path is a first network path, and wherein the target data center is a first target data center, and wherein the operations further comprise:

receiving a request based on additional data gathered by the mobile computing device, wherein a second target data center provides computations for the additional data, wherein the second target data center is different from the first target data center;

generating a second network path based on the request; and

transferring at least one packet from the second target data center to the mobile computing device via the second network path.

16. The medium of claim 1, wherein the operations further comprise:

determining that no network path is available to meet a requirement of a request to determine a network path; and

determining the network path based on a comparison between a first cost and a second cost, wherein the first cost is based on a first performance metric value, and wherein the second cost is based on a second performance metric value, and wherein the first performance metric value and the second performance metric value are both part of the plurality of values stored in the distributed, tamper-evident ledger.

17. The medium of claim 1, wherein the operations further comprise:

steps for generating the network path in the distributed computing environment; and

steps for storing the plurality of values in the tamper-evident, distributed ledger.

18. The medium of claim 1, wherein the operations further comprise generating an indicator signal and transmitting the indicator signal to the mobile computing device, wherein the indicator signal indicates a performance decrease.

19. The medium of claim 1, wherein the network path is a first network path, and wherein the target data center is a first target data center, and wherein the operations further comprise:

determining that a computational limit of the first target data center of the network path is exceeded by a set of computations being performed by the first target data center;

selecting a second target data center to perform computations based on the computational limit being exceeded; and

generating a second network path, wherein the second network path includes a link to the second target data center.

20. A method, comprising:

advertising, with a computer system, a plurality of values corresponding to computing components to peer nodes of a peer-to-peer network;

storing, with the computer system, the plurality of values in a tamper-evident, distributed ledger encoding records of a plurality of previous values in a directed acyclic graph of cryptographic hash pointers, wherein the tamper-evident, distributed ledger is stored on the peer-to-peer network;

determining, with the computer system, a target data center among a plurality of geographically distributed candidate data centers, wherein the target data center performs computations based on data sent from a mobile computing device, and wherein the target data center executes a peer node of the peer-to-peer network;

determining, with the computer system, a network path that is linked to the target data center based on a distance to the target data center, wherein the distance value is determined based on from the plurality of values stored in the tamper-evident, distributed ledger; and

transferring, with the computer system, a packet from the target data center, wherein the packet traverses the network path and comprises one or more computation results from the target data center.

21. A tangible, non-transitory, machine-readable medium storing instructions that when executed by one or more processors effectuate operations comprising:

advertising, with a computer system, capabilities of computing components to peer nodes of a peer-to-peer network by storing, with the computer system, the advertised capabilities of computing components in a tamper-evident, distributed ledger stored on the peer-to-peer network;

determining, with the computer system, based on the advertised capabilities, a target data center among a plurality of geographically distributed candidate data centers, wherein the geographically distributed candidate data centers execute a peer nodes of the peer-to-peer network;

transferring, to the target data center, from a previous data center among the geographically distributed candidate data centers, via a fiber side-haul connection, state of a distributed application executing on the peer-to-peer network; and

based on the transferred state and data wirelessly streamed from a mobile computing device to the target data center, executing a computing load of the mobile computing device with the target data center.

22. The medium of claim 21, wherein:

the advertised capabilities include ports accessible in the target data center, speed of the ports, a number of potential adjacent peer nodes of the target data center for peering, an actual number of adjacent peer nodes of the target data center for peering, and a gateway protocol settlement status.

23. The medium of claim 21, wherein the operations comprise:

determining a network route between the mobile computing device and the target datacenter based on the advertised capabilities stored in the distributed ledger.