This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
Assessing Reliability of Multistage Interconnection Networks
October 1993 (vol. 42 no. 10)
pp. 1207-1221

[1] H. M. F. AboElFotoh and C. J. Colbourn, "Series-parallel bounds for the two-terminal reliability problem,"ORSA J. Comput., vol. 1, pp. 209-222, 1989.
[2] D. P. Agrawal, "Graph theoretical analysis and design of multistage interconnection networks,"IEEE Trans. Comput., vol. C-32, pp. 637-648, 1983.
[3] M. O. Ball, C. J. Colbourn, and J. S. Provan, "Network reliability," inHandbook of Operations Research: Networks.
[4] M. O. Ball and J. S. Provan, "Calculating bounds on reachability and connectedness in stochastic networks,"Networks, vol. 13, pp. 253-278, 1983.
[5] J. T. Blake and K. S. Trivedi, "Multistage interconnection network reliability,"IEEE Trans. Comput., vol. C-38, pp. 1600-1603, 1989.
[6] J. T. Blake and K. S. Trivedi, "Reliability analysis of interconnection networks using hierarchical composition,"IEEE Trans. Rel., vol. R-38, pp. 111-119, 1989.
[7] C. Botting, S. Rai, and D. P. Agrawal, "Reliability computation of multistage interconnection networks,"IEEE Trans. Rel., vol. R-38, pp. 138-145, 1989.
[8] L. Caccetta and M. Kraetzl, "Blocking probabilities of certain classes of channel graphs," inRecent Studies in Graph Theory(V. R. Kulli, Ed.), to be published.
[9] F. R. K. Chung and F. K. Hwang, "A generalization of Takagi's theorem on optimal channel graphs,"Bell Syst. Tech. J., vol. 57, pp. 171-178, 1978.
[10] C. J. Colbourn,The Combinatorics of Network Reliability. Oxford, U.K.: Oxford University Press, 1987.
[11] C. J. Colbourn and D. D. Harms, "Bounding all-terminal reliability in computer networks,"Networks, vol. 18, pp. 1-12, 1988.
[12] C. J. Colbourn, L. D. Nel, T. B. Boffey, and D. F. Yates, "Probabilistic estimation of damage from fire spread,"Ann. Operat. Res., to be published.
[13] J. D. Esary and F. Proschan, "Coherent structures of nonidentical components,"Technometrics, vol. 5, pp. 191-209, 1963.
[14] D. D. Harms and C. J. Colbourn, "Renormalization of two-terminal reliability,"Networks, to be published.
[15] D. D. Harms, J. S. Devitt, and C. J. Colbourn, "Networks and reliability in Maple," inProceedings of the DIMACS Workshop on Computational Support for Discrete Mathematics, to be published.
[16] F. K. Hwang, "Superior channel graphs," inProc. 9th Int. Teletraffic Cong.(Torremolino, Spain), 1979, paper 543.
[17] K. Hwang and T. P. Chang, "Combinatorial reliability analysis of multiprocessor computers,"IEEE Trans. Rel., vol. R-31, pp. 469-473, 1982.
[18] N. M. Kini, A. Kumar, and D. P. Agrawal, "Quantitative reliability analysis of redundant multistage interconnection networks," inReliability of Computer and Communications Networks, AMS/ACM, 1991, pp. 153-170.
[19] M. Kraetzl and C. J. Colbourn, "Transformations on channel graphs,"IEEE Trans. Commun., to be published.
[20] M. Kraetzl and C. J. Colbourn, "Threshold channel graphs," incombinatorics, Probability and Computing, to be published.
[21] C. Y. Lee, "Analysis of switching networks,"Bell Syst. Tech. J., vol. 34, no. 6, pp. 1287-1315, 1955.
[22] M. V. Lomonosov and V. P. Polesskii, "Maximum of the connectivity probability,"Problems Inform. Transmission, vol. 8, pp. 324-328, 1972.
[23] S. Y. Kuo and W. K. Fuchs, "Spare allocation and reconfiguration in large area VLSI," inProc. 25th ACM/IEEE Design Automat. Conf., 1988, pp. 609-612.
[24] J. S. Provan and M. O. Ball, "The complexity of counting cuts and of computing the probability that a graph is connected,"SIAM J. Comput., vol. 12, pp. 777-788, 1981.
[25] J. G. Shanthikumar, "Bounding network reliability using consecutive minimal cutsets,"IEEE Trans. Rel., vol. R-37, pp. 45-49, 1988.
[26] D. R. Shier,Network Reliability and Algebraic Structures. Oxford, UK: Clarendon, 1991.
[27] T. H. Szymanski and V. C. Hamacher, "On the permutation capability of multistage interconnection networks,"IEEE Trans. Comput., vol. C-36, pp. 810-822, July 1987.
[28] T. H. Szymanski and V. C. Hamacher, "On the universality of multipath multistage interconnection networks,"J. Parallel Distrib. Comput., vol. 7, pp. 541-569, 1989.
[29] K. Takagi, "Optimum channel graph of link system,"Electron. Commun. Japan, vol. 54-A, pp. 1-10, 1971.
[30] A. Varma and C. S. Raghavendra, "Reliability analysis of redundant-path interconnection networks,"IEEE Trans. Rel., vol. R-38, pp. 130-137, 1989.

Citation:
C.J. Colbourn, J.S. Devitt, D.D. Harms, M. Kraetzl, "Assessing Reliability of Multistage Interconnection Networks," IEEE Transactions on Computers, vol. 42, no. 10, pp. 1207-1221, Oct. 1993, doi:10.1109/12.257707
Usage of this product signifies your acceptance of the Terms of Use.