Optimal Scheduling of Interactive and Noninteractive Traffic in Telecommunication Systems

Keith Ross, Bintong Chen

    Research output: Contribution to journalArticle

    Abstract

    Heterogeneous traffic types (interactive messages, file transfers, facsimile, etc.) compete for access to a shared resource (satellite channel, bus, etc.). If a packet is not immediately given access to the resource, it waits in a buffer. We assume that the buffer capacity is infinite, that the traffic types arrive according to independent Poisson processes, and that the period over which a packet occupies the resource has an arbitrary type-dependent distribution. The traffic types are partitioned into two groups: interactive and noninteractive. The average delay of each of the interactive types is required below given thresholds. The problem of finding an optimal scheduling policy that minimizes a linear combination of the average delays for the noninteractive types while meeting the design constraints is considered. Simple necessary and sufficient conditions are derived for the existence of a policy that satisfies the constraints. An algorithm is given that decomposes the traffic types into an ordered arrangement of groups, and the existence of a policy that gives strict priority accordingly is established. Under weak conditions on the costs and rates, it is shown that all optimal policies must have this structural property. Sensitivity and aggregation analyses are given. Finally, exploiting the above decomposition, an optimal policy is constructed and is shown to have many appealing properties.

    Original languageEnglish (US)
    Pages (from-to)261-267
    Number of pages7
    JournalIEEE Transactions on Automatic Control
    Volume33
    Issue number3
    DOIs
    StatePublished - 1988

    Fingerprint

    Facsimile
    Telecommunication systems
    Telecommunication traffic
    Structural properties
    Agglomeration
    Scheduling
    Satellites
    Decomposition
    Costs

    ASJC Scopus subject areas

    • Computer Science Applications
    • Control and Systems Engineering
    • Electrical and Electronic Engineering

    Cite this

    Optimal Scheduling of Interactive and Noninteractive Traffic in Telecommunication Systems. / Ross, Keith; Chen, Bintong.

    In: IEEE Transactions on Automatic Control, Vol. 33, No. 3, 1988, p. 261-267.

    Research output: Contribution to journalArticle

    @article{54bca925babb4579ab1590862990f92c,
    title = "Optimal Scheduling of Interactive and Noninteractive Traffic in Telecommunication Systems",
    abstract = "Heterogeneous traffic types (interactive messages, file transfers, facsimile, etc.) compete for access to a shared resource (satellite channel, bus, etc.). If a packet is not immediately given access to the resource, it waits in a buffer. We assume that the buffer capacity is infinite, that the traffic types arrive according to independent Poisson processes, and that the period over which a packet occupies the resource has an arbitrary type-dependent distribution. The traffic types are partitioned into two groups: interactive and noninteractive. The average delay of each of the interactive types is required below given thresholds. The problem of finding an optimal scheduling policy that minimizes a linear combination of the average delays for the noninteractive types while meeting the design constraints is considered. Simple necessary and sufficient conditions are derived for the existence of a policy that satisfies the constraints. An algorithm is given that decomposes the traffic types into an ordered arrangement of groups, and the existence of a policy that gives strict priority accordingly is established. Under weak conditions on the costs and rates, it is shown that all optimal policies must have this structural property. Sensitivity and aggregation analyses are given. Finally, exploiting the above decomposition, an optimal policy is constructed and is shown to have many appealing properties.",
    author = "Keith Ross and Bintong Chen",
    year = "1988",
    doi = "10.1109/9.403",
    language = "English (US)",
    volume = "33",
    pages = "261--267",
    journal = "IEEE Transactions on Automatic Control",
    issn = "0018-9286",
    publisher = "Institute of Electrical and Electronics Engineers Inc.",
    number = "3",

    }

    TY - JOUR

    T1 - Optimal Scheduling of Interactive and Noninteractive Traffic in Telecommunication Systems

    AU - Ross, Keith

    AU - Chen, Bintong

    PY - 1988

    Y1 - 1988

    N2 - Heterogeneous traffic types (interactive messages, file transfers, facsimile, etc.) compete for access to a shared resource (satellite channel, bus, etc.). If a packet is not immediately given access to the resource, it waits in a buffer. We assume that the buffer capacity is infinite, that the traffic types arrive according to independent Poisson processes, and that the period over which a packet occupies the resource has an arbitrary type-dependent distribution. The traffic types are partitioned into two groups: interactive and noninteractive. The average delay of each of the interactive types is required below given thresholds. The problem of finding an optimal scheduling policy that minimizes a linear combination of the average delays for the noninteractive types while meeting the design constraints is considered. Simple necessary and sufficient conditions are derived for the existence of a policy that satisfies the constraints. An algorithm is given that decomposes the traffic types into an ordered arrangement of groups, and the existence of a policy that gives strict priority accordingly is established. Under weak conditions on the costs and rates, it is shown that all optimal policies must have this structural property. Sensitivity and aggregation analyses are given. Finally, exploiting the above decomposition, an optimal policy is constructed and is shown to have many appealing properties.

    AB - Heterogeneous traffic types (interactive messages, file transfers, facsimile, etc.) compete for access to a shared resource (satellite channel, bus, etc.). If a packet is not immediately given access to the resource, it waits in a buffer. We assume that the buffer capacity is infinite, that the traffic types arrive according to independent Poisson processes, and that the period over which a packet occupies the resource has an arbitrary type-dependent distribution. The traffic types are partitioned into two groups: interactive and noninteractive. The average delay of each of the interactive types is required below given thresholds. The problem of finding an optimal scheduling policy that minimizes a linear combination of the average delays for the noninteractive types while meeting the design constraints is considered. Simple necessary and sufficient conditions are derived for the existence of a policy that satisfies the constraints. An algorithm is given that decomposes the traffic types into an ordered arrangement of groups, and the existence of a policy that gives strict priority accordingly is established. Under weak conditions on the costs and rates, it is shown that all optimal policies must have this structural property. Sensitivity and aggregation analyses are given. Finally, exploiting the above decomposition, an optimal policy is constructed and is shown to have many appealing properties.

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

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

    U2 - 10.1109/9.403

    DO - 10.1109/9.403

    M3 - Article

    VL - 33

    SP - 261

    EP - 267

    JO - IEEE Transactions on Automatic Control

    JF - IEEE Transactions on Automatic Control

    SN - 0018-9286

    IS - 3

    ER -