Output rate-controlled scheduling policy

End-to-end delay bounds calculation

Masaki Hanada, Hidenori Nakazato

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

    2 Citations (Scopus)

    Abstract

    Recently many packet scheduling algorithms based on Generalized Processor Sharing (GPS) and Earliest Deadline First (EDF) have been proposed in order to guarantee deterministic or statistical delay bounds. GPS provides a minimum guaranteed service rate for each session and tight end-to-end 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. EDF is the optimal scheduling algorithm in terms of schedulable region in a single-node network. However, using EDF to provide end-to-end delay bounds is problematic because the traffic will be distorted after traffic aggregation in a multi-node network. In this paper, we present a scheduling policy called Output Rate-Controlled Generalized Processor Sharing (ORC-GPS) in order to guarantee deterministic delay bounds. ORC-GPS is a rate-based scheduling like GPS and controls the service rate to lower the delay bounds for leaky bucket constrained sessions. We compare ORC-GPS with GPS and EDF in terms of delay bounds.

    Original languageEnglish
    Title of host publicationInternational Conference on Advanced Communication Technology, ICACT
    Pages1370-1375
    Number of pages6
    Volume2
    DOIs
    Publication statusPublished - 2007
    Event9th International Conference on Advanced Communication Technology, ICACT 2007 - Gangwon-Do, Korea, Republic of
    Duration: 2007 Feb 122007 Feb 14

    Other

    Other9th International Conference on Advanced Communication Technology, ICACT 2007
    CountryKorea, Republic of
    CityGangwon-Do
    Period07/2/1207/2/14

    Fingerprint

    Scheduling algorithms
    Scheduling
    Agglomeration

    ASJC Scopus subject areas

    • Electrical and Electronic Engineering

    Cite this

    Hanada, M., & Nakazato, H. (2007). Output rate-controlled scheduling policy: End-to-end delay bounds calculation. In International Conference on Advanced Communication Technology, ICACT (Vol. 2, pp. 1370-1375). [4195413] https://doi.org/10.1109/ICACT.2007.358612

    Output rate-controlled scheduling policy : End-to-end delay bounds calculation. / Hanada, Masaki; Nakazato, Hidenori.

    International Conference on Advanced Communication Technology, ICACT. Vol. 2 2007. p. 1370-1375 4195413.

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

    Hanada, M & Nakazato, H 2007, Output rate-controlled scheduling policy: End-to-end delay bounds calculation. in International Conference on Advanced Communication Technology, ICACT. vol. 2, 4195413, pp. 1370-1375, 9th International Conference on Advanced Communication Technology, ICACT 2007, Gangwon-Do, Korea, Republic of, 07/2/12. https://doi.org/10.1109/ICACT.2007.358612
    Hanada M, Nakazato H. Output rate-controlled scheduling policy: End-to-end delay bounds calculation. In International Conference on Advanced Communication Technology, ICACT. Vol. 2. 2007. p. 1370-1375. 4195413 https://doi.org/10.1109/ICACT.2007.358612
    Hanada, Masaki ; Nakazato, Hidenori. / Output rate-controlled scheduling policy : End-to-end delay bounds calculation. International Conference on Advanced Communication Technology, ICACT. Vol. 2 2007. pp. 1370-1375
    @inproceedings{cf525e92caca49c1bdc6f2b207b71260,
    title = "Output rate-controlled scheduling policy: End-to-end delay bounds calculation",
    abstract = "Recently many packet scheduling algorithms based on Generalized Processor Sharing (GPS) and Earliest Deadline First (EDF) have been proposed in order to guarantee deterministic or statistical delay bounds. GPS provides a minimum guaranteed service rate for each session and tight end-to-end 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. EDF is the optimal scheduling algorithm in terms of schedulable region in a single-node network. However, using EDF to provide end-to-end delay bounds is problematic because the traffic will be distorted after traffic aggregation in a multi-node network. In this paper, we present a scheduling policy called Output Rate-Controlled Generalized Processor Sharing (ORC-GPS) in order to guarantee deterministic delay bounds. ORC-GPS is a rate-based scheduling like GPS and controls the service rate to lower the delay bounds for leaky bucket constrained sessions. We compare ORC-GPS with GPS and EDF in terms of delay bounds.",
    author = "Masaki Hanada and Hidenori Nakazato",
    year = "2007",
    doi = "10.1109/ICACT.2007.358612",
    language = "English",
    volume = "2",
    pages = "1370--1375",
    booktitle = "International Conference on Advanced Communication Technology, ICACT",

    }

    TY - GEN

    T1 - Output rate-controlled scheduling policy

    T2 - End-to-end delay bounds calculation

    AU - Hanada, Masaki

    AU - Nakazato, Hidenori

    PY - 2007

    Y1 - 2007

    N2 - Recently many packet scheduling algorithms based on Generalized Processor Sharing (GPS) and Earliest Deadline First (EDF) have been proposed in order to guarantee deterministic or statistical delay bounds. GPS provides a minimum guaranteed service rate for each session and tight end-to-end 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. EDF is the optimal scheduling algorithm in terms of schedulable region in a single-node network. However, using EDF to provide end-to-end delay bounds is problematic because the traffic will be distorted after traffic aggregation in a multi-node network. In this paper, we present a scheduling policy called Output Rate-Controlled Generalized Processor Sharing (ORC-GPS) in order to guarantee deterministic delay bounds. ORC-GPS is a rate-based scheduling like GPS and controls the service rate to lower the delay bounds for leaky bucket constrained sessions. We compare ORC-GPS with GPS and EDF in terms of delay bounds.

    AB - Recently many packet scheduling algorithms based on Generalized Processor Sharing (GPS) and Earliest Deadline First (EDF) have been proposed in order to guarantee deterministic or statistical delay bounds. GPS provides a minimum guaranteed service rate for each session and tight end-to-end 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. EDF is the optimal scheduling algorithm in terms of schedulable region in a single-node network. However, using EDF to provide end-to-end delay bounds is problematic because the traffic will be distorted after traffic aggregation in a multi-node network. In this paper, we present a scheduling policy called Output Rate-Controlled Generalized Processor Sharing (ORC-GPS) in order to guarantee deterministic delay bounds. ORC-GPS is a rate-based scheduling like GPS and controls the service rate to lower the delay bounds for leaky bucket constrained sessions. We compare ORC-GPS with GPS and EDF in terms of delay bounds.

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

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

    U2 - 10.1109/ICACT.2007.358612

    DO - 10.1109/ICACT.2007.358612

    M3 - Conference contribution

    VL - 2

    SP - 1370

    EP - 1375

    BT - International Conference on Advanced Communication Technology, ICACT

    ER -