Non-Extensive Kaniadakisian Maximum Entropy Formalisms of Stable Heavy-Tailed M/G/1 Queueing System

Gespeichert in:
Bibliographische Detailangaben
Titel: Non-Extensive Kaniadakisian Maximum Entropy Formalisms of Stable Heavy-Tailed M/G/1 Queueing System
Autoren: Mageed, Ismail A, orcid:0000-0002-3691-
Verlagsinformationen: Zenodo
Publikationsjahr: 2025
Bestand: Zenodo
Schlagwörter: Queueing Theory, Information Theory, Statistical physics, Stable M/G/1 queue, embedded Markov chain (EMC), server utilization (SU), generalized entropy functionals, probability density function(PDF)
Beschreibung: Focussing on an inductive application of Kaniadakisian formalism on the analysis of a stable M/G/1 queue, novel state probability and , are explicitly determined, subject to normalisation, server utilisation(SU) and Pollaczeck-Khinchin (P-K) mean queue length (MQL) constraints. Typical numerical experiments illustrate the impact of Kaniadakisian EME state probability, with ‘long-range interactions’ of order, (0 < <0.5) on the stable M/GE/1 queue with heavy tails. Moreover, new links are uncovered between and the corresponding Rényian and Tsallisian formalisms, and . Numerical experiments are illustrated to show the great information theoretic extensive parameter (0 < <0.5) on the overall performance of the newly devised formalism. Conclusion combined with the next research phase are provided.
Publikationsart: report
Sprache: unknown
Relation: https://zenodo.org/records/16585887; oai:zenodo.org:16585887; https://doi.org/10.5281/zenodo.16585887
DOI: 10.5281/zenodo.16585887
Verfügbarkeit: https://doi.org/10.5281/zenodo.16585887
https://zenodo.org/records/16585887
Rights: Creative Commons Attribution 4.0 International ; cc-by-4.0 ; https://creativecommons.org/licenses/by/4.0/legalcode
Dokumentencode: edsbas.39C1DE3D
Datenbank: BASE