Entropy maximisation and queueing network models
DD Kouvatsos - Annals of Operations Research, 1994 - Springer
Over recent years it has become increasingly evident that “classical” queueing theory cannot
easily handle complex queueing systems and networks with many interacting elements. As …
easily handle complex queueing systems and networks with many interacting elements. As …
Formalism of the Rényian Maximum Entropy (RMF) of the Stable M/G/1 queue with Geometric Mean (GeoM) and Shifted Geometric Mean (SGeoM) Constraints with …
A theoretical approach for creating power law behaviour in broadband communication
networks with GeoM or SGeoM specifications utilizing the Rényian maximum entropy …
networks with GeoM or SGeoM specifications utilizing the Rényian maximum entropy …
An Introductory Survey of Entropy Applications to Information Theory, Queuing Theory, Engineering, Computer Science, and Statistical Mechanics
Clausius was the first to coin the term “entropy” roughly 160 years ago. Since then, many
scholars from several scientific fields have continued to enhance, develop, and interpret the …
scholars from several scientific fields have continued to enhance, develop, and interpret the …
Inductive Inferences of Z-Entropy Formalism (ZEF) Stable M/G/1 Queue with Heavy Tails
A comprehensive description of the theory of Z's non-extensive maximum entropy (NME)
solution as an inductive inference technique for systems possessing a non-extensive 'long …
solution as an inductive inference technique for systems possessing a non-extensive 'long …
[PDF][PDF] The Impact of Information Geometry on the Analysis of the Stable M/G/1 Queue Manifold.
Information geometry (IG) provides the characterization of the structure of statistical models
from a differential geometric point of view. By considering families of probability distributions …
from a differential geometric point of view. By considering families of probability distributions …
Appointment scheduling with multiple providers and stochastic service times
In many appointment scheduling systems with multiple providers, customers are assigned
appointment times but they are not assigned a specific provider in advance–that is …
appointment times but they are not assigned a specific provider in advance–that is …
[PDF][PDF] Non-Extensive Maximum Entropy Formalisms and Inductive Inferences of Stable M/G/1 Queue with Heavy Tails
278 Queueing Theory 2 namely GEq, R and GEq, T, respectively. Two case studies, based
on typical numerical experiments, illustrate the impact of Rényi's and Tsallis's NME state …
on typical numerical experiments, illustrate the impact of Rényi's and Tsallis's NME state …
A maximum entropy analysis of the G/G/1 queue at equilibrium
DD Kouvatsos - Journal of the Operational Research Society, 1988 - Taylor & Francis
The principle of maximum entropy is used to analyse a G/G/1 queue at equilibrium when the
constraints involve only the first two moments of the interarrival-time and service-time …
constraints involve only the first two moments of the interarrival-time and service-time …
M/G/1 queue with Balking Shannonian Maximum Entropy Closed Form Expression with Some Potential Queueing Applications to Energy
The investigation of stable M/G/1 and queue with balking, characterized by a Poisson
prospective arrival process and iid general (G) service periods, is being done to examine …
prospective arrival process and iid general (G) service periods, is being done to examine …
Maximum entropy and the G/G/1/N queue
DD Kouvatsos - Acta Informatica, 1986 - Springer
A new “hybrid” analytic framework, based on the principle of maximum entropy, is used to
derive a closed form expression for the queue length distribution of a G/G/1 finite capacity …
derive a closed form expression for the queue length distribution of a G/G/1 finite capacity …