Complete analysis of finite and infinite buffer \(GI/MSP/1\) queue-a computational approach

From MaRDI portal
Publication:2643808

DOI10.1016/j.orl.2006.02.003zbMath1149.90322OpenAlexW1497388568MaRDI QIDQ2643808

U. C. Gupta, Abhijit Datta Banik

Publication date: 27 August 2007

Published in: Operations Research Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.orl.2006.02.003




Related Items (21)

Sojourn-time distribution of the \(G I/M S P/1\) queueing systemAnalysis of \(\mathrm{BMAP}/\mathrm{MSP}/1\) queueANALYTICALLY EXPLICIT RESULTS FOR THE GI/C-MSP/1/∞ QUEUEING SYSTEM USING ROOTSAnalyzing the finite buffer batch arrival queue under Markovian service process: \(\mathrm{GI}^X /\mathrm{MSP}/1/\mathrm{N}\)Stationary analysis of a discrete-time GI/D-MSP/1 queue with multiple vacationsOn the finite buffer queue with renewal input and batch Markovian service process: \(\mathrm{GI}/\mathrm{BMSP}/1/N\)Computing conditional sojourn time of a randomly chosen tagged customer in a BMAP/MSP/\(1\) queue under random order service disciplineElucidating the short term loss behavior of Markovian-modulated batch-service queueing model with discrete-time batch Markovian arrival processA note on the waiting-time distribution in an infinite-buffer \(\text{GI}^{[X}/ \text{C-MSP} / 1\) queueing system] ⋮ Performance analysis of a \(GI/D\)-\(MSP/1/\infty\) queueing system under different service phase initiationsAsymptotic analysis for loss probability of queues with finite \(GI / M /1\) type structureModelling and analysis of \(GI/BMSP/1\) queueing systemPerformance evaluation of a multi-product production line: an approximation methodAnalyzing state-dependent arrival in \(GI/\mathrm{BMSP}/1/\infty \) queuesLoss pattern of \(\mathrm{DBMAP}/\mathrm{DMSP}/1/K\) queue and its application in wireless local communicationsAnalysis of stationary discrete-time \(GI/D-MSP/1\) queue with finite and infinite buffersA 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] ⋮ Finite-Buffer Bulk Service Queue Under Markovian Service Process:GI/MSP(a,b)/1/NOn the optimal control of loss probability and profit in a \(GI /C\)-\(BMSP /1/N\) queueing systemA 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/



Cites Work




This page was built for publication: Complete analysis of finite and infinite buffer \(GI/MSP/1\) queue-a computational approach