No / An analytic framework is devised, based on the principle of maximum entropy (ME), for the performance modelling and evaluation of a wireless GSM/GPRS cell supporting bursty multiple class traffic of voice calls and data packets under complete partitioning (CPS), partial sharing (PSS) and aggregate sharing (ASS) traffic handling schemes. Three distinct open queueing network models (QNMS) under CPS, PSS and ASS, respectively, are described, subject to external compound Poisson traffic processes and generalised exponential (GE) transmission times under a repetitive service blocking mechanism and a complete buffer sharing management rule. Each QNM generally consists of three building block stations, namely a loss system with GSM/GPRS traffic and a system of access and transfer finite capacity queues in tandem dealing with GPRS traffic under head-of-line and discriminatory processor sharing scheduling disciplines, respectively. The analytic methodology is illustrated by focusing on the performance study of the GE-type tandem queueing system for GPRS under a CPS. An ME product-form approximation is characterised leading into a decomposition of the tandem system into individual queues and closed-form ME expressions for state and blocking probabilities are presented. Typical numerical examples are included to validate the ME solutions against simulation and study the effect of external GPRS bursty traffic upon the performance of the cell. Moreover, an overview of recent extensions of the work towards the analysis of a GE-type multiple server finite capacity queue with preemptive resume priorities and its implications towards the performance modelling and evaluation of GSM/GPRS cells with PSS and ASS are included. / ,
| Identifer | oai:union.ndltd.org:BRADFORD/oai:bradscholars.brad.ac.uk:10454/3279 |
| Date | January 2003 |
| Creators | Kouvatsos, Demetres D., Awan, Irfan U., Al-Begain, Khalid |
| Source Sets | Bradford Scholars |
| Language | English |
| Detected Language | English |
| Type | Article, No full-text in the repository |
Page generated in 0.0124 seconds