This article studies the impact on the design of scheduling algorithms for Orthogonal Frequency Division Multiple Access (OFDMA) systems of two traffic models described in the evaluation methodology proposals from standardization bodies: the full buffer and the finite buffer traffic models. The analysis concentrates on utility-based scheduling with an a-fair utility function for Non-Real Time (...

We consider an Internet link carrying http-like traffic, i.e., transfer of finite volume files starting at random time instants. These file transfers are controlled by an adaptive window protocol (AWP); an example of such a protocol is TCP. We provide an analysis for the auto-covariance function of the AWP controlled traffic into the link’s buffer; this traffic, in general, is not an on-off pro...

This paper presents the analysis of a renewal input  finite buffer queue wherein the customers can decide either to  join the queue with a probability or balk. The service process is Markovian service process ($MSP$) governed  by an underlying $m$-state Markov chain. Employing the supplementary  variable and imbedded Markov chain techniques,   the steady-state system length distributions at pre...