Waiting Probability Based Traffic Grooming In Optical Networks

Abstract

In this paper, we have proposed an efficient traffic grooming model for optical networks. This model has low complexity and it can be easily implemented for traffic grooming problems. It is used to calculate the waiting probability of computer networks and then traffic grooming problems are addressed based on the calculated waiting probability. Waiting probability is always a major parameter during the analysis of network performance because it provides an estimate for the waiting of calls in the transmission route. This model can also be used to calculate some other key network parameters such as number of server required, ideal route length, number of free wavelengths required etc. based on a fixed value of waiting probability. This model can be applied on different network topologies for traffic grooming with equal efficiency.