Call admission control and scheduling algorithm for a CDMA system

In this paper we introduce the system capacity in the multi-code CDMA system and evaluate the system performance constrained by required SNR/sub th/ and other QoS factors. The call admission control (CAC) algorithm is proposed to administer the requests. Moreover, the enforcer, scheduler and shaper are proposed to maintain the required QoS.

[1]  Abhay Parekh,et al.  A generalized processor sharing approach to flow control in integrated services networks: the single-node case , 1993, TNET.

[2]  Van Jacobson,et al.  Link-sharing and resource management models for packet networks , 1995, TNET.

[3]  Hui Zhang,et al.  Hierarchical packet fair queueing algorithms , 1996, SIGCOMM 1996.

[4]  Hui Zhang,et al.  WF/sup 2/Q: worst-case fair weighted fair queueing , 1996, Proceedings of IEEE INFOCOM '96. Conference on Computer Communications.

[5]  I Chih-Lin,et al.  Performance of multi-code CDMA wireless personal communications networks , 1995, 1995 IEEE 45th Vehicular Technology Conference. Countdown to the Wireless Twenty-First Century.

[6]  I Chih-Lin,et al.  Multi-code CDMA wireless personal communications networks , 1995, Proceedings IEEE International Conference on Communications ICC '95.

[7]  Hui Zhang,et al.  Hierarchical packet fair queueing algorithms , 1997, TNET.

[8]  Uwe-Carsten Fiebig,et al.  Design study for a CDMA-based third-generation mobile radio system , 1994, IEEE J. Sel. Areas Commun..

[9]  B. J. Hwang,et al.  Improving the Performance in a Multimedia CDMA Cellular System with Resource Reservation , 2001 .