Abstract
This paper considers the call admission control problem for multi-service wireless CDMA cellular systems with buffering. The call admission problem is formulated as a semi-Markov decision process with constraints on the blocking probabilities and SIR. By using recent results in large random matrices, the SIR constraints incorporate multi-class voice/data services and fading channels. We show that the optimal call admission policy can be computed via a linear programming based algorithm.
Original language | English (US) |
---|---|
Pages | 705-710 |
Number of pages | 6 |
State | Published - 2001 |
Externally published | Yes |
Event | IEEE Global Telecommunicatins Conference GLOBECOM'01 - San Antonio, TX, United States Duration: Nov 25 2001 → Nov 29 2001 |
Other
Other | IEEE Global Telecommunicatins Conference GLOBECOM'01 |
---|---|
Country/Territory | United States |
City | San Antonio, TX |
Period | 11/25/01 → 11/29/01 |
All Science Journal Classification (ASJC) codes
- Electrical and Electronic Engineering
- Global and Planetary Change