Estimating characteristics of queueing networks using transactional data

Queueing Systems

Volumn 29, Issue 1, 1998, Pages 75-127

  Mandelbaum, Avi ^a   Zeltyn, Sergey ^a  

^a TECHNION ISRAEL INSTITUTE OF TECHNOLOGY   (Israel)

Author keywords

Data analysis; Hidden Markov models; Non parametric inference; Performance evaluation; Queueing inference engine; Queueing networks; Queues

Indexed keywords

DATA REDUCTION; HIDDEN MARKOV MODELS; QUEUEING THEORY; SALES;

IDENTIFICATION NUMBER; NON PARAMETRIC INFERENCES; OPEN QUEUEING NETWORKS; OPERATIONAL DATA; PERFORMANCE EVALUATION; QUEUES; SERVICE OPERATIONS; TRANSACTIONAL DATA;

QUEUEING NETWORKS;

EID: 0032335878     PISSN: 02570130     EISSN: 15729443     Source Type: Journal    
DOI: 10.1023/A:1019119727465     Document Type: Article

References (19)

1. D.J. Bertsimas and L.D. Servi, Deducing queueing from transactional data: The queue inference engine, revisited, Oper. Res. 40 (1992) 217-228.
2. R.M. Blumenthal, Excursions of Markov Processes (Birkhäuser, Boston, 1992).
3. D.J. Daley and L.D. Servi, Exploiting Markov chains to infer queue length from transactional data, J. Appl. Probab. 29 (1992) 713-732.
4. D.J. Daley and L.D. Servi, A two-point Markov chain boundary value problem, Adv. in Appl. Probab. 25 (1993) 607-630.
5. D.J. Daley and L.D. Servi, Approximating last exit probabilities of a random walk, with application to conditional queue length moments within busy periods of M/GI/1 queues, J. Appl. Probab. 31A (1994) 251-267.
6. A. Dembo and O. Zeitouni, Large Deviations Techniques and Applications (Jones and Bartlett, Boston, 1992).
7. R. Durrett, Probability: Theory and Examples (Wadsworth & Brooks, Belmont, CA, 1991).
8. R.G. Elliott, L. Argoun and J.B. Moore, Hidden Markov Models. Estimation and Control (Springer, Berlin, 1995).
9. R. Gawlick, Estimating disperse queueing networks: The queue inference engine, Comput. Commun. Review 20 (1990) 111-118.
10. S.A. Hall, New directions in queue inference for management implementations, Ph.D. thesis, Massachusetts Institute of Technology (1992).
11. D.L. Iglehart, Conditioned limit theorems for random walks, in: Stochastic Processes and Related Topics, Vol. 1, ed. M. Puri (Academic Press, New York).
12. L.K. Jones and R.C. Larson, Efficient computation of probabilities of events described by order statistics and applications to queue inference, Preprint (1992).
13. R.C. Larson, The queue inference engine: Deducing queue statistics from transactional data, Managm. Sci. 36 (1990) 586-601.
14. R.C. Larson, The queue inference engine: Deducing queue statistics from transactional data, addendum, Managm. Sci. 36 (1990) 1062.
15. L.R. Rabiner, A tutorial on Hidden Markov Models and selected applications in speech recognition, Proc. IEEE 77 (1989) 257-286.
16. A. Shwartz and A. Weiss, Large Deviations for Performance Analysis: Queues, Communications and Computing (Chapman & Hall, London, 1995).
17. L. Takacs, Queueing methods in the theory of random graphs, in: Advances in Queueing: Models, Methods and Problems, ed. J.H. Dshalow (CRC Press, 1995) pp. 45-78.
18. J. Walrand, Introduction to Queueing Networks (Prentice-Hall, Englewood Cliffs, NJ, 1988).
19. S. Zeltyn, Estimating characteristics of queueing networks using transactional data, M.Sc. thesis, Technion (1996).