Combinatorial Approach to an r-node Tandem Queue
customers arrive at the first node according to a Poisson process with rate λ
the service times at node i, 0 ≤ i ≤ rare i.i.d. random variables having an exponential distribution with mean 1/μ i
the service times at various nodes and interarrival times are independent
initially there are m i > 0 customers waiting at node i
Unable to display preview. Download preview PDF.
- McMahon P.A. (1915) Combinatory Analysis, VoL 1, Cambridge University Press, London.Google Scholar