Evaluation of the Maximum Level Reached by a Queue Over a Finite Period

This paper deals with the performance analysis of a system modeled by a queue. If we are interested in occupation problems and if we look at the transient phase, then it makes sense to study the maximum backlog observed in the queue over a finite period. This paper proposes an efficient algorithmic scheme to evaluate the distribution of this maximum backlog level, based on the uniformization technique. The approach is illustrated using the classical M/M/1 model, but it can be extended to more complex ones.

• Type: Conference
• Year: 2002
• Where: DSN
• Authors: Gerardo Rubino
• Keywords: Computer Networks, DSN 2002, Efficient Algorithmic Scheme, Maximum Backlog, Maximum Backlog Level