Assessing Contact Graph Routing Performance and Reliability in Distributed Satellite Constellations

Algorithm 3

CGR: Load route list.

   input: bundle to forward , contact plan

   output: route list

()  ;

(2)  for    do

(3)         ;

(4)         ;

(5)         ;

(6)         ;

(7)         ;

(8)  set to empty;

(9)  while    1  do

(10)       Dijkstra  (, , );

(11)      if    is empty  then

(12)        break  (no more routes in contact graph)

(13)      ;

(14)      if    not empty  then

(15)        if    then

(16)         for    do

(17)              ;

(18)              ;

(19)              ;

(20)             if    then

(21)               ;

(22)         ;

(23)         set to empty;

(24)         continue  (go to next Dijkstra’s search)

(25)      ;

(26)      if    then

(27)         ;

(28)      else

(29)        ;

(30)        for    do

(31)         if    then

(32)             ;

(33)             break  (limit contact found)

(34)      ;

(35)      for    do

(36)          ;

(37)          ;

(38)          ;

(39) return