Algorithm: Routing Modulation Level Spectrum Assignment-Multipath

Input: Network topology $G\left(V,E,D\right)$ , demand set $r_i\left(s_i,d_i,b_i\right)$ in R_anycast.

Output: demand set $r_i\left(s_i,d_i,b_i\right)$ in R_anycast established.

1: for each demand

2: Construct and compute the KSP algorithm

3: Sort path in ascending order of j

4: For the single path: select required parameters in descending order and calculate the required FS

5: If the spectrum space can be configured

6: Configure the selected path combination, modulation mode FS, and core

7: else

8: if the core limit is not exceeded

9: Change to the next core and compute the single path

10: else

11: Confirm that the upper limit of the path is not exceeded

12: If the upper limit of the path is not exceeded

13: Change to the next core and compute the single path

14: else

15: end for

16: For the Multipath: select the required parameters in descending order, calculate the required FS

17: If the spectrum space can be configured according to the core selection strategy

18: Configure the selected path combination, modulation mode FS, and core

19: else

20: If the core limit is not exceeded

21: Change to the next core and compute the single path

22: else

23: Confirm that the upper limit of the path is not exceeded

24: If the upper limit of the path is not exceeded

25: Change to the next core and compute the single path

26: else

27: end for