On zero-avoiding transition probabilities of an r-node tandem queue: a combinatorial approach

DOI10.2307/3214780zbMath0781.60078OpenAlexW4248224935MaRDI QIDQ4274464

Walter Böhm, Joti L. Jain, Sri Gopal Mohanty

Publication date: 17 February 1994

Published in: Journal of Applied Probability (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.2307/3214780

zbMATH Keywords

lattice pathscombinatorial methodsJackson networkcombinatorial approachzero- avoiding transition probabilities

Mathematics Subject Classification ID

Stochastic network models in operations research (90B15) Queueing theory (aspects of probability theory) (60K25) Applications of Markov renewal processes (reliability, queueing networks, etc.) (60K20)

Related Items (1)

Non-coincidence probabilities and the time-dependent behavior of tandem queues with deterministic input.

This page was built for publication: On zero-avoiding transition probabilities of an r-node tandem queue: a combinatorial approach