Estimating characteristics of queueing networks using transactional data
Authors:
- 1 August 1998
- journal article
- Published by Springer Nature in Queueing Systems
- Vol. 29 (1) , 75-127
Abstract
No abstract availableKeywords
This publication has 8 references indexed in Scilit:
- Approximating last-exit probabilities of a random walk, by application to conditional queue length moments within busy periods of M/GI/1 queuesJournal of Applied Probability, 1994
- A two-point Markov chain boundary-value problemAdvances in Applied Probability, 1993
- Exploiting Markov chains to infer queue length from transactional dataJournal of Applied Probability, 1992
- Deducing Queueing from Transactional Data: The Queue Inference Engine, RevisitedOperations Research, 1992
- Excursions of Markov Processes1992
- Estimating disperse network queuesACM SIGCOMM Computer Communication Review, 1990
- The Queue Inference Engine: Deducing Queue Statistics from Transactional DataManagement Science, 1990
- A tutorial on hidden Markov models and selected applications in speech recognitionProceedings of the IEEE, 1989