TY - GEN
T1 - Approximate formulae for Gaussian priority queues
AU - Mannersalo, Petteri
AU - Norros, Ilkka
PY - 2001
Y1 - 2001
N2 - Queueing theory with general Gaussian traffic has no exact results, but reasonably good approximations are easy to obtain. In the context of Differentiated Services, FIFO queues play a minor role. Instead, it is important to understand how priority queues behave when the inputs are Gaussian. This paper focuses on developing practically usable estimates for distributions of Gaussian priority queues. The key idea is to identify the most probable paths along which a big queue arises. Some of the approximations are compared to simulations, and the results are promising.
AB - Queueing theory with general Gaussian traffic has no exact results, but reasonably good approximations are easy to obtain. In the context of Differentiated Services, FIFO queues play a minor role. Instead, it is important to understand how priority queues behave when the inputs are Gaussian. This paper focuses on developing practically usable estimates for distributions of Gaussian priority queues. The key idea is to identify the most probable paths along which a big queue arises. Some of the approximations are compared to simulations, and the results are promising.
U2 - 10.1016/S1388-3437(01)80186-4
DO - 10.1016/S1388-3437(01)80186-4
M3 - Conference article in proceedings
SN - 978-0-444-50911-6
T3 - Teletraffic Science and Engineering
SP - 991
EP - 1002
BT - Teletraffic Engineering in the Internet Era
A2 - Moreira de Souza, Jorge
A2 - da Fonseca, Nelson L.S.
A2 - de Souza e Silva, Edmundo A.
PB - Elsevier
T2 - 17th International Teletraffic Congress, ITC 17
Y2 - 24 September 2001 through 28 September 2001
ER -