Algorithm 1 R-SA (s; d; T) Pseudo-code |
Require: R = {r1; r2; …; rK} List of candidate routes; F = {f1; f2; …; fM}: List of candidate frequency slot indexes; 1: R ← ∅; F ← ∅; 2: R = Routing-Ordering-Algorithm (s; d); 3: for (j = 1 to K) do 4: B = Frequency-Slots-Necessary (rj; T) 5: F = Spectrum-Ordering-Algorithm (); 6: for (i = 1 to M) do 7: if (frequency indexes from fi to fi + B − 1 are available in route rj) then 8: return the route rj and frequency slot index fi as R-SA solution. 9: end if 10: end for 11: end for 12: return no solution available; |