Preprint
Article
Maximum Ismail’s Second Entropy Formalism of Heavy-Tailed Queues with Hurst Exponent Heuristic Mean Queue Length Combined with Potential Applications of Hurst Exponent to Social Computing and Connected Health
Altmetrics
Downloads
95
Views
34
Comments
0
This version is not peer-reviewed
Submitted:
29 January 2024
Posted:
30 January 2024
You are already at the latest version
Alerts
Abstract
The theory of Ismail's non-extensive maximum entropy solution (NME) is described in detail. It is used as an inductive inference technique for heavy-tailed queues with a non-robust mean queue length and a non-extensive "long-range" interaction. In our novel method, we substitute the non-robust mean queue length for the conventional Pollaczeck-Khinchin mean queue length. In other words, the new non-extensivity parameter q will be included in the resulting state probability function. Numerical portraits are provided to capture the influential effect of the derived formalism, , on the stable M//1 queue with heavy tails. More potentially, some applications of Hurst Exponent to social computing and connected health are provided. Conclusion with some challenging open problems and possible future research pathways are given.
Keywords:
Subject: Computer Science and Mathematics - Probability and Statistics
Copyright: This open access article is published under a Creative Commons CC BY 4.0 license, which permit the free download, distribution, and reuse, provided that the author and preprint are cited in any reuse.
MDPI Initiatives
Important Links
© 2024 MDPI (Basel, Switzerland) unless otherwise stated