Approximate Estimation of Transaction Response Time

Neven Tomov, Euan Dempster, M. Howard Williams, P. J B King, Albert Burger

Research output: Contribution to journalArticle

7 Citations (Scopus)

Abstract

This paper describes a study of different approximation techniques used to predict the response times of database transactions represented as patterns of resource consumption and modelled with non-product-form queueing networks. The techniques are applied to a range of examples. The experiments show that none of the approximation techniques has a consistent advantage over the others for all cases considered. On the other hand, a simple heuristic rule is formulated which provides an acceptable approximation to the average transaction response time for the entire range of examples. The rule specifies a procedure for labelling each queue in a queueing network as either an M/M/1 or an M/G/1 resource. The resulting network can then be solved to obtain the mean response time of individual transactions.

Original languageEnglish
Pages (from-to)241-250
Number of pages10
JournalComputer Journal
Volume42
Issue number3
Publication statusPublished - 1999

Fingerprint Dive into the research topics of 'Approximate Estimation of Transaction Response Time'. Together they form a unique fingerprint.

  • Cite this

    Tomov, N., Dempster, E., Howard Williams, M., King, P. J. B., & Burger, A. (1999). Approximate Estimation of Transaction Response Time. Computer Journal, 42(3), 241-250.