
This Article  
 
Share  
Bibliographic References  
Add to:  
Digg Furl Spurl Blink Simpy Del.icio.us Y!MyWeb  
Search  
 
ASCII Text  x  
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. 12071221, October, 1993.  
BibTex  x  
@article{ 10.1109/12.257707, author = {C.J. Colbourn and J.S. Devitt and D.D. Harms and M. Kraetzl}, title = {Assessing Reliability of Multistage Interconnection Networks}, journal ={IEEE Transactions on Computers}, volume = {42}, number = {10}, issn = {00189340}, year = {1993}, pages = {12071221}, doi = {http://doi.ieeecomputersociety.org/10.1109/12.257707}, publisher = {IEEE Computer Society}, address = {Los Alamitos, CA, USA}, }  
RefWorks Procite/RefMan/Endnote  x  
TY  JOUR JO  IEEE Transactions on Computers TI  Assessing Reliability of Multistage Interconnection Networks IS  10 SN  00189340 SP1207 EP1221 EPD  12071221 A1  C.J. Colbourn, A1  J.S. Devitt, A1  D.D. Harms, A1  M. Kraetzl, PY  1993 VL  42 JA  IEEE Transactions on Computers ER   
[1] H. M. F. AboElFotoh and C. J. Colbourn, "Seriesparallel bounds for the twoterminal reliability problem,"ORSA J. Comput., vol. 1, pp. 209222, 1989.
[2] D. P. Agrawal, "Graph theoretical analysis and design of multistage interconnection networks,"IEEE Trans. Comput., vol. C32, pp. 637648, 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. 253278, 1983.
[5] J. T. Blake and K. S. Trivedi, "Multistage interconnection network reliability,"IEEE Trans. Comput., vol. C38, pp. 16001603, 1989.
[6] J. T. Blake and K. S. Trivedi, "Reliability analysis of interconnection networks using hierarchical composition,"IEEE Trans. Rel., vol. R38, pp. 111119, 1989.
[7] C. Botting, S. Rai, and D. P. Agrawal, "Reliability computation of multistage interconnection networks,"IEEE Trans. Rel., vol. R38, pp. 138145, 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. 171178, 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 allterminal reliability in computer networks,"Networks, vol. 18, pp. 112, 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. 191209, 1963.
[14] D. D. Harms and C. J. Colbourn, "Renormalization of twoterminal 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. R31, pp. 469473, 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. 153170.
[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. 12871315, 1955.
[22] M. V. Lomonosov and V. P. Polesskii, "Maximum of the connectivity probability,"Problems Inform. Transmission, vol. 8, pp. 324328, 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. 609612.
[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. 777788, 1981.
[25] J. G. Shanthikumar, "Bounding network reliability using consecutive minimal cutsets,"IEEE Trans. Rel., vol. R37, pp. 4549, 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. C36, pp. 810822, 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. 541569, 1989.
[29] K. Takagi, "Optimum channel graph of link system,"Electron. Commun. Japan, vol. 54A, pp. 110, 1971.
[30] A. Varma and C. S. Raghavendra, "Reliability analysis of redundantpath interconnection networks,"IEEE Trans. Rel., vol. R38, pp. 130137, 1989.