Approximate formulae for Gaussian priority queues

Petteri Mannersalo, Ilkka Norros

    Research output: Chapter in Book/Report/Conference proceedingConference article in proceedingsScientificpeer-review


    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.
    Original languageEnglish
    Title of host publicationTeletraffic Engineering in the Internet Era
    Subtitle of host publicationProceedings of the International Teletraffic Congress - ITC-17
    EditorsJorge Moreira de Souza, Nelson L.S. da Fonseca, Edmundo A. de Souza e Silva
    ISBN (Print)978-0-444-50911-6
    Publication statusPublished - 2001
    MoE publication typeA4 Article in a conference publication
    Event17th International Teletraffic Congress, ITC 17 - Salvador da Bahia, Brazil
    Duration: 24 Sept 200128 Sept 2001

    Publication series

    SeriesTeletraffic Science and Engineering


    Conference17th International Teletraffic Congress, ITC 17
    CitySalvador da Bahia


    Dive into the research topics of 'Approximate formulae for Gaussian priority queues'. Together they form a unique fingerprint.

    Cite this