Algorithms to determine exact blocking probabilities for multirate tree networks

Danny H K Tsang, Keith Ross

    Research output: Contribution to journalArticle

    Abstract

    A circuit-switched network consisting of multiple-access links connected to a common link is considered. Each call requires circuits on one access link and on the common link. The network supports multiple classes of calls where each class specifies a bandwidth requirement, an arrival rate, and a holding-time distribution. Based on a product-form solution for these networks, four algorithms are developed to determine the exact blocking probability for each of the classes. The first two algorithms are based on convolution, the third on the fast Fourier transform, and the fourth on a recursion due to J. S. Kaufman (1981) and to J. W. Roberts (1981). Complexity bounds and numerical results demonstrate that these algorithms can determine blocking probabilities in reasonable CPU time for networks with thousands of circuits.

    Original languageEnglish (US)
    Pages (from-to)1266-1271
    Number of pages6
    JournalIEEE Transactions on Communications
    Volume38
    Issue number8
    StatePublished - Aug 1990

    Fingerprint

    Blocking probability
    Trees (mathematics)
    Networks (circuits)
    Switching networks
    Convolution
    Fast Fourier transforms
    Program processors
    Bandwidth

    ASJC Scopus subject areas

    • Engineering(all)

    Cite this

    Algorithms to determine exact blocking probabilities for multirate tree networks. / Tsang, Danny H K; Ross, Keith.

    In: IEEE Transactions on Communications, Vol. 38, No. 8, 08.1990, p. 1266-1271.

    Research output: Contribution to journalArticle

    Tsang, Danny H K ; Ross, Keith. / Algorithms to determine exact blocking probabilities for multirate tree networks. In: IEEE Transactions on Communications. 1990 ; Vol. 38, No. 8. pp. 1266-1271.
    @article{db5cebaa8413446d87b2757191c5b914,
    title = "Algorithms to determine exact blocking probabilities for multirate tree networks",
    abstract = "A circuit-switched network consisting of multiple-access links connected to a common link is considered. Each call requires circuits on one access link and on the common link. The network supports multiple classes of calls where each class specifies a bandwidth requirement, an arrival rate, and a holding-time distribution. Based on a product-form solution for these networks, four algorithms are developed to determine the exact blocking probability for each of the classes. The first two algorithms are based on convolution, the third on the fast Fourier transform, and the fourth on a recursion due to J. S. Kaufman (1981) and to J. W. Roberts (1981). Complexity bounds and numerical results demonstrate that these algorithms can determine blocking probabilities in reasonable CPU time for networks with thousands of circuits.",
    author = "Tsang, {Danny H K} and Keith Ross",
    year = "1990",
    month = "8",
    language = "English (US)",
    volume = "38",
    pages = "1266--1271",
    journal = "IEEE Transactions on Communications",
    issn = "0090-6778",
    publisher = "Institute of Electrical and Electronics Engineers Inc.",
    number = "8",

    }

    TY - JOUR

    T1 - Algorithms to determine exact blocking probabilities for multirate tree networks

    AU - Tsang, Danny H K

    AU - Ross, Keith

    PY - 1990/8

    Y1 - 1990/8

    N2 - A circuit-switched network consisting of multiple-access links connected to a common link is considered. Each call requires circuits on one access link and on the common link. The network supports multiple classes of calls where each class specifies a bandwidth requirement, an arrival rate, and a holding-time distribution. Based on a product-form solution for these networks, four algorithms are developed to determine the exact blocking probability for each of the classes. The first two algorithms are based on convolution, the third on the fast Fourier transform, and the fourth on a recursion due to J. S. Kaufman (1981) and to J. W. Roberts (1981). Complexity bounds and numerical results demonstrate that these algorithms can determine blocking probabilities in reasonable CPU time for networks with thousands of circuits.

    AB - A circuit-switched network consisting of multiple-access links connected to a common link is considered. Each call requires circuits on one access link and on the common link. The network supports multiple classes of calls where each class specifies a bandwidth requirement, an arrival rate, and a holding-time distribution. Based on a product-form solution for these networks, four algorithms are developed to determine the exact blocking probability for each of the classes. The first two algorithms are based on convolution, the third on the fast Fourier transform, and the fourth on a recursion due to J. S. Kaufman (1981) and to J. W. Roberts (1981). Complexity bounds and numerical results demonstrate that these algorithms can determine blocking probabilities in reasonable CPU time for networks with thousands of circuits.

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

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

    M3 - Article

    AN - SCOPUS:0025474657

    VL - 38

    SP - 1266

    EP - 1271

    JO - IEEE Transactions on Communications

    JF - IEEE Transactions on Communications

    SN - 0090-6778

    IS - 8

    ER -