Advertisement

Lower Bounds for Wide-Sense Non-blocking Clos Network

  • Kuo-Hui Tsai
  • Da-Wei Wang
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 1449)

Abstract

The 3-stage Clos network is generally considered the most basic multistage interconnecting network(MIN). The nonblocking property of such network has been extensively studied in the past. However there are only a few lower bound results regarding wide-sense nonblocking. We show that in the classical circuit switching environment, for large r to guarantee wide-sense nonblocking, 2n − 1 center switches are necessary where r is the number of input switches and n is the number of inlets of each input switch. For the multirate environment, we show that for large enough r any 3-stage Clos network needs at least 3n − 2 center switches to guarantee wide-sense nonblocking. Our proof works for even 2-rate environment.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 1.
    V.E. Benes, Mathematical Theory of Connecting Networks and Telephone Traffic. Academic Press, New York, 1965.zbMATHGoogle Scholar
  2. 2.
    V.E. Benes, Blocking in the NAIU network, Bell Laboratories Tech. Memo. 1985Google Scholar
  3. 3.
    C. Clos, A study of nonblocking switching networks, Bell Syst. Tech. J., 32(1953) pp. 406–424.Google Scholar
  4. 4.
    D.Z. Du, B. Gao, F.K. Hwang, J.H. Kim, On rearrangeable multirate Clos networks. To appear in SIAM J. Comput.Google Scholar
  5. 5.
    D.Z. Du, P.C. Fishburn, B. Gao, F.K. Hwang, Wide-sense nonblocking for 3-stage Clos networks, preprint.Google Scholar
  6. 6.
    B. Gao and Frank Hwang, Wide-sense Nonblocking for Multirate 3-stage Clos Networks, Theoretical Computer Science, 182(1997) pp. 171–182.zbMATHCrossRefMathSciNetGoogle Scholar
  7. 7.
    A. Jajszczyk, A new concept-repackable networks, IEEE Trans. Communications 41(1993), pp. 1232–1236.zbMATHCrossRefGoogle Scholar
  8. 8.
    F.K. Liptopoulos and S. Lhalaasani, Semi-rearrangably nonblocking operation of Clos networks in the multirate environment, To appear in IEEE Trans. Networking.Google Scholar
  9. 9.
    S. Ohta. A simple control algorithm for rearrangable switching networks with time division multiplexed links, IEEE J. Selected Areas of Comm., 5(1987), pp. 1302–1308.CrossRefGoogle Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1998

Authors and Affiliations

  • Kuo-Hui Tsai
    • 1
  • Da-Wei Wang
    • 1
  1. 1.Institute of Information ScienceAcademia SinicaNankang, TaipeiTaiwan, ROC

Personalised recommendations