A model for finite stroage message switching networks
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.
Unable to display preview. Download preview PDF.