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

DOI10.1007/BF00572990zbMath0679.90021MaRDI QIDQ1823135

Demetres D. Kouvatsos, Nasreddine Tabet-Aouel

Publication date: 1989

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

zbMATH Keywords

priority classes; marginal queue length distribution; non-preemptive head-of-line; preemptive- resume; reduced occupancy approximation; stable G/G/1 queue

Mathematics Subject Classification ID

60K25: Queueing theory (aspects of probability theory)

90B22: Queues and service in operations research

68M20: Performance evaluation, queueing, and scheduling in the context of computer systems

94A17: Measures of information, entropy

60K20: Applications of Markov renewal processes (reliability, queueing networks, etc.)

Related Items

Entropy maximisation and queueing network models, 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

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