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
preprint
OA: closed
CC-BY-4.0
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.
My notes (saved in your browser only)
Citation neighborhood (no data yet)
We don't have any in-corpus citations linked to this paper yet. This is a recent paper (2024) — citers typically take a year or two to land, and the OpenAlex reference graph may still be filling in.
Source provenance
- europepmc
- last seen: 2026-05-20T01:45:00.602351+00:00
- unpaywall
- last seen: 2026-05-27T02:00:06.600101+00:00
License: CC-BY-4.0