Performance bounds for scheduling queueing networks
type: Item
instance of: scholarly article
title: Performance bounds for scheduling queueing networks
zbMATH Open document ID: 0759.60100
author: Jihong Ou
author: Lawrence M. Wein
published in: The Annals of Applied Probability
publication date: 1993-01-16T00:00:00Z
review text: Some general classes of multi-customer networks are compared with (partially very) simplified derivates. Roughly the idea is: Forget about those structures of the system which makes analysis complex and try to do this in a way such that the new model when run in parallel to the old one can be strictly compared either by pathwise comparison of the describing processes or by comparing the steady-state expectations of the performance measure. Some of the bounds and concerned numerical results are called ``moderately encouraging'' by the authors.
Mathematics Subject Classification ID: 60K25
Mathematics Subject Classification ID: 90B15
Mathematics Subject Classification ID: 90B22
zbMATH DE Number: 90048
zbMATH Keywords: simulation
zbMATH Keywords: performance bounds
zbMATH Keywords: scheduling
zbMATH Keywords: queueing networks
zbMATH Keywords: non- productform systems
zbMATH Keywords: numerical results
reviewed by: Hans Daduna
MaRDI profile type: Publication
full work available at URL: https://doi.org/10.1214/aoap/1177005711
OpenAlex ID: W2062589800
DOI: 10.1214/AOAP/1177005711
description: scientific article; zbMATH DE number 90048