Problems of Information Transmission

, Volume 51, Issue 3, pp 289–298 | Cite as

The MMAP/M/R/0 queueing system with reservation of servers operating in a random environment

Communication Network Theory


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.


Cognitive Radio Secondary User Sojourn Time Random Environment Queueing System 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. 1.
    Guryanov, I.O. Cognitive Radio: New Approaches in Providing with a Radio-Frequency Resource of Perspective Radio Technologies, Elektrosvyaz, 2012, no. 8, pp. 5–8.Google Scholar
  2. 2.
    Chen, S., Wyglinski, A.M. Pagadarai, S., Vuyyuru, R., and Altintas, O., Feasibility Analysis of Vehicular Dynamic Spectrum Access via Queueing Theory Model, IEEE Commun. Mag., 2011, vol. 49, no. 11, pp. 156–163.CrossRefGoogle Scholar
  3. 3.
    Akyildiz, I.F. Lee, W.-Y., Vuran, M.C., and Mohanty, S., NeXt Generation/Dynamic Spectrum Access/Cognitive Radio Wireless Networks: A Survey, Comput. Netw., 2006, vol. 50, no. 13, pp. 2127–2159.MATHCrossRefGoogle Scholar
  4. 4.
    Konishi, Y. Masuyama, H., Kasahara, S., and Takahashi, Y., Performance Analysis of Dynamic Spectrum Handoff Scheme with Variable Bandwidth Demand on Secondary Users for Cognitive Radio Networks, Wirel. Netw., 2013, vol. 19, no. 5, pp. 607–617.CrossRefGoogle Scholar
  5. 5.
    Zhu, X. Shen, L., and Yum, T.-S.P., Analysis of Cognitive Radio Spectrum Access with Optimal Channel Reservation, IEEE Commun. Lett., 2007, vol. 11, no. 4, pp. 304–306.CrossRefGoogle Scholar
  6. 6.
    Kim, C.S. Dudin, A., Klimenok, V., and Khramova, V., Erlang Loss Queueing System with Batch Arrivals Operating in a Random Environment, Comput. Oper. Res., 2009, vol. 36, no. 3, pp. 674–697.MATHMathSciNetCrossRefGoogle Scholar
  7. 7.
    Kim, C.S. Klimenok, V., Mushko, V., and Dudin, A., The BMAP/PH/N Retrial Queueing System Operating in Markovian Random Environment, Comput. Oper. Res., 2010, vol. 37, no. 7, pp. 1228–1237.MATHMathSciNetCrossRefGoogle Scholar
  8. 8.
    Graham, A. Kronecker Products and Matrix Calculus with Applications, Chichester: Ellis Horwood, 1981.Google Scholar
  9. 9.
    Dudin, S. and Dudina, O. Call Center OperationModel as aMAP/PH/N/R-N System with Impatient Customers, Probl. Peredachi Inf., 2011, vol. 47, no. 4, pp. 68–83 [Probl. Inf. Trans. (Engl. Transl.), 2011, vol. 47, no. 4, pp. 364–377].MathSciNetGoogle Scholar
  10. 10.
    Lucantoni, D.M. New Results on the Single Server Queue with a Batch Markovian Arrival Process, Commun. Statist. Stochastic Models, 1991, vol. 7, no. 1, pp. 1–46.MATHMathSciNetCrossRefGoogle Scholar
  11. 11.
    Klimov, G.P. Stokhasticheskie sistemy obsluzhivaniya (Stochastic Queueing Systems), Moscow: Nauka, 1966.Google Scholar

Copyright information

© Pleiades Publishing, Inc. 2015

Authors and Affiliations

  1. 1.Department of Probability Theory and Mathematical StatisticsTomsk State UniversityTomskRussia

Personalised recommendations