DISTRIBUTED PROCESSING FOR DETERMINING NETWORK PATHS
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.
1 - 20 . (canceled)
21 . A computer-implemented method comprising:
receiving, from a computing device, at a first cellular base station, a request for edge-based computing, wherein:
the first cellular base station is collocated with a first edge-based data center,
the request is received on a first network to which a plurality of cellular base stations are connected,
the request is received wirelessly from the computing device by the first cellular base station, and
the first edge-based data center is connected to a second network of a plurality of edge-based data centers, including the first edge-based data center;
determining that a network path generation condition is satisfied;
determining, based on the satisfaction of the network path generation condition, a path on the second network to a second edge-based data center of the plurality of edge-based data centers; and
causing the request to be conveyed via the path to the second edge-based data center.
22 . The method of claim 21 , wherein the determining that the network path generation condition is satisfied comprises determining that a network path has become inaccessible.
23 . The method of claim 21 , wherein the determining that the network path generation condition is satisfied comprises determining that a new edge-based data center has been added to the second network.
24 . The method of claim 21 , wherein the determining that the network path generation condition is satisfied comprises determining that a computational limit of the first edge-based data center has been exceeded.
25 . The method of claim 21 , wherein the determining that the network path generation condition is satisfied comprises:
obtaining a geolocation of the computing device; and
determining an anticipated cellular base station of the plurality of cellular base stations that is predicted to receive data from the computing device after a handoff operation.
26 . The method of claim 25 , wherein the anticipated cellular base station is determined at least in part based on a predicted route of the computing device.
27 . The method of claim 26 , further comprising steps for predicting the predicted route of the computing device.
28 . The method of claim 21 , wherein the determining that the network path generation condition is satisfied comprises determining that a recurring time condition is satisfied.
29 . The method of claim 21 , further comprising:
based on the request being conveyed to the second edge-based data center, analyzing, with the second edge-based data center, sensor data of the computing device.
30 . The method of claim 29 , wherein the computing device is a mobile device.
31 . The method of claim 29 , wherein a self-driving car comprises the computing device.
32 . The method of claim 31 , further comprising:
instructing actuators of the self-driving car to adjust based on the analysis of the sensor data of the computing device.
33 . The method of claim 21 , wherein the second edge-based data center is selected from the plurality of edge-based data centers for network path generation based on telemetry of each of the plurality of edge-based data centers.
34 . The method of claim 33 , wherein the telemetry is obtained from advertised performance metric values provided by each of the edge-based data centers.
35 . The method of claim 34 , comprising steps for advertising performance metric values.
36 . The method of claim 21 , wherein the second network is a backhaul network.
37 . The method of claim 21 , wherein the second network is a cross haul network.
38 . The method of claim 21 , comprising:
advertising performance metric values of the plurality of edge-based data centers;
rendering at least some of the advertised performance metric values tamper evident with a tamper-evident data structure; and
selecting the second edge-based data structure for network path generation based on the advertised performance metric values.
39 . The method of claim 21 , comprising:
servicing the request with a distributed application executed on more than one of the plurality of edge-based data centers.
40 . A tangible, non-transitory, machine-readable medium storing instructions that when executed by a computer system effectuate operations comprising:
receiving, from a computing device, at a first cellular base station, a request for edge-based computing, wherein:
the first cellular base station is collocated with a first edge-based data center,
the request is received on a first network to which a plurality of cellular base stations are connected,
the request is received wirelessly from the computing device by the first cellular base station, and
the first edge-based data center is connected to a second network of a plurality of edge-based data centers, including the first edge-based data center;
determining that a network path generation condition is satisfied;
determining, based on the satisfaction of the network path generation condition, a path on the second network to a second edge-based data center of the plurality of edge-based data centers; and
causing the request to be conveyed via the path to the second edge-based data center.