Skip to main content

Lower Bounds for Wide-Sense Non-blocking Clos Network

  • Conference paper
  • First Online:
Computing and Combinatorics (COCOON 1998)

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 1449))

Included in the following conference series:

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.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. V.E. Benes, Mathematical Theory of Connecting Networks and Telephone Traffic. Academic Press, New York, 1965.

    MATH  Google Scholar 

  2. V.E. Benes, Blocking in the NAIU network, Bell Laboratories Tech. Memo. 1985

    Google Scholar 

  3. C. Clos, A study of nonblocking switching networks, Bell Syst. Tech. J., 32(1953) pp. 406–424.

    Article  Google Scholar 

  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. D.Z. Du, P.C. Fishburn, B. Gao, F.K. Hwang, Wide-sense nonblocking for 3-stage Clos networks, preprint.

    Google Scholar 

  6. B. Gao and Frank Hwang, Wide-sense Nonblocking for Multirate 3-stage Clos Networks, Theoretical Computer Science, 182(1997) pp. 171–182.

    Article  MathSciNet  Google Scholar 

  7. A. Jajszczyk, A new concept-repackable networks, IEEE Trans. Communications 41(1993), pp. 1232–1236.

    Article  Google Scholar 

  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. 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.

    Article  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 1998 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Tsai, KH., Wang, DW. (1998). Lower Bounds for Wide-Sense Non-blocking Clos Network. In: Hsu, WL., Kao, MY. (eds) Computing and Combinatorics. COCOON 1998. Lecture Notes in Computer Science, vol 1449. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-68535-9_25

Download citation

  • DOI: https://doi.org/10.1007/3-540-68535-9_25

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-64824-6

  • Online ISBN: 978-3-540-68535-7

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics