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

DOI10.2307/3214780MaRDI QIDQ4274464zbMATH OpenOpenAlexFDO

Authors Walter Böhm, Joti L. Jain, S. G. 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

combinatorial approachcombinatorial methodsJackson networklattice pathszero- avoiding transition probabilities

Mathematics Subject Classification ID

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

Recommendations

• The combinatorics of birth-death processes and applications to queues
• The transient solution of M/M/1 queues under (M,N)-policy. A combinatorial approach
• Combinatorial approach to Markovian queueing models
• Series Jackson networks and noncrossing probabilities
• scientific article; zbMATH DE number 1058059

Cited in

(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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4274464)