Dynamic Routing Strategy for Directed Transmissions of High-Valued Contents in NGSO Satellite-Based Internet

Algorithm 1

-learning in unicast routing.

1:  Q(S,A) Connect Matrix

2: fordo

3:  S(1) Begin State.

4:  for1,2,…end do

5:   if Random then

6:    A Max(Q(S(), A())).

7:   else.

8:    A(1) Random(Q(S(), A())).

9:   end if.

10:   S S

11:   if S satisfy the constraints for (1), (2) and (3)

    then

12:    Reward Constant

    N.B.: Constant

13:   else

14:    Reward

15:   end if

16:   Q(S, A) Q(S, A) + [Reward

    Max(Q(S, A)) Q(S, A)]

17:   if S is equal to End State then

18:    break

19:   else

20:    S S

21:   end if

22:  end for

23:  if converge then

24:   Counter Counter

25:   if Counter Counter_Threshold then

26:    break all

27:   end if

28:  else

29:   Counter clear

30:  end if

31: end for