
This Article  
 
Share  
Bibliographic References  
Add to:  
Digg Furl Spurl Blink Simpy Del.icio.us Y!MyWeb  
Search  
 
ASCII Text  x  
Yuanyuan Yang, Jianchao Wang, "WideSense Nonblocking Clos Networks Under Packing Strategy," IEEE Transactions on Computers, vol. 48, no. 3, pp. 265284, March, 1999.  
BibTex  x  
@article{ 10.1109/12.754994, author = {Yuanyuan Yang and Jianchao Wang}, title = {WideSense Nonblocking Clos Networks Under Packing Strategy}, journal ={IEEE Transactions on Computers}, volume = {48}, number = {3}, issn = {00189340}, year = {1999}, pages = {265284}, doi = {http://doi.ieeecomputersociety.org/10.1109/12.754994}, publisher = {IEEE Computer Society}, address = {Los Alamitos, CA, USA}, }  
RefWorks Procite/RefMan/Endnote  x  
TY  JOUR JO  IEEE Transactions on Computers TI  WideSense Nonblocking Clos Networks Under Packing Strategy IS  3 SN  00189340 SP265 EP284 EPD  265284 A1  Yuanyuan Yang, A1  Jianchao Wang, PY  1999 KW  Interconnection networks KW  widesense nonblocking KW  routing control strategies KW  packing KW  linear programming KW  Fibonacci numbers. VL  48 JA  IEEE Transactions on Computers ER   
Abstract—In this paper, we study widesense nonblocking conditions under packing strategy for the threestage Clos network, or
[1] C. Clos, “A Study of NonBlocking Switching Networks,” Bell System Technical J., vol. 32, pp. 406424, 1953.
[2] V.E. Benes, Mathematical Theory of Connecting Networks and Telephone Traffic. New York: Academic Press, 1965.
[3] V.E. Benes, “On Rearrangeable ThreeStage Connecting Networks,” Bell System Technical J., vol. 41, no. 5, pp. 1,4811,492, Sept. 1962.
[4] A. Itoh et al. “Practical Implementation and Packaging Technologies for a LargeScale Atm Switching System,” IEEE J. Selected Areas in Comm., vol. 9, no. 8, pp. 1,2801,288. 1991.
[5] J. Beetem, M. Denneau, and D. Weingarten, “The GF11 Supercomputer,” Proc. 12th Ann. Int'l Symp. Computer Architecture, pp. 108115, 1985.
[6] A. Jajszczyk and G. Jekel, “A New ConceptRepackable Networks,” IEEE Trans. Comm., vol. 41, no. 8, pp. 1,2321,237, 1993.
[7] A. Varma and C.S. Raghavendra, Interconnection Networks for Multiprocessors and Multicomputers: Theory and Practice. IEEE C. S. Press, 1994.
[8] M.H. Ackroyd, “Call Repacking in Connecting Networks,” IEEE Trans. Comm. , vol. 27, no. 3, pp. 589591, 1979.
[9] A. Girard and S. Hurtubise, “Dynamic Routing and Call Repacking in CircuitSwitched Networks,” IEEE Trans. Comm., vol. 31, no. 12, pp. 1,2901,294, 1983.
[10] Y. Mun, Y. Tang, and V. Devarajan, “Analysis of Call Packing and Rearrangement in a Multi Stage Switch,” IEEE Trans. Comm., vol. 42,nos. 2/3/4, pp. 252254, 1994.
[11] D.E. Knuth, The Art of Computer Programming, vol. 1,Addison Wesley, second ed. 1973.
[12] V. Chvatal, Linear Programming. W.H. Freeman, 1983.
[13] K.G. Murty, Linear Programming. John Wiley&Sons, 1983.
[14] W. Kaplan, Advanced Calculus, third ed. AddisonWesley, 1973.