In recent years, there has been tremendous interests and progresses in the field of wireless communications. Call admission control (CAC) is the key component to maximize the system utilization under certain QoS constraints such as call blocking rates. Among the CACs, Markov decision process (MDP) approach is a popular method to optimize certern objectives of interest. However, the computation complexity for deriving optimal policies make this approach less accessible to those with large problem size. In this paper, we will address this issue of how the optimal solutions fluctuate as the traffic condition changed using sensitivity analysis technique, in order to cut down unnecessary computing time if optimal policy did not change as the traffic conditions vary. First of all, the LP problem is solved by simplex method to examine the best policy when the optimal solution is found, then the sensitivity analysis technique is used by adding perturbation on traffic parameters to indicate the range to which optimal bases are invariant. The analytical results for computation complexity reduction is shown to analyze the performance under various traffic conditions.

Date Published: 25 October 2004
PDF: 11 pages
Proc. SPIE 5601, Internet Multimedia Management Systems V, (25 October 2004); doi: 10.1117/12.580057

Published in SPIE Proceedings Vol. 5601:
Internet Multimedia Management Systems V
John R. Smith; Tong Zhang; Sethuraman Panchanathan, Editor(s)