Link dimensioning in WDM networks with dynamic traffic grooming
This paper presents an analytical model to determine the number of required wavelengths to meet a specified Grade of Service (GoS) in WDM networks with dynamic grooming capabilities. The GoS is defined in terms of overall call blocking probability in the system. Traffic consists of two rate streams, low-rate and high-rate. For each traffic stream, call interarrival and holding times are exponentially distributed. Two wavelength assignment strategies, Random and First-Fit, are considered to accommodate the calls in the network. In the case of Random assignment, the system can be formulated as a Markov process from which a product form solution can be approximated the overall call blocking probabilities. Numerical and simulation results show that in low traffic regime this formula is a lower bound for the Random assignment and an upper bound for the First-Fit assignment. Numerically, we show that the product form formula can be used to dimension the network, when implementing the First-Fit assignment strategy.
|Keywords||Blocking performance, Link dimensioning, Markov process, Wavelength Division Multiplexing (WDM)|
|Conference||Canadian Conference on Electrical and Computer Engineering 2005|
Mosharaf, K., Lambadaris, I, Talim, J, & Shokrani, A. (2005). Link dimensioning in WDM networks with dynamic traffic grooming. Presented at the Canadian Conference on Electrical and Computer Engineering 2005. doi:10.1109/CCECE.2005.1557300