ORC-GPS: Output rate-controlled scheduling policy for delay guarantees

Masaki Hanada, Hidenori Nakazato

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

    5 Citations (Scopus)

    Abstract

    Recently packet scheduling algorithms such as Packetized GPS (PGPS), Worst-case Fair Weighted Fair Queueing (WF2Q) and Self-Clocked Fair Queueing (SCFQ) have been proposed in order to guarantee deterministic or statistical delay bounds. These algorithms are based on Generalized Processor Sharing (GPS) which is an ideal scheduling algorithm based on fluid flow model in which the traffic is infinitely divisible. GPS provides a minimum guaranteed service rate for each session and tight delay bounds for leaky bucket constrained sessions. However, the delay bounds are unnecessarily large because each session is served according to its associated constant weight until the session buffer is empty. In this paper, we present a scheduling policy called Output Rate-Controlled Generalized Processor Sharing (ORC-GPS). ORC-GPS is a rate-based scheduling like GPS and controls the service rate to lower the delay bounds for leaky bucket constrained sessions. In numerical experiments, we compare ORC-GPS with GPS in terms of delay bounds.

    Original languageEnglish
    Title of host publicationIEEE International Conference on Communications
    Pages530-535
    Number of pages6
    DOIs
    Publication statusPublished - 2007
    Event2007 IEEE International Conference on Communications, ICC'07 - Glasgow, Scotland
    Duration: 2007 Jun 242007 Jun 28

    Other

    Other2007 IEEE International Conference on Communications, ICC'07
    CityGlasgow, Scotland
    Period07/6/2407/6/28

    Fingerprint

    Scheduling algorithms
    Scheduling
    Flow of fluids
    Experiments

    ASJC Scopus subject areas

    • Media Technology

    Cite this

    Hanada, M., & Nakazato, H. (2007). ORC-GPS: Output rate-controlled scheduling policy for delay guarantees. In IEEE International Conference on Communications (pp. 530-535). [4288764] https://doi.org/10.1109/ICC.2007.93

    ORC-GPS : Output rate-controlled scheduling policy for delay guarantees. / Hanada, Masaki; Nakazato, Hidenori.

    IEEE International Conference on Communications. 2007. p. 530-535 4288764.

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

    Hanada, M & Nakazato, H 2007, ORC-GPS: Output rate-controlled scheduling policy for delay guarantees. in IEEE International Conference on Communications., 4288764, pp. 530-535, 2007 IEEE International Conference on Communications, ICC'07, Glasgow, Scotland, 07/6/24. https://doi.org/10.1109/ICC.2007.93
    Hanada M, Nakazato H. ORC-GPS: Output rate-controlled scheduling policy for delay guarantees. In IEEE International Conference on Communications. 2007. p. 530-535. 4288764 https://doi.org/10.1109/ICC.2007.93
    Hanada, Masaki ; Nakazato, Hidenori. / ORC-GPS : Output rate-controlled scheduling policy for delay guarantees. IEEE International Conference on Communications. 2007. pp. 530-535
    @inproceedings{67229be6e8fa44bfb7d29d850ca54613,
    title = "ORC-GPS: Output rate-controlled scheduling policy for delay guarantees",
    abstract = "Recently packet scheduling algorithms such as Packetized GPS (PGPS), Worst-case Fair Weighted Fair Queueing (WF2Q) and Self-Clocked Fair Queueing (SCFQ) have been proposed in order to guarantee deterministic or statistical delay bounds. These algorithms are based on Generalized Processor Sharing (GPS) which is an ideal scheduling algorithm based on fluid flow model in which the traffic is infinitely divisible. GPS provides a minimum guaranteed service rate for each session and tight delay bounds for leaky bucket constrained sessions. However, the delay bounds are unnecessarily large because each session is served according to its associated constant weight until the session buffer is empty. In this paper, we present a scheduling policy called Output Rate-Controlled Generalized Processor Sharing (ORC-GPS). ORC-GPS is a rate-based scheduling like GPS and controls the service rate to lower the delay bounds for leaky bucket constrained sessions. In numerical experiments, we compare ORC-GPS with GPS in terms of delay bounds.",
    author = "Masaki Hanada and Hidenori Nakazato",
    year = "2007",
    doi = "10.1109/ICC.2007.93",
    language = "English",
    isbn = "1424403537",
    pages = "530--535",
    booktitle = "IEEE International Conference on Communications",

    }

    TY - GEN

    T1 - ORC-GPS

    T2 - Output rate-controlled scheduling policy for delay guarantees

    AU - Hanada, Masaki

    AU - Nakazato, Hidenori

    PY - 2007

    Y1 - 2007

    N2 - Recently packet scheduling algorithms such as Packetized GPS (PGPS), Worst-case Fair Weighted Fair Queueing (WF2Q) and Self-Clocked Fair Queueing (SCFQ) have been proposed in order to guarantee deterministic or statistical delay bounds. These algorithms are based on Generalized Processor Sharing (GPS) which is an ideal scheduling algorithm based on fluid flow model in which the traffic is infinitely divisible. GPS provides a minimum guaranteed service rate for each session and tight delay bounds for leaky bucket constrained sessions. However, the delay bounds are unnecessarily large because each session is served according to its associated constant weight until the session buffer is empty. In this paper, we present a scheduling policy called Output Rate-Controlled Generalized Processor Sharing (ORC-GPS). ORC-GPS is a rate-based scheduling like GPS and controls the service rate to lower the delay bounds for leaky bucket constrained sessions. In numerical experiments, we compare ORC-GPS with GPS in terms of delay bounds.

    AB - Recently packet scheduling algorithms such as Packetized GPS (PGPS), Worst-case Fair Weighted Fair Queueing (WF2Q) and Self-Clocked Fair Queueing (SCFQ) have been proposed in order to guarantee deterministic or statistical delay bounds. These algorithms are based on Generalized Processor Sharing (GPS) which is an ideal scheduling algorithm based on fluid flow model in which the traffic is infinitely divisible. GPS provides a minimum guaranteed service rate for each session and tight delay bounds for leaky bucket constrained sessions. However, the delay bounds are unnecessarily large because each session is served according to its associated constant weight until the session buffer is empty. In this paper, we present a scheduling policy called Output Rate-Controlled Generalized Processor Sharing (ORC-GPS). ORC-GPS is a rate-based scheduling like GPS and controls the service rate to lower the delay bounds for leaky bucket constrained sessions. In numerical experiments, we compare ORC-GPS with GPS in terms of delay bounds.

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

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

    U2 - 10.1109/ICC.2007.93

    DO - 10.1109/ICC.2007.93

    M3 - Conference contribution

    AN - SCOPUS:38549158344

    SN - 1424403537

    SN - 9781424403530

    SP - 530

    EP - 535

    BT - IEEE International Conference on Communications

    ER -