Information theoretic approximations for M/G/1 and G/G/1 queuing systems

DOI10.1007/BF00262975zbMath0456.68038OpenAlexW2035019464MaRDI QIDQ1151029

John E. Shore

Publication date: 1982

Published in: Acta Informatica (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/bf00262975

zbMATH Keywords

information theoretic inference techniques

Mathematics Subject Classification ID

Queueing theory (aspects of probability theory) (60K25) Performance evaluation, queueing, and scheduling in the context of computer systems (68M20) Information theory (general) (94A15)

Related Items (14)

An ME-based approximation for multi-server queues with preemptive priority ⋮ Information theoretic analysis for queueing systems with quasi-random input ⋮ Entropy maximization and the busy period of some single-server vacation models ⋮ Maximum entropy solutions for batch arrival queue with an un-reliable server and delaying vacations ⋮ The presence of exponentiality in entropy maximized M/GI/1 queues ⋮ On the number of customers served in the \(M/G/1\) retrial queue: first moments and maximum entropy approach ⋮ 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 analysis to the \(N\) policy M/G/1 queueing system with server breakdowns and general startup times ⋮ A general methodology for population analysis ⋮ Entropy maximization andNTvacation M/G/1 model with a startup and unreliable server: comparative analysis on the first two moments of system size ⋮ Approximating queue lengths in M(t)/D/1 queues ⋮ Maximum entropy analysis to the \(N\) policy M/G/1 queueing system with a removable server ⋮ Entropy maximisation and queueing network models

This page was built for publication: Information theoretic approximations for M/G/1 and G/G/1 queuing systems