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

Algorithm 2

-learning in multicast routing.

1:  Q(S,A) Connect Matrix

2:  Destination Node

3:  Source Node

4: fordo

5:  Begin State

6:  End State

7:  for1,2,…end do

8:   if is empty then

9:    break

10:  end if

11:  for1,2,…end do

12:   if Random then

13:    A(1) Max(Q(S(), A()))

14:   else

15:    A(1) Random(Q(S(), A()))

16:   end if

17:   S S()

18:   Q Q(S, A))

19:   if S is empty then

20:    Q Reward Constant

21:   else

22:    if S is equal to End State then

23:     Q Reward Constant

24:    else

25:    Reward

26:    Q Reward Max(Q(S, all A))

27:    S(+1) S

28:   end if

29:  end if

30:  Q(S, A) Q(S, A)

31:  if converge then

32:   Counter Counter

33:   if Counter Counter_Threshold then

34:    break

35:   end if

36:  else

37:   Counter clear

38:  end if

39:  end for

40:  

41:  

42: end for

43:end for