An approximate performance model for a multislot integrated services system

Abstract

An approximate model (with finite or infinite waiting room) is presented for an integrated service system with three types of traffic: a first-offered narrowband traffic, an overflow narrowband traffic, and a wideband traffic. A narrowband call requires a single server, while the number of servers required to serve a wideband call is N. The blocked narrowband calls are lost while the blocked wideband calls are delayed in a finite or infinite waiting room. Based on two assumptions with regard to the characteristics of the system, the system is resolved by decomposition. The corresponding improvements in numerical efficiency as well as in computational storage requirements are significant enough to enable use of the model within network optimization algorithms. The model provides a very good approximation for the system performance, i.e. the blocking probabilities of the two narrowband traffics, the loss probability (in the case of finite waiting room), the probability of nonwaiting, and the average waiting time of wideband traffic.>

Cite this work

No public copy is stored for this record, so only the metadata is cited.

Stored only when both papers are in the corpus — 26 citations exist upstream.

Papers that cite the same references — the relational fallback while embeddings are still backfilling.