We consider an MXI ell queueing system with N-policy and single vacation. As soon as the system becomes empty, the server leaves the system for a vacation of random length 11: When he returns from the vacation, if the system size is greater than or equal to a pretermined value N(threshold), he begins to serve the customers. If not, the server waits in the system until the system size reaches or...

This paper analyzes a renewal input  working vacations queue with change over times and Bernoulli schedulevacation interruption under (a,c,b) policy.The service and vacation times are exponentially distributed.The server begins service if there are at least c units in the queue and the service takes place in batches with a minimum of size a and a maximum of size b (a

A finite-buffer M/G/1-type queueing model is considered in which the level of saturation of the buffer is controlled by a dropping function. A direct analytical method to the study of the transient queue-size distribution is proposed. Applying the embedded Markov chain paradigm and the formula of total probability, a specific-type system of integral equations for the transient queue-size distri...

We study the best achievable performance (in terms of the average queue size and delay) in a stochastic and dynamic version of the bin-packing problem. Items arrive to a queue according to a Poisson process with rate 2ρ, where ρ ∈ (0, 1). The item sizes are independent and identically distributed (i.i.d.) with a uniform distribution in [0, 1]. At each time unit, a single unit-size bin is availa...

This paper investigates the steady state property of queue length for a batch arrival queue under N-policy with single vacation and setup times. When the system becomes empty, the server is turned off at once and takes a single vacation of random length V . When he returns, if the queue length reaches or exceeds threshold ( 1) N N  , the server is immediately turned on but is temporarily unava...

Existence of capacity drop phenomenon, as the difference between pre-queue and queue discharge flow rates, has been one of the controversial concepts of traffic engineering. Several researches have focused on capacity drop existence and also its estimation issues. This paper aims to estimate capacity drop based not only on a comparison between breakdown and queue discharge flow rates, but also ...

In join the shortest queue networks, incoming jobs are assigned to the shortest queue from among a randomly chosen subset of D queues, in a system of N queues; after completion of service at its queue, a job leaves the network. We also assume that jobs arrive into the system according to a rateαN Poisson process, α < 1, with rate-1 service at each queue. When the service at queues is exponentia...

In join the shortest queue networks, incoming jobs are assigned to the shortest queue from among a randomly chosen subset of D queues, in a system of N queues; after completion of service at its queue, a job leaves the network. We also assume that jobs arrive into the system according to a rateαN Poisson process, α < 1, with rate-1 service at each queue. When the service at queues is exponentia...