Capacity of Multiservice WCDMA Networks with Variable GoS

• Published in: Wireless networks Vol. 12; no. 2; pp. 241 - 253
• Main Authors: Hegde, Nidhi, Altman, Eitan
• Format: Journal Article
• Language: English
• Published: New York Springer Nature B.V 01.04.2006
• Subjects: Bandwidths; Code Division Multiple Access; Quality of service; Studies; Telecommunications systems; Traffic flow; Wireless networks
• ISSN: 1022-0038; 1572-8196
• DOI: 10.1007/s11276-005-5272-0

Traditional definitions of capacity of CDMA networks are either related to the number of calls they can handle (pole capacity) or to the arrival rate that guarantees that the rejection rate (or outage) is below a given fraction (Erlang capacity). We extend the latter definition to other quality of service (QoS). We consider best-effort (BE) traffic sharing the network resources with real-time (RT) applications. As is often the case in CDMA systems, we assume that the BE traffic access is done using a time-shared channel (such as the HDR or the HSDPA). BE applications can adapt their instantaneous transmission rate to the available one and thus need not be subject to admission control or outages. Their meaningful QoS is the average delay (i.e. the sojourn time). The delay aware capacity is then defined as the arrival rate of BE calls that the system can handle such that their expected delay is bounded by a given constant. We compute in this paper both the blocking probability of the RT traffic having an adaptive Grade of Service (GoS) as well as the expected delay of the BE traffic for an uplink multicell WCDMA system. This yields the Erlang capacity for former and the delay capacity for the latter. [PUBLICATION ABSTRACT]