Hostname: page-component-78c5997874-m6dg7 Total loading time: 0 Render date: 2024-11-12T19:47:54.549Z Has data issue: false hasContentIssue false
  • English
  • Français

Exact analysis for a class of simple, circuit-switched networks with blocking

Published online by Cambridge University Press:  01 July 2016

Yaakov Kogan
Yaakov Kogan*
Affiliation:
Technion—IIT
*
∗Postal address: Faculty of Industrial Engineering and Management, Technion-Israel Institute of Technology, Haifa 32 000, Israel.
Rights & Permissions [Opens in a new window]

Abstract

Core share and HTML view are not available for this content. However, as you have access to this content, a full PDF is available via the ‘Save PDF’ action button.

We consider the same circuit switching problem as in Mitra [1]. The calculation of the blocking probabilities is reduced to finding the partition function for a closed exponential pseudo-network with L−1 customers. This pseudo-network differs from that in [1] in one respect only: service rates at nodes 1, 2, …, p depend on the queue length. The asymptotic expansion developed in [1] follows from our exact expression for the partition function.

Keywords

GENERATING AND PARTITION FUNCTIONS
Type
Letters to the Editor
Information
Advances in Applied Probability , Volume 21 , Issue 4 , December 1989 , pp. 952 - 955
Copyright
Copyright © Applied Probability Trust 1989 

Footnotes

Research supported by a grant from the Israeli Ministry of Communications.

References

[1] Mitra, D. (1987) Asymptotic analysis and computational methods for a class of simple, circuit-switched networks with blocking. Adv. Appl. Prob. 19, 219–239.Google Scholar