Monte carlo summation applied to product-form loss networks

Keith Ross, Jie Wang

    Research output: Contribution to journalArticle

    Abstract

    Loss networks with direct routing have a product-form solution for their equilibrium probabilities. The product-form solution typically involves a normalization constant calling for a multidimensional summation over an astronomical number of states. We propose the application of Monte Carlo summation in order to determine the normalization constant, the blocking probabilities, and the revenue sensitivities. We show that if the proper sampling technique is employed, then the computational effort of Monte Carlo summation is independent of link capacities. We also discuss the application of importance sampling, antithetic variates, and indirect estimation via Little's formula. The method is illustrated with a four-leaf star network supporting multirate traffic.

    Original languageEnglish (US)
    Pages (from-to)323-348
    Number of pages26
    JournalProbability in the Engineering and Informational Sciences
    Volume6
    Issue number3
    DOIs
    StatePublished - 1992

    Fingerprint

    Loss Networks
    Product Form
    Product Form Solution
    Summation
    Importance sampling
    Normalization
    Blocking probability
    Stars
    Blocking Probability
    Importance Sampling
    Sampling
    Star
    Leaves
    Routing
    Traffic
    Revenue

    ASJC Scopus subject areas

    • Industrial and Manufacturing Engineering
    • Statistics and Probability
    • Management Science and Operations Research
    • Statistics, Probability and Uncertainty

    Cite this

    Monte carlo summation applied to product-form loss networks. / Ross, Keith; Wang, Jie.

    In: Probability in the Engineering and Informational Sciences, Vol. 6, No. 3, 1992, p. 323-348.

    Research output: Contribution to journalArticle

    @article{7cb19467c0974e2bb295e2eecb65f15c,
    title = "Monte carlo summation applied to product-form loss networks",
    abstract = "Loss networks with direct routing have a product-form solution for their equilibrium probabilities. The product-form solution typically involves a normalization constant calling for a multidimensional summation over an astronomical number of states. We propose the application of Monte Carlo summation in order to determine the normalization constant, the blocking probabilities, and the revenue sensitivities. We show that if the proper sampling technique is employed, then the computational effort of Monte Carlo summation is independent of link capacities. We also discuss the application of importance sampling, antithetic variates, and indirect estimation via Little's formula. The method is illustrated with a four-leaf star network supporting multirate traffic.",
    author = "Keith Ross and Jie Wang",
    year = "1992",
    doi = "10.1017/S0269964800002576",
    language = "English (US)",
    volume = "6",
    pages = "323--348",
    journal = "Probability in the Engineering and Informational Sciences",
    issn = "0269-9648",
    publisher = "Cambridge University Press",
    number = "3",

    }

    TY - JOUR

    T1 - Monte carlo summation applied to product-form loss networks

    AU - Ross, Keith

    AU - Wang, Jie

    PY - 1992

    Y1 - 1992

    N2 - Loss networks with direct routing have a product-form solution for their equilibrium probabilities. The product-form solution typically involves a normalization constant calling for a multidimensional summation over an astronomical number of states. We propose the application of Monte Carlo summation in order to determine the normalization constant, the blocking probabilities, and the revenue sensitivities. We show that if the proper sampling technique is employed, then the computational effort of Monte Carlo summation is independent of link capacities. We also discuss the application of importance sampling, antithetic variates, and indirect estimation via Little's formula. The method is illustrated with a four-leaf star network supporting multirate traffic.

    AB - Loss networks with direct routing have a product-form solution for their equilibrium probabilities. The product-form solution typically involves a normalization constant calling for a multidimensional summation over an astronomical number of states. We propose the application of Monte Carlo summation in order to determine the normalization constant, the blocking probabilities, and the revenue sensitivities. We show that if the proper sampling technique is employed, then the computational effort of Monte Carlo summation is independent of link capacities. We also discuss the application of importance sampling, antithetic variates, and indirect estimation via Little's formula. The method is illustrated with a four-leaf star network supporting multirate traffic.

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

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

    U2 - 10.1017/S0269964800002576

    DO - 10.1017/S0269964800002576

    M3 - Article

    AN - SCOPUS:84971896317

    VL - 6

    SP - 323

    EP - 348

    JO - Probability in the Engineering and Informational Sciences

    JF - Probability in the Engineering and Informational Sciences

    SN - 0269-9648

    IS - 3

    ER -