Limit Theorems for Queuing Systems with Regenerative Doubly Stochastic Input Flow*


Cite item

Full Text

Open Access Open Access
Restricted Access Access granted
Restricted Access Subscription Access

Abstract

This article focuses on queuing systems with doubly stochastic Poisson regenerative input flow and an infinite number of servers. Service times have the heavy-tailed distribution. The analogs of the law of large numbers and the central limit theorem for the number of occupied servers are obtained. These theorems follow from results for systems with general doubly stochastic Poisson processes [1]. As examples, we consider systems in which the input flow is controlled by a semi-Markov modulated and Markov modulated processes.

About the authors

E. A. Chernavskaya

Lomonosov Moscow State University

Author for correspondence.
Email: Chernavskayaak@mail.ru
Russian Federation, Moscow

Supplementary files

Supplementary Files
Action
1. JATS XML

Copyright (c) 2016 Springer Science+Business Media New York