A call admission control for service differentiation and fairness management in WDM grooming networks

We investigate a call admission control (CAC) mechanism for providing fairness control and service differentiation in a WDM network with grooming capabilities. A WDM grooming network can handle different classes of traffic streams which differ in their bandwidth requirements. We assume that for each class, call interarrival and holding times are exponentially distributed. Using a Markov Decision Process approach, an optimal CAC policy is derived for providing fairness in the network. The Policy Iteration algorithm is used to numerically compute the optimal policy. Furthermore, we propose a heuristic decomposition algorithm with lower computational complexity and good performance. Simulation results compare the performance of our proposed policy with those of Complete Sharing and Complete Partitioning policies. Comparisons show that our proposed policy provides the best performance in most cases. Although this approach is motivated by WDM networks, it may be deployed to determine the optimal resource allocation in many problems in wireless and wired telecommunications systems.