No open-access location is known for this record yet.
No open-access location is known for this record yet.
A closed BCMP queuing network consisting of R job classes (chains), K+1 single-server, fixed-rate nodes, and M/sub j/ class j jobs (j=1, 2, . . ., R) is considered. Asymptotic expansions are constructed for the partition function under assumptions (1) K>>1, (2) M/sub j/>>1 for each j, and (3) K/M/sub j/=O(1). Analytic expressions for performance measures such as the mean queue length are also given. The approach employs the ray method and the method of matched asymptotic expansions. Numerical comparisons illustrate the accuracy of the approximations.>
Loading…
Stored only when both papers are in the corpus — 18 citations exist upstream.
Papers that cite the same references — the relational fallback while embeddings are still backfilling.
Imported from OpenAlex (CC0) — nothing here is generated.