Skip to main content
Log in

Numerical computation of response time distributions using stochastic reward nets

  • Computational Methods
  • Published:
Annals of Operations Research Aims and scope Submit manuscript

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.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Similar content being viewed by others

References

  1. M. Ajmone Marsan, G. Conte and G. Balbo, A class of generalized stochastic Petri nets for the performance evaluation of multiprocessor systems, ACM Trans. Comput. Syst. 2 (1984) 93–122.

    Article  Google Scholar 

  2. F. Baskett, K.M. Chandy, R.R. Muntz and F.G. Palacios, Open, closed and mixed networks of queues with different classes of customers, J. ACM 22 (1975) 248–260.

    Article  Google Scholar 

  3. O.J. Boxma and H. Daduna, Sojourn times in queueing networks, in:Stochastic Analysis of Computer and Communication Systems ed. H. Takagi (Elsevier Science, North-Holland, Amsterdam, The Netherlands, 1990) pp. 401–450.

    Google Scholar 

  4. G. Ciardo, A. Blakemore, P.F. Chimento, J.K. Muppala and K.S. Trivedi, Automated generation and analysis of Markov reward models using Stochastic Reward Nets, in:Linear Algebra, Markov Chains, and Queueing Models eds. C. Meyer and R.J. Plemmons, IMA Volumes in Mathematics and its Applications, vol. 48 (Springer, Heidelberg, Germany, 1992).

    Google Scholar 

  5. G. Ciardo, J. Muppala and K. Trivedi, SPNP: Stochastic Petri net package, in:Proc. Int. Workshop on Petri Nets and Performance Models, Los Alamos, CA (IEEE Computer Society Press, 1989) pp. 142–150.

  6. A.E. Conway and D.E. O'Brien, Estimating response time distributions in queueing networks, in:Performance of Distributed Systems and Integrated Communication Networks (Elsevier Science North-Holland, Amsterdam, The Netherlands, 1992) pp. 225–244.

    Google Scholar 

  7. S.S. Lavenberg,Computer Performance Modeling Handbook (Academic Press, New York, 1983).

    Google Scholar 

  8. S.S. Lavenberg and M. Reiser, Stationary state probabilities of arrival instants for closed queueing networks with multiple types of customers, J. Appl. Prob. 1 (1980) 1048–1061.

    Google Scholar 

  9. E.D. Lazowska, J. Zahorjan, G.S. Graham and K.C. Sevick,Quantitative System Performance (Prentice-Hall, Englewood Cliffs, NJ, USA, 1984).

    Google Scholar 

  10. B. Melamed and M. Yadin, Numerical computation of sojourn-time distributions in queueing networks, J. ACM 31 (1984) 839–854.

    Article  Google Scholar 

  11. B. Melamed and M. Yadin, Randomization procedures in the computation of cumulative-time distributions over discrete state Markov processes, Oper. Res. 32 (1984) 926–944.

    Article  Google Scholar 

  12. M.K. Molloy, Performance analysis using stochastic Petri nets, IEEE Trans. Comput. C-31 (1982) 913–917.

    Google Scholar 

  13. J.L. Peterson,Petri Net Theory and the Modeling of Systems (Prentice-Hall, Englewood Cliffs, NJ, USA, 1981).

    Google Scholar 

  14. K.E.E. Raatikainen, Approximating response time distributions, in:Proc. 1989 ACM SIGMETRICS Int. Conf. on Measurement and Modeling of Computer Systems, Berkeley, CA (1989) pp. 190–199.

  15. S. Salza and S.S. Lavenberg, Approximating response time distributions in closed queueing network models of computer performance, in:Performance '81, ed. F.J. Klystra (North-Holland, Amsterdam, 1981) pp. 659–666.

    Google Scholar 

  16. K.C. Sevcik and I. Mitrani, The distribution of queueing network states at input and output instants, J. ACM 28 (1981) 358–371.

    Article  Google Scholar 

  17. K.S. Trivedi,Probability and Statistics with Reliability, Queueing, and Computer Science Applications (Prentice-Hall, Englewood Cliffs, NJ, USA, 1982).

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Additional information

This research was sponsored in part by the National Science Foundation under Grant CCR-9108114 and by the Naval Surface Warfare Center under contract N60921-92-C-0161.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Muppala, J.K., Trivedi, K.S., Mainkar, V. et al. Numerical computation of response time distributions using stochastic reward nets. Ann Oper Res 48, 155–184 (1994). https://doi.org/10.1007/BF02024663

Download citation

  • Issue Date:

  • DOI: https://doi.org/10.1007/BF02024663

Keywords

Navigation