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.
References
Kleinrock, L.: "Communication Nets" McGraw-Hill, 1964
Kleinrock, L.: "Analytic and Simulation Methods in Computer Network Design" SJCC 1970
Saaty, T.L.: "Elements of Queueing Theory" McGraw-Hill, 1961.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1973 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Borgonovo, F., Fratta, L. (1973). A model for finite stroage message switching networks. In: Conti, R., Ruberti, A. (eds) 5th Conference on Optimization Techniques Part II. Optimization Techniques 1973. Lecture Notes in Computer Science, vol 4. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-06600-4_9
Download citation
DOI: https://doi.org/10.1007/3-540-06600-4_9
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-06600-2
Online ISBN: 978-3-540-37909-6
eBook Packages: Springer Book Archive