Name
Abstract | ||
|---|---|---|
We consider the numerical computation of response time distributions for closed product form queueing networks using thetagged customer approach. We map this problem on to the computation of the time to absorption distribution of a finite-state continuous time Markov chain. The construction and solution of these Markov chains is carried out using a variation of stochastic Petri nets called stochastic reward nets (SRNs). We examine the effects of changing the service discipline and the service time distribution at a queueing center on the response time distribution. A multiserver queueing network example is also presented. While the tagged customer approach for computing the response time distribution is not new, this paper presents a new approach for computing the response time distributions using SRNs. |
Year | DOI | Venue |
|---|---|---|
1994 | 10.1007/BF02024663 | Annals OR |
Keywords | Field | DocType |
stochastic petri net,markov chain,continuous time markov chain | Discrete mathematics,Markov chain mixing time,Mathematical optimization,Continuous-time Markov chain,Markov property,Computer science,Markov chain,Stochastic Petri net,Layered queueing network,Queueing theory,Quasi-birth–death process | Journal |
Volume | Issue | ISSN |
48 | 2 | 1572-9338 |
Citations | PageRank | References |
12 | 0.94 | 11 |
Authors | ||
4 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Jogesh Muppala | 1 | 774 | 79.12 |
| Trivedi, K.S. | 2 | 7721 | 700.23 |
| Varsha Mainkar | 3 | 68 | 8.24 |
| Vidyadhar G. Kulkarni | 4 | 539 | 60.15 |