We consider a multiserver queueing system without buffer, with customers of two types, operating in a random environment. The system is fed by a marked Markovian arrival process which depends on the environment state. Customers of the first type have absolute priority over customers of the second type. Instantaneous service rates are piecewise constant with parameters depending on the customer type and the current environment state. The system behavior is described by a continuous-time multivariate Markov chain. We present a generator of this chain in a block-tridiagonal form. We briefly describe the procedure for finding a stationary probability distribution of system states and obtain formulas for the main probabilistic characteristics of the system in terms of the stationary distribution. An algorithm for computing the Laplace–Stieltjes transform of the sojourn time for an arbitrary customer of the first type is obtained.
Problems of Information Transmission – Springer Journals
Published: Oct 18, 2015
It’s your single place to instantly
discover and read the research
that matters to you.
Enjoy affordable access to
over 18 million articles from more than
15,000 peer-reviewed journals.
All for just $49/month
Query the DeepDyve database, plus search all of PubMed and Google Scholar seamlessly
Save any article or search result from DeepDyve, PubMed, and Google Scholar... all in one place.
All the latest content is available, no embargo periods.
“Whoa! It’s like Spotify but for academic articles.”@Phil_Robichaud