Blocking Probability of Dijkstra Shortest and Least Congestion Routing Algorithm in Wavelength-Routed WDM Network

Er. Sukhdeep Kaur Sohal, Er. Sehajpal Kaur

doi:10.17762/ijritcc.v2i6.3175

PDF

Published: Jun 30, 2014

DOI: https://doi.org/10.17762/ijritcc.v2i6.3175

Er. Sukhdeep Kaur Sohal, Er. Sehajpal Kaur

Abstract

No Abstract

How to Cite

, E. S. K. S. E. S. K. (2014). Blocking Probability of Dijkstra Shortest and Least Congestion Routing Algorithm in Wavelength-Routed WDM Network. International Journal on Recent and Innovation Trends in Computing and Communication, 2(6), 1374–1379. https://doi.org/10.17762/ijritcc.v2i6.3175

Issue

Vol. 2 No. 6 (2014): June (2014) Issue

Section

Articles

Make a Submission

Announcements

Call for Papers

May 1, 2025

Call for Papers for the New Issue.
Last Date of Submission: September 30^th, 2025

Imp. Announcement

April 15, 2022

Dear Authors,
We are feeling proud congratulations to all the contributors of IJRITCC. Because The "International Journal on Recent and Innovation Trends in Computing and Communication" has been accepted for Scopus.

Like, Subscribe and Share This Video