Reduced forwarding rules for aerospace net work nodes

1. A method comprising,

receiving location information from each of a plurality of nodes in a network, the plurality of nodes including at least one node that is moving relative to another node of the network;

converting the received location information for each node into a corresponding network address, the corresponding network address being based on a hierarchical cell-based partitioning scheme;

identifying, by one or more processors of a network controller, a target region for a given node of the network based on a plurality of routing paths, the target region encompassing two or more nodes in the network that are next hops for the given node and that have a common segment in the corresponding network addresses, wherein the two or more nodes in the target region include a moving node;

sending, by the one or more processors of the network controller, one or more forwarding rules to one or more nodes in the network, the one or more forwarding rules including the common segment to identify the next hops for the given node;

receiving new location information for the moving node;

determining a new network address for the moving node based on the new location information; and

when the new network address does not have the common segment, sending, by the one or more processors of the network controller, the new network address to the moving node.

2. The method of claim 1 , wherein the hierarchical cell-based partitioning scheme is based on a spherical geometry library.

3. The method of claim 1 , wherein the converting of the received location information for each node includes:

for each node of the plurality of nodes, projecting a location of the node into a model of the Earth and a cube encapsulating the Earth using the location information from the node, the cube encapsulating the Earth being partitioned using the hierarchical cell-based partitioning scheme into a plurality of cells; and

determining the corresponding network address for the location of the node based on a given cell of the plurality of cells in which the projected location falls.

4. The method of claim 3 , wherein the corresponding network address includes a segment of a cell identifier of the given cell.

5. The method of claim 1 , wherein the converting of the received location information for each node includes retrieving, from a database, a cell identifier that corresponds with a location of the node based on the received location information, the cell identifier being derived from the hierarchical cell-based partitioning scheme.

6. The method of claim 1 , wherein the identifying the target region includes generating a network configuration for the network for the plurality of routing paths.

7. The method of claim 1 , further comprising sending, by the one or more processors of the network controller, the corresponding network address to each node of the plurality of nodes in the network.

8. The method of claim 1 , further comprising:

determining, by the one or more processors of the network controller, a routing path through the network based on the location information of the plurality of nodes, the routing path identifying a source node and a plurality of next hops; and

wherein the sending of the one or more forwarding rules includes sending instructions to the source node for encapsulating the plurality of next hops in a header of a packet for segment routing along the routing path.

9. A network controller for a network, the network including at least one node that is moving relative to another node, the network controller comprising:

one or more processors configured to:

receive location information from each of a plurality of nodes in the network;

convert the received location information for each node into a corresponding network address, the corresponding network address being based on a hierarchical cell-based partitioning scheme;

identify a target region for a given node in the network based on a plurality of routing paths, the target region encompassing two or more nodes in the network and that are next hops for the given node that have a common segment in the corresponding network addresses, wherein the two or more nodes in the target region include a moving node;

send one or more forwarding rules to the one or more nodes in the network, the one or more forwarding rules including the common segment to identify the next hops for the given node;

receive new location information for the moving node;

determine a new network address for the moving node based on the new location information; and

when the new network address does not have the common segment, send the new network address to the moving node.

10. The network controller of claim 9 , wherein the hierarchical cell-based partitioning scheme is based on spherical geometry library.

11. The network controller of claim 9 , wherein the one or more processors are further configured to convert the received location information for each node based on a location of a node in a model of the Earth, wherein the model of the Earth includes a cube encapsulating the Earth that is partitioned using the hierarchical cell-based partitioning scheme into a plurality of cells.

12. The network controller of claim 11 , wherein the corresponding network address includes a segment of a cell identifier of one of the plurality of cells in which the node is located in the model of the Earth.

13. The network controller of claim 9 , wherein the one or more processors are configured to convert the received location information for each node based on a database on which are stored a cell identifier that corresponds with a location of the node, the cell identifier being derived from the hierarchical cell-based partitioning scheme.

14. The network controller of claim 9 , wherein the one or more processors are further configured to generate a network configuration for the network for the plurality of routing paths.

15. The network controller of claim 9 , wherein the one or more processors are further configured to send the corresponding network address to each node of the plurality of nodes in the network.

16. The network controller of claim 9 , wherein the one or more processors are further configured to:

determine a routing path through the network based on the location information of the plurality of nodes, the routing path identifying a source node and a plurality of next hops; and

wherein the one or more forwarding rules includes instructions to the source node for encapsulating the plurality of next hops in a header of a packet for segment routing along the routing path.

17. A tangible, non-transitory computer-readable storage medium configured to store instructions, the instructions, when executed by one or more processors, cause the one or more processors to perform a method, the method comprising:

receiving location information from each of a plurality of nodes in a network, the plurality of nodes including at least one node that is moving relative to another node of the network;

converting the received location information for each node into a corresponding network address, the corresponding network address being based on a hierarchical cell-based partitioning scheme;

identifying a target region for a given node in the network based on a plurality of routing paths, the target region encompassing two or more nodes in the network that are next hops for the given node and that have a common segment in the corresponding network addresses, wherein the two or more nodes in the target region include a moving node; and

sending one or more forwarding rules to one or more nodes in the network, the one or more forwarding rules including the common segment to identify the next hop for the given node;

receiving new location information for the moving node;

determining a new network address for the moving node based on the new location information; and

when the new network address does not have the common segment, sending the new network address to the moving node.

18. The medium of claim 17 , wherein the hierarchical cell-based partitioning scheme is based on a spherical geometry library.