Comparative study of throughput of queueing networks with exponential and deterministic serving time in nodes

Research output: Contribution to journalArticlepeer-review

Abstract

Queueing network consist ·|M|m- and ·|GI|∞- systems is considered. The input flow of claims for open network is the simplest (Poisson flow). It is proved that if in several ·|M|1- systems service time changes from exponential to deterministic with the same average value, so productivity characteristics of network are not reduced. In particular, for open network summary number of claims in modified network is stochastically less then in initial network. For closed network average loading coefficients of systems in modified network exceed those of initial network.

Original languageEnglish (US)
Pages (from-to)15-24
Number of pages10
JournalProblemy Peredachi Informatsii
Volume27
Issue number2
StatePublished - Apr 1 1991
Externally publishedYes

ASJC Scopus subject areas

  • Electrical and Electronic Engineering

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

Cite this