Abstract
An exposition is undertaken to analytically derive validate the Shannonian Maximum Entropy BTM for the underlying stable queue. Most importantly, the analytic derivation of the upper and lower bounds 0f the absolute difference between Shannonian Cumulative service time distribution functions (CDFs) with and without balking. Typical numerical experiments are provided. Additionally, some applications of queue theory to AR are given. Some challenging open problems are addressed combined with closing remarks and future research directions.
Publisher
Balkan Journal of Electrical & Computer Engineering (BAJECE)
Reference21 articles.
1. [1] I.A.Mageed, et al, “M/G/1 queue with Balking Shannonian Maximum
Entropy Closed Form Expression with Some Potential Queueing
Applications to Energy”, 2022 Global Energy Conference (GEC). IEEE,
2022.
2. [2] E.T.Jaynes, “Information Theory and Statistical Mechanics”, Physical
Review, 106, 1957, 620 - 630.
3. [3] E.T.Jaynes, E.T., “Where do we Stand on Maximum Entropy?”, in
Proc. The Maximum Entropy Formalism Conference, M.I.T., USA,
1978.
4. [4]S.-C.Fang,et al, “Entropy optimization and mathematical
programming,1997, Kluwer Academic Publishers, Boston.
5. [5] J.Shore, and R. Johnson, “Axiomatic derivation of the principle of
maximum entropy and the principle of minimum cross-entropy”,
IEEE Transactions onInformation Theory,1980, 26, 26-37.