Algorithm 3 Novel-RSA (s; d; T) Pseudo-code

1: Solve the RSA problem using current RSA policy (R-SA Algorithm 1);

2: If the problem has a solution, then accept the connection;

3: Else Solve the RSA problem using the SA-R Algorithm 2;

4: If the problem has a solution, then accept the connection;

5: Change the RSA strategy of pair nodes (s, d) to SA-R if the required throughput is greater than T.

6: Else block the connection.