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

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 no...

Full description

Saved in:
Bibliographic Details
Published in:Advances in applied probability 1989-12, Vol.21 (4), p.952-955
Main Author: Kogan, Yaakov
Format: Article
Language:English
Subjects:
Applied sciences
Circuit properties
Customers
Electric, optical and optoelectronic circuits
Electronic circuits
Electronics
Exact sciences and technology
Letters to the Editor
Switching, multiplexing, switched capacity circuits
Citations: Items that this one cites
Items that cite this one
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary: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.
ISSN:0001-8678
1475-6064
DOI:10.2307/1427782