Assessing Contact Graph Routing Performance and Reliability in Distributed Satellite Constellations

Algorithm 1

CGR.

   input: bundle to forward , contact plan , route list , excluded nodes , proximate nodes

   output: bundle enqueued in the corresponding queue

()  ;

(2)  if    changed  since  last     calculation   then

(3)     ;

(4)  if    forbids return to sender  then

(5)      sender node;

(6)    identifyProxNodes (, , , );

(7)  if    is critical  then

(8)    enqueue a copy of to each node in ;

(9)    return

(10) set to empty;

(11) for    do

(12)   if    is empty  then

(13)        

(14)   else if    then

(15)        

(16)   else if    then

(17)        continue

(18)   else if    then

(19)        

(20)   else if    then

(21)        continue

(22)   else if    then

(23)        

(24) if    is not empty  then

(25)   enqueue to ;

(26)   manageOverbook  

(27) else

(28)   enqueue to limbo

(29) return