The \(MMAP/M/R/0\) queueing system with reservation of servers operating in a random environment. (English. Russian original) Zbl 1333.90026
Probl. Inf. Transm. 51, No. 3, 289-298 (2015); translation from Probl. Peredachi Inf. 51, No. 3, 93-104 (2015).
Summary: 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.
MSC:
| 90B22 | Queues and service in operations research |
| 60K25 | Queueing theory (aspects of probability theory) |
References:
| [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. |
| [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. · doi:10.1109/MCOM.2011.6069723 |
| [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. · Zbl 1107.68018 · doi:10.1016/j.comnet.2006.05.001 |
| [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. · doi:10.1007/s11276-012-0488-2 |
| [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. · doi:10.1109/LCOM.2007.348282 |
| [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. · Zbl 1179.90077 · doi:10.1016/j.cor.2007.10.022 |
| [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. · Zbl 1178.90097 · doi:10.1016/j.cor.2009.09.008 |
| [8] | Graham, A., Kronecker Products and Matrix Calculus with Applications (1981), Chichester · Zbl 0497.26005 |
| [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]. · Zbl 1274.90069 |
| [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. · Zbl 0733.60115 · doi:10.1080/15326349108807174 |
| [11] | Klimov, G. P., Stokhasticheskie sistemy obsluzhivaniya(Stochastic Queueing Systems) (1966), Moscow |
This reference list is based on information provided by the publisher or from digital mathematics libraries. Its items are heuristically matched to zbMATH identifiers and may contain data conversion errors. In some cases that data have been complemented/enhanced by data from zbMATH Open. This attempts to reflect the references listed in the original paper as accurately as possible without claiming completeness or a perfect matching.
