Thumbnail
Access Restriction
Subscribed

Author Conway, Adrian E. ♦ Pinsky, Eugene ♦ Tridandapani, Srinivasan
Source ACM Digital Library
Content type Text
Publisher Association for Computing Machinery (ACM)
File Format PDF
Copyright Year ©1994
Language English
Subject Domain (in DDC) Computer science, information & general works ♦ Data processing & computer science
Subject Keyword Blocking models ♦ Circuit-switched networks ♦ Decomposition methods ♦ Exact analysis ♦ Locality ♦ Product-form ♦ Recursion ♦ Sparsity
Abstract Three new decomposition methods are developed for the exact analysis of stochastic multi-facility blocking models of the product-form type. The first is a basic decomposition algorithm that reduces the analysis of blocking probabilities to that of two separate subsystems. The second is a generalized M-subsystem decomposition method. The third is a more elaborate and efficient incremental decomposition technique. All of the algorithms exploit the sparsity of locality that can be found in the demand matrix of a system. By reducing the analysis to that of a set of subsystems, the overall dimensionality of the problem is diminished and the computational requirements are reduced significantly. This enables the efficient computation of blocking probabilities in large systems. Several numerical examples are provided to illustrate the computational savings that can be realized.
ISSN 00045411
Age Range 18 to 22 years ♦ above 22 year
Educational Use Research
Education Level UG and PG
Learning Resource Type Article
Publisher Date 1994-07-01
Publisher Place New York
e-ISSN 1557735X
Journal Journal of the ACM (JACM)
Volume Number 41
Issue Number 4
Page Count 28
Starting Page 648
Ending Page 675


Open content in new tab

   Open content in new tab
Source: ACM Digital Library