Advertisement

Wide-sense Nonblocking for 3-stage Clos Networks

Chapter
  • 102 Downloads
Part of the Network Theory and Applications book series (NETA, volume 5)

Abstract

Let C,(n,m,r) denote the symmetric 3-stage Clos network with r n × m crossbars in the first and third stage, and m r × r crossbars in the second stage. A network is wide-sense nonblocking if it is nonblocking under a given routing algorithm. Packing is a routing algorithm much heralded in the folklore, and was shown to save n/2 center switches for r = 2. We prove the surprising result that packing does not save anything for r ≥ 3. We also show that C (n,m,r) is not wide-sense nonblocking (under any algorithm) for r ≥ 3 if m < [7n/4]. We also extend some results to asymmetric 3-stage Clos networks

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. [1]
    Benes, V. E., Mathematical Theory of Connecting Networks and Telephone Traffic, Academic Press, New York, 1965.zbMATHGoogle Scholar
  2. [2]
    Benes, V. E., Blocking in the NAIU network, AT&T Bell Laboratories Tech. Memo, 1985.Google Scholar
  3. [3]
    Chung, S.-P and Ross, K. W., On nonblocking multirate interconnection networks, SIAM J. Comput. 20(1991) 726 - 736.MathSciNetzbMATHCrossRefGoogle Scholar
  4. [4]
    Clos, C., A study of nonblocking networks, Bell Syst. Tech. J. 32(1953) 406 - 424.Google Scholar
  5. [5]
    Duguid, A. M., Structural properties of switching networks, Brown Univ. Progress Report BTL-7, 1959.Google Scholar
  6. [6]
    Slepian, D., Two theorems on a particular crossbar switching network, AT&T Bell Labs Tech. Memo, 1958.Google Scholar
  7. [7]
    Smith, D. G., Lower bound on the size of a 3-stage wide-sense nonblocking network, Elec. Lett.13 (1977) 215–216.CrossRefGoogle Scholar
  8. [8]
    Yang, Y. and Wang, W., Wide-sense nonblocking Clos networks under packing strategy, IEEE Trans. Cmput. 45(1999) 265 - 254.CrossRefGoogle Scholar

Copyright information

© Kluwer Academic Publishers 2001

Authors and Affiliations

  1. 1.Department of Computer Science and EngineeringUniversity of MinnesotaMinneapolisUSA
  2. 2.AT&T Shannon LaboratoryFlorham ParkUSA
  3. 3.Lattice Semiconductor CorpMilpitasUSA
  4. 4.Department of MathematicsChiao Tung UniversityHsinChuTaiwan, ROC

Personalised recommendations