A maximum entropy priority approximation for a stable G/G/1 queue
type: Item
instance of: scholarly article
title: A maximum entropy priority approximation for a stable G/G/1 queue
zbMATH Open document ID: 0679.90021
DOI: 10.1007/BF00572990
author: Nasreddine Tabet-Aouel
author: Demetres D. Kouvatsos
published in: Acta Informatica
publication date: 1989-01-01T00:00:00Z
review text: See the preview in Zbl 0667.90039.
Mathematics Subject Classification ID: 90B22
Mathematics Subject Classification ID: 60K25
Mathematics Subject Classification ID: 68M20
Mathematics Subject Classification ID: 94A17
Mathematics Subject Classification ID: 60K20
zbMATH DE Number: 4114356
zbMATH Keywords: priority classes
zbMATH Keywords: stable G/G/1 queue
zbMATH Keywords: preemptive- resume
zbMATH Keywords: non-preemptive head-of-line
zbMATH Keywords: marginal queue length distribution
zbMATH Keywords: reduced occupancy approximation
MaRDI profile type: Publication
cites work: Open, Closed, and Mixed Networks of Queues with Different Classes of Customers
cites work: A new MVA-based approximation for closed queueing networks with a preemptive priority server
cites work: Q3883484
cites work: The Response Times of Priority Classes under Preemptive Resume in M/M/m Queues
cites work: Q5185813
cites work: Priority queues
cites work: Prior Probabilities
cites work: Q3855869
cites work: A Maximum Entropy Analysis of the G/G/1 Queue at Equilibrium
cites work: State Probabilities of M/M/1 Priority Queues
cites work: Computation of Steady-State Probabilities for M/M/1 Priority Queues
cites work: Q4101255
cites work: Multiprocessor systems with preemptive priorities
cites work: Axiomatic derivation of the principle of maximum entropy and the principle of minimum cross-entropy
full work available at URL: https://doi.org/10.1007/bf00572990
OpenAlex ID: W2051393033
description: scientific article; zbMATH DE number 4114356