On Zero avoiding Transition Probabilities of an r-node Tandem Queue - a Combinatorial Approach
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 node...
| Main Authors: | , , |
|---|---|
| Format: | Others |
| Language: | en |
| Published: |
Department of Statistics and Mathematics, WU Vienna University of Economics and Business
1992
|
| Subjects: | |
| Online Access: | http://epub.wu.ac.at/1356/1/document.pdf |