An ME-based approximation for multi-server queues with preemptive priority
DOI10.1016/0377-2217(94)90413-8zbMath0809.90052OpenAlexW2046662529MaRDI QIDQ1333541
Demetres D. Kouvatsos, Nasredine Tabet-Aouel
Publication date: 15 September 1994
Published in: European Journal of Operational Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0377-2217(94)90413-8
approximationpriority queuequeueing networksentropy maximizationpreemptive-resumediscrete flow systems
Queues and service in operations research (90B22) Measures of information, entropy (94A17) Applications of Markov renewal processes (reliability, queueing networks, etc.) (60K20)
Related Items (1)
Cites Work
- Unnamed Item
- Information theoretic analysis for a general queueing system at equilibrium with application to queues in tandem
- Maximum entropy two-station cyclic queues with multiple general servers
- The presence of exponentiality in entropy maximized M/GI/1 queues
- Information theoretic approximations for M/G/1 and G/G/1 queuing systems
- A maximum entropy priority approximation for a stable G/G/1 queue
- Priority queues
- Information Theory and Statistical Mechanics
- The Response Times of Priority Classes under Preemptive Resume in M/M/m Queues
- Maximum Entropy Condition in Queueing Theory
- Maximum Entropy Analysis of Multiple-server Queueing Systems
- Axiomatic derivation of the principle of maximum entropy and the principle of minimum cross-entropy
- Multiprocessor systems with preemptive priorities
- Approximating the Mean Waiting Time in the GI/G/s Queue
- On an Approximation to the Mean Response Times of Priority Classes in a Stable G/G/c/PR Queue
- Prior Probabilities
- A Statistical Mechanical Approach to Systems Analysis
- An Analysis of M/M/s Queueing Systems Based on the Maximum Entropy Principle
This page was built for publication: An ME-based approximation for multi-server queues with preemptive priority
