A method of approximate analysis of an open exponential queuing network with losses due to finite shared buffers in multi-queue nodes
type: Item
instance of: scholarly article
title: A method of approximate analysis of an open exponential queuing network with losses due to finite shared buffers in multi-queue nodes
zbMATH Open document ID: 1380.90094
author: Miron Vinarskiy
published in: European Journal of Operational Research
publication date: 2018-02-16T00:00:00Z
Mathematics Subject Classification ID: 90B22
Mathematics Subject Classification ID: 60K20
Mathematics Subject Classification ID: 60K25
zbMATH DE Number: 6839963
zbMATH Keywords: queuing
zbMATH Keywords: queuing network
zbMATH Keywords: multi-queue node
zbMATH Keywords: finite buffer
zbMATH Keywords: losses
MaRDI profile type: Publication
full work available at URL: j.ejor.2016.09.031
OpenAlex ID: W2521189837
Wikidata QID: Q115575535
cites work: Competitive buffer management for shared-memory switches
cites work: Multi-server tandem queue with Markovian arrival process, phase-type service times, and finite buffers
cites work: An open exponential queuing network with limited waiting spaces and losses: A method of approximate analysis
cites work: Q3944001
cites work: Reversed processes, product forms and a non-product form
cites work: Modeling Cross Correlation in Three-Moment Four-Parameter Decomposition Approximation of Queueing Networks
cites work: Q4101255
cites work: Store-and-Forward Buffer Requirements in a Packet Switching Network
cites work: Queuing Networks with Population Size Constraints
cites work: Q5652137
cites work: An analytic finite capacity queueing network model capturing the propagation of congestion and blocking
cites work: Q4843184
cites work: Approximate analysis for queueing networks with finite capacity and customer loss
DOI: 10.1016/J.EJOR.2016.09.031
description: scientific article; zbMATH DE number 6839963