Access the full text.
Sign up today, get DeepDyve free for 14 days.
M. Chaudhry, V. Goswami (2018)
The Queue Geo/G/1/N + 1 RevisitedMethodology and Computing in Applied Probability, 21
D. Manfield, P. Tran-Gia (1982)
Analysis of a Finite Storage System with Batch Input Arising out of Message PacketizationIEEE Trans. Commun., 30
Yutaka Baba (1984)
THE M X /G/l QUEUE WITH FINITE WAITING ROOM
M. Chaudhry (1992)
Numerical Issues in Computing Steady-State Queueing-Time Distributions of Single-Server Bulk-Service Queues: M/Gb/1 and M/Gd/1INFORMS J. Comput., 4
S. Lavenberg (1975)
The Steady-State Queueing Time Distribution for the M/G/1 Finite Capacity QueueManagement Science, 21
D. Kendall (1964)
Some Recent Work and Further Problems in the Theory of QueuesTheory of Probability and Its Applications, 9
N. Akar (2006)
Solving the ME/ME/1 queue with state-space methods and the matrix sign functionPerform. Evaluation, 63
(2005)
Editorial Manager(tm) for Queueing Systems Title: Analytic Computation Schemes for the Discrete-time Bulk Service Queue Analytic Computation Schemes for the Discrete-time Bulk Service Queue
C. Blondia (1989)
The n/g/l finite capacity queue, 5
M. Chaudhry, Gagandeep Singh, U. Gupta (2013)
A Simple and Complete Computational Analysis of MAP/R/1 Queue Using RootsMethodology and Computing in Applied Probability, 15
(2008)
Geo=G=1=1-queue with one “nonstandard” discipline of service
C. Litton (1983)
A First Course in Bulk QueuesJournal of the Operational Research Society, 34
M. Chaudhry, U. Gupta, M. Agarwal (1991)
On exact computational analysis of distributions of numbers in systems for M/G/1/N + 1 and GI/M/1/N + 1 queues using rootsComput. Oper. Res., 18
P. Finch (1958)
The Effect of the Size of the Waiting Room on a Simple QueueJournal of the royal statistical society series b-methodological, 20
A. Gravey, G. Hébuterne (1992)
Simultaneity in Discrete-Time Single Server Queues with Bernoulli InputsPerform. Evaluation, 14
V. Ramaswami (1988)
A stable recursion for the steady state vector in markov chains of m/g/1 typeStochastic Models, 4
J. Hunter (1983)
Discrete Time Models : Techniques and Applications
M. Chaudhry, U. Gupta (1992)
Exact computational analysis of waiting-time distributions of single-server bulk-arrival queues: MX/G/1European Journal of Operational Research, 63
A. Alfa (2015)
Applied Discrete-Time Queues
Pierluigi Conti (1999)
Large sample Bayesian analysis for ${\rm Geo}/G/1$ discrete-time queueing modelsAnnals of Statistics, 27
Tao Yang, Hui Li (1995)
On the steady-state queue size distribution of the discrete-timeGeo/G/1 queue with repeated customersQueueing Systems, 21
Gagandeep Singh, U. Gupta, M. Chaudhry (2016)
Detailed computational analysis of queueing-time distributions of the BMAP/G/1 queue using rootsJournal of Applied Probability, 53
Hyo-Seong Lee, M. Srinivasan (1989)
Control policies for the M X /g/ 1 queueing systemManagement Science, 35
M. Chaudhry (1979)
The queueing system MX/G/1 and its ramificationsNaval Research Logistics Quarterly, 26
H. Gail, S. Hantler, B. Taylor (1996)
Spectral analysis of M/G/1 and G/M/1 type Markov chainsAdvances in Applied Probability, 28
ML Chaudhry (1992)
Qroot software package
J. Keilson, L. Servi (1989)
Blocking Probability for M/G/1 Vacation Systems with Occupancy Level Dependent SchedulesOper. Res., 37
R. Chakka (1995)
Performance and reliability modelling of computing systems using spectral expansion
D. Kouvatsos, S. Denazis, N. Tabet-Aouel (1994)
Simultaneity in discrete-time queues with compound Bernoulli inputs and AF-DF buffer management policies
Ho Lee, S. Lee, S. Yoon, Boo Ahn, N. Park (1999)
A recursive method for Bernoulli arrival queues and its application to partial buffer sharing in ATMComput. Oper. Res., 26
M. Chaudhry, C. Harris, W. Marchal (1990)
Robustness of Rootfinding in Single-Server Queueing ModelsINFORMS J. Comput., 2
(1993)
Queueing analysis: Finite systems, Vol
S. Stidham (2002)
Applied Probability in Operations Research: A Retrospective
L. Kleinrock (1975)
Queueing Systems: Volume I-Theory
S. Chiamsiri, M. Leonard (1981)
A Diffusion Approximation for Bulk QueuesManagement Science, 27
N. Akar, N. Oguz, K. Sohraby (1998)
Matrix-geometric solutions of M/G/1-type Markov chains: a unifying generalized state-space approachIEEE J. Sel. Areas Commun., 16
H Bruneel, BG Kim (2012)
Discrete-time models for communication systems including ATM, vol 205
M. Chaudhry, U. Gupta, M. Agarwal (1992)
Exact and approximate numerical solutions to steady-state single-server queues:M/G/1 — a unified approachQueueing Systems, 10
R. Nobel (1989)
Practical approximations for finite-buffer queueing models with batch-arrivalsEuropean Journal of Operational Research, 38
(2000)
Berlin Chaudhry ML (1992) Qroot software package. A & A Publications
J. Hunter (1985)
Mathematical techniques of applied probability
U. Bhat (2006)
An Introduction to Queueing Theory: Modeling and Analysis in Applications
M. Chaudhry (2000)
On Numerical Computations of Some Discrete-Time Queues
Tsung-Yin Wang, J. Ke (2009)
The randomized threshold for the discrete-time Geo/G/1 queueApplied Mathematical Modelling, 33
Ho Lee, J. Moon, J. Park, Byung Kim (2003)
A spectral approach to compute the mean performance measures of the queue with low-order BMAP inputJournal of Applied Mathematics and Stochastic Analysis, 16
F. Gouweleeuw (1996)
Calculating the loss probability in a BMAP/G/1/N+1 queueStochastic Models, 12
H. Bruneel, Byung Kim (1992)
Discrete-time models for communication systems including ATM
Hisashi Kobayashi, Brian Mark, W. Turin (2012)
Probability, Random Processes, and Statistical Analysis: Applications to Communications, Signal Processing, Queueing Theory and Mathematical Finance
J. Keilson (1966)
The Ergodic Queue Length Distribution for Queueing Systems with Finite CapacityJournal of the royal statistical society series b-methodological, 28
Arunava Maity, U. Gupta (2015)
A Comparative Numerical Study of the Spectral Theory Approach of Nishimura and the Roots Method Based on the Analysis of BDMMAP/G/1 QueueInternational Journal of Stochastic Analysis, 2015
R. Cigno (2019)
Queueing SystemsIntroduction to Stochastic Processes and Simulation
M. Woodward (1993)
Communication and computer networks - modelling with discrete-time queues
This paper presents an alternative steady-state solution to the discrete-time G e o/G/1/N + 1 queueing system using roots. The analysis has been carried out for a late-arrival system using the imbedded Markov chain method, and the solutions for the early arrival system have been obtained from those of the late-arrival system. Using roots of the associated characteristic equation, the distributions of the numbers in the system at various epochs are determined. We find a unified approach for solving both finite- and infinite- buffer systems. We investigate the measures of effectiveness and provide numerical illustrations. We establish that, in the limiting case, the results thus obtained converge to the results of the continuous-time counterparts. The applications of discrete-time queues in modeling slotted digital computer and communication systems make the contributions of this paper relevant.
Methodology and Computing in Applied Probability – Springer Journals
Published: Jun 4, 2018
Read and print from thousands of top scholarly journals.
Already have an account? Log in
Bookmark this article. You can see your Bookmarks on your DeepDyve Library.
To save an article, log in first, or sign up for a DeepDyve account if you don’t already have one.
Copy and paste the desired citation format or use the link below to download a file formatted for EndNote
Access the full text.
Sign up today, get DeepDyve free for 14 days.
All DeepDyve websites use cookies to improve your online experience. They were placed on your computer when you launched this website. You can change your cookie settings through your browser.