An Analytical Approach for Traffic Grooming Problems Using Waiting Probability in WDM Networks

Traffic grooming is the optimization of resources in a network. An efficient traffic grooming provides better resource utilization, enhanced performance at a lower cost. Traffic grooming has become very significant for all types of computer networks. As WDM (wavelength division multiplexing) networks are providing very high speed for a huge amount of data transfer, so traffic grooming is even more important for these networks. There are so many parameters that may be considered for traffic grooming. The waiting probability is one of the key parameters for traffic grooming. Waiting probability is a measurement of time spent by a call to get the required resources for further communication. We have proposed an efficient traffic grooming technique. This technique is based on waiting probability calculations. Waiting probability is calculated, and then traffic grooming problems are addressed based on the waiting probability calculations. Some of the other key network performance parameters such as the number of servers required, ideal path length for a source–destination pair, number of free wavelengths required, etc., are also analyzed. It is a low complexity technique for handling traffic grooming problems efficiently in telecommunication and call center management.