A Call Admission Control for Service Differentiation and Fairness Management in WDM Grooming Networks

Authors:
Kayvan Mosharaf;Jerome Talim;Ioannis Lambadaris
Affiliations:
Carleton University, Ottawa, ON, Canada;Carleton University, Ottawa, ON, Canada;Carleton University, Ottawa, ON, Canada
Venue:
BROADNETS '04 Proceedings of the First International Conference on Broadband Networks
Year:
2004

Citing 5
Cited 2

Dynamic programming: deterministic and stochastic models

Dynamic programming: deterministic and stochastic models
A path decomposition approach for computing blocking probabilities in wavelength-routing networks

IEEE/ACM Transactions on Networking (TON)
Computing approximate blocking probabilities for a class of all-optical networks

IEEE Journal on Selected Areas in Communications
Models of blocking probability in all-optical networks with and without wavelength changers

IEEE Journal on Selected Areas in Communications
A generalized framework for analyzing time-space switched optical networks

IEEE Journal on Selected Areas in Communications

MDP-based lightpath establishment for service differentiation in all-optical WDM networks with wavelength conversion capability

Photonic Network Communications
Fair admission control scheme based on conditional preemption in traffic-groomed optical networks

Photonic Network Communications

Quantified Score

Hi-index	0.00

Visualization

Abstract

We investigate a Call Admission Control (CAC) mechanism to provide 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 by 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 to provide 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 very good performance. Simulation results compare the performance of our proposed policy, with that of Complete Sharing and Complete Partitioning policies. Comparisons show that our proposed policy provide 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.