Assuming there are always sufficient data waiting to be transmitted, adaptive modulation and coding (AMC) at the physical layer have been traditionally designed separately from higher layers. However, this assumption is not always valid when queuing effects are taken into account at the data link layer. In this paper, we analyze the performance of a wireless system with finite-length queuing an...

This paper considers the queue length distribution in a class of FIFO single-server queues with (possibly correlated) multiple arrival streams, where the service time distribution of customers from each arrival stream may differ from one another among streams. It is widely recognized that the queue length distribution in a FIFO queue with multiple non-Poissonian arrival streams having different...

We study a processor sharing queue with a limited number of service positions and an infinite buffer. The occupied service positions share an underlying resource. We prove that for service times with a decreasing failure rate, the queue length is stochastically decreasing in the number of service positions, and that for service times with an increasing failure rate, the queue length is stochast...

We consider a one dimensional stochastic control problem that arises from queueing network applications. The state process corresponding to the queue-length is given by a stochastic differential equation which reflects at the origin. The controller can choose the drift coefficient which represents the service rate and the buffer size b > 0. When the queue-length reaches b, the new customers are...

We consider a one dimensional stochastic control problem that arises from queueing network applications. The state process corresponding to the queue-length is given by a stochastic differential equation which reflects at the origin. The controller can choose the drift coefficient which represents the service rate and the buffer size b > 0. When the queue-length reaches b, the new customers are...

Using behavioral experiments, we examined the impact of dispensability of effort and salience of feedback on worker productivity and how they can be managed via queueing design. We considered two queue design features: queue structure that can either be parallel queues (multiple queues with a dedicated server per queue) or a single queue (a single pooled queue served by multiple providers); and...

In this paper, we consider a single-cell IEEE 802.16 environment in which the base station allocates subchannels to the subscriber stations in its coverage area. The subchannels allocated to a subscriber station are shared by multiple connections at that subscriber station. To ensure the Quality of Service (QoS) performances, two Connection Admission Control (CAC) mechanisms, namely, threshold-...

This paper considers MAP/G/1 queueing systems under the following two situations: (1) At the end of a busy period, the server is turned off and inspects the queue length every time a customer a,rrives. When the queue length reaches a pre-specified value N , the server turns on and serves customers continuously until the system becomes empty. (2) At the end of a busy period, the server takes a s...