Abstract
Recent work in queueing theory has provided a means by which queue lengths can be estimated based solely on information about service completions. The work yields algorithms that permit the estimation of invisible or disperse queues which would be difficult to measure directly. These algorithms may be applied to resources in communications networks at which difficult-to-measure queues exist. The following paper presents an algorithm for queue estimation and measures its accuracy on transmission data taken from an ethernet environment. Results show the algorithm to be fairly accurate despite its simplifying assumption that the arrival process of the data packets is Poisson; for about 2/3 of the queues analyzed, the ratio of the root mean square difference between the real queue and the estimated queue to the average real queue is less than 1/2.
Publisher
Association for Computing Machinery (ACM)
Subject
Computer Networks and Communications,Software
Reference8 articles.
1. R. C. Larson "The Queue Inference Engine : Deducing Queue Statistics From Transactional Data" to appear in Management Science 1990.
2. L. D . Servi personal correspondence August 1990 .
3. On a 68030 at 24Mhz with a f80882 coprocessor it took two days to calculate expected queue length s
4. with the assumption of a 2-Erlang arrival distribution for a busy period with 11 packets .
Cited by
6 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. Queue Inference Engine;Encyclopedia of Operations Research and Management Science;2013
2. inference engine;Encyclopedia of Operations Research and Management Science;2001
3. Estimating characteristics of queueing networks using transactional data;Queueing Systems;1998
4. Q;Encyclopedia of Operations Research and Management Science;1996
5. Exploiting Markov chains to infer queue length from transactional data;Journal of Applied Probability;1992-09