Approximating queue lengths in \(M(t)/G/1\) queue using the maximum entropy principle

DOI10.1007/BF01261657zbMath0741.60094OpenAlexW2047266288MaRDI QIDQ1186516

Mingyuan Chen, Attahiru Sule Alfa

Publication date: 28 June 1992

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

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

zbMATH Keywords

maximum entropy principletime- varying queueing modelstransportation and traffic systems

Mathematics Subject Classification ID

Queueing theory (aspects of probability theory) (60K25) Queues and service in operations research (90B22)

Related Items (1)

Information theoretic analysis for queueing systems with quasi-random input

Cites Work

• Unnamed Item
• A Mathematical Theory of Communication
• The presence of exponentiality in entropy maximized M/GI/1 queues
• Approximating queue lengths in M(t)/D/1 queues
• Information Theory and Statistical Mechanics
• Maximum Entropy Condition in Queueing Theory
• A Maximum Entropy Analysis of the G/G/1 Queue at Equilibrium
• Maximum Entropy Analysis of Multiple-server Queueing Systems
• A Closure Approximation for the Nonstationary M/M/s Queue
• Approximating the Behavior of Nonstationary Single-Server Queues
• The discrete-time single-server queue with time-inhomogeneous compound Poisson input and general service time distribution

This page was built for publication: Approximating queue lengths in \(M(t)/G/1\) queue using the maximum entropy principle