Abstract
The necessity is shown to design queueing systems with non-Markovian service time distribution and the big number of channels. A general characteristic is given on phase approximations. Techniques of iteration and matrix-geometric progression are discussed. A new (sweeping) method is suggested. Results of numerical calculations and the evaluation of theirs complexity are presented. Recommendations are proposed how methods discussed in this paper can be applied.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
References
Basharin, G.P., Bordukova, V.T.: Some exact and approximate results for the multiserver queuing systems with limited storage. Teletraffic Theory and Information Networks, 6–15 (1977). (in Russian)
Bocharov, P.P., Pechinkin, A.V.: Queueing Theory: Textbook. People Friendship University of Russia, Moscow (1995). (in Russian)
Brandwajn, A., Begin, T.: Preliminary results on simple approach to G/G/c-like queues. In: Proceeding of the 16th International Conference on Analytical and Stochastic Modeling Techniques and Applications, ASMTA, pp. 159–173 (2009)
Daigle, J.N.: Queuing Theory with Applications to Packet Telecommunication. Springer, Boston (2005)
Evans, R.D.: Geometric distribution in some two dimensional queuing systems. Operat. Res. 5, 830–846 (1967)
Osogami, T., Harchol-Balter, M.: A Closed-form solution for mapping general distribution to minimal PH distributions. In: Proceeding of the 13th International Conference on Computer Performance Evaluation. Modeling Technique and Tools, Urbana, Il, USA, pp. 200–217 (2003)
Osogami, T., Harchol-Balter, M.: Necessary and sufficient conditions for representing general distributions by coxians. In: Proceeding of the 13th International Conference on Computer Performance Evaluation. Modeling Technique and Tools, Urbana, Il, USA, pp. 182–199 (2003)
Ryzhikov, Y.I.: Algorithm for calculating multichannel system with Erlangian service. Autom. Remote Control 5, 30–37 (1980). (in Russian)
Ryzhikov, Y.I: Development and comparizon of methods for calculating multi-channel queueing systems. In: Proceeding of the XII All-Russian Meeting on Control Systems, pp. 5208–5219. Institute of Control Sciences, Moscow (2014). (in Russian)
Ryzhikov, Y.I., Khomonenko, A.D.: Iterative method of calculating multichannel systems with arbitrary distribution of service time. Prob. Control Inf. Theor. 3, 32–38 (1980). (in Russian)
Takahashi, Y., Takami, Y.: A Numerical method for the steady-state probabilities of a GI/G/c queuing system in a general class. J. of the Operat. Res. Soc. Japan 2, 147–157 (1976)
Takahashi, Y.: Asymptotic exponentiality of the tail of the waiting time distribution in a Ph/Ph/c queue. Adv. Appl. Probab. 13, 619–630 (1981)
Vishnevsky, V.M.: The theoretical basis to design computer networks. Technosphere, Moscow (2003). (in Russian)
Acknowledgments
The research described in the paper was partially supported by state research 0073-2014-009 and 0073-2015-0007.
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2017 Springer International Publishing AG
About this paper
Cite this paper
Ryzhikov, Y.I. (2017). A Sweep Method for Calculating Multichannel Queueing Systems. In: Dudin, A., Nazarov, A., Kirpichnikov, A. (eds) Information Technologies and Mathematical Modelling. Queueing Theory and Applications. ITMM 2017. Communications in Computer and Information Science, vol 800. Springer, Cham. https://doi.org/10.1007/978-3-319-68069-9_22
Download citation
DOI: https://doi.org/10.1007/978-3-319-68069-9_22
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-319-68068-2
Online ISBN: 978-3-319-68069-9
eBook Packages: Computer ScienceComputer Science (R0)