Maximum entropy and the G/G/1/N queue
From MaRDI portal
Publication:1067967
DOI10.1007/BF00288469zbMath0581.90026MaRDI QIDQ1067967
Publication date: 1986
Published in: Acta Informatica (Search for Journal in Brave)
maximum entropy; queue length distribution; closed form expression; G/G/1 finite capacity queue; two-stage cyclic queueing networks
60K25: Queueing theory (aspects of probability theory)
90B22: Queues and service in operations research
90B10: Deterministic network models in operations research
68M20: Performance evaluation, queueing, and scheduling in the context of computer systems
Related Items
Maximum entropy solutions for batch arrival queue with an un-reliable server and delaying vacations, MRE hierarchical decomposition of general queueing network models, Maximum entropy approach for batch-arrival queue under \(N\) policy with an un-reliable server and single vacation, A maximum entropy approach for the \(\langle p,N\rangle\)-policy \(M/G/1\) queue with a removable and unreliable server, Maximum entropy two-station cyclic queues with multiple general servers, Entropy maximisation and queueing network models, On modeling failure and repair times in stochastic models of manufacturing systems using generalized exponential distributions, A universal building block for the approximate analysis of a shared buffer ATM switch architecture, Homogenisation techniques for the analysis of production lines with unreliable machines having different speeds, Maximum entropy analysis to the \(N\) policy M/G/1 queueing system with server breakdowns and general startup times, Maximum entropy analysis to the \(N\) policy M/G/1 queueing system with a removable server, Entropy maximization andNTvacation M/G/1 model with a startup and unreliable server: comparative analysis on the first two moments of system size
Cites Work
- A maximum entropy analysis of the M/G/1 and G/M/1 queueing systems at equilibrium
- 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
- On Approximations for Queues, III: Mixtures of Exponential Distributions
- Axiomatic derivation of the principle of maximum entropy and the principle of minimum cross-entropy
- The Steady-State Queueing Time Distribution for the M/G/1 Finite Capacity Queue
- Prior Probabilities
- Nonpriority Multiprogramming Systems Under Heavy Demand Conditions—Customers' Viewpoint
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item