GPS schedulers and gaussian traffic

Petteri Mannersalo, Ilkka Norros

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

    27 Citations (Scopus)

    Abstract

    This article considers Gaussian flows which are fed into a GPS (Generalized Processor Sharing) scheduler. The system is analyzed using a most probable path approach. This method gives quite good approximations for performance measures, like queue length distributions in the full range of queue levels. The approximations are based on the distinction whether it is more probable that an aggregated queue consists of traffic from one class only or whether it is a combination of several classes. The approximate queue length distribution for a specific flow is then calculated either using the Empty Buffer Approximation or the authors' Rough Full Link Approximation, respectively.
    Original languageEnglish
    Title of host publication21st Annual Joint Conference of the IEEE Computer and Communications Societies, IEEE INFOCOM 2002
    Subtitle of host publicationNew York, USA, 23-27 June 2002
    PublisherIEEE Institute of Electrical and Electronic Engineers
    Pages1660-1667
    ISBN (Print)0-7803-7476-2
    DOIs
    Publication statusPublished - 2002
    MoE publication typeA4 Article in a conference publication

    Publication series

    SeriesProceedings - IEEE INFOCOM
    Volume21
    ISSN0743-166X

    Cite this