Abstract

Analysis of Queueing Systems with an Infinite Number of Servers and a Small Parameter

Highlights

  • The current study of service networks with complex sending discipline in [1,2,3] transport networks [4,5,6] and the asymptotic behavior of Jackson networks [7] handled with the problematic of verifying the global convergence of the solutions of certain infinite systems of ordinary differential equations to a time-independent solution

  • We suppose that service time has mean 1/μ with exponential distribution

  • There is a stationary probability distribution for the states of the system and if N → ∞ the evolution of the values uk(t) becomes deterministic and the Markov chain asymptotically converges to a dynamic system the evolution of which is described by system of ordinary differential equations of infinite order uk(t) = μ (uk+1(t) − uk(t)) + λ (︀(uk−1(t))2 − (uk(t))2)︀

Read more

Summary

Introduction

The current study of service networks with complex sending discipline in [1,2,3] transport networks [4,5,6] and the asymptotic behavior of Jackson networks [7] handled with the problematic of verifying the global convergence of the solutions of certain infinite systems of ordinary differential equations to a time-independent solution. We consider the dynamics of large-scale queueing systems that consist of infinite number of servers with a Poisson input flow of requests of intensity N λ. We suppose that service time has mean 1/μ with exponential distribution In this case a share uk(t) of the servers that have the queues lengths with not less than k can be described using a system of ordinary differential equations of infinite order. We investigate the truncation system of this ordinary differential equations of infinite order with a small real parameter order N. Tikhonov type Cauchy problem for this truncation system with small parameter ε and initial conditions is used for the simulation of behavior solutions and for analysis of large-scale queueing systems with taking into account parameters λ, μ, ε

Queueing Systems with Infinite Number of Servers
Queueing Systems with Infinite Number of Servers and a Small Parameter
Queueing Systems with Finite Number of Servers and a Small Parameter
Conclusions
Full Text
Paper version not known

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 call

Disclaimer: 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.