Performance Modeling of Cloud Systems by an Infinite-Server Queue Operating in Rarely Changing Random Environment

Svetlana Moiseeva, Evgeny Polin, Alexander Moiseev and Janos Sztrik ()
Additional contact information
Svetlana Moiseeva: Institute of Applied Mathematics and Computer Science, National Research Tomsk State University, 36 Lenina Ave., 634050 Tomsk, Russia
Evgeny Polin: Institute of Applied Mathematics and Computer Science, National Research Tomsk State University, 36 Lenina Ave., 634050 Tomsk, Russia
Alexander Moiseev: Institute of Applied Mathematics and Computer Science, National Research Tomsk State University, 36 Lenina Ave., 634050 Tomsk, Russia
Janos Sztrik: Faculty of Informatics, University of Debrecen, Egyetem tér 1, 4032 Debrecen, Hungary

Future Internet, 2025, vol. 17, issue 10, 1-14

Abstract: This paper considers a heterogeneous queuing system with an unlimited number of servers, where the parameters are determined by a random environment. A distinctive feature is that the parameters of the exponential distribution of the request processing time do not change their values until the end of service. Thus, the devices in the system under consideration are heterogeneous. For the study, a method of asymptotic analysis is proposed under the condition of extremely rare changes in the states of the random environment. We consider the following problem. Cloud node accepts requests of one type that have a similar intensity of arrival and duration of processing. Sometimes an input scheduler switches to accept requests of another type with other intensity and duration of processing. We model the system as an infinite-server queue in a random environment, which influences the arrival intensity and service time of new requests. The random environment is modeled by a Markov chain with a finite number of states. Arrivals are modeled as a Poisson process with intensity dependent on the state of the random environment. Service times are exponentially distributed with rates also dependent on the state of the random environment at the time moment when the request arrived. When the environment changes its state, requests that are already in the system do not change their service times. So, we have requests of different types (serviced with different rates) present in the system at the same time. For the study, we consider a situation where changes of the random environment are made rarely. The method of asymptotic analysis is used for the study. The asymptotic condition of a rarely changing random environment (entries of the generator of the corresponding Markov chain tend to zero) is used. A multi-dimensional joint steady-state probability distribution of the number of requests of different types present in the system is obtained. Several numerical examples illustrate the comparisons of asymptotic results to simulations.

Keywords: infinite-server queue; asymptotic analysis; random environment (search for similar items in EconPapers)
JEL-codes: O3 (search for similar items in EconPapers)
Date: 2025
References: Add references at CitEc
Citations:

Downloads: (external link)
https://www.mdpi.com/1999-5903/17/10/462/pdf (application/pdf)
https://www.mdpi.com/1999-5903/17/10/462/ (text/html)

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:gam:jftint:v:17:y:2025:i:10:p:462-:d:1766766

Access Statistics for this article

Future Internet is currently edited by Ms. Grace You

More articles in Future Internet from MDPI
Bibliographic data for series maintained by MDPI Indexing Manager ().