Abstract
The features of the existing classification of queuing systems are considered, its disadvantages are shown. Only the laws of time intervals distribution between neighboring requests and time intervals for processing requests are used as the main flows characteristics. The main disadvantage is the lack of information about the correlation and cross-correlation flows properties. It is shown that flows that have the same distribution laws but different correlation properties can form queues where values differ by several orders of magnitude. Flows controlled by the Markov chain and, in particular, examples of hyperexponential flows classification are considered. It is shown that this kind of flows can have the same probability distribution laws for time intervals between neighboring requests, but significantly different queue sizes caused by the difference in the flows correlation properties. Another disadvantage of the Kendall’s classification is inability to classify systems by the nature of changes in the input load.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
