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. A computer-implemented method of locally cross-connecting networks in edge-computing environments, the method comprising:
receiving, at a first cellular base station co-located with a first edge-based data center, a request for edge-based computing from a mobile computing device, wherein:
the request is received on a first network including a plurality of other geographically-distributed cellular base stations in a metropolitan area,
the request is sent wirelessly from the first mobile computing device to the first cellular base station, and
the first edge-based data center is on a second network of a plurality of geographically-distributed edge-based data centers, including the first edge-based data center, in the metropolitan area;
cross-connecting, at the first edge-based data center, the first network to the second network by operation of software executed at the first edge-based data center and determining a path on the second network to computing resources at the first edge-based data center;
determining, with the first edge-based data center, a path on the second network to computing resources to service the request at one of the plurality of geographically-distributed edge-based data centers; and
causing the request to be conveyed via the path to the computing resources.
2. The method of claim 1 , wherein:
cross-connecting is performed without requiring the request be sent to a mobile switching center of the first network.
3. The method of claim 1 , wherein:
determining the path is performed without requiring the request be sent to a mobile switching center of the first network.
4. The method of claim 1 , wherein determining the path comprises selecting one of the plurality of edge-based centers to service the request.
5. The method of claim 4 , wherein selecting one of the plurality of edge-based centers comprises:
obtaining, at the first edge-based data center, telemetry of the plurality of edge-based data centers;
selecting, at the first edge-based data center, the selected one of the plurality of edge-based centers.
6. The method of claim 5 , wherein obtaining telemetry comprises each of the plurality of edge-based data centers advertising performance metric values.
7. The method of claim 6 , wherein obtaining telemetry comprises steps for advertising performance metric values.
8. The method of claim 4 , wherein selecting one of the plurality of edge-based centers comprises selecting a second edge-based data center among the plurality of edge-based data centers.
9. The method of claim 4 , wherein selecting one of the plurality of edge-based centers comprises:
obtaining, at the first edge-based data center:
first values indicative of processor utilization of other edge-based data centers among the plurality of edge-based data centers, and
second values indicative of memory utilization of other edge-based data centers among the plurality of edge-based data centers; and
selecting based on the first values and the second values.
10. The method of claim 4 , wherein selecting one of the plurality of edge-based centers comprises selecting based on a measure of expected latency in at least part of servicing the request.
11. The method of claim 1 , wherein the second network is a backhaul network.
12. The method of claim 1 , wherein the second network is a crosshaul network.
13. The method of claim 1 , wherein cross-connecting comprises cross-connecting in real-time by reconfiguring the path in response to a real-time event.
14. The method of claim 1 , comprising:
advertising performance metric values; and
rendering at least some of the advertised performance metric values tamper evident with a tamper-evident data structure.
15. The method of claim 1 , comprising:
effectuating the cross-connecting with a smart contract configured to write a record documenting the cross-connecting to a directed acyclic graph of cryptographic hash pointers.
16. The method of claim 1 , comprising:
servicing a first part of a workload at least partially specified by the request at the first edge-based data center; and
servicing a second part of the workload at a second edge-based data center among the plurality of edge-based data centers.
17. The method of claim 1 , wherein:
determining the path comprises steps for determining the path.
18. The method of claim 1 , comprising:
performing steps for determining new network paths.
19. The method of claim 1 , comprising:
servicing the request with a distributed application executed on more than one of the plurality of edge-based data centers.
20. A tangible, non-transitory, machine-readable medium storing instructions that when executed by a computer system effectuate operations comprising:
receiving, at a first cellular base station co-located with a first edge-based data center, a request for edge-based computing from a mobile computing device, wherein:
the request is received on a first network including a plurality of other geographically-distributed cellular base stations in a metropolitan area,
the request is sent wirelessly from the first mobile computing device to the first cellular base station, and
the first edge-based data center is on a second network of a plurality of geographically-distributed edge-based data centers, including the first edge-based data center, in the metropolitan area;
cross-connecting, at the first edge-based data center, the first network to the second network by operation of software executed at the first edge-based data center and determining a path on the second network to computing resources at the first edge-based data center;
determining, with the first edge-based data center, a path on the second network to computing resources to service the request at one of the plurality of geographically-distributed edge-based data centers; and
causing the request to be conveyed via the path to the computing resources.
21. The medium of claim 20 , wherein:
cross-connecting is performed without requiring the request be sent to a mobile switching center of the first network.
22. The medium of claim 20 , wherein:
determining the path is performed without requiring the request be sent to a mobile switching center of the first network.
23. The medium of claim 20 , wherein determining the path comprises selecting one of the plurality of edge-based centers to service the request.
24. The medium of claim 23 , wherein selecting one of the plurality of edge-based centers comprises:
obtaining, at the first edge-based data center, telemetry of the plurality of edge-based data centers;
selecting, at the first edge-based data center, the selected one of the plurality of edge-based centers.
25. The medium of claim 24 , wherein obtaining telemetry comprises each of the plurality of edge-based data centers advertising performance metric values.
26. The medium of claim 25 , wherein obtaining telemetry comprises steps for advertising performance metric values.
27. The medium of claim 23 , wherein selecting one of the plurality of edge-based centers comprises selecting a second edge-based data center among the plurality of edge-based data centers.
28. The medium of claim 23 , wherein selecting one of the plurality of edge-based centers comprises:
obtaining, at the first edge-based data center:
first values indicative of processor utilization of other edge-based data centers among the plurality of edge-based data centers, and
second values indicative of memory utilization of other edge-based data centers among the plurality of edge-based data centers; and
selecting based on the first values and the second values.
29. The medium of claim 23 , wherein selecting one of the plurality of edge-based centers comprises selecting based on a measure of expected latency in at least part of servicing the request.
30. The medium of claim 20 , wherein the second network is a backhaul network.
31. The medium of claim 20 , wherein the second network is a crosshaul network.
32. The medium of claim 20 , wherein cross-connecting comprises cross-connecting in real-time by reconfiguring the path in response to a real-time event.
33. The medium of claim 20 , the operations further comprising:
advertising performance metric values; and
rendering at least some of the advertised performance metric values tamper evident with a tamper-evident data structure.
34. The medium of claim 20 , the operations further comprising:
effectuating the cross-connecting with a smart contract configured to write a record documenting the cross-connecting to a directed acyclic graph of cryptographic hash pointers.
35. The medium of claim 20 , the operations further comprising:
servicing a first part of a workload at least partially specified by the request at the first edge-based data center; and
servicing a second part of the workload at a second edge-based data center among the plurality of edge-based data centers.
36. The medium of claim 20 , wherein:
determining the path comprises steps for determining the path.
37. The medium of claim 20 , the operations further comprising:
performing steps for determining new network paths.
38. The medium of claim 20 , the operations further comprising:
servicing the request with a distributed application executed on more than one of the plurality of edge-based data centers.