Exact solutions for open, closed and mixed queueing networks with rejection blocking
type: Item
instance of: scholarly article
title: Exact solutions for open, closed and mixed queueing networks with rejection blocking
zbMATH Open document ID: 0664.60091
DOI: 10.1016/0304-3975(89)90062-5
author: Horst von Brand
author: Ian F. Akyildiz
published in: Theoretical Computer Science
publication date: 1989-01-01T00:00:00Z
review text: Open, mixed and closed queueing networks with multiple job classes, reversible routing and rejection blocking are investigated in this paper. Jobs may change class membership and general service requirement distributions that depend on the job class are allowed. We prove that the equilibrium state probabilities have product form if at all stations either the scheduling discipline is symmetric or all service requirements at the station have the same exponential distribution. The solution implies insensitivity in this kind of blocking networks, i.e. the distribution of the jobs in equilibrium, irrespective of their remaining service requirements, depends only on their mean service requirement.
Mathematics Subject Classification ID: 60K20
Mathematics Subject Classification ID: 68M20
Mathematics Subject Classification ID: 60K25
zbMATH DE Number: 4086707
zbMATH Keywords: queueing networks
zbMATH Keywords: scheduling discipline
zbMATH Keywords: insensitivity
zbMATH Keywords: blocking networks
MaRDI profile type: Publication
full work available at URL: 0304-3975(89)90062-5
OpenAlex ID: W2055793747
cites work: Networks of queues and the method of stages
cites work: Open, Closed, and Mixed Networks of Queues with Different Classes of Customers
cites work: Computational algorithms for closed queueing networks with exponential servers
cites work: Throughput Capacity of a Sequence of Queues with Blocking Due to Finite Waiting Room
cites work: A Characterization of Product-Form Queuing Networks
cites work: Product Form and Local Balance in Queueing Networks
cites work: Computational algorithms for product form queueing networks
cites work: The multiple phase service network with generalized processor sharing
cites work: Q3227148
cites work: Closed Queuing Systems with Exponential Servers
cites work: Networks of queues with customers of different types
cites work: Networks of queues
cites work: Q3855869
cites work: Stationary state probabilities at arrival instants for closed queueing networks with multiple types of customers
cites work: On the reversibility of queueing networks
cites work: Q4080532
cites work: A Generalized Queueing Discipline for Product Form Network Solutions
cites work: Q3709574
cites work: On equivalencies of blocking mechanisms in queueing networks with blocking
cites work: Q3734820
cites work: Queuing Networks with Multiple Closed Chains: Theory and Computational Algorithms
cites work: Closed Exponential Networks of Queues with Saturation: The Jackson-Type Stationary Distribution and Its Asymptotic Analysis
cites work: Corrigendum: `` Mean-Value Analysis of Closed Multichain Queuing Networks''
cites work: The Distribution of Queuing Network States at Input and Output Instants
cites work: Queuing Networks with Random Selection for Service
cites work: A simple technique in Markovian control with applications to resource allocation to resource allocation in communication networks
Recommended article: Q4843184
Recommended article: General open and closed queueing networks with blocking: a unified framework for approximation
Recommended article: Exact solutions for networks of queues with blocking-after-service
Recommended article: Approximation Analysis of Open Acyclic Exponential Queueing Networks with Blocking
Recommended article: Some equivalencies between closed queueing networks with blocking
Recommended article: Computational algorithms for networks of queues with rejection blocking
Recommended article: Acceptance instant distributions in product-form closed queueing networks with blocking
description: scientific article; zbMATH DE number 4086707