Monotonicity properties for the stochastic knapsack

Keith Ross, David D. Yao

    Research output: Contribution to journalArticle

    Abstract

    A stochastic system is considered in equilibrium with N servers, no waiting room, and K classes of customers. A class-k customer requires bk servers and releases them simultaneously after a random period of time. This multiclass blocking system is motivated by loss networks that support a variety of traffic types (e.g., voice, video, facsimile). The effect of increasing the state-dependent arrival rates and the number of servers on the throughputs and blocking probabilities is considered. It is noted that the theory developed can be extended to the case where queuing is permitted in the knapsack.

    Original languageEnglish (US)
    Pages (from-to)1173-1179
    Number of pages7
    JournalIEEE Transactions on Information Theory
    Volume36
    Issue number5
    DOIs
    StatePublished - Sep 1990

    Fingerprint

    Servers
    customer
    Facsimile
    video
    Blocking probability
    Stochastic systems
    traffic
    Telecommunication traffic
    Throughput
    time

    ASJC Scopus subject areas

    • Information Systems

    Cite this

    Monotonicity properties for the stochastic knapsack. / Ross, Keith; Yao, David D.

    In: IEEE Transactions on Information Theory, Vol. 36, No. 5, 09.1990, p. 1173-1179.

    Research output: Contribution to journalArticle

    Ross, Keith ; Yao, David D. / Monotonicity properties for the stochastic knapsack. In: IEEE Transactions on Information Theory. 1990 ; Vol. 36, No. 5. pp. 1173-1179.
    @article{c7e1d944fdca490694ed34bcc89e81ca,
    title = "Monotonicity properties for the stochastic knapsack",
    abstract = "A stochastic system is considered in equilibrium with N servers, no waiting room, and K classes of customers. A class-k customer requires bk servers and releases them simultaneously after a random period of time. This multiclass blocking system is motivated by loss networks that support a variety of traffic types (e.g., voice, video, facsimile). The effect of increasing the state-dependent arrival rates and the number of servers on the throughputs and blocking probabilities is considered. It is noted that the theory developed can be extended to the case where queuing is permitted in the knapsack.",
    author = "Keith Ross and Yao, {David D.}",
    year = "1990",
    month = "9",
    doi = "10.1109/18.57223",
    language = "English (US)",
    volume = "36",
    pages = "1173--1179",
    journal = "IEEE Transactions on Information Theory",
    issn = "0018-9448",
    publisher = "Institute of Electrical and Electronics Engineers Inc.",
    number = "5",

    }

    TY - JOUR

    T1 - Monotonicity properties for the stochastic knapsack

    AU - Ross, Keith

    AU - Yao, David D.

    PY - 1990/9

    Y1 - 1990/9

    N2 - A stochastic system is considered in equilibrium with N servers, no waiting room, and K classes of customers. A class-k customer requires bk servers and releases them simultaneously after a random period of time. This multiclass blocking system is motivated by loss networks that support a variety of traffic types (e.g., voice, video, facsimile). The effect of increasing the state-dependent arrival rates and the number of servers on the throughputs and blocking probabilities is considered. It is noted that the theory developed can be extended to the case where queuing is permitted in the knapsack.

    AB - A stochastic system is considered in equilibrium with N servers, no waiting room, and K classes of customers. A class-k customer requires bk servers and releases them simultaneously after a random period of time. This multiclass blocking system is motivated by loss networks that support a variety of traffic types (e.g., voice, video, facsimile). The effect of increasing the state-dependent arrival rates and the number of servers on the throughputs and blocking probabilities is considered. It is noted that the theory developed can be extended to the case where queuing is permitted in the knapsack.

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

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

    U2 - 10.1109/18.57223

    DO - 10.1109/18.57223

    M3 - Article

    VL - 36

    SP - 1173

    EP - 1179

    JO - IEEE Transactions on Information Theory

    JF - IEEE Transactions on Information Theory

    SN - 0018-9448

    IS - 5

    ER -