A service provided by the WU Library and the WU IT-Services

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

Böhm, Walter and Jain, J. L. and Mohanty, Sri Gopal (1992) On Zero avoiding Transition Probabilities of an r-node Tandem Queue - a Combinatorial Approach. Forschungsberichte / Institut für Statistik, 26. Department of Statistics and Mathematics, WU Vienna University of Economics and Business, Vienna.

[img]
Preview
PDF
Download (195Kb) | Preview

Abstract

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)

Item Type: Paper
Keywords: Tandem Queue / Zero Avoiding Transition Probabilities / Combinatorial Methods / Lattice Paths
Divisions: Departments > Finance, Accounting and Statistics > Statistics and Mathematics
Depositing User: Repository Administrator
Date Deposited: 11 Jul 2006 10:50
Last Modified: 14 Sep 2010 21:51
URI: http://epub.wu.ac.at/id/eprint/1356

Actions

View Item