Skip to main content
SpringerLink
Log in

A new form of an unblockable network

  • Safety, Viability, Reliability, Technical Diagnostics
  • Published:
Automation and Remote Control Aims and scope Submit manuscript

Abstract

We compare the characteristics of folded reconfigurable and unblockable Clos networks obtained by simulation modeling. We consider new forms of unblockable networks: generalized and generalised residual Clos networks. We compare the characteristics of all these networks.

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

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

References

  1. Scott, S., Abts, D., Kim, J., et al., The Black Widow High-Radix Clos Network, Proc. 33rd Int. Symp. Comp. Arch. (ISCA’2006), 2006, URL: http://www.scc.acad.bg/ncsa/articles/library/Switches%20and%20Networks/High_Radix_Clos_Stanford.pdf.

    Google Scholar 

  2. Pipenger, N., On Rearrangeable and Non-Blocking Switching Networks, J. Comput. Syst. Sci., 1978, vol. 17, pp. 307–311.

    Article  Google Scholar 

  3. Arora, S., Leighton, F.T., and Maggs, B.M., On-Line Algorithms for Path Selection in a Nonblocking Network, SIAM J. Comput., 1996, vol. 25, no. 3, pp. 600–625, URL: http://www.cs.princeton.edu/~arora/pubs/AroraLM94.pdf.

    Article  MathSciNet  MATH  Google Scholar 

  4. Podlazov, V.S. and Sokolov, V.V., Generalized Clos Networks, Autom. Remote Control, 2009, vol. 70, no. 10, pp. 1713–1748.

    Article  MathSciNet  Google Scholar 

  5. Karavai, M.F., Parkhomenko, P.P., and Podlazov, V.S., Combinatorial Methods for Constructing Bipartite Uniform Minimal Quasicomplete Graphs (Symmetrical Block Designs), Autom. Remote Control, 2009, vol. 70, no. 2, pp. 312–327.

    Article  MathSciNet  MATH  Google Scholar 

  6. Hall, M., Combinatorial Theory, Blaisdell: Waltham, 1967. Translated under the title Kombinatorika, Moscow: Mir, 1970.

    MATH  Google Scholar 

  7. Clos, C., A Study of Non-Blocking Switching Networks, Bell Syst. Tech. J., 1953, vol. 32, pp. 406–424.

    Article  Google Scholar 

  8. Benes, V.E., Mathematical Theory of Connecting Networks and Telephone Traffic, New York: Academic, 1965. Translated under the title Matematicheskie osnovy teorii telefonnykh soobshchenii, Moscow: Svyaz’, 1968.

    MATH  Google Scholar 

  9. Podlazov, V.S. and Karavai, M.F., System Networks with Direct Channels for Multiprocessor Computational Systems: Perfect System Networks, Palmarium Acad. Publishing, 2012, URL: http://www.ipu.ru/sites/default/files/publications/18125/3747-18125.pdf.

    Google Scholar 

  10. Karavai, M.F. and Podlazov, V.S., Extended Block Designs for Ideal System Area Networks, Probl. Upravlen., 2012, no. 4, pp. 45–51.

    Google Scholar 

  11. Karavai, M.F., Podlazov, V.S., and Sokolov, V.V., The Method of Extending Full Commutators in a Fixed Circuit Basis, Proc. 5th Int. Conf. “Parallel Computations and Control Problems” (PACO’2010), Moscow, 2010, pp. 295–305, URL: http://paco.ipu.ru/pdf/A205.pdf.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Trapeznikov Institute of Control Sciences, Russian Academy of Sciences, Moscow, Russia

    V. S. Podlazov

Authors
  1. V. S. Podlazov
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to V. S. Podlazov.

Additional information

Original Russian Text © V.S. Podlazov, 2014, published in Avtomatika i Telemekhanika, 2014, No. 10, pp. 139–152.

Rights and permissions

Reprints and permissions

About this article

Check for updates. Verify currency and authenticity via CrossMark

Cite this article

Podlazov, V.S. A new form of an unblockable network. Autom Remote Control 75, 1826–1836 (2014). https://doi.org/10.1134/S0005117914100099

Download citation

  • Received:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1134/S0005117914100099

Keywords

Search

Navigation