Advertisement

A model for finite stroage message switching networks

  • F. Borgonovo
  • L. Fratta
Computer And Communication Networks
Part of the Lecture Notes in Computer Science book series (LNCS, volume 4)

Abstract

In this paper the analysis of particular message switching networks is performed taking into account the finite storage at nodes.

An upper and lower bound to the node blocking probability are computed when the exact values are not available because of the computational complexity.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Kleinrock, L.: "Communication Nets" McGraw-Hill, 1964Google Scholar
  2. Kleinrock, L.: "Analytic and Simulation Methods in Computer Network Design" SJCC 1970Google Scholar
  3. Saaty, T.L.: "Elements of Queueing Theory" McGraw-Hill, 1961.Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1973

Authors and Affiliations

  • F. Borgonovo
    • 1
  • L. Fratta
    • 1
  1. 1.Istituto di Elettronica and Centro Telecomunicazioni SpazialiCNR Politecnico di MilanoItaly

Personalised recommendations