In this paper we examine a tandem network of queueing nodes where a nonstationary external Markovian arrival process feeds the initial upstream node. We develop methods for modeling the departure flow from any upstream node in its role as the arrival process to the immediate downstream node, and employ various techniques to match the interarrival moments to the downstream node to the moments of...

We consider a two-stage tandem queue with two parallel servers and two queues. We assume that initially all jobs are present and that no further arrivals take place at any time. The two servers are identical and can serve both types of job. The processing times are exponentially distributed. After being served, a job of queue 1 joins queue 2, whereas a job of queue 2 leaves the system. Holding ...

We consider a stochastic fluid network where the external input processes are compound Poisson with heavy-tailed Weibullian jumps. Our results comprise of large deviations estimates for buffer content process in vector-valued Skorokhod space which is endowed product $$J_1$$ topology. To illustrate our framework, we provide explicit tandem queue. At heart proof recent sample-path result, and nov...

Abstract: In this paper, we present a performance analysis of a system with two multiplexers in tandem. Each multiplexer is fed by an external arrival process that consists of the superposition of the traffic generated by independent binary Markov sources. Further, the output of the first multiplexer is fed into the second multiplexer according to an independent Bernoulli process. The probabili...

In this paper the end-to-end performance evaluation of a tagged session is considered through the study of a tandem queueing network. A service discipline is adopted at each queue which allows for the study of First-Come First-Served (FCFS) as well as peak-rate-enforcing multiplexing schemes. A numerical approach is presented which allows for the computation of delay, jitter and inter-departure...

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...

A Message Channel is dejined as a tandem connection of single server queues in which the successive service times experienced by any particular customer are scaled versions of the same random variable, and thus it serves as a model for sparsely connected store-and-forward data communications networks (or network segments) where messages typically preserve their lengths as they traverse the syst...