Monte Carlo summation applied to multichain queueing networks

Keith Ross, Jie Wang

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

    Abstract

    Although many closed multichain queuing networks give rise to a product-form solution for their equilibrium probabilities, evaluating performance measures remains nontrivial due to the presence of a normalization constant. The authors propose the application of Monte Carlo summation in order to determine the normalization constant, throughputs, and gradients of throughputs. The rough idea is to randomly sample the product-form solution over the state space and then average to obtain a consistent estimate. The Monte Carlo summation method has computational requirements that grow polynomially in the problem size, in some cases linearly, and can be adapted to arbitrary product-form networks.

    Original languageEnglish (US)
    Title of host publicationProceedings of the IEEE Conference on Decision and Control
    PublisherPubl by IEEE
    Pages483-484
    Number of pages2
    ISBN (Print)0780304500
    StatePublished - Jan 1992
    EventProceedings of the 30th IEEE Conference on Decision and Control Part 1 (of 3) - Brighton, Engl
    Duration: Dec 11 1991Dec 13 1991

    Other

    OtherProceedings of the 30th IEEE Conference on Decision and Control Part 1 (of 3)
    CityBrighton, Engl
    Period12/11/9112/13/91

    Fingerprint

    Queueing networks
    Throughput
    Monte Carlo methods

    ASJC Scopus subject areas

    • Chemical Health and Safety
    • Control and Systems Engineering
    • Safety, Risk, Reliability and Quality

    Cite this

    Ross, K., & Wang, J. (1992). Monte Carlo summation applied to multichain queueing networks. In Proceedings of the IEEE Conference on Decision and Control (pp. 483-484). Publ by IEEE.

    Monte Carlo summation applied to multichain queueing networks. / Ross, Keith; Wang, Jie.

    Proceedings of the IEEE Conference on Decision and Control. Publ by IEEE, 1992. p. 483-484.

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

    Ross, K & Wang, J 1992, Monte Carlo summation applied to multichain queueing networks. in Proceedings of the IEEE Conference on Decision and Control. Publ by IEEE, pp. 483-484, Proceedings of the 30th IEEE Conference on Decision and Control Part 1 (of 3), Brighton, Engl, 12/11/91.
    Ross K, Wang J. Monte Carlo summation applied to multichain queueing networks. In Proceedings of the IEEE Conference on Decision and Control. Publ by IEEE. 1992. p. 483-484
    Ross, Keith ; Wang, Jie. / Monte Carlo summation applied to multichain queueing networks. Proceedings of the IEEE Conference on Decision and Control. Publ by IEEE, 1992. pp. 483-484
    @inproceedings{57e5cffc60a84306a134bad201271ccd,
    title = "Monte Carlo summation applied to multichain queueing networks",
    abstract = "Although many closed multichain queuing networks give rise to a product-form solution for their equilibrium probabilities, evaluating performance measures remains nontrivial due to the presence of a normalization constant. The authors propose the application of Monte Carlo summation in order to determine the normalization constant, throughputs, and gradients of throughputs. The rough idea is to randomly sample the product-form solution over the state space and then average to obtain a consistent estimate. The Monte Carlo summation method has computational requirements that grow polynomially in the problem size, in some cases linearly, and can be adapted to arbitrary product-form networks.",
    author = "Keith Ross and Jie Wang",
    year = "1992",
    month = "1",
    language = "English (US)",
    isbn = "0780304500",
    pages = "483--484",
    booktitle = "Proceedings of the IEEE Conference on Decision and Control",
    publisher = "Publ by IEEE",

    }

    TY - GEN

    T1 - Monte Carlo summation applied to multichain queueing networks

    AU - Ross, Keith

    AU - Wang, Jie

    PY - 1992/1

    Y1 - 1992/1

    N2 - Although many closed multichain queuing networks give rise to a product-form solution for their equilibrium probabilities, evaluating performance measures remains nontrivial due to the presence of a normalization constant. The authors propose the application of Monte Carlo summation in order to determine the normalization constant, throughputs, and gradients of throughputs. The rough idea is to randomly sample the product-form solution over the state space and then average to obtain a consistent estimate. The Monte Carlo summation method has computational requirements that grow polynomially in the problem size, in some cases linearly, and can be adapted to arbitrary product-form networks.

    AB - Although many closed multichain queuing networks give rise to a product-form solution for their equilibrium probabilities, evaluating performance measures remains nontrivial due to the presence of a normalization constant. The authors propose the application of Monte Carlo summation in order to determine the normalization constant, throughputs, and gradients of throughputs. The rough idea is to randomly sample the product-form solution over the state space and then average to obtain a consistent estimate. The Monte Carlo summation method has computational requirements that grow polynomially in the problem size, in some cases linearly, and can be adapted to arbitrary product-form networks.

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

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

    M3 - Conference contribution

    AN - SCOPUS:0026618524

    SN - 0780304500

    SP - 483

    EP - 484

    BT - Proceedings of the IEEE Conference on Decision and Control

    PB - Publ by IEEE

    ER -