ME-based approximations for general discrete-time queueing models
From MaRDI portal
Publication:3122454
DOI10.1016/0166-5316(94)90029-9zbMath0875.68090OpenAlexW1991028068MaRDI QIDQ3122454
Nasreddine Tabet-Aouel, Spyros G. Denazis, Demetres D. Kouvatsos
Publication date: 27 February 1997
Published in: Performance Evaluation (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0166-5316(94)90029-9
SchedulingApproximationDiscrete-time queuesAsynchronous Transfer Mode (ATM) switch architecturesCompound Bernoulli Process (CBP)Generalized geometric (GGeo) distributionMaximum Entropy (ME) principle
Related Items (2)
Discrete-time multiserver queues with geometric service times. ⋮ Entropy maximisation and queueing network models
This page was built for publication: ME-based approximations for general discrete-time queueing models