Maximum entropy two-station cyclic queues with multiple general servers
DOI10.1007/BF00299634zbMath0634.90022OpenAlexW2051578298MaRDI QIDQ1097160
Demetres D. Kouvatsos, John Almond
Publication date: 1988
Published in: Acta Informatica (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/bf00299634
maximum entropyqueueing networksqueue length distributionapproximate methodsmultiple serversfirst-come-first- servedfixed number of jobsperformance.two-station cyclic queues
Queueing theory (aspects of probability theory) (60K25) Queues and service in operations research (90B22) Applications of Markov renewal processes (reliability, queueing networks, etc.) (60K20)
Related Items (8)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Maximum entropy and the G/G/1/N queue
- Maximum entropy two-station cyclic queues with multiple general servers
- An approximation formula \(L_q\cong\alpha\cdot\rho^\beta /(1-\rho)\)
- A numerical solution for the \(\lambda(n)/C_2/r/N\) queue
- The mathematical analysis of the computer system modeled as a two stage cyclic queue
- The behaviour of a single queue in a general queueing network
- Note—Comments on a Queueing Inequality
- Note—Simple Inequalities for Multiserver Queues
- Approximate Analysis of General Queuing Networks
- Approximate Analysis of Central Server Models
- Open, Closed, and Mixed Networks of Queues with Different Classes of Customers
- Approximations for the M/G/m Queue
- A Processor Utilization Model for a Multiprocessor Computer System
- Cyclic Queuing Systems with Restricted Length Queues
This page was built for publication: Maximum entropy two-station cyclic queues with multiple general servers