Most probable path techniques for gaussian queueing systems

Ilkka Norros

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

    2 Citations (Scopus)

    Abstract

    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.
    Original languageEnglish
    Title of host publicationNetworking 2002
    Subtitle of host publicationNetworking Technologies, Services, and Protocols; Performance of Computer and Communication Networks; Mobile and Wireless Communications
    PublisherSpringer
    Pages86-104
    ISBN (Electronic)978-3-540-47906-2
    ISBN (Print)3-540-43709-6, 978-3-540-43709-3
    DOIs
    Publication statusPublished - 2002
    MoE publication typeA4 Article in a conference publication
    Event2nd International IFIP-TC6 Networking Conference 2002 - Pisa, Italy
    Duration: 19 May 200224 May 2002

    Publication series

    SeriesLecture Notes in Computer Science
    Volume2345
    ISSN0302-9743

    Conference

    Conference2nd International IFIP-TC6 Networking Conference 2002
    CountryItaly
    CityPisa
    Period19/05/0224/05/02

    Fingerprint Dive into the research topics of 'Most probable path techniques for gaussian queueing systems'. Together they form a unique fingerprint.

    Cite this