Performance analysis of the discrete-time GI/Geom/1/N queue

DOI10.2307/3215281zbMATH Open0845.60093OpenAlexW4251185692MaRDI QIDQ4877421FDOQ4877421

Authors: M. L. Chaudhry, U. C. Gupta 

Publication date: 12 May 1996

Published in: Journal of Applied Probability (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.2307/3215281

Recommendations

• Analysis of the discrete-time \(GI/\text{Geom}(n)/1/N\) queue
• Performance analysis of discrete-time finite-buffer batch-arrival \(GI^X/Geom/1/N\) queues
• Queue-length and waiting-time distributions of discrete-time \(\text{GI}^X/\text{Geom}/1\) queueing systems with early and late arrivals
• On discrete-time multiserver queues with finite buffer: \(GI/Geom/m/N\)
• On the Analysis of the Discrete-Time Geom(n)/G(n)/1/N Queue

zbMATH Keywords

discrete-timesteady-state probability distributionrecursivesupplementary variable

Mathematics Subject Classification ID

Queueing theory (aspects of probability theory) (60K25) Performance evaluation, queueing, and scheduling in the context of computer systems (68M20)

Cited In (26)

• Performance analysis of discrete-time finite-buffer batch-arrival \(GI^X/Geom/1/N\) queues
• Modelling and analysis of a discrete-time \(GI^X / Geom /1/K\) queue with \(N\) threshold policy
• Discrete-time renewal input state dependent queue with working vacations and change over time
• Multiserver bulk service discrete-time queue with finite buffer and renewal input
• Discrete-time renewal input multiple vacation queue with accessible and non-accessible batches
• Delay analysis of a discrete-timeGI−GI− 1 queue with reservation-based priority scheduling
• Discrete time queues and matrix-analytic methods. (With comments and rejoinder)
• Performance analysis of discrete-time queue GI/G/1 with negative arrivals
• Computing queue length and waiting time distributions in finite-buffer discrete-time multiserver queues with late and early arrivals
• On discrete-time multiserver queues with finite buffer: \(GI/Geom/m/N\)
• Analysis of the discrete-time GI/G/1/K using the remaining time approach
• Analysis of discrete-time TES/G/1 and TES/D/1-K queueing systems
• Analysis of the discrete-time \(GI/\text{Geom}(n)/1/N\) queue
• On the relations among the distributions at different epochs for discrete-time GI/Geom/1 queues
• Analytically simple and computationally efficient results for the \(GI^X/ Geo /c\) queues
• Analysis of discrete-time queues with batch renewal input and multiple vacations
• Strategic experimentation in queues
• Algorithmic Discussions Of Distributions Of Numbers Of Busy Channels For GI/Geom/m/m Queues
• On the Analysis of the Discrete-Time Geom(n)/G(n)/1/N Queue
• Availability analysis of machining system with common cause failure, inspection and imperfect repair
• Title not available (Why is that?)
• Analyzing the discrete-time \(G^{(G)}/Geo/1\) queue using complex contour integration
• Performance analysis of finite buffer discrete-time queue with bulk service
• Discrete-time queue with Bernoulli bursty source arrival and generally distributed service times
• Analysis of stationary discrete-time \(GI/D-MSP/1\) queue with finite and infinite buffers
• Performance analysis of a Geom/Geom/1 queueing system with variable input probability

This page was built for publication: Performance analysis of the discrete-time GI/Geom/1/N queue

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4877421)