Fault-Tolerance Analysis of One-Sided Crosspoint Switching Networks
暂无分享,去创建一个
[1] Richard M. Karp,et al. A n^5/2 Algorithm for Maximum Matchings in Bipartite Graphs , 1971, SWAT.
[2] Chris J. Mitchell,et al. One-stage one-sided rearrangeable switching networks , 1989, IEEE Trans. Commun..
[3] J. Szép,et al. Introduction to the theory of games , 1985 .
[4] Mateo Valero,et al. Reduction of Connections for Multibus Organization , 1983, IEEE Transactions on Computers.
[5] Suresh Chalasani,et al. Reduction of crosspoints in one-sided crosspoint switching networks , 1989, IEEE INFOCOM '89, Proceedings of the Eighth Annual Joint Conference of the IEEE Computer and Communications Societies.
[6] V. E. Benes,et al. Blocking states in connecting networks made of square switches arranged in stages , 1981, The Bell System Technical Journal.
[7] Joydeep Ghosh,et al. Reduction of simultaneous-switching noise in large crossbar networks , 1991 .
[8] Gerald M. Masson,et al. Lower Bounds on Crosspoints in Concentrators , 1982, IEEE Transactions on Computers.
[9] Richard M. Karp,et al. A n^5/2 Algorithm for Maximum Matchings in Bipartite Graphs , 1971, SWAT.
[10] G. Masson. Binomial Switching Networks for Concentration and Distribution , 1977, IEEE Trans. Commun..
[11] V. Benes,et al. Mathematical Theory of Connecting Networks and Telephone Traffic. , 1966 .
[12] Joydeep Ghosh,et al. Rearrangeable operation of large crosspoint switching networks , 1990, IEEE Trans. Commun..