Skip to main content
SpringerLink
Log in

On switching network functionalities and their relationships

  • Published:
International Journal of Computer & Information Sciences Aims and scope Submit manuscript

Abstract

First developed for telephone applications, Circuit Switching Networks (CSN) are being used more and more extensively also in computer architecture, but a good understanding of their features are required in order to take advantage of them. Several types of functionalities have been defined in the literature to describe the logical behavior of CSN's. In this work the relationships among the main CSN functionalities are investigated and a domain of definition is identified. In this environment relations as inclusion, composition and specularity of functionalities are considered, and for each functionality upper and lower bounds on complexity are derived or reported from the literature.

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. G. M. Masson, G. C. Gingher, and S. Nakamura, “A Sampler of Circuit Switching Networks,”Computer, June 1979, pp. 32–48.

  2. C. D. Thompson, “Generalized Connection Networks for Parallel Processor Intercommunication,”IEEE Trans. on Computers,27(12):1119–1125 (Dec. 1978).

    Google Scholar 

  3. V. Benes,Mathematical Theory of Connecting Networks and Telephone Traffic (Academic Press, New York, 1965).

    Google Scholar 

  4. N. J. Pippenger, “Superconcentrators,”SIAM Jour. Comp.,6:298–304 (1977).

    Google Scholar 

  5. N. Pippenger, “Generalized Connectors,”SIAM Jour. Comp.,7(4):510–514 (Nov. 1978).

    Google Scholar 

  6. M. S. Pinsker, “On the complexity of a concentrator,”Proc. 7th Internat. Teletraffic Conf.,Stockholm, 1973, pp. 318/1–318/4.

  7. M. Abramowitz and I. Stegun,Handbook of mathematical functions, National Bureau of Standards (Nov. 1964, Washington, D.C.).

  8. C. Jordan,Calculus affinite differences (Chelsea Publishing Co., New York, 1950).

    Google Scholar 

  9. N. J. Pippenger and L. G. Valiant, “Shifting graphs and their applications,”J. Assoc. Comput. Mach.,23:423–432 (1976).

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Istituto di Elaborazione dell'Informazione del CNR, Pisa, Italy

    G. Alia & E. Martinelli

Authors
  1. G. Alia
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. E. Martinelli
    View author publications

    You can also search for this author in PubMed Google Scholar

Additional information

This work has been supported by the National Computer Science Program of the Italian National Research Council.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Alia, G., Martinelli, E. On switching network functionalities and their relationships. International Journal of Computer and Information Sciences 11, 123–138 (1982). https://doi.org/10.1007/BF00995527

Download citation

  • Received:

  • Revised:

  • Issue Date:

  • DOI: https://doi.org/10.1007/BF00995527

Key words

Search

Navigation