ANALYTICALLY EXPLICIT RESULTS FOR THE GI/C-MSP/1/∞ QUEUEING SYSTEM USING ROOTS

DOI10.1017/S0269964811000349zbMath1255.60160OpenAlexW2078612429WikidataQ59323821 ScholiaQ59323821MaRDI QIDQ2909825

António Pacheco, Mohan L. Chaudhry, Sujit Kumar Samanta

Publication date: 6 September 2012

Published in: Probability in the Engineering and Informational Sciences (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1017/s0269964811000349

Mathematics Subject Classification ID

Queueing theory (aspects of probability theory) (60K25) Queues and service in operations research (90B22)

Related Items

Sojourn-time distribution of the \(G I/M S P/1\) queueing system ⋮ Analysis of \(\mathrm{BMAP}/\mathrm{MSP}/1\) queue ⋮ Analytic and computational analysis of the discrete-time \(GI/D\)-\(MSP/1\) queue using roots ⋮ Computing the Distribution for the Number of Renewals with Bulk Arrivals ⋮ A discrete-time \(GI^X/Geo/1\) queue with multiple working vacations under late and early arrival system ⋮ On The Renewal Input Batch-arrival Queue Under Single And Multiple Working Vacation Policy With Application To EPON ⋮ Performance analysis of a \(GI/D\)-\(MSP/1/\infty\) queueing system under different service phase initiations ⋮ Analysis of the sojourn time distribution for \(M/GL/1\) queue with bulk-service of exactly size \(L\) ⋮ Modelling and analysis of \(GI/BMSP/1\) queueing system ⋮ Roots, Symmetry, and Contour Integrals in Queuing-Type Systems ⋮ 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] ⋮ On the optimal control of loss probability and profit in a \(GI /C\)-\(BMSP /1/N\) queueing system ⋮ 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/∞

Uses Software

• QPACK

Cites Work

• Unnamed Item
• Unnamed Item
• Analyzing \(GI/E_ r/1\) queues
• Departure process of the \(MAP/SM/1\) queue
• The stationary characteristics of the G/MSP/\(1/r\) queueing system
• Queueing system with passive servers
• Analysis of \(GI^{X}/ M(n)// N\) systems with stochastic customer acceptance policy
• Sojourn time distributions in the queue defined by a general QBD process
• Analytic computation schemes for the discrete-time bulk service queue
• Complete analysis of finite and infinite buffer \(GI/MSP/1\) queue-a computational approach
• An experimental evaluation of the matrix-geometric method for theGI/PH/1 queue
• Robustness of Rootfinding in Single-Server Queueing Models
• Some steady-state distributions for theMAP /SM /1 queue
• Spectral analysis of M/G/1 and G/M/1 type Markov chains
• Perturbation theory for the asymptotic decay rates in the queues with Markovian arrival process and/or Markovian service process

This page was built for publication: ANALYTICALLY EXPLICIT RESULTS FOR THE GI/C-MSP/1/∞ QUEUEING SYSTEM USING ROOTS