Abstract: In this article, a two-node single-processor Markovian tandem queueing system with task splitting and feedback is considered. Each node has an infinite buffer before it and, thus, no blocking is possible in the system. Splitting feature is added to the model considered and it makes it a novel tandem queue. The functional equation developed from the generating function applied to the s...

We derive the two-dimensional transforms of the transient workload and queue-length distributions in the single-server queue with general service times and a batch Markovian arrival process (BMAP). This arrival process includes the familiar phase-type renewal process and the Markov modulated Poisson process as special cases, and allows correlated interarrival times and batch sizes. Numerical re...

We consider the MAP/M/c queue with markovian flow of breakdowns. There are K waiting positions for arrival customers in the system. The system we consider comprises c servers, of which one are has to work for the customers. The other servers is in the cold standby , repairing or waiting for repairing, only the working server can fails, and there is only one repairman. This model is quite genera...

The discovery of the self similarity of Ethernet traac at Bellcore has had a profound eeect on the world of performance modelling. This paper examines the eeects of self similarity of input traac on the performance of a queue. We use a traac characterisation due to Robert and Le Boudec which allows self similar traac with an arbitrary mean and Hurst parameter to be generated. The technique give...

We consider a markovian multiserver queue with a finite waiting line in which a customer may decide to leave and give up service if its waiting time in queue exceeds its random deadline. We focus on the performance measure in terms of the probability of being served under both transient and stationary regimes. We investigate monotonicity properties of first and second order of this performance ...

This paper considers an infinite-server queue with multiple batch Markovian arrival streams. The service time distribution of customers may be different for different arrival streams, and simultaneous batch arrivals from more than one stream are allowed. For this queue, we first derive a system of ordinary differential equations for the time-dependent matrix joint generating function of the num...

This paper studies an infinite-server queue in a Markov environment, that is, an infinite-server queue with arrival rates and service times depending on the state of a Markovian background process. Scaling the arrival rates λi by a factor N and the rate qij of the background process by a factor N, with α ∈ R, we establish a central limit theorem as N tends to ∞. We find different scaling regime...

We establish heavy traffic limit theorems for queue-length processes in critically loaded single class queueing networks with state dependent arrival and service rates. A distinguishing feature of our model is non-Markovian state dependence. The limit stochastic process is a continuous-path reflected process on the nonnegative orthant. We give an application to generalised Jackson networks with...

This paper studies an infinite-server queue in a Markov environment, that is, an infiniteserver queue with arrival rates and service times depending on the state of a Markovian background process. We focus on the probability that the number of jobs in the system attains an unusually high value. Scaling the arrival rates λi by a factor N and the transition rates νij of the background process as ...

This paper presents the analysis of a finite buffer renewal input queue wherein the customers can decide either to join the queue with a probability or to balk. The service process is Markovian service process (MSP ) governed by an underlyingm-state Markov chain. Employing the supplementary variable and embedded Markov chain techniques, the steadystate system length distributions at pre-arrival...