RESEARCH OF SERVICE SYSTEMS WITH CYCLIC WAITING TIME
Abstract
We study queuing systems with cyclic waiting times for claims Gl / G / 1 and SM / SM / I, in which the time spent by claims in the orbit has a general non-lattice distribution, and the service discipline FCFS is adopted. Conditions for the ergodicity of the embedded Markov chain are derived. The results of statistical modeling are presented.
References
Falin G. I. A survey of retrial queues // Queueing S%s; - 1990. - 7. - P.127-168.
Yang T., Templeton J.G.C. A survey on retrial queue.- Queueing Syst. - 1987.-2. - P. 203-233.
Lakatos L. On a simple continuous cycle-waitmg prurient / .Ann. Univ. Sci. Budapest. Sect. Comp. - 1994. -14. -P.105-113.
Lakatos L. On a cycle-waiting queueing problem // Theory of Stoch. Proc. - 1996. - 2(18). - P. 176-180.
Lakatos L. On a discrete cycle-waiting queueing promlem // J. Math. Sci. (New York). - 1998. - 4(92). - P.4031-4034.
Koba E. V. On a GI/G/1 retrial queueing system with FIFO queueing discipline // Theory of Stoch. Proc. - 2002. - 8(24). - P.168-175.
Kalashnikov V. V. Mathematical methods in queue mg theory. Kluwer Academic Publishers. Dordrecht. - 1994. - 377 p.
Downloads
Published
How to Cite
Issue
Section
License
The scientific journal adheres to the principles of Open Access and provides free, immediate, and permanent access to all published materials without financial, technical, or legal barriers for readers.
All articles are published in Open Access under the Creative Commons Attribution 4.0 International (CC BY 4.0) license.
Copyright
Authors who publish their works in the journal:
-
retain the copyright to their publications;
-
grant the journal the right of first publication of the article;
-
agree to the distribution of their materials under the CC BY 4.0 license;
-
have the right to reuse, archive, and distribute their works (including in institutional and subject repositories), provided that proper reference is made to the original publication in the journal.
