Output rate-controlled generalized processor sharing

End-to-end delay bounds calculation

Masaki Hanada, Hidenori Nakazato, Hitoshi Watanabe

    Research output: Chapter in Book/Report/Conference proceedingConference contribution

    1 Citation (Scopus)

    Abstract

    Recently multimedia applications such as music or video streaming, video teleconferencing and IP telephony have been flourishing in packet-switched networks. Applications that generate such real-time data can have very diverse quality-of-service (QoS) requirements. In order to guarantee diverse QoS requirements, the combined use of a packet scheduling algorithm based on Generalized Processor Sharing (GPS) and leaky bucket traffic regulator is the most successful QoS mechanism. GPS can provide a minimum guaranteed service rate for each session and tight delay bounds for leaky bucket constrained sessions. However, the delay bounds for leaky bucket constrained sessions under GPS are unnecessarily large because each session is served according to its associated constant weight until the session buffer is empty. In order to solve the problem, a scheduling policy called Output Rate-Controlled Generalized Processor Sharing (ORC-GPS) has been proposed in [10]. ORC-GPS is a rate-based scheduling like GPS, and controls the service rate in order to lower the delay bounds for leaky bucket constrained sessions. In this paper, we extend the delay bounds calculation for single-node networks introduced in [10] to multi-node networks and compare ORC-GPS with GPS in terms of end-to-end delay bounds through numerical experiments.

    Original languageEnglish
    Title of host publicationIEEE Region 10 Annual International Conference, Proceedings/TENCON
    Pages779-784
    Number of pages6
    DOIs
    Publication statusPublished - 2010
    Event2010 IEEE Region 10 Conference, TENCON 2010 - Fukuoka
    Duration: 2010 Nov 212010 Nov 24

    Other

    Other2010 IEEE Region 10 Conference, TENCON 2010
    CityFukuoka
    Period10/11/2110/11/24

    Fingerprint

    Quality of service
    Scheduling
    Teleconferencing
    Packet networks
    Video streaming
    Scheduling algorithms
    Telecommunication traffic
    Experiments

    ASJC Scopus subject areas

    • Electrical and Electronic Engineering
    • Computer Science Applications

    Cite this

    Hanada, M., Nakazato, H., & Watanabe, H. (2010). Output rate-controlled generalized processor sharing: End-to-end delay bounds calculation. In IEEE Region 10 Annual International Conference, Proceedings/TENCON (pp. 779-784). [5686588] https://doi.org/10.1109/TENCON.2010.5686588

    Output rate-controlled generalized processor sharing : End-to-end delay bounds calculation. / Hanada, Masaki; Nakazato, Hidenori; Watanabe, Hitoshi.

    IEEE Region 10 Annual International Conference, Proceedings/TENCON. 2010. p. 779-784 5686588.

    Research output: Chapter in Book/Report/Conference proceedingConference contribution

    Hanada, M, Nakazato, H & Watanabe, H 2010, Output rate-controlled generalized processor sharing: End-to-end delay bounds calculation. in IEEE Region 10 Annual International Conference, Proceedings/TENCON., 5686588, pp. 779-784, 2010 IEEE Region 10 Conference, TENCON 2010, Fukuoka, 10/11/21. https://doi.org/10.1109/TENCON.2010.5686588
    Hanada M, Nakazato H, Watanabe H. Output rate-controlled generalized processor sharing: End-to-end delay bounds calculation. In IEEE Region 10 Annual International Conference, Proceedings/TENCON. 2010. p. 779-784. 5686588 https://doi.org/10.1109/TENCON.2010.5686588
    Hanada, Masaki ; Nakazato, Hidenori ; Watanabe, Hitoshi. / Output rate-controlled generalized processor sharing : End-to-end delay bounds calculation. IEEE Region 10 Annual International Conference, Proceedings/TENCON. 2010. pp. 779-784
    @inproceedings{9232087cb05a4471afbf1ec172c9f2dc,
    title = "Output rate-controlled generalized processor sharing: End-to-end delay bounds calculation",
    abstract = "Recently multimedia applications such as music or video streaming, video teleconferencing and IP telephony have been flourishing in packet-switched networks. Applications that generate such real-time data can have very diverse quality-of-service (QoS) requirements. In order to guarantee diverse QoS requirements, the combined use of a packet scheduling algorithm based on Generalized Processor Sharing (GPS) and leaky bucket traffic regulator is the most successful QoS mechanism. GPS can provide a minimum guaranteed service rate for each session and tight delay bounds for leaky bucket constrained sessions. However, the delay bounds for leaky bucket constrained sessions under GPS are unnecessarily large because each session is served according to its associated constant weight until the session buffer is empty. In order to solve the problem, a scheduling policy called Output Rate-Controlled Generalized Processor Sharing (ORC-GPS) has been proposed in [10]. ORC-GPS is a rate-based scheduling like GPS, and controls the service rate in order to lower the delay bounds for leaky bucket constrained sessions. In this paper, we extend the delay bounds calculation for single-node networks introduced in [10] to multi-node networks and compare ORC-GPS with GPS in terms of end-to-end delay bounds through numerical experiments.",
    author = "Masaki Hanada and Hidenori Nakazato and Hitoshi Watanabe",
    year = "2010",
    doi = "10.1109/TENCON.2010.5686588",
    language = "English",
    isbn = "9781424468904",
    pages = "779--784",
    booktitle = "IEEE Region 10 Annual International Conference, Proceedings/TENCON",

    }

    TY - GEN

    T1 - Output rate-controlled generalized processor sharing

    T2 - End-to-end delay bounds calculation

    AU - Hanada, Masaki

    AU - Nakazato, Hidenori

    AU - Watanabe, Hitoshi

    PY - 2010

    Y1 - 2010

    N2 - Recently multimedia applications such as music or video streaming, video teleconferencing and IP telephony have been flourishing in packet-switched networks. Applications that generate such real-time data can have very diverse quality-of-service (QoS) requirements. In order to guarantee diverse QoS requirements, the combined use of a packet scheduling algorithm based on Generalized Processor Sharing (GPS) and leaky bucket traffic regulator is the most successful QoS mechanism. GPS can provide a minimum guaranteed service rate for each session and tight delay bounds for leaky bucket constrained sessions. However, the delay bounds for leaky bucket constrained sessions under GPS are unnecessarily large because each session is served according to its associated constant weight until the session buffer is empty. In order to solve the problem, a scheduling policy called Output Rate-Controlled Generalized Processor Sharing (ORC-GPS) has been proposed in [10]. ORC-GPS is a rate-based scheduling like GPS, and controls the service rate in order to lower the delay bounds for leaky bucket constrained sessions. In this paper, we extend the delay bounds calculation for single-node networks introduced in [10] to multi-node networks and compare ORC-GPS with GPS in terms of end-to-end delay bounds through numerical experiments.

    AB - Recently multimedia applications such as music or video streaming, video teleconferencing and IP telephony have been flourishing in packet-switched networks. Applications that generate such real-time data can have very diverse quality-of-service (QoS) requirements. In order to guarantee diverse QoS requirements, the combined use of a packet scheduling algorithm based on Generalized Processor Sharing (GPS) and leaky bucket traffic regulator is the most successful QoS mechanism. GPS can provide a minimum guaranteed service rate for each session and tight delay bounds for leaky bucket constrained sessions. However, the delay bounds for leaky bucket constrained sessions under GPS are unnecessarily large because each session is served according to its associated constant weight until the session buffer is empty. In order to solve the problem, a scheduling policy called Output Rate-Controlled Generalized Processor Sharing (ORC-GPS) has been proposed in [10]. ORC-GPS is a rate-based scheduling like GPS, and controls the service rate in order to lower the delay bounds for leaky bucket constrained sessions. In this paper, we extend the delay bounds calculation for single-node networks introduced in [10] to multi-node networks and compare ORC-GPS with GPS in terms of end-to-end delay bounds through numerical experiments.

    UR - http://www.scopus.com/inward/record.url?scp=79951655624&partnerID=8YFLogxK

    UR - http://www.scopus.com/inward/citedby.url?scp=79951655624&partnerID=8YFLogxK

    U2 - 10.1109/TENCON.2010.5686588

    DO - 10.1109/TENCON.2010.5686588

    M3 - Conference contribution

    SN - 9781424468904

    SP - 779

    EP - 784

    BT - IEEE Region 10 Annual International Conference, Proceedings/TENCON

    ER -