Performance of a burst switching scheme for CDMA-based wireless packet data systems

Emerging requirements for higher rate data services and better spectrum efficiency are the main issues of third-generation mobile radio systems. In particular, a new concept of burst switching has been introduced for supporting the packet data services in the CDMA-based wireless system. In the burst switching system, radio resources are allocated to users for the duration of data bursts, which is a series of packets, as opposed to the conventional packet switching scheme. To implement the burst switching scheme, three different states (active, control hold, dormant states) are defined and two transition timers are employed to release the fundamental and supplemental code channels, respectively, at certain instances. Furthermore, the system is subject to burst admission control policy, with which a burst is admitted only when the number of currently available channels is greater than the admission threshold. Since there exists a trade-off between the additional packet access delay during a burst and resource utilization depending on the time-out value of the transition tinier and burst admission threshold, it is critical to understand the performance characteristics in terms of the underlying design parameters. In this paper, we develop an analytic model and present a Quasi-Birth-Death (QBD) queueing analysis for evaluating the performance of burst switching schemes. This work focuses on the trade-off studies for optimizing the time-out value of the transition timer so as to minimize the average delay performance. Theoretical performance measures are derived by means of the matrix geometric method and furthermore, some simulation results are presented to validate the proposed analytical approach.