Answers are grounded in this paper and cite their sources.
This paper presents an in-depth analysis of the Weighted Least Congestion Routing (WLCR) algorithm and its variants for Routing and Wavelength Assignment (RWA) in all-optical networks. The WLCR algorithm enhances network performance by incorporating a weighted function based on the number of free wavelengths and route characteristics such as hop length and hop count. Three wavelength assignment strategies—First-Fit (FF), Most Used (MU), and Least Used (LU)—are evaluated in combination with WLCR. A modified weight function is proposed to further reduce blocking probability and improve link utilization by balancing wavelength availability, hop length, and hop count. The proposed algorithms are tested using simulations on 25-node mesh-torus and 12-node ring topologies under dynamic traffic conditions. Simulation results demonstrate that the modified WLCR algorithm significantly outperforms traditional dynamic RWA schemes, particularly in high-traffic scenarios and complex topologies. The study concludes that the modified WLCR-FF scheme offers the best trade-off between blocking probability and resource utilization, especially in mesh-torus networks.
No takes yet. Share an insight, caveat, or question.
Rajesh Kumar Singh (2026) studied this question.
Synapse has enriched 10 related papers. Consider them for comparative context: