Abstract
This paper develops a rather general and easy-to-use
methodology how to obtain good approximations for queue
length distributions in priority and generalized
processor sharing systems where the cumulative input
traffic streams are modeled as general Gaussian processes
with stationary increments. The idea is to identify the
most probable path in the threshold-exceeding event, or a
heuristic approximation of it, and then to use
probability estimates based on this path. The method is
particularly useful for long-range dependent traffic and
complicated traffic mixes, which are difficult to handle
with traditional queueing theory.
Original language | English |
---|---|
Pages (from-to) | 399-412 |
Journal | Computer Networks |
Volume | 40 |
Issue number | 3 |
DOIs | |
Publication status | Published - 2002 |
MoE publication type | A1 Journal article-refereed |
Keywords
- gaussian processes
- generalized processor sharing
- priority queues
- most probable paths