
This Article  
 
Share  
Bibliographic References  
Add to:  
Digg Furl Spurl Blink Simpy Del.icio.us Y!MyWeb  
Search  
 
ASCII Text  x  
Y. Yang, G.M. Masson, "Nonblocking Broadcast Switching Networks," IEEE Transactions on Computers, vol. 40, no. 9, pp. 10051015, September, 1991.  
BibTex  x  
@article{ 10.1109/12.83662, author = {Y. Yang and G.M. Masson}, title = {Nonblocking Broadcast Switching Networks}, journal ={IEEE Transactions on Computers}, volume = {40}, number = {9}, issn = {00189340}, year = {1991}, pages = {10051015}, doi = {http://doi.ieeecomputersociety.org/10.1109/12.83662}, publisher = {IEEE Computer Society}, address = {Los Alamitos, CA, USA}, }  
RefWorks Procite/RefMan/Endnote  x  
TY  JOUR JO  IEEE Transactions on Computers TI  Nonblocking Broadcast Switching Networks IS  9 SN  00189340 SP1005 EP1015 EPD  10051015 A1  Y. Yang, A1  G.M. Masson, PY  1991 KW  processor interconnection; nonblocking; multistage; broadcast networks; network control algorithm; parallel processing systems; multiprocessor interconnection networks; switching networks. VL  40 JA  IEEE Transactions on Computers ER   
Results are presented for nonblocking multistage broadcast networks wherein a request from an idle input port to be connected to some set of idle output ports can be satisfied without any disturbance of other broadcast connections already existing in the network. Furthermore, a linear network control algorithm for realizing such a broadcast connection request is given. These results represent the best known explicit constructions with limited numbers of stages relative to both crosspoint and control algorithm complexity. Thus, these networks are highly useful for practical applications involving the movement of and collaboration with voice/video/text/graphics information that require broadcast capability. These networks are also useful for the interconnection of processor and memory units in parallel processing systems.
[1] V. E. Benes, "Heuristic remarks and mathematical problems regarding the theory of switching systems,"Bell Syst. Tech. J., vol. 41, pp. 12011247, 1962.
[2] C. Clos, "A study of nonblocking switching networks,"Bell Syst. Tech. J., vol. 32, pp. 406424, 1953.
[3] D. Cantor, "On nonblocking switching networks,"Networks, vol. 2, pp. 367377, 1972.
[4] G. M. Masson, "Upper bounds on fanout in connection networks,"IEEE Trans. Circuits Syst., Special Issue on LargeScale Systems, vol. CT20, pp. 222230, 1973.
[5] G. M. Masson and B. W. Jordan, "Realization of a class of multiple connection assignments with multistage connection networks," inProc. Fifth Annu. Princeton Conf. Inform. Sci. Syst., 1971, pp. 316321.
[6] G. M. Masson and B. W. Jordan, "Generalized multistage connection networks,"Networks, vol. 2, pp. 191209, 1972.
[7] F. K. Hwang, "Rearrangeability of multiconnection threestage networks,"Networks, vol. 2, pp. 301306, 1972.
[8] F. K. Hwang, "Threestage multiconnection networks which are nonblocking in the wide sense,"Bell Syst. Tech. J., vol. 58, pp. 12831287, 1979.
[9] A. Jajszczyk, "Comments on: Threestage multiconnection networks which are nonblocking in the wide sense,"Bell Syst. Tech. J., vol. 62, pp. 21132114, 1983.
[10] F. K. Hwang and A. Jajszczyk, "On nonblocking multiconnection networks,"IEEE Trans. Commun., vol. COM34, pp. 10381041, 1986.
[11] G. M. Masson, "Binomial switching networks for concentration and distribution,"IEEE Trans. Commun., vol. COM25, pp. 873884, 1977.
[12] G. M. Masson, "Report on fanout switching networks," presented to P. Fire and H. Graves, GTE Sylvania, and T. Dixon, Department of Defense, Mountain View, CA, 1973.
[13] G. M. Masson, "Lower bounds on crosspoints in concentrators,"IEEE Trans. Comput., vol. C31, pp. 11731179, 1982.
[14] R. W. Kufta and A. G. Vacroux, "Multiple stage networks with fanout capabilities," inProc. Comput. Networking Symp., Silver Spring, MD, 1983, pp. 8996
[15] G. W. Richards and F. K. Hwang, "A twostage rearrangeable broadcast switching network,"IEEE Trans. Commun., vol. COM33, pp. 10251034, 1985.
[16] G. W. Richards and F. K. Hwang, "A twostage rearrangeable broadcast switching network," inProc. 11th Int. Teletraffic Congress, Kyoto, Japan, Sept. 1985, pp. 10831087.
[17] G. W. Richards, "Rearrangeable multiconnection switching networks," United States Patent 4,566,007, Jan. 21, 1986.
[18] C. T. Lea, "A new broadcast switching network,"IEEE Trans. Commun., vol. COM36, pp. 11281137, 1988.
[19] J. S. Turner, "Practical widesense nonblocking generalized connectors," Washington Univ. Comput. Sci. Res. Rep.8829, 1988.
[20] D. Dolev, C. Dwork, N. Pippinger, and A. Widgerson, "Superconcentrators, generalizers and generalized connectors with limited depth," inProc. 15th Annu. ACM Symp. Theory Comput., 1983, pp. 4251.
[21] P. Feldman, J. Friedman, and N. Pippenger, "Widesense nonblocking networks,"SIAM J. Discrete Math., vol. 1, no. 2, pp. 158173, May 1988.
[22] D. G. Kirkpatrick, M. Klawe, and N. Pippenger, "Some graphcoloring theorems with applications to generalized connection networks,"SIAM J. Alg. Disc. Math., vol. 6, no. 4, pp. 576582, Oct. 1985.
[23] N. Pippenger, private communication, 1990.
[24] J. S. Linnell and H. R. Lehman, "New customercontrolled DS3 video switch,"Telephony, pp. 5360, June, 1986.
[25] J. P. Ofman, "A universal automation,"Trans. Moscow Math. Soc., vol. 14, 1965 (translation published by Amer. Muth Soc. pp. 11191125, 1967).
[26] C.D. Thompson, "General connection networks for parallel processor interconnection,"IEEE Trans. Comput., vol. C27, pp. 11191125, 1978.