WLC22-1: Queueing Performance Analysis of Periodic Polling Services for VoIP in an IEEE802.16 System

Abstract

In this paper, we consider the queueing performance of periodic polling services for VoIP in an IEEE802.16 system, which is modeled by an M /G/C type queue with periodic batch service. We carry out an analysis for this system, using a generating function approach with supplementary variable technique. As a service discipline, the size of batch, the transmission duration in units of frames, i.e., contiguous frames, and the vacation period correspond to the bandwidth assigned to a subscriber station and the period to poll other subscriber stations, respectively. In numerical examples, the mean queue lengths are given, according to various system parameters.

An Efficient Capacity Allocation Scheme of Periodic Polling Services for a Multimedia Traffic in an IEEE802.16 System

“…In the scheme, a BS allocates M contiguous transmission frames and a vacation period of v frames to an SS. In contrast to [11], during a transmission period, an SS returns the allocated bandwidth to the BS, when its queue is empty. We have carried out an analysis on this system called Elimited service, by using a generating function approach.…”

“…We have carried out an analysis on this system called Elimited service, by using a generating function approach. With some numerical examples, the performance of the proposed system has been compared with that of a deterministic capacity allocation scheme in [11]. The results of E-limited batch service (C>2) are also obtained using simulations.…”

“…of a deterministic capacity allocation scheme for UGS [11], in which C=1, M and v are fixed, irrespective of the state of transmitter's queue. Note that the system presented here is non-gated service system, while the system in [11] is gated-service system.…”

“…In the analysis, the capacity is expressed in terms of C packets to be transmitted in an uplink subframe, M contiguous uplink subframes and a vacation period of v frames, i.e., polling period. In contrast to [11], we propose a capacity allocation scheme for a multimedia traffic. In the scheme, the bandwidth allocated to an SS will be returned to a BS, when the SS's queue is empty during M contiguous uplink subframes.…”

“…This assumption inverts an M/G/1 type queueing system, which allows unlimited packet arrivals in discrete time, into a QuasiBirth and Death (QBD) type queueing system, and they used the matrix-geometric algorithm. In [11], we carried out an exact analysis on the queueing system of the periodic polling services for UGS, where the capacity is deterministically allocated to an SS and is invariant irrespective of the state of a transmitter's queue. In the analysis, the capacity is expressed in terms of C packets to be transmitted in an uplink subframe, M contiguous uplink subframes and a vacation period of v frames, i.e., polling period.…”