OPTIMAL MULTIPLEXING OF HETEROGENEOUS TRAFFIC WITH HARD CONSTRAINT.

Philippe Nain, Keith Ross

    Research output: Chapter in Book/Report/Conference proceedingChapter

    Abstract

    Considered are optimal dynamic policies for multiplexing K plus 1 heterogeneous traffic types onto a single communication channel. The packet types arrive to the channel according to independent Poisson processes. The service requirements are exponential with type dependent means. The optimization criterion is to minimize a linear combination of the average delays for packet types 1 to K, while simultaneously subjecting the average delay of type-0 packets to a hard constraint. The optimal multiplexing policy is shown to be a randomized modification of the ' mu c rule'. The optimization problem is thereby reduced to a problem of finding the optimal randomization factor; an algorithm, which can be implemented in real time, is given to do this for two particular cases.

    Original languageEnglish (US)
    Title of host publicationPerformance Evaluation Review
    Pages100-108
    Number of pages9
    Volume14
    Edition1
    StatePublished - May 1986

    Fingerprint

    Multiplexing
    Telecommunication traffic

    ASJC Scopus subject areas

    • Hardware and Architecture

    Cite this

    Nain, P., & Ross, K. (1986). OPTIMAL MULTIPLEXING OF HETEROGENEOUS TRAFFIC WITH HARD CONSTRAINT. In Performance Evaluation Review (1 ed., Vol. 14, pp. 100-108)

    OPTIMAL MULTIPLEXING OF HETEROGENEOUS TRAFFIC WITH HARD CONSTRAINT. / Nain, Philippe; Ross, Keith.

    Performance Evaluation Review. Vol. 14 1. ed. 1986. p. 100-108.

    Research output: Chapter in Book/Report/Conference proceedingChapter

    Nain, P & Ross, K 1986, OPTIMAL MULTIPLEXING OF HETEROGENEOUS TRAFFIC WITH HARD CONSTRAINT. in Performance Evaluation Review. 1 edn, vol. 14, pp. 100-108.
    Nain P, Ross K. OPTIMAL MULTIPLEXING OF HETEROGENEOUS TRAFFIC WITH HARD CONSTRAINT. In Performance Evaluation Review. 1 ed. Vol. 14. 1986. p. 100-108
    Nain, Philippe ; Ross, Keith. / OPTIMAL MULTIPLEXING OF HETEROGENEOUS TRAFFIC WITH HARD CONSTRAINT. Performance Evaluation Review. Vol. 14 1. ed. 1986. pp. 100-108
    @inbook{5fce35acb8f941cba7bf82fd274f7aed,
    title = "OPTIMAL MULTIPLEXING OF HETEROGENEOUS TRAFFIC WITH HARD CONSTRAINT.",
    abstract = "Considered are optimal dynamic policies for multiplexing K plus 1 heterogeneous traffic types onto a single communication channel. The packet types arrive to the channel according to independent Poisson processes. The service requirements are exponential with type dependent means. The optimization criterion is to minimize a linear combination of the average delays for packet types 1 to K, while simultaneously subjecting the average delay of type-0 packets to a hard constraint. The optimal multiplexing policy is shown to be a randomized modification of the ' mu c rule'. The optimization problem is thereby reduced to a problem of finding the optimal randomization factor; an algorithm, which can be implemented in real time, is given to do this for two particular cases.",
    author = "Philippe Nain and Keith Ross",
    year = "1986",
    month = "5",
    language = "English (US)",
    volume = "14",
    pages = "100--108",
    booktitle = "Performance Evaluation Review",
    edition = "1",

    }

    TY - CHAP

    T1 - OPTIMAL MULTIPLEXING OF HETEROGENEOUS TRAFFIC WITH HARD CONSTRAINT.

    AU - Nain, Philippe

    AU - Ross, Keith

    PY - 1986/5

    Y1 - 1986/5

    N2 - Considered are optimal dynamic policies for multiplexing K plus 1 heterogeneous traffic types onto a single communication channel. The packet types arrive to the channel according to independent Poisson processes. The service requirements are exponential with type dependent means. The optimization criterion is to minimize a linear combination of the average delays for packet types 1 to K, while simultaneously subjecting the average delay of type-0 packets to a hard constraint. The optimal multiplexing policy is shown to be a randomized modification of the ' mu c rule'. The optimization problem is thereby reduced to a problem of finding the optimal randomization factor; an algorithm, which can be implemented in real time, is given to do this for two particular cases.

    AB - Considered are optimal dynamic policies for multiplexing K plus 1 heterogeneous traffic types onto a single communication channel. The packet types arrive to the channel according to independent Poisson processes. The service requirements are exponential with type dependent means. The optimization criterion is to minimize a linear combination of the average delays for packet types 1 to K, while simultaneously subjecting the average delay of type-0 packets to a hard constraint. The optimal multiplexing policy is shown to be a randomized modification of the ' mu c rule'. The optimization problem is thereby reduced to a problem of finding the optimal randomization factor; an algorithm, which can be implemented in real time, is given to do this for two particular cases.

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

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

    M3 - Chapter

    AN - SCOPUS:0022716727

    VL - 14

    SP - 100

    EP - 108

    BT - Performance Evaluation Review

    ER -