Abstract
In this paper, dynamic resource allocation and multicast routing algorithms are proposed for elastic optical networks (EONs). The proposed algorithms find the shortest path trees by modeling either the amount of free spectrum in each link or the link length as the cost function of routing method. The proposed algorithms are simulated in the dynamic operation scenario over the so called US Backbone topology. Simulation results reveal that by considering the cost function of routing algorithm based on the available spectrum in each link will improve the blocking probability while reduce the spectrum efficiency. On the other hand, by considering link length as the cost function, the blocking probability get worsen whereas the bandwidth efficiency is improved. Consequently, in order to compromise the benefits of both algorithms, we consider a mixed cost function based on the normalized cost function of each method and employing a weighting coefficient to trade-off between blocking probability and spectrum efficiency.
Sign-in/Register to access full text options 
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 callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
