Optimal dynamic scheduling in Jackson networks

Keith Ross, David D. Yao

    Research output: Contribution to journalArticle

    Abstract

    A Jackson-like network that supports J types of interactive traffic (e.g., interactive messages) as well as I types of noninteractive traffic (e.g., file transfers, facsimile) is considered. The service-time distributions and the internal routing are homogeneous for all traffic types but can be node (queue) dependent. The problem is to find a scheduling control that minimizes a weighted sum of the average end-to-end delay for the interactive types and at the same time ensures that the average end-to-end delays for the interactive types will be below given design constraints. Conservation laws are first established and shown to yield the base of a polymatroid. The optimal control problem is then transformed into a linear program with the feasible region being the polymatroid base truncated by delay constraints. An optimal control is identified that partitions the traffic types into I + r (0 ≤ r ≤ J) ordered groups and applies a strict priority rule among the groups. An algorithm is developed that does the grouping and solves the optimization problem. A decentralized implementation of the optimal control is also discussed.

    Original languageEnglish (US)
    Pages (from-to)47-53
    Number of pages7
    JournalIEEE Transactions on Automatic Control
    Volume34
    Issue number1
    DOIs
    StatePublished - Jan 1989

    Fingerprint

    Scheduling
    Facsimile
    Telecommunication traffic
    Conservation

    ASJC Scopus subject areas

    • Control and Systems Engineering
    • Electrical and Electronic Engineering

    Cite this

    Optimal dynamic scheduling in Jackson networks. / Ross, Keith; Yao, David D.

    In: IEEE Transactions on Automatic Control, Vol. 34, No. 1, 01.1989, p. 47-53.

    Research output: Contribution to journalArticle

    Ross, Keith ; Yao, David D. / Optimal dynamic scheduling in Jackson networks. In: IEEE Transactions on Automatic Control. 1989 ; Vol. 34, No. 1. pp. 47-53.
    @article{362fefd58b734895ab3fb3f457bbc291,
    title = "Optimal dynamic scheduling in Jackson networks",
    abstract = "A Jackson-like network that supports J types of interactive traffic (e.g., interactive messages) as well as I types of noninteractive traffic (e.g., file transfers, facsimile) is considered. The service-time distributions and the internal routing are homogeneous for all traffic types but can be node (queue) dependent. The problem is to find a scheduling control that minimizes a weighted sum of the average end-to-end delay for the interactive types and at the same time ensures that the average end-to-end delays for the interactive types will be below given design constraints. Conservation laws are first established and shown to yield the base of a polymatroid. The optimal control problem is then transformed into a linear program with the feasible region being the polymatroid base truncated by delay constraints. An optimal control is identified that partitions the traffic types into I + r (0 ≤ r ≤ J) ordered groups and applies a strict priority rule among the groups. An algorithm is developed that does the grouping and solves the optimization problem. A decentralized implementation of the optimal control is also discussed.",
    author = "Keith Ross and Yao, {David D.}",
    year = "1989",
    month = "1",
    doi = "10.1109/9.8648",
    language = "English (US)",
    volume = "34",
    pages = "47--53",
    journal = "IEEE Transactions on Automatic Control",
    issn = "0018-9286",
    publisher = "Institute of Electrical and Electronics Engineers Inc.",
    number = "1",

    }

    TY - JOUR

    T1 - Optimal dynamic scheduling in Jackson networks

    AU - Ross, Keith

    AU - Yao, David D.

    PY - 1989/1

    Y1 - 1989/1

    N2 - A Jackson-like network that supports J types of interactive traffic (e.g., interactive messages) as well as I types of noninteractive traffic (e.g., file transfers, facsimile) is considered. The service-time distributions and the internal routing are homogeneous for all traffic types but can be node (queue) dependent. The problem is to find a scheduling control that minimizes a weighted sum of the average end-to-end delay for the interactive types and at the same time ensures that the average end-to-end delays for the interactive types will be below given design constraints. Conservation laws are first established and shown to yield the base of a polymatroid. The optimal control problem is then transformed into a linear program with the feasible region being the polymatroid base truncated by delay constraints. An optimal control is identified that partitions the traffic types into I + r (0 ≤ r ≤ J) ordered groups and applies a strict priority rule among the groups. An algorithm is developed that does the grouping and solves the optimization problem. A decentralized implementation of the optimal control is also discussed.

    AB - A Jackson-like network that supports J types of interactive traffic (e.g., interactive messages) as well as I types of noninteractive traffic (e.g., file transfers, facsimile) is considered. The service-time distributions and the internal routing are homogeneous for all traffic types but can be node (queue) dependent. The problem is to find a scheduling control that minimizes a weighted sum of the average end-to-end delay for the interactive types and at the same time ensures that the average end-to-end delays for the interactive types will be below given design constraints. Conservation laws are first established and shown to yield the base of a polymatroid. The optimal control problem is then transformed into a linear program with the feasible region being the polymatroid base truncated by delay constraints. An optimal control is identified that partitions the traffic types into I + r (0 ≤ r ≤ J) ordered groups and applies a strict priority rule among the groups. An algorithm is developed that does the grouping and solves the optimization problem. A decentralized implementation of the optimal control is also discussed.

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

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

    U2 - 10.1109/9.8648

    DO - 10.1109/9.8648

    M3 - Article

    VL - 34

    SP - 47

    EP - 53

    JO - IEEE Transactions on Automatic Control

    JF - IEEE Transactions on Automatic Control

    SN - 0018-9286

    IS - 1

    ER -