Name
Title | ||
|---|---|---|
A reduced dimension MDP-based call admission control scheme for next generation telecommunications |
Abstract | ||
|---|---|---|
The effective call admission control (CAC) scheme provides preferential treatments on call requests to achieve efficient utilization of system resources. The Markov Decision Process (MDP) is one of the optimization schemes used to derive the optimal CAC policy for pre-determined goals. However, the MDP-based approaches suffer from the Curse of Dimensionality problem, where the size of state space grows exponentially with the increase of the number of call types and the number of channels. The Curse of Dimensionality problem makes the MDP-based approach difficult to be implemented in practice. In this paper, we consider a heterogeneous telecommunication system with multiple service priority classes. We propose a suboptimal MDP-based CAC scheme, designed based on a two-phase reduced dimension structure to substantially reduce the overall computational complexity from the order of O(C12) to the order of O(C4), where C denotes number of system capacity. Our proposed MDP-based CAC scheme is evaluated via an event driven simulator and the results are compared with the conventional complete sharing scheme and different guard channel schemes under various traffic loads. |
Year | DOI | Venue |
|---|---|---|
2012 | 10.1109/IWCMC.2012.6314339 | IWCMC |
Keywords | Field | DocType |
reduced dimension mdp,optimisation,next generation networks,guard channel,telecommunication congestion control,call admission control (cac),computational complexity,multiple service priority,next generation telecommunications,markov decision process,heterogeneous telecommunication system,cac scheme,optimization schemes,markov processes,call admission control scheme,markov decision process (mdp) | Next-generation network,Telecommunications,Markov process,Call Admission Control,Computer science,Communication channel,Computer network,Markov decision process,Curse of dimensionality,State space,Computational complexity theory,Distributed computing | Conference |
ISSN | ISBN | Citations |
2376-6492 | 978-1-4577-1378-1 | 5 |
PageRank | References | Authors |
0.41 | 8 | 4 |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Huan Chen | 1 | 36 | 4.50 |
| Chih-Chuan Cheng | 2 | 35 | 3.11 |
| Wei-Ho Chung | 3 | 517 | 68.70 |
| Hsi-Hsun Yeh | 4 | 36 | 2.23 |