Asymptotically exact decomposition approximations for open queueing networks
type: Item
instance of: scholarly article
title: Asymptotically exact decomposition approximations for open queueing networks
zbMATH Open document ID: 0711.60093
DOI: 10.1016/0167-6377(90)90055-A
author: Martin I. Reiman
published in: Operations Research Letters
publication date: 1990-01-01T00:00:00Z
Mathematics Subject Classification ID: 60K20
Mathematics Subject Classification ID: 60K25
Mathematics Subject Classification ID: 90B22
zbMATH DE Number: 4169821
zbMATH Keywords: bottleneck analysis
zbMATH Keywords: heavy traffic
zbMATH Keywords: decomposition approximations
zbMATH Keywords: mean sojourn times
zbMATH Keywords: queueing networks
zbMATH Keywords: traffic intensity
MaRDI profile type: Publication
cites work: Multiproduct Queueing Networks with Deterministic Routing: Decomposition Approach and the Notion of Interference
cites work: Limit Theorems for Queueing Networks. I
cites work: Stochastic discrete flow networks: Diffusion approximations and bottlenecks
cites work: Q3806523
cites work: Multiple channel queues in heavy traffic. I
cites work: Networks of Waiting Lines
cites work: Approximate Analysis of General Queuing Networks by Decomposition
cites work: Approximating a Point Process by a Renewal Process, I: Two Basic Methods
full work available at URL: 0167-6377(90)90055-a
OpenAlex ID: W2057808525
description: scientific article; zbMATH DE number 4169821