ME-based approximations for general discrete-time queueing models

DOI10.1016/0166-5316(94)90029-9MaRDI QIDQ3122454zbMATH OpenOpenAlexFDO

Authors Demetres D. Kouvatsos, Nasreddine Tabet-Aouel, Spyros G. Denazis

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

zbMATH Keywords

ApproximationAsynchronous Transfer Mode (ATM) switch architecturesCompound Bernoulli Process (CBP)Discrete-time queuesGeneralized geometric (GGeo) distributionMaximum Entropy (ME) principleScheduling

Mathematics Subject Classification ID

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

Recommendations

• Using Discrete Distributions to Approximate General Service Time Distributions in Queueing Models
• scientific article; zbMATH DE number 4159820
• scientific article; zbMATH DE number 4100354
• Studies on the M/E_k/1 queueing model
• Estimation of measures in M/M/1 queue
• Using the discrete time modelling approach to evaluate the time-dependent behaviour of queueing systems

Cited in

(5)

• Entropy maximisation and queueing network models
• A universal building block for the approximate analysis of a shared buffer ATM switch architecture
• Discrete-time multiserver queues with geometric service times.
• Markov approximations to D-BMAPs: Information theoretic bounds on queueing performance
• A discrete-time queueing model of EMD policy in high-speed networks

This page was built for publication: ME-based approximations for general discrete-time queueing models

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3122454)