Abstract
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.
Highlights
The dynamic growth of end users and an increasing use of applications such as VoD, HDTV, and cloud computing requires a large-capacity network
Photon Netw Commun (2017) 34:323–333 solving the basic Routing and Spectrum Assignment (RSA) problem, in which the path length is optimized under the spectrum continuity constraints and non-overlapping spectra constraints for adjacent connections on the links of the network for the fixed modulation level
We have focused on the dynamic routing in elastic optical networks whose aim is to minimize the bandwidth blocking probability or the number of rejected requests
Summary
In [6] the RMLSA problem is formulated, where apart from classical constraints imposed on the spectrum, the constraint imposed on the transmission distance has been taken into account. In [3], the RMLSA problem is formulated, in which the objective function minimizes the most used spectrum slots while meeting non-overlapping spectra of the connections on the links To solve this problem, several approaches have been proposed from optimal and decomposition ILP algorithms to a sequential heuristic algorithm with appropriate ordering policies. In [9] a dynamic RSA problem is considered, where the traffic on the connections of the network is variable in time To solve this problem, an algorithm based on a set of k shortest paths, whose lengths are determined by the number of links, has been used. In the fourth section the obtained results are compared with the results obtained on the basis of well-known algorithms, and in the fifth section a summary and conclusions are shown
Sign-in/Register to view highlights & summary Sign-in/Register to access full text options 
Free) 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a call
