A decomposition approximation for the performance evaluation of non-preemptive priority in GSM/GPRS

Sayeed Ghani; Mischa Schwartz

1st Annual Conference on Broadband Networks

Research Article

A decomposition approximation for the performance evaluation of non-preemptive priority in GSM/GPRS

Cite: BibTeX Plain Text

@INPROCEEDINGS{10.1109/BROADNETS.2004.3,
    author={Sayeed Ghani and Mischa Schwartz},
    title={A decomposition approximation for the performance evaluation of non-preemptive priority in GSM/GPRS},
    proceedings={1st Annual Conference on Broadband Networks},
    publisher={IEEE},
    proceedings_a={BROADNETS},
    year={2004},
    month={12},
    keywords={},
    doi={10.1109/BROADNETS.2004.3}
}

Sayeed Ghani
Mischa Schwartz
Year: 2004
A decomposition approximation for the performance evaluation of non-preemptive priority in GSM/GPRS
BROADNETS
IEEE
DOI: 10.1109/BROADNETS.2004.3

Sayeed Ghani¹^,*, Mischa Schwartz²^,*

1: Center for Computer Studies, IBA, Karachi, Pakistan
2: Dept. of Elect. Eng., Columbia University, NY

*Contact email: sghani@iba.edu.pk, schwartz@ee.columbia.edu

Abstract

Decomposition approximations in the past have been successfully applied to the performance analysis of preemptive priority based GSM/GPRS networks. In this paper, we propose a decomposition technique for the performance analysis of GSM/GPRS networks where GSM voice calls have non-preemptive priority over GPRS data packets. In other words, when demand exists for GSM circuit switched channels, the GPRS user can continue its transmission until the ending of packet transmission resulting in a delayed release of the channel. It is shown that such an approximation can be quite accurate in predicting both the impact of delayed release on GSM voice queuing as well as for comparison of immediate versus delayed release of channels on GPRS data queuing delays.

Published: 2004-12-13
Publisher: IEEE

: http://dx.doi.org/10.1109/BROADNETS.2004.3