Bounding blocking probabilities and throughput in queueing networks with buffer capacity constraints
type: Item
instance of: scholarly article
title: Bounding blocking probabilities and throughput in queueing networks with buffer capacity constraints
zbMATH Open document ID: 0908.90132
DOI: 10.1023/A:1019142905175
author: S. H. Smith
published in: Queueing Systems
publication date: 1998-08-09T00:00:00Z
Mathematics Subject Classification ID: 90B22
Mathematics Subject Classification ID: 60K25
Mathematics Subject Classification ID: 90B18
Mathematics Subject Classification ID: 90B30
zbMATH DE Number: 1185552
zbMATH Keywords: performance evaluation
zbMATH Keywords: finite buffers
zbMATH Keywords: upper and lower bounding
zbMATH Keywords: throughput
zbMATH Keywords: blocking probabilities
zbMATH Keywords: queueing networks
zbMATH Keywords: buffer capacity constraints
zbMATH Keywords: manufacturing systems
zbMATH Keywords: communication networks
zbMATH Keywords: \(M/M/s/s\) queue
MaRDI profile type: Publication
full work available at URL: a:1019142905175
OpenAlex ID: W328775442
Recommended article: A Tight Bound on the Throughput of Queueing Networks with Blocking
Recommended article: Blocking probability, throughput and waiting time in finite capacity polling systems
Recommended article: Optimizing the throughput, service rate, and buffer allocation in finite queueing networks
Recommended article: The destabilizing effect of blocking due to finite buffering capacity in multi-class queueing networks
Recommended article: Throughput bounds for closed queueing networks
Recommended article: Q4843184
description: scientific article; zbMATH DE number 1185552