A tandem queue with Lévy input : a new representation of the downstream queue length
نویسندگان
چکیده
In this paper we present a new representation for the steady state distribution of the workload of the second queue in a two-node tandem network. It involves the difference of two suprema over two adjacent intervals. In case of spectrally-positive Lévy input, this enables us to derive the Laplace transform and Pollaczek-Khintchine representation of the workload of the second queue. Additionally we obtain the exact distribution of the workload in the case of Brownian and Poisson input, as well as some insightful formulas representing the exact asymptotics for alphastable Lévy inputs. 2000 Mathematics Subject Classification: 60G51, 60K25
منابع مشابه
ANALYSIS OF FINITE BUFFER RENEWAL INPUT QUEUE WITH BALKING AND MARKOVIAN SERVICE PROCESS
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...
متن کاملTail asymptotics for a Lévy-driven tandem queue with an intermediate input
We consider a Lévy-driven tandem queue with an intermediate input assuming that its buffer content process obtained by a reflection mapping has the stationary distribution. For this queue, no closed form formula is known, not only for its distribution but also for the corresponding transform. In this paper we consider only light-tailed inputs. For the Brownian input case, we derive exact tail a...
متن کاملANALYSIS OF RENEWAL INPUT STATE DEPENDENT VACATION QUEUE WITH $N$-POLICY
This paper analyzes renewal input state dependent queue with $N$- policy wherein the server takes exactly one vacation. Using the supplementary variable technique and recursive method, we derive the steady state system length distributions at various epochs. Various performance measures has been presented. Finally, some numerical computations in the form of graphs are presented to show the par...
متن کاملDISCRETE-TIME GI/D-MSP/1/K QUEUE WITH N THRESHOLD POLICY
This paper presents a discrete-time single-server finite buffer N threshold policy queue with renewal input and discreteMarkovian service process. The server terminates service whenever the system becomes empty, and recommencesservice as soon as the number of waiting customers in the queue is N. We obtain the system-length distributionsat pre-arrival and arbitrary epochs using the supplementary...
متن کاملExact asymptotics for a Lévy-driven tandem queue with an intermediate input
We consider a Lévy-driven tandem queue with an intermediate input assuming that its buffer content process obtained by a reflection mapping has the stationary distribution. For this queue, no closed form formula is known, not only for its distribution but also for the corresponding transform. In this paper we consider only light-tailed inputs, and derive exact asymptotics for the tail distribut...
متن کامل