The stationary characteristics of the G/MSP/\(1/r\) queueing system

DOI10.1023/A:1022219232282zbMath1066.60077MaRDI QIDQ1778845

A. V. Pechinkin, P. P. Bocharov, Saverio Salerno, Ciro D' Apice

Publication date: 17 June 2005

Published in: Automation and Remote Control (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1023/a:1022219232282

zbMATH Keywords

recurrent input flow; Markov service process; method of embedded Markov chain

Mathematics Subject Classification ID

60K25: Queueing theory (aspects of probability theory)

90B22: Queues and service in operations research

Related Items

Extended analysis and computationally efficient results for the GI/Ma,b/1 queueing system, Analysis of \(\mathrm{BMAP}/\mathrm{MSP}/1\) queue, Stationary analysis of a discrete-time GI/D-MSP/1 queue with multiple vacations, On the finite buffer queue with renewal input and batch Markovian service process: \(\mathrm{GI}/\mathrm{BMSP}/1/N\), Analyzing state-dependent arrival in \(GI/\mathrm{BMSP}/1/\infty \) queues, Erlang loss queueing system with batch arrivals operating in a random environment, Elucidating the short term loss behavior of Markovian-modulated batch-service queueing model with discrete-time batch Markovian arrival process, Performance analysis of a \(GI/D\)-\(MSP/1/\infty\) queueing system under different service phase initiations, A simple analysis of the batch arrival queue with infinite-buffer and Markovian service process using roots method: \( GI^{[X}/C\)-\( MSP /1/\infty \)], Analyzing discrete-time \(GI^{[X}/D-MSP/1/\infty\) queueing system using \(RG\)-factorization], Modelling and analysis of \(GI/BMSP/1\) queueing system, On the optimal control of loss probability and profit in a \(GI /C\)-\(BMSP /1/N\) queueing system, Sojourn-time distribution of the \(G I/M S P/1\) queueing system, Asymptotic analysis for loss probability of queues with finite \(GI / M /1\) type structure, Complete analysis of finite and infinite buffer \(GI/MSP/1\) queue-a computational approach, Analyzing the finite buffer batch arrival queue under Markovian service process: \(\mathrm{GI}^X /\mathrm{MSP}/1/\mathrm{N}\), A simple analysis of system characteristics in the batch service queue with infinite-buffer and Markovian service process using the roots method:GI/C-MSP^(a,b)/1/∞, ANALYTICALLY EXPLICIT RESULTS FOR THE GI/C-MSP/1/∞ QUEUEING SYSTEM USING ROOTS, Finite-Buffer Bulk Service Queue Under Markovian Service Process:GI/MSP^(a,b)/1/N