Queueing Performance Analysis of Periodic Polling Services for VoIP in an IEEE802.16 System.
DOI: 10.1109/GLOCOM.2006.739 Conference: Proceedings of the Global Telecommunications Conference, 2006. GLOBECOM '06, San Francisco, CA, USA, 27 November - 1 December 2006
In this paper, we consider the queueing performance of periodic polling services for VoIP in an IEEE802.16 system, which is modeled by an MIGIC 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.
Available from: Shang-Juh Kao
- "Since the promise of transmission from BS is guaranteed, the access delay and bandwidth request overhead can be avoided. The delay performance of the IEEE 802.16 random access protocol has been carried out by using continuous queueing model, such as reported in , , , , . Since the IEEE 802.16 is a frame-based protocol and the system state only changes at frame boundary, the discrete-time queueing model could be more suitable for characterizing the 802.16 network, especially for the study of UGS service. "
[Show abstract] [Hide abstract]
ABSTRACT: The standards of IEEE 802.16 define the unsolicited grant service (UGS) for real-time applications of stringent delay requirement. In this paper, using a discrete-time GI-D-c model to describe the behaviors of UGS in 802.16 networks is presented. The performance metrics of mean number of PDUs, PDU queueing delay, and bandwidth utilization subject to the change in traffic load or allocated bandwidth are investigated. The results verify that if the required bandwidth of the real time traffic is more than the granted capacity, the mean number of PDUs in the queue will grow unexpectedly as the traffic becomes saturated. As more granted bandwidth is offered, the queue length will keep empty until the traffic load is significant. Once the load becomes saturated, the queue is vast filled immediately. Similar performance indication for PDU queueing delay can be derived under various bandwidth allocations. The experimental results also show that the bandwidth utilization is linearly increased along with the traffic load.
[Show abstract] [Hide abstract]
ABSTRACT: In this paper, we consider a capacity allocation scheme of periodic polling services for a multimedia traffic in an IEEE 802.16 system. In the scheme of our interest, a base station assigns a subscriber station contiguous M uplink subframes for uplink traffic transmission and v vacation frames for saving power and opportunities for other subscriber stations. Among M uplink subframes, the subscriber station returns its remaining frames, when its queue is empty. The returned bandwidth will then be allocated to other subscriber stations. We carry out an analysis on this queueing system, by using a generating function approach. The performance of the proposed capacity allocation scheme is presented in terms of the first moment of queue length, the mean vacation and transmission period. We also compare its performance with that of a deterministic capacity allocation scheme, in which allocated bandwidth would not be returned
IEEE 3rd International Conference on Mobile Adhoc and Sensor Systems, MASS 2006, 9-12 October 2006, Vancouver, BC, Canada; 01/2006
Data provided are for informational purposes only. Although carefully collected, accuracy cannot be guaranteed. The impact factor represents a rough estimation of the journal's impact factor and does not reflect the actual current impact factor. Publisher conditions are provided by RoMEO. Differing provisions from the publisher's actual policy or licence agreement may be applicable.