Digraph network superframes
View Patent ↗A method of assigning cells in a superframe using digraph link information in a network of nodes is disclosed. The method comprises determining a total number of desired digraph links in the network of nodes wherein a digraph link is a directional link specifying routing information at each node in the network between said node and a second node, and wherein the network of nodes includes a plurality of nodes each with a plurality of digraph links. The method further comprises selecting a superframe size at least large enough to accommodate the total number of desired digraph links and assigning each desired digraph link to a cell in the superframe wherein each cell in the superframe specifies a synchronized time and frequency communication plan.
1. A method of assigning cells in a superframe using digraph link information in a network of nodes comprising:
determining a total number of desired digraph links in a network of nodes wherein a digraph link is a directional link specifying routing information at a first node between the first node and a second node, and wherein the network of nodes includes a plurality of nodes each with a plurality of digraph links;
selecting a superframe size at least large enough to accommodate the total number of desired digraph links; and
assigning each desired digraph link to a cell in the superframe wherein each cell in the superframe specifies a synchronized time and frequency communication plan.
2. A method as recited in claim 1 , wherein the cells assigned to certain of the desired digraph links are selected to reduce packet transmission time latency for messages to a gateway.
3. A method as recited in claim 1 , wherein certain desired digraph links are assigned to a plurality of cells.
4. A method as recited in claim 1 , wherein assignment of the cell for the desired digraph link is selected to reduce packet transmission time latency for messages from a gateway.
5. A method as recited in claim 1 , wherein assignment of the cell for the desired digraph link is selected to reduce packet transmission time latency for messages to a gateway and wherein the transmission time latency uses packet queue prioritization wherein a packet has top priority in a queue for a given node if that the packet is prioritized to be sent at the next available time slot.
6. A method as recited in claim 1 , wherein assignment of the cell for the desired digraph link is selected to reduce packet transmission time latency for messages from a gateway and wherein the transmission time latency uses packet queue prioritization wherein a packet has top priority in a queue for a given node if that the packet is prioritized to be sent at the next available time slot.
7. A method as recited in claim 1 , wherein assignment of the cell for the desired digraph link is for multicast of a packet.
8. A method as recited in claim 1 , wherein assignment of the cell for the desired digraph link is based on resource availability.
9. A method as recited in claim 1 , wherein assignment of the cell for the desired digraph link is based on resource availability and wherein the resource is power.
10. A method as recited in claim 1 , wherein assignment of the cell for the desired digraph link is based on state of network.
11. A method as recited in claim 1 , wherein assignment of the cell for the desired digraph link is based on state of network and wherein state is user requested.
12. A method as recited in claim 1 , wherein assignment of the cell for the desired digraph link is based on state of network and wherein state is based on health reporting of resource state.
13. A method as recited in claim 1 , wherein assignment of the cell for the desired digraph link is based on state of network and wherein state is based on information in a packet.
14. A method as recited in claim 1 , wherein assignment of the cell for the desired digraph link is based on state of network and wherein state is based on information in an upstream system.
15. A method as recited in claim 1 , wherein assignment of the cell for the desired digraph link is based on state of network and wherein state is based on information in a downstream system.
16. A method as recited in claim 1 , wherein assignment of the cell for the desired digraph link is preloaded in nodes.
17. A method as recited in claim 1 , wherein assignment of the cell for the desired digraph link is downloaded to nodes.
18. A method as recited in claim 1 , wherein a node can use one of a plurality of superframes.
19. A system for assigning cells in a superframe using digraph link information in a network of nodes comprising:
a processor for determining a total number of desired digraph links in a network of nodes wherein a digraph link is a directional link specifying routing information at a first node between the first node and a second node, and wherein the network of nodes includes a plurality of nodes each with a plurality of digraph links;
a processor for selecting a superframe size at least large enough to accommodate the total number of desired digraph links; and
a processor for assigning each desired digraph link to a cell in the superframe wherein each cell in the superframe specifies a synchronized time and frequency communication plan.
20. A system as recited in claim 19 , wherein the cells assigned to certain of the desired digraph links are selected to reduce packet transmission time latency for messages to a gateway.
21. A system as recited in claim 19 , wherein certain desired digraph links are assigned to a plurality of cells.
22. A system as recited in claim 19 , wherein assignment of the cell for the desired digraph link is selected to reduce packet transmission time latency for messages from a gateway.
23. A system as recited in claim 19 , wherein assignment of the cell for the desired digraph link is selected to reduce packet transmission time latency for messages to a gateway and wherein the transmission time latency uses packet queue prioritization wherein a packet has top priority in a queue for a given node if that the packet is prioritized to be sent at the next available time slot.
24. A system as recited in claim 19 , wherein assignment of the cell for the desired digraph link is selected to reduce packet transmission time latency for messages from a gateway and wherein the transmission time latency uses packet queue prioritization wherein a packet has top priority in a queue for a given node if that the packet is prioritized to be sent at the next available time slot.
25. A system as recited in claim 19 , wherein assignment of the cell for the desired digraph link is for multicast of a packet.
26. A system as recited in claim 19 , wherein assignment of the cell for the desired digraph link is based on resource availability.
27. A system as recited in claim 19 , wherein assignment of the cell for the desired digraph link is based on resource availability and wherein the resource is power.
28. A system as recited in claim 19 , wherein assignment of the cell for the desired digraph link is based on state of network.
29. A system as recited in claim 19 , wherein assignment of the cell for the desired digraph link is based on state of network and wherein state is user requested.
30. A system as recited in claim 19 , wherein assignment of the cell for the desired digraph link is based on state of network and wherein state is based on health reporting of resource state.
31. A system as recited in claim 19 , wherein assignment of the cell for the desired digraph link is based on state of network and wherein state is based on information in a packet.
32. A system as recited in claim 19 , wherein assignment of the cell for the desired digraph link is based on state of network and wherein state is based on information in an upstream system.
33. A system as recited in claim 19 , wherein assignment of the cell for the desired digraph link is based on state of network and wherein state is based on information in a downstream system.
34. A system as recited in claim 19 , wherein assignment of the cell for the desired digraph link is preloaded in nodes.
35. A system as recited in claim 19 , wherein assignment of the cell for the desired digraph link is downloaded to nodes.
36. A system as recited in claim 19 , wherein a node can use one of a plurality of superframes.
37. A computer program product for assigning cells in a superframe using digraph link information in a network of nodes, the computer program product being embodied in a computer readable medium and comprising computer instructions for:
determining a total number of desired digraph links in a network of nodes wherein a digraph link is a directional link specifying routing information at a first node between the first node and a second node, and wherein the network of nodes includes a plurality of nodes each with a plurality of digraph links;
selecting a superframe size at least large enough to accommodate the total number of desired digraph links; and
assigning each desired digraph link to a cell in the superframe wherein each cell in the superframe specifies a synchronized time and frequency communication plan.
38. A computer program product as recited in claim 37 , wherein the cells assigned to certain of the desired digraph links are selected to reduce packet transmission time latency for messages to a gateway.
39. A computer program product as recited in claim 37 , wherein certain desired digraph links are assigned to a plurality of cells.
40. A computer program product as recited in claim 37 , wherein assignment of the cell for the desired digraph link is selected to reduce packet transmission time latency for messages from a gateway.
41. A computer program product as recited in claim 37 , wherein assignment of the cell for the desired digraph link is selected to reduce packet transmission time latency for messages to a gateway and wherein the transmission time latency uses packet queue prioritization wherein a packet has top priority in a queue for a given node if that the packet is prioritized to be sent at the next available time slot.
42. A computer program product as recited in claim 37 , wherein assignment of the cell for the desired digraph link is selected to reduce packet transmission time latency for messages from a gateway and wherein the transmission time latency uses packet queue prioritization wherein a packet has top priority in a queue for a given node if that the packet is prioritized to be sent at the next available time slot.
43. A computer program product as recited in claim 37 , wherein assignment of the cell for the desired digraph link is for multicast of a packet.
44. A computer program product as recited in claim 37 , wherein assignment of the cell for the desired digraph link is based on resource availability.
45. A computer program product as recited in claim 37 , wherein assignment of the cell for the desired digraph link is based on resource availability and wherein the resource is power.
46. A computer program product as recited in claim 37 , wherein assignment of the cell for the desired digraph link is based on state of network.
47. A computer program product as recited in claim 37 , wherein assignment of the cell for the desired digraph link is based on state of network and wherein state is user requested.
48. A computer program product as recited in claim 37 , wherein assignment of the cell for the desired digraph link is based on state of network and wherein state is based on health reporting of resource state.
49. A computer program product as recited in claim 37 , wherein assignment of the cell for the desired digraph link is based on state of network and wherein state is based on information in a packet.
50. A computer program product as recited in claim 37 , wherein assignment of the cell for the desired digraph link is based on state of network and wherein state is based on information in an upstream system.
51. A computer program product as recited in claim 37 , wherein assignment of the cell for the desired digraph link is based on state of network and wherein state is based on information in a downstream system.
52. A computer program product as recited in claim 37 , wherein assignment of the cell for the desired digraph link is preloaded in nodes.
53. A computer program product as recited in claim 37 , wherein assignment of the cell for the desired digraph link is downloaded to nodes.
54. A computer program product as recited in claim 37 , wherein a node can use one of a plurality of superframes.