Abstract

In this paper, we have developed a low complexity mathematical model which is used for the calculation of blocking probability of network and this model does not require any simulation statistics. The implementation of the model proposed has less complexity and the computation used in this model is quite efficient. This paper suggests an optimum path as a solution to routing problem and the appropriate number of wavelengths have also been suggested which should be free in a network to have the least blocking probability. This model can be implemented on different network topologies. Further, the model is also used to evaluate the blocking performance of NSFNet topology and hence used to improve its performance on the basis of blocking probability.

Full Text
Published version (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