A Novel Priority Call Admission Control Algorithm Based on Total Resource Requirements for CDMA Systems 


Vol. 29,  No. 12, pp. 1298-1308, Dec.  2004


PDF
  Abstract

CAC (Call Admission Control) schemes for different service class are studied in many papers. A novel priority CAC algorithm, which gives priority to a same class call according to the total resource requirements is proposed and analyzed in this paper. The proposed algorithm provides a priority according to the total resource requirements other than only in a base station. If there are efficient residual resources in the system, it will accept all new calls. Otherwise, it will selectively accept these new calls according to the total resource requirements. The results show that the proposed algorithm provides better call blocklng probability, outage probability and throughput than the conventional algorithm.

  Statistics
Cumulative Counts from November, 2022
Multiple requests among the same browser session are counted as one view. If you mouse over a chart, the values of data points will be shown.


  Cite this article

[IEEE Style]

S. Piao and Y. Park, "A Novel Priority Call Admission Control Algorithm Based on Total Resource Requirements for CDMA Systems," The Journal of Korean Institute of Communications and Information Sciences, vol. 29, no. 12, pp. 1298-1308, 2004. DOI: .

[ACM Style]

Shi-quan Piao and Yong-wan Park. 2004. A Novel Priority Call Admission Control Algorithm Based on Total Resource Requirements for CDMA Systems. The Journal of Korean Institute of Communications and Information Sciences, 29, 12, (2004), 1298-1308. DOI: .

[KICS Style]

Shi-quan Piao and Yong-wan Park, "A Novel Priority Call Admission Control Algorithm Based on Total Resource Requirements for CDMA Systems," The Journal of Korean Institute of Communications and Information Sciences, vol. 29, no. 12, pp. 1298-1308, 12. 2004.

Search
(IN TITLE, AUTHOR, ABSTRACT,KEYWORDS)

Advanced Search ▼

POPULAR KEYWORDS
(TOP 10 KEYWORDS)

Recent Publications
(LAST 3 YEARS)






pISSN : 1226 - 4717
eISSN : 2287 - 3880