Estimating disperse network queues

Publisher Website
Google Scholar
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.

This publication has 1 reference indexed in Scilit: