Preprint Article Version 1 This version is not peer-reviewed

Definition of Optimal Time Intervals in the Queues’ Analysis: The Use of Epsilon-Entropy and Epsilon-Capacity

Version 1 : Received: 6 September 2024 / Approved: 7 September 2024 / Online: 9 September 2024 (09:03:42 CEST)

How to cite: Kagan, E.; Novoselsky, A. Definition of Optimal Time Intervals in the Queues’ Analysis: The Use of Epsilon-Entropy and Epsilon-Capacity. Preprints 2024, 2024090583. https://doi.org/10.20944/preprints202409.0583.v1 Kagan, E.; Novoselsky, A. Definition of Optimal Time Intervals in the Queues’ Analysis: The Use of Epsilon-Entropy and Epsilon-Capacity. Preprints 2024, 2024090583. https://doi.org/10.20944/preprints202409.0583.v1

Abstract

In the paper, we suggest a method for calculating optimal time intervals in the queue analysis. The suggested method processes partitioning of the time interval and utilizes the epsilon-entropy and epsilon-capacity of the partition for finding an optimal partition. Optimality of the partition is specified based on its epsilon-information. The suggested method is illustrated by defining the intervals for histograms of differently distributed samples and demonstrated its effectiveness in comparison with the existing methods

Keywords

Arrival rate; departure rate; epsilon-entropy; epsilon-capacity; epsilon-information; partition

Subject

Computer Science and Mathematics, Applied Mathematics

Comments (0)

We encourage comments and feedback from a broad range of readers. See criteria for comments and our Diversity statement.

Leave a public comment
Send a private comment to the author(s)
* All users must log in before leaving a comment
Views 0
Downloads 0
Comments 0


×
Alerts
Notify me about updates to this article or when a peer-reviewed version is published.
We use cookies on our website to ensure you get the best experience.
Read more about our cookies here.