Article
Version 1
Preserved in Portico This version is not peer-reviewed
Information Data Length Theory for the Transient
Version 1
: Received: 26 January 2024 / Approved: 29 January 2024 / Online: 29 January 2024 (12:59:01 CET)
How to cite: A Mageed, D. I. Information Data Length Theory for the Transient. Preprints 2024, 2024012013. https://doi.org/10.20944/preprints202401.2013.v1 A Mageed, D. I. Information Data Length Theory for the Transient. Preprints 2024, 2024012013. https://doi.org/10.20944/preprints202401.2013.v1
Abstract
The current paper provides a cutting-edge information data length- theoretic approach to the transient M/M/Infinity queueing system. This is a first time ever investigation that unifies information data length and queueing theories. The significant impact of both time and the number of states for the transient M/M/ Infinity queue on both the upper and lower bounds of the obtained information data length is observed and noted. The paper concludes with some challenging open problems, combined with concluding remarks and future research pathways.
Keywords
Information data length; transient queues; M/M/ Infinity Queueing System
Subject
Computer Science and Mathematics, Probability and Statistics
Copyright: This is an open access article distributed under the Creative Commons Attribution License which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.
Comments (0)
We encourage comments and feedback from a broad range of readers. See criteria for comments and our Diversity statement.
Leave a public commentSend a private comment to the author(s)
* All users must log in before leaving a comment