Comparative throughput analysis of queueing networks with exponential and deterministic service times in the nodes

Research output: Contribution to journalArticle

Abstract

We consider a queueing network consisting of |M|m and |GI|∞ systems. Poisson arrivals are assumed (if the network is open). We show that the throughput characteristics are not degraded when the exponential service time in one or several |M|I systems is replaced with a deterministic service time with the same mean: if the network is open the total number of customers in the modified network is stochastically less than in the original network; if the network is closed, the average load coefficients of the systems in the modified network are not less than in the original network.

Original languageEnglish (US)
Pages (from-to)99-107
Number of pages9
JournalProblems of Information Transmission
Volume27
Issue number2
StatePublished - Oct 1991
Externally publishedYes

ASJC Scopus subject areas

  • Engineering(all)

Fingerprint Dive into the research topics of 'Comparative throughput analysis of queueing networks with exponential and deterministic service times in the nodes'. Together they form a unique fingerprint.

  • Cite this