A lower bound on strictly non-blocking networks


We prove that a strictly non-blockingn-connector of depthk must haveω(n 1+1/(k−1)) edges.

This is a preview of subscription content, access via your institution.


  1. [1]

    C. Clos, A Study of non-blocking switching networks,Bell. Sys. Tech. J.,32 (1953), 406–424.

    Google Scholar 

  2. [2]

    N. Pippenger andL. Valiant, Shifting graphs and their applications,J. ACM,23 (1976), 423–432.

    Google Scholar 

Download references

Author information



Rights and permissions

Reprints and Permissions

About this article

Cite this article

Friedman, J. A lower bound on strictly non-blocking networks. Combinatorica 8, 185–188 (1988). https://doi.org/10.1007/BF02122799

Download citation

AMS subject classification (1980)

  • 94 A