Method and apparatus for adaptive directed route randomization and distribution in a richly connected communication network

Claim 2

In a communication system comprising a plurality of nodes that communicate with each other over links wherein each of said links has a link usage probability (LUP) associated therewith, said LUP being proportional to a number of times an associated link is part of a selected route, a method of routing data packets among said plurality of nodes comprising the steps of: (a) finding alternative minimum hop routes between a source node and a destination node, each of said alternative minimum hop routes comprising a sequence of links over which to send a data packet; (b) temporarily updating said LUP for each link associated with each of said alternative minimum hop routes, said temporarily updating step performed by increasing said LUP proportionally to a number of times said associated link is part of one of said alternative minimum hop routes; (c) calculating a network routing entropy (NRE) for each of said alternative minimum hop routes using said LUPs associated with each link of said alternative minimum hop routes; (d) selecting a first choice minimum hop route from said alternative minimum hop routes, said first choice minimum hop route having a largest of said NREs; and (e) routing said data packet from said source node to said destination node over said first choice minimum hop route.

Claim 3

A method as claimed in claim 1 further comprising the step of updating said LUP for each link associated with said first choice minimum hop route by increasing said LUP proportionally to said number of times each link of said first choice minimum hop route is part of said first choice minimum hop route.

Claim 4

A method as claimed in claim 1 further comprising the step of determining, for each of said alternative minimum hop routes, a link having a maximum value of said LUPs, and wherein the selecting step includes the step of choosing said first choice minimum hop route having said link with a lowest of said maximum value of said LUPs.

Claim 5

A method as claimed in claim 1 wherein the determining step further comprises the step of determining which links are not available for transfer of said data packet during said predetermined time periods, said links being shut off as said nodes change said orbital position.

Claim 6

A method as claimed in claim 1 wherein said alternative minimum hop routes includes a transit node in said sequence of links, said transit node being one node on said first choice minimum hop route, and wherein each node of said plurality of nodes has a plurality of links associated therewith, and wherein the selecting further comprises the step of selecting first choice minimum hop routes for each source - destination pair of nodes of said plurality of nodes, and said method further comprises the step of: calculating, for said transit node, a percentage each link associated with said transit node is identified by said first choice minimum hop routes that use said transit node for routing to said destination node, and wherein the routing step comprises the step of routing said data packet away from said transit node to said destination node over one of said plurality of links associated with said transit node based on said percentage.

Claim 7

A method as claimed in claim 5 further comprising the steps of: generating a table for said transit node including said percentage for each link of said plurality of links associated with said transit node; and sending said table to said transit node.

Claim 8

A method as claimed in claim 6 wherein the generating step further comprises the step of generating said table for each node of said plurality of nodes.

Claim 9

A method as claimed in claim 1 further comprising the step of storing said first choice minimum hop route for said destination node in each node of said plurality of nodes.

Claim 10

A method as claimed in claim 1 further comprising the step of determining available links that will be usable during a predetermined time period, and said finding step further comprises the step of considering only said available links for finding said alternative minimum hop routes.

Claim 11

A method as claimed in claim 9 wherein said nodes are orbiting satellite communication stations and wherein the determining step further comprises the step of determining available links during predetermined time periods, said predetermined time periods based on different constellation configurations for said plurality of nodes, said constellation configurations including orbital position of each of said nodes during each of said predetermined time periods including links planned to be turned off during each of said predetermined time periods.

Claim 12

A method as claimed in claim 10 wherein the determining step further comprises the step of determining failed links and links not available for transfer of said data packet for each of said predetermined time periods.

Claim 13

A method as claimed in claim 11 further comprising the steps of repeating the determining, the finding, the temporarily updating, the calculating and the selecting steps for each of said predetermined time periods, and generating a list of first choice minimum hop routes for each of said constellation configurations.

Claim 14

A method as claimed in claim 1 wherein the finding step comprises the step of finding additional alternative minimum hop routes when the finding step finds only one of said alternative minimum hop routes, said alternative minimum hop routes including routes having less than a predetermined number of hops, said predetermined number being greater than a number of hops of said one of said alternative minimum hop routes.

Claim 15

A method as claimed in claim 2 further comprising the step of repeating the finding, the temporarily updating, the calculating, the selecting and the updating steps for all source - destination node combinations of said plurality of nodes.

Claim 16

In a communication system comprised of a plurality of nodes that move with respect to each other and communicate with each other over links, a method of routing data packets among said plurality of nodes comprising the steps of: determining available links during each of a plurality of predetermined time periods, each time period based on different constellation configurations for said nodes, said constellation configurations including orbital position of each of said nodes during each of said predetermined time periods; finding, for each of said constellation configurations, minimum hop routes between source and destination node pairs, each of said minimum hop routes comprising a sequence of said available links over which to send a data packet between a source node and a destination node; calculating a link usage probability (LUP) for each of said links of said sequences, said LUP based on a number of times a link is used in each of said sequences; calculating a network routing entropy for each of said minimum hop routes based on said LUP of each link of said minimum hop routes; selecting, for each of said source and destination node pairs, one of said minimum hop routes for each of said constellation configurations, said one minimum hop route resulting in a largest network routing entropy (NRE); and routing, during said predetermined time periods associated with said constellation configurations, said data packet between said source node and said destination node over said one minimum hop route.

Claim 17

In a communication system comprised of a plurality of nodes that move with respect to each other and communicate with each other over links, a method of routing data packets among said plurality of nodes comprising the steps of: determining available links during each of a plurality of predetermined time periods, each time period based on different constellation configurations for said nodes, said constellation configurations including orbital position of each of said nodes during each of said predetermined time periods; finding, for each of said constellation configurations, minimum hop routes between source and destination node pairs, each of said minimum hop routes comprising a sequence of said available links over which to send a data packet between a source node and a destination node; calculating a link usage probability (LUP) for each of said links of said sequences, said LUP based on a number of times a link is used in each of said sequences; calculating a network routing entropy for each of said minimum hop routes based on said LUP of each link of said minimum hop routes; selecting, for each of said source and destination node pairs, one of said minimum hop routes for each of said constellation configurations, said one minimum hop route resulting in a largest network routing entropy (NRE); and routing, during said predetermined time periods associated with said constellation configurations, said data packet between said source node and said destination node over said one minimum hop route.

Claim 18

A method as claimed in claim 15 wherein: the finding step comprises the step of finding alternative minimum hop routes when the finding step finds only one minimum hop route, said alternative minimum hop routes including routes having less than a predetermined number of hops, said predetermined number based on an acceptable delay for a type of said data packet, and the selecting step further comprises the step of selecting second and third choice minimum hop routes from said minimum hop routes and said alternative minimum hop routes, said second and third choice minimum hop routes resulting in a next largest NRE.

Claim 19

A communication system that routes data packets over minimum hop routes resulting in a distributed usage of communication links, said minimum hop routes comprising a list of said communication links to send a data packet between a source node and a destination node, said system comprising: a plurality of nodes that move with respect to each other, said nodes coupled by said communication links; multi-channel transceivers associated with each node of said plurality of nodes for sending data packets over said communication links using said minimum hop routes; and a control facility coupled to said nodes for determining which of said communication links will be available during predetermined time periods, finding said minimum hop routes between said nodes, calculating link usage probabilities (LUPs) for each communication link of said minimum hop routes, calculating a network routing entropy (NRE) based on said LUPs, and selecting a first choice minimum hop route from said minimum hop routes for said source node and said destination node based on said NRE.

Claim 20

A communication system that routes data packets over minimum hop routes resulting in a distributed usage of communication links, said minimum hop routes comprising a list of said communication links to send a data packet between a source node and a destination node, said system comprising: a plurality of nodes that move with respect to each other, said nodes coupled by said communication links; multi-channel transceivers associated with each node of said plurality of nodes for sending data packets over said communication links using said minimum hop routes; and a control facility coupled to said nodes for determining which of said communication links will be available during predetermined time periods, finding said minimum hop routes between said nodes, calculating link usage probabilities (LUPs) for each communication link of said minimum hop routes, calculating a network routing entropy (NRE) based on said LUPs, and selecting a first choice minimum hop route from said minimum hop routes for said source node and said destination node based on said NRE.

Claim 21

A communication system as claimed in claim 17 wherein said first choice minimum hop routes include a transit node in said sequence of links, said transit node being one node on said first choice minimum hop route, and wherein said control facility further comprises: means for calculating a percentage each communication link of said plurality associated with said transit node that is identified by said first choice minimum hop route that uses said transit node; and means for instructing said transceiver coupled to said transit node to send said data packet from said transit node over one of said communication links associated with said transit node based on said percent.

Claim 22

A communication system as claimed in claim 17 further comprising a storage medium on each node coupled to said processors, said storage medium stores a table including said first choice minimum hop route, said table being sent from said control facility to each node of said plurality of nodes over an uplink.

Claim 23

A communication system as claimed in claim 17 wherein said control facility includes means for finding alternative hop routes when only one minimum hop route is found, said alternative hop routes including routes having hop a length less than an acceptable threshold for a type of said data packet, said acceptable threshold based on a delay associated with said alternative hop route.