Approximate queueing network analysis of patient treatment times

Authors:
S. W. M. Au-Yeung;P. G. Harrison;W. J. Knottenbelt
Affiliations:
Imperial College London, UK;Imperial College London, UK;Imperial College London, UK
Venue:
Proceedings of the 2nd international conference on Performance evaluation methodologies and tools
Year:
2007

Citing 10
Cited 0

Mean Value Analysis for Blocking Queueing Networks

IEEE Transactions on Software Engineering
Approximate mean value analysis algorithms for queuing networks: existence, uniqueness, and convergence results

Journal of the ACM (JACM)
Mean-Value Analysis of Closed Multichain Queuing Networks

Journal of the ACM (JACM)
Experiments with improved approximate mean value analysis algorithms

Performance Evaluation - Special issue on modelling techniques and tools for performance evaluation
Passage time distributions in large Markov chains

SIGMETRICS '02 Proceedings of the 2002 ACM SIGMETRICS international conference on Measurement and modeling of computer systems
Performance Modelling of Communication Networks and Computer Architectures (International Computer S

Performance Modelling of Communication Networks and Computer Architectures (International Computer S
Response time densities in generalised stochastic petri net models

WOSP '02 Proceedings of the 3rd international workshop on Software and performance
Multiclass Multiservers with Deferred Operations in Layered Queueing Networks, with Software System Applications

MASCOTS '04 Proceedings of the The IEEE Computer Society's 12th Annual International Symposium on Modeling, Analysis, and Simulation of Computer and Telecommunications Systems
Optimization of a Tandem M/GI/1 Router Network with Batch Arrivals

IPDPS '05 Proceedings of the 19th IEEE International Parallel and Distributed Processing Symposium (IPDPS'05) - Workshop 15 - Volume 16
Mean value analysis for polling systems

Queueing Systems: Theory and Applications

Quantified Score

Hi-index	0.00

Visualization

Abstract

We develop an approximate generating function analysis (AGFA) technique which approximates the Laplace transform of the probability density function of customer response time in networks of queues with class-based priorities. From the approximated Laplace transform, we derive the first two moments of customer response time. This technique is applied to a model of a large hospital's Accident and Emergency department for which we obtain the mean and standard deviation of total patient service time. We experiment with different patient-handling priority schemes and compare the AGFA moments with the results from a discrete event simulation.