TY - GEN
T1 - Most probable path techniques for gaussian queueing systems
AU - Norros, Ilkka
PY - 2002
Y1 - 2002
N2 - This paper is a review of an approach to queueing systems where the cumulative input is modelled by a general Gaussian process with stationary increments. The examples include priority and Generalized Processor Sharing systems, and a system where service capacity is allocated according to predicted future demand. The basic technical idea is to identify the most probable path in the threshold exceedance event, or a heuristic approximation of it, and then 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.
AB - This paper is a review of an approach to queueing systems where the cumulative input is modelled by a general Gaussian process with stationary increments. The examples include priority and Generalized Processor Sharing systems, and a system where service capacity is allocated according to predicted future demand. The basic technical idea is to identify the most probable path in the threshold exceedance event, or a heuristic approximation of it, and then 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.
U2 - 10.1007/3-540-47906-6_7
DO - 10.1007/3-540-47906-6_7
M3 - Conference article in proceedings
SN - 3-540-43709-6
SN - 978-3-540-43709-3
T3 - Lecture Notes in Computer Science
SP - 86
EP - 104
BT - Networking 2002
PB - Springer
T2 - 2nd International IFIP-TC6 Networking Conference 2002
Y2 - 19 May 2002 through 24 May 2002
ER -