Get 20M+ Full-Text Papers For Less Than $1.50/day. Start a 14-Day Trial for You or Your Team.

Learn More →

A Note on Maximum Entropy in Queueing Problems

A Note on Maximum Entropy in Queueing Problems Abstract The main tool of information theory is the Shannon entropy introduced by C.E. Shannon in 1948. This paper, concentrates on obtaining probabilistic models for a queueing system using the principle of maximum entropy subject to certain constraints. Some properties of queueing systems following the maximum entropy approach are stated. http://www.deepdyve.com/assets/images/DeepDyve-Logo-lg.png Economic Quality Control de Gruyter

A Note on Maximum Entropy in Queueing Problems

Economic Quality Control , Volume 24 (2) – Oct 1, 2009

Loading next page...
 
/lp/de-gruyter/a-note-on-maximum-entropy-in-queueing-problems-zdHJRICXZg
Publisher
de Gruyter
Copyright
Copyright © 2009 by the
ISSN
1869-6147
eISSN
1869-6147
DOI
10.1515/EQC.2009.263
Publisher site
See Article on Publisher Site

Abstract

Abstract The main tool of information theory is the Shannon entropy introduced by C.E. Shannon in 1948. This paper, concentrates on obtaining probabilistic models for a queueing system using the principle of maximum entropy subject to certain constraints. Some properties of queueing systems following the maximum entropy approach are stated.

Journal

Economic Quality Controlde Gruyter

Published: Oct 1, 2009

There are no references for this article.