Resource title

On Zero avoiding Transition Probabilities of an r-node Tandem Queue - a Combinatorial Approach

Resource image

image for OpenScout resource :: On Zero avoiding Transition Probabilities of an r-node Tandem Queue - a Combinatorial Approach

Resource description

In this paper we present a simple combinatorial approach for the derivation of zero avoiding transition probabilities in a Markovian r- node series Jackson network. The method we propose offers two advantages: first, it is conceptually simple because it is based on transition counts between the nodes and does not require a tensor representation of the network. Second, the method provides us with a very efficient technique for numerical computation of zero avoiding transition probabilities. (author's abstract) ; Series: Forschungsberichte / Institut für Statistik

Resource author

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

Resource publisher

Resource publish date

Resource language

en

Resource content type

application/pdf

Resource resource URL

http://epub.wu.ac.at/1356/1/document.pdf

Resource license

Adapt according to the license agreement. Always reference the original source and author.