Analysis of stationary discrete-time GI/D-MSP/1 queue with finite and infinite buffers
DOI10.1007/S10288-008-0088-2zbMATH Open1188.90071OpenAlexW2029358090MaRDI QIDQ976978FDOQ976978
S. K. Samanta, U. C. Gupta, M. L. Chaudhry
Publication date: 16 June 2010
Published in: 4OR (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10288-008-0088-2
Recommendations
- Queue-length, waiting-time and service batch size analysis for the discrete-time \(GI/D-MSP^{\text{(a,b)}}/1/\infty\) queueing system
- Stationary analysis of a discrete-time GI/D-MSP/1 queue with multiple vacations
- Complete analysis of finite and infinite buffer \(GI/MSP/1\) queue-a computational approach
- Analyzing discrete-time \(GI^{[X]}/D-MSP/1/\infty\) queueing system using \(RG\)-factorization
- Analytic and computational analysis of the discrete-time \(GI/D\)-\(MSP/1\) queue using roots
waiting timediscrete-time Markovian service process (D-MSP)matrix-geometric methodsupplementary variable
Queues and service in operations research (90B22) Queueing theory (aspects of probability theory) (60K25) Performance evaluation, queueing, and scheduling in the context of computer systems (68M20)
Cites Work
- Title not available (Why is that?)
- Sojourn time distributions in the queue defined by a general QBD process
- Title not available (Why is that?)
- On the relations among the distributions at different epochs for discrete-time GI/Geom/1 queues
- Title not available (Why is that?)
- Regenerative Analysis and Steady State Distributions for Markov Chains
- Performance analysis of the discrete-time GI/Geom/1/N queue
- Complete analysis of finite and infinite buffer \(GI/MSP/1\) queue-a computational approach
- Characterizing the BMAP/MAP/1 Departure Process via the ETAQA Truncation
- Perturbation theory for the asymptotic decay rates in the queues with Markovian arrival process and/or Markovian service process
- Analysis of a finite-buffer bulk-service queue with discrete-Markovian arrival process: D-MAP/Ga,b/1/N
- Title not available (Why is that?)
- Discrete time queues and matrix-analytic methods. (With comments and rejoinder)
- Stationary distribution of a finite queue with recurrent input and Markov service
- The complete analysis of the discrete time finite DBMAP/G/1/N queue
- Title not available (Why is that?)
- Stationary characteristics of the \(SM/MSP/n/r\) queuing system
- Some steady-state distributions for theMAP /SM /1 queue
- An SM\(_2/\text{MSP}/n/r\) system with random-service discipline and a common buffer
- Departure process of the \(MAP/SM/1\) queue
Cited In (13)
- Performance analysis of discrete-time finite-buffer batch-arrival \(GI^X/Geom/1/N\) queues
- Analytic and computational analysis of the discrete-time \(GI/D\)-\(MSP/1\) queue using roots
- Analyzing a degenerate buffer with general inter-arrival and service times in discrete time
- Performance analysis of a \(GI/D\)-\(MSP/1/\infty\) queueing system under different service phase initiations
- A renewal generated geometric catastrophe model with discrete-time Markovian arrival process
- Modelling and analysis of \(GI/BMSP/1\) queueing system
- On discrete-time multiserver queues with finite buffer: \(GI/Geom/m/N\)
- Analysis of discrete-time TES/G/1 and TES/D/1-K queueing systems
- Stationary analysis of a discrete-time GI/D-MSP/1 queue with multiple vacations
- Analyzing discrete-time \(GI^{[X]}/D-MSP/1/\infty\) queueing system using \(RG\)-factorization
- Queue-length, waiting-time and service batch size analysis for the discrete-time \(GI/D-MSP^{\text{(a,b)}}/1/\infty\) queueing system
- Analysis of a buffer queueing problem in discrete time
- Complete analysis of finite and infinite buffer \(GI/MSP/1\) queue-a computational approach
This page was built for publication: Analysis of stationary discrete-time \(GI/D-MSP/1\) queue with finite and infinite buffers
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q976978)