Optimal and Computationally Efficient Priority-Based Routing and Wavelength Allocation Strategy Supporting Qos for High-Speed Transport Networks
Tarun Gupta1, Amit Kumar Garg2

1Tarun Gupta, Ph.D Scholar, Department of ECE, DCRUST University, (Haryana), India.
2Amit Kumar Garg, Professor, Department of ECE, DCRUST University, (Haryana), India.
Manuscript received on 19 August 2019 | Revised Manuscript received on 10 September 2019 | Manuscript Published on 17 September 2019 | PP: 1000-1003 | Volume-8 Issue-2S8 August 2019 | Retrieval Number: B11910882S819/2019©BEIESP | DOI: 10.35940/ijrte.B1191.0882S819
Open Access | Editorial and Publishing Policies | Cite | Mendeley | Indexing and Abstracting
© The Authors. Blue Eyes Intelligence Engineering and Sciences Publication (BEIESP). This is an open access article under the CC-BY-NC-ND license (http://creativecommons.org/licenses/by-nc-nd/4.0/)

Abstract: One of major optical network problem is to route and to assign the wavelength efficiently because of its wavelength reuse characteristics and information transparency. By utilizing the trade-off scheme between the blocking probability and setup time of the requested route, priority-based RWA (PRWA) approaches has been studied for WDM networks by introducing a priority criterion which depends on calculation of hop counts and volume of the traffic. The simulation result shows that PRWA technique reduces both the blocking probability (approx. 20%) as compare with non-priority based RWA scheme and the average end to end delay near about (10 msec.) as compare with Adaptive routing (AR) at various traffic load conditions. This approach also results in cost-effectiveness as well as reduction in the complexity of the network in comparison to earlier reported techniques.
Keywords: WDM, Blocking Probability, Priority Queue, NSFNET, Routing and Wavelength Assignment.
Scope of the Article: High Speed Networks