Efficient decomposition methods for the analysis of multi-facility blocking models

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.

[1]  Luke Y.-C. Lien,et al.  A tree convolution algorithm for the solution of queueing networks , 1983, CACM.

[2]  William Stallings,et al.  ISDN and Broadband ISDN , 1992 .

[3]  A. Girard,et al.  End-to-End Blocking for Circuit-Switched Networks: Polynomial Algorithms for Some Special Cases , 1983, IEEE Trans. Commun..

[4]  J. S. Kaufman,et al.  Sizing a Message Store Subject to Blocking Criteria , 1979, Performance.

[5]  P. Lin,et al.  Analysis of Circuit-Switched Networks Employing Originating-Office Control with Spill-Forward , 1978, IEEE Trans. Commun..

[6]  Keith W. Ross,et al.  Algorithms to determine exact blocking probabilities for multirate tree networks , 1990, IEEE Trans. Commun..

[7]  Zbigniew Dziong,et al.  Congestion Probabilities in a Circuit-Switched Integrated Services Network , 1987, Perform. Evaluation.

[8]  J. M. Holtzman,et al.  Analysis of dependence effects in telephone trunking networks , 1971 .

[9]  Herbert A. Simon,et al.  Aggregation of Variables in Dynamic Systems , 1961 .

[10]  G. Barberis,et al.  Capacity Allocation in a DAMA Satellite System , 1982, IEEE Trans. Commun..

[11]  J. S. Kaufman,et al.  Blocking with Retrials in a Completely Shared Resource Environment , 1992, Perform. Evaluation.

[12]  Eugene Pinsky,et al.  Computational algorithms for blocking probabilities in circuit-switched networks , 1992, Ann. Oper. Res..

[13]  Tarek N. Saadawi,et al.  Blocking Probability in Two-Way Distributed Circuit-Switched CATV , 1986, IEEE Trans. Commun..

[14]  Jie Wang,et al.  Solving product form stochastic networks with Monte Carlo summation , 1990, 1990 Winter Simulation Conference Proceedings.

[15]  D Mitra.  Some results from an asymptotic analysis of a class of simple, circuit-switched networks , 1986 .

[16]  J. Aein.  A Multi-User-Class, Blocked-Calls-Cleared, Demand Access Model , 1978, IEEE Trans. Commun..

[17]  J. Lehoczky,et al.  Insensitivity of blocking probabilities in a circuit-switching network , 1984 .

[18]  G. J. Foschini,et al.  Sharing Memory Optimally , 1983, IEEE Trans. Commun..

[19]  G. Fredrikson.  Analysis of Channel Utilization in Traffic Concentrators , 1974, IEEE Trans. Commun..

[20]  Nicolas D. Georganas,et al.  Queueing networks - exact computational algorithms: a unified theory based on decomposition and aggregation , 1989, Computer systems.

[21]  J. Kaufman,et al.  Blocking in a Shared Resource Environment , 1981, IEEE Trans. Commun..

[22]  Eugene Pinsky,et al.  Exact computation of blocking probabilities in state-dependent multi-facility blocking models , 1991, Performance of Distributed Systems and Integrated Communication Networks.

[23]  W. Whitt,et al.  Blocking when service is required from several facilities simultaneously , 1985, AT&T Technical Journal.

[24]  J.M. Aein,et al.  Satellite capacity allocation , 1977, Proceedings of the IEEE.

[25]  Pravin Varaiya,et al.  Throughput in multiple service, multiple resource communication networks , 1991, IEEE Trans. Commun..

[26]  S. Zachary,et al.  Loss networks , 2009, 0903.0640.

[27]  Izhak Rubin,et al.  Performance analysis of interconnected metropolitan area circuit-switched telecommunications networks , 1988, IEEE Trans. Commun..

[28]  K. Ross,et al.  TELETRAFFIC ENGINEERING FOR PRODUCT-FORM CIRCUIT-SWITCHED NETWORKS , 1990 .

[29]  A. Gersht,et al.  Virtual-circuit load control in fast packet-switched broadband networks , 1988, IEEE Global Telecommunications Conference and Exhibition. Communications for the Information Age.