A maximum entropy priority approximation for a stable G/G/1 queue

DOI10.1007/BF00572990zbMath0679.90021OpenAlexW2051393033MaRDI QIDQ1823135

Nasreddine Tabet-Aouel, Demetres D. Kouvatsos

Publication date: 1989

Published in: Acta Informatica (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/bf00572990

zbMATH Keywords

priority classesmarginal queue length distributionnon-preemptive head-of-linepreemptive- resumereduced occupancy approximationstable G/G/1 queue

Mathematics Subject Classification ID

Queueing theory (aspects of probability theory) (60K25) Queues and service in operations research (90B22) Performance evaluation, queueing, and scheduling in the context of computer systems (68M20) Measures of information, entropy (94A17) Applications of Markov renewal processes (reliability, queueing networks, etc.) (60K20)

Related Items (4)

An ME-based approximation for multi-server queues with preemptive priority ⋮ Information theoretic approximations for the \(M/G/1\) retrial queue ⋮ On the number of customers served in the \(M/G/1\) retrial queue: first moments and maximum entropy approach ⋮ Entropy maximisation and queueing network models

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Priority queues
• The Response Times of Priority Classes under Preemptive Resume in M/M/m Queues
• A Maximum Entropy Analysis of the G/G/1 Queue at Equilibrium
• A new MVA-based approximation for closed queueing networks with a preemptive priority server
• Axiomatic derivation of the principle of maximum entropy and the principle of minimum cross-entropy
• Multiprocessor systems with preemptive priorities
• Computation of Steady-State Probabilities for M/M/1 Priority Queues
• Open, Closed, and Mixed Networks of Queues with Different Classes of Customers
• Prior Probabilities
• State Probabilities of M/M/1 Priority Queues

This page was built for publication: A maximum entropy priority approximation for a stable G/G/1 queue