Algorithm 2 SA-R (s; d; T) Pseudo-code

Require: R = {r₁; r₂; …; r_K}: List of candidate routes;

F = {f₁; f₂; …; f_M}: List of candidate frequency slot indexes;

1: R ← ∅; F ← ∅;

2: F = Spectrum-Ordering-Algorithm ();

3: for (i = 1 to M) do

4: R = Routing-Ordering-Algorithm (s; d);

5: for (j = 1 to K) do

6: B = Frequency-Slots-Necessary (r_j; T)

7: if (frequency indexes from f_i to f_i + B − 1 are available in route r_j) then

8: return the route r_j and frequency slot index f_i as SA-R solution.

9: end if

10: end for

11: end for

12: return no solution available;