a two server queueing system with single and batch service is considered in this paper. the arrival process is assumed to be poisson and the service rate follows an exponential distribution. server-i serves the customers in both single and batch service, while server-ii serves the customers in batch service only. the laplace transform of the transient and steady state behavior of the model is c...

this paper investigates a discrete-time impatient customer queue with bernoulli-schedule vacation interruption. the  vacation times and the service times during regular busy period and during working vacation period are assumed to follow geometric distribution. we obtain the steady-state probabilities at arbitrary and outside observer's observation epochs using recursive technique. cost an...

This thesis is based on some applications of Markov chains and decision processes for performance analysis ofcongestion avoidance algorithms and power control. First, we study the behaviour of the window size of an MIMDcongestion control algorithm when subject to different loss processes. We show that the logarithm of the embeddedwindow size follows an additive recursive equation, w...

This paper examines the Bernoulli admission control policy for the two phase bulk arrival retrial queueing system wherein the customers has the option either to take second phase of service or to leave the system after completing first essential phase of service. In addition, the arrival rate of the customers depends upon the server status. After the service completion of each individual custom...

It is shown that a Markovian queue, with bulk arrivals and departures having any probability mass functions for their batch sizes, has geometrically distributed queue length at equilibrium (when this exists) provided there is an additional special bulk arrival stream, with particular rate and batch size distribution, when the server is idle. It is shown that the time-averaged input rate of the ...

An approximation algorithm is presented for open tandem queueing networks with finite buffers and with general service times. The algorithm decomposes the system into individual queues with revised arrival and service process and revised queue capacity. Then, each queue is analyzed in isolation. The service process is revised so that to reB.ect the additional delay a unit might undergo due to b...

We consider a class of two-queue polling systems with exhaustive service, where the order in which the server visits the queues is governed by a discrete-time Markov chain. For this model, we derive an expression for the probability generating function of the joint queue length distribution at polling epochs. Based on these results, we obtain explicit expressions for the Laplace-Stieltjes trans...

The revenue management literature for queues typically assumes that providers know the distribution of customer demand attributes. We study an observable1 queue that serves an unknown proportion of patient and impatient customers. The provider has a Bernoulli prior on this proportion, corresponding to an optimistic or pessimistic scenario. For every queue length, she chooses a low or a high...

This paper deals with the study of multi-server queueing model in a fuzzy environment imposition reneging customers. Entry customers system is assumed to be Poisson process and exponential service time distribution under first-come-first-served basis. Specific this investigation derive various performance measures such as queue length, waiting queue, response optimal number servers explicit for...

Consider a single server fixed batch service queueing system under multiple vacation with a possibility of negative arrival in which the arrival rate λ follows a Poisson process, the service time follows an exponential distribution with parameter μ. Further we assume a negative arrival rate occur at the rate of ν which follows a Poisson process and the length of time the server in vacation foll...