LAUSR

The considered Routing, Modulation Level and Spectrum Allocation (RMLSA) problem covers path length minimization while still meeting the spectrum continuity constraints, non-overlapping spectra constraints, spectrum contiguity constraints, and choice of modulation level. In this problem, the relationship between spectrum connection and bit rate of the incoming request has been taken into account. In this paper, two algorithms have been proposed. The first one is based on a set of shortest paths whose lengths are determined by the number of links in the network. The second one is a modified version of Dijkstra’s algorithm. Modification of this algorithm is based on introduction of weights of the network links depending on the utilization of the links and the introduction of a aggregated spectrum of the path that is being selected. Extensive research has shown that algorithms reject the lower traffic volume as compared to well-known algorithms proposed in literature.