Maximum Entropy Condition in Queueing Theory

DOI10.2307/2582209zbMath0582.60090OpenAlexW4247886923MaRDI QIDQ3704708

Silviu Guiasu

Publication date: 1986

Published in: The Journal of the Operational Research Society (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.2307/2582209

zbMATH Keywords

information theorybirth-and-death processnon-linear optimizationmaximum entropy conditionsteady-state condition

Mathematics Subject Classification ID

Queueing theory (aspects of probability theory) (60K25) Branching processes (Galton-Watson, birth-and-death, etc.) (60J80) Measures of information, entropy (94A17)

Related Items (21)

An ME-based approximation for multi-server queues with preemptive priority ⋮ A quadratically convergent global algorithm for the linearly-constrained minimum cross-entropy problem ⋮ A branch and bound network approach to the canonical constrained entropy problem ⋮ Information theoretic analysis for queueing systems with quasi-random input ⋮ Entropy maximization and the busy period of some single-server vacation models ⋮ Minimum aberration criterion for screening experiments at two levels from an entropy-based perspective ⋮ 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 ⋮ Profit management of car rental companies ⋮ Maximum entropy condition in multiserver queueing system ⋮ Approximating queue lengths in \(M(t)/G/1\) queue using the maximum entropy principle ⋮ Maximum entropy approach for batch-arrival queue under \(N\) policy with an un-reliable server and single vacation ⋮ On the optimal entropy analysis ⋮ Estimation using plug-in of the stationary distribution and Shannon entropy of continuous time Markov processes ⋮ A methodology for revenue analysis of parking lots ⋮ Stationary analysis of a retrial queue with preemptive repeated attempts ⋮ A general methodology for population analysis ⋮ Approximating queue lengths in M(t)/D/1 queues ⋮ On the stable Gani-type attainability problem controlled by promotion at maximum entropy ⋮ Computing the maximum-entropy extension of given discrete probability distributions ⋮ Entropy maximisation and queueing network models

This page was built for publication: Maximum Entropy Condition in Queueing Theory