Route auditing for physical internet container routing

1. A method for self-audited routing of a shipping container comprising:

acquiring a contemporaneous location of a shipping container within location based circuitry of a computing device affixed to the shipping container;

retrieving from memory of the computing device affixed to the shipping container, an expected node and a destination node from a sequence of nodes in a path from an origin node of the shipping container, to the destination node;

comparing in the memory of the computing device, the contemporaneous location to a location of the expected node;

on condition that the contemporaneous location is not within a threshold distance of the location of the expected node, transmitting a message from the computing device over a wireless computer communications network to a remotely disposed computing client indicating a fault in routing of the shipping container to the destination node, querying a datastore of known nodes with the contemporaneous location, receiving in response to the querying an indication of a corresponding node, computing a path of one or more nodes from the corresponding node to the destination node, storing a next one of the nodes of the path as a next expected node in the memory of the computing device, and including in the message an indication of a re-routing of the shipping container along the computed path.

2. The method of claim 1 , further comprising:

computing in the memory of the computing device, a time when the shipping container will arrive at the destination node utilizing the computed path, and

performing the re-routing on further condition that that the determined time is within a threshold value of a pre-specified time of arrival of the shipping container stored in the memory of the computing device affixed to the shipping container.

3. The method of claim 1 , further comprising:

wherein the corresponding node is a most recent node at which the shipping container had been positioned as a next expected node in the memory of the computing device and including in the message an indication of a re-routing of the shipping container to return to the most recent node.

4. The method of claim 1 , further comprising, on condition that the contemporaneous location is within a threshold distance of the location of the expected node and the expected node is the destination node, transmitting a message from the computing device over a wireless computer communications network to a remotely disposed computing client indicating a completion of the routing of the shipping container to the destination node.

5. The method of claim 4 , further comprising, including in the message indicating the completion of the routing, a list of each node through which the container had passed from the origin node to the destination node and an amount of time during which the container had been present at each of the nodes in the log.

6. A data processing system configured for self-audited routing of a shipping container, the system comprising:

a host computing device adapted for affixation to a shipping container, the device comprising at least one processor, memory and wireless communications circuitry; and,

a route self-auditing module comprising computer program instructions that, during execution in the host computing device perform:

acquiring a contemporaneous location of a shipping container within location based circuitry of a computing device affixed to the shipping container;

retrieving from memory of the computing device affixed to the shipping container, an expected node and a destination node from a sequence of nodes in a path from an origin node of the shipping container, to the destination node;

comparing in the memory of the computing device, the contemporaneous location to a location of the expected node; and,

on condition that the contemporaneous location is not within a threshold distance of the location of the expected node, transmitting a message from the computing device over a wireless computer communications network to a remotely disposed computing client indicating a fault in routing of the shipping container to the destination node, querying a datastore of known nodes with the contemporaneous location, receiving in response to the querying an indication of a corresponding node, computing a path of one or more nodes from the corresponding node to the destination node, storing a next one of the nodes of the path as a next expected node in the memory of the computing device, and including in the message an indication of a re-routing of the shipping container along the computed path.

7. The system of claim 6 , wherein the program instructions further perform:

computing in the memory of the computing device, a time when the shipping container will arrive at the destination node utilizing the computed path, and

performing the re-routing on further condition that that the determined time is within a threshold value of a pre-specified time of arrival of the shipping container stored in the memory of the computing device affixed to the shipping container.

8. The system of claim 6 , wherein the program instructions further perform:

wherein the corresponding node is a most recent node at which the shipping container had been positioned as a next expected node in the memory of the computing device and including in the message an indication of a re-routing of the shipping container to return to the most recent node.

9. The system of claim 6 , wherein the program instructions further perform, on condition that the contemporaneous location is within a threshold distance of the location of the expected node and the expected node is the destination node, transmitting a message from the computing device over a wireless computer communications network to a remotely disposed computing client indicating a completion of the routing of the shipping container to the destination node.

10. The system of claim 9 , wherein the program instructions further perform, including in the message indicating the completion of the routing, a list of each node through which the container had passed from the origin node to the destination node and an amount of time during which the container had been present at each of the nodes in the log.

11. A computer program product for self-audited routing of a shipping container, the computer program product including a non-transitory computer readable storage medium having program instructions embodied therewith, the program instructions executable by a device to cause the device to perform a method including:

acquiring a contemporaneous location of a shipping container within location based circuitry of a computing device affixed to the shipping container;

retrieving from memory of the computing device affixed to the shipping container, an expected node and a destination node from a sequence of nodes in a path from an origin node of the shipping container, to the destination node;

comparing in the memory of the computing device, the contemporaneous location to a location of the expected node; and,

on condition that the contemporaneous location is not within a threshold distance of the location of the expected node, transmitting a message from the computing device over a wireless computer communications network to a remotely disposed computing client indicating a fault in routing of the shipping container to the destination node, querying a datastore of known nodes with the contemporaneous location, receiving in response to the querying an indication of a corresponding node, computing a path of one or more nodes from the corresponding node to the destination node, storing a next one of the nodes of the path as a next expected node in the memory of the computing device, and including in the message an indication of a re-routing of the shipping container along the computed path.

12. The computer program product of claim 11 , wherein the method further includes:

computing in the memory of the computing device, a time when the shipping container will arrive at the destination node utilizing the computed path, and

performing the re-routing on further condition that that the determined time is within a threshold value of a pre-specified time of arrival of the shipping container stored in the memory of the computing device affixed to the shipping container.

13. The computer program product of claim 11 , wherein the method further includes:

wherein the corresponding node is a most recent node at which the shipping container had been positioned as a next expected node in the memory of the computing device and including in the message an indication of a re-routing of the shipping container to return to the most recent node.

14. The computer program product of claim 11 , wherein the method further includes, on condition that the contemporaneous location is within a threshold distance of the location of the expected node and the expected node is the destination node, transmitting a message from the computing device over a wireless computer communications network to a remotely disposed computing client indicating a completion of the routing of the shipping container to the destination node.

15. The computer program product of claim 14 , wherein the method further includes, including in the message indicating the completion of the routing, a list of each node through which the container had passed from the origin node to the destination node and an amount of time during which the container had been present at each of the nodes in the log.