This article studies the performance of the MAP/G/1 queue under workload control and post processing. We first obtain the probability generating function of the queue length distribution. Then we derive the mean queue length. We present computational experiences and compare the MAP queue with the Poisson queue.Accepted versio
Abstract — The bottleneck in many telecommunication systems has often been modeled by an M/G/1 queue...
We study the queue length of the MX /G/1 queue under D-policy. We derive the queue length PGF at an ...
The buffer overflow period in a queue withMarkovian arrival process (MAP) and general service time d...
This paper studies the steady-state queue length process of the MAP/G/1 queue under the dyadic contr...
In this paper, we analyze the discrete-time MAP/G/1 queue under the DD-policy in which the idle serv...
We consider a polling system: a queueing system of $N \geq 1$ queues with Poisson arrivals $Q_1, \ld...
In many applications, significant correlations between arrivals of load-generating events make the n...
AbstractWe consider the MAP/G/1 queue with working vacations and vacation interruption. We obtain th...
Markovian arrival process (MAP), Bulk-service, finite-buffer, queue, multiple-vacations, 60K25,
In many applications, significant correlations between arrivals of load-generating events make the n...
In this paper we study the excursions of the workload process of G/GI/1 queues above a given level. ...
A GI/G/1 queue is a queuing system with a single server and infinite capacity. Jobs arrive according...
textabstractRecently the workload distribution in the M/G/1 queue with work removal has been analyse...
We consider two types of queues with workload-dependent arrival rate and service speed. Our study is...
The queue M/G/1 with a round-robin type queueing discipline is considered. The overall processing ti...
Abstract — The bottleneck in many telecommunication systems has often been modeled by an M/G/1 queue...
We study the queue length of the MX /G/1 queue under D-policy. We derive the queue length PGF at an ...
The buffer overflow period in a queue withMarkovian arrival process (MAP) and general service time d...
This paper studies the steady-state queue length process of the MAP/G/1 queue under the dyadic contr...
In this paper, we analyze the discrete-time MAP/G/1 queue under the DD-policy in which the idle serv...
We consider a polling system: a queueing system of $N \geq 1$ queues with Poisson arrivals $Q_1, \ld...
In many applications, significant correlations between arrivals of load-generating events make the n...
AbstractWe consider the MAP/G/1 queue with working vacations and vacation interruption. We obtain th...
Markovian arrival process (MAP), Bulk-service, finite-buffer, queue, multiple-vacations, 60K25,
In many applications, significant correlations between arrivals of load-generating events make the n...
In this paper we study the excursions of the workload process of G/GI/1 queues above a given level. ...
A GI/G/1 queue is a queuing system with a single server and infinite capacity. Jobs arrive according...
textabstractRecently the workload distribution in the M/G/1 queue with work removal has been analyse...
We consider two types of queues with workload-dependent arrival rate and service speed. Our study is...
The queue M/G/1 with a round-robin type queueing discipline is considered. The overall processing ti...
Abstract — The bottleneck in many telecommunication systems has often been modeled by an M/G/1 queue...
We study the queue length of the MX /G/1 queue under D-policy. We derive the queue length PGF at an ...
The buffer overflow period in a queue withMarkovian arrival process (MAP) and general service time d...