Mohan L. Chaudhry
Affiliations:- Royal Military College of Canada, Department of Mathematics and Computer Science, Kingston, Canada
According to our database1,
Mohan L. Chaudhry
authored at least 52 papers
between 1966 and 2022.
Collaborative distances:
Collaborative distances:
Timeline
Legend:
Book In proceedings Article PhD thesis Dataset OtherLinks
Online presence:
-
on rmc.ca
On csauthors.net:
Bibliography
2022
A simple and efficient computing procedure of the stationary system-length distributions for GIX/D/c and BMAP/D/c queues.
Comput. Oper. Res., 2022
2021
Complete analysis of a discrete-time batch service queue with batch-size-dependent service time under correlated arrival process: D-MAP/G<sub>n</sub><sup>(a, b)</sup>/1.
RAIRO Oper. Res., 2021
A Short Note on the System-Length Distribution in a Finite-Buffer GI<sup>X/C</sup>-MSP/1/N Queue Using Roots.
Proceedings of the Performance Engineering and Stochastic Modeling, 2021
2017
Efficient Computational Analysis of Stationary Probabilities for the Queueing System <i>BMAP</i>/<i>G</i>/1/<i>N</i> With or Without Vacation(s).
INFORMS J. Comput., 2017
Steady-state analysis of single exponential vacation in a PH/MSP/1/∞ queue using roots.
CoRR, 2017
A simple analysis of the batch arrival queue with infinite-buffer and Markovian service process using roots method: GI<sup>[X]</sup>/C-MSP/1/∞.
Ann. Oper. Res., 2017
On the Consecutive Customer Loss Probabilities in a Finite-Buffer Renewal Batch Input Queue with Different Batch Acceptance/Rejection Strategies Under Non-renewal Service.
Proceedings of the Soft Computing for Problem Solving, 2017
2016
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<sup>(a,b)</sup>/1/∞.
RAIRO Oper. Res., 2016
Analytically elegant and computationally efficient results in terms of roots for the GI<sup>X</sup>/M/c queueing system.
Queueing Syst. Theory Appl., 2016
An alternative method for computing system-length distributions of BMAP/R/1 and BMAP/D/1 queues using roots.
Perform. Evaluation, 2016
Analytically simple and computationally efficient solution to GI/Geom/1 queues involving heavy-tailed distributions.
Oper. Res. Lett., 2016
Detailed computational analysis of queueing-time distributions of the BMAP/G/1 queue using roots.
J. Appl. Probab., 2016
2015
Analytic and computational analysis of the discrete-time GI/D-MSP/1 queue using roots.
Comput. Oper. Res., 2015
2014
INFORMS J. Comput., 2014
Int. J. Comput. Math., 2014
2012
Computing system-time and system-length distributions for MAP/D/1 queue using distributional Little's law.
Perform. Evaluation, 2012
A Simple and Extended Computational Analysis of <i>M</i>/<i>G</i><sub><i>j</i></sub><sup>(<i>a</i>, <i>b</i>)</sup>/1 and <i>M</i>/<i>G</i><sub><i>j</i></sub><sup>(<i>a</i>, <i>b</i>)</sup>/1/(<i>B</i> + <i>b</i>) Queues Using Roots.
INFOR Inf. Syst. Oper. Res., 2012
2010
On the Distribution of the Number of Customers in the D-BMAP/G<sup><i>a, b</i></sup>/1/<i>M</i> Queue - A Simple Approach to a Complex Problem.
INFOR Inf. Syst. Oper. Res., 2010
2009
A Simple and Complete Solution to the Stationary Queue-Length Probabilities of a Bulk-Arrival Bulk-Service Queue.
INFOR Inf. Syst. Oper. Res., 2009
Analysis of stationary discrete-time <i>GI</i>/<i>D</i>-<i>MSP</i>/1 queue with finite and infinite buffers.
4OR, 2009
2008
The use of the distributional Little's law in the computational analysis of discrete-time GI/G/1 and GI/D/c queues.
Perform. Evaluation, 2008
2007
Discrete-time single-server finite-buffer queues under discrete Markovian arrival process with vacations.
Perform. Evaluation, 2007
Discrete-time Geo<sup>X</sup>/G<sup>(a, b)</sup>/1/N queues with single and multiple vacations.
Math. Comput. Model., 2007
Proceedings of the 2nd International Conference on Performance Evaluation Methodolgies and Tools, 2007
2004
Analysis of the discrete-time bulk-service queue Geo/G<sup>Y</sup>/1/<i>N</i>+<i>B</i>.
Oper. Res. Lett., 2004
An Invariance Relation and a Unified Method to Derive Stationary Queue-Length Distributions.
Oper. Res., 2004
Complete analytic and computational analyses of the discrete-time bulk-arrival infinite-server system: <i>GI</i><sup><i>X</i></sup>/<i>Geom</i>/.
Comput. Oper. Res., 2004
Comput. Oper. Res., 2004
2003
A complete and simple solution for a discrete-time multi-server queue with bulk arrivals and deterministic service times.
Oper. Res. Lett., 2003
2002
Waiting-time distribution of a discrete-time multiserver queue with correlated arrivals and deterministic service times: D-MAP/D/k system.
Oper. Res. Lett., 2002
2001
Perform. Evaluation, 2001
Modeling and Analysis of Discrete-Time Multiserver Queues with Batch Arrivals: GIX/Geom/m.
INFORMS J. Comput., 2001
1999
Modelling and analysis of M/G<sup>a, b</sup>/1/N queue - A simple alternative approach.
Queueing Syst. Theory Appl., 1999
1998
Performance Analysis of Discrete-Time Finite-Buffer Batch-Arrival GI<sup>X</sup>/Geom/1/N Queues.
Discret. Event Dyn. Syst., 1998
1997
Queue-Length and Waiting-Time Distributions of Discrete-Time GI<sup>X</sup>/Geom/1 Queueing Systems With Early and Late Arrivals.
Queueing Syst. Theory Appl., 1997
1996
On the relations among the distributions at different epochs for discrete-time GI/Geom/1 queues.
Oper. Res. Lett., 1996
1994
First-passage-time and busy-period distributions of discrete-time Markovian queues: <i>Geom(n)/Geom(n)</i>/1/<i>N</i>.
Queueing Syst. Theory Appl., 1994
1993
Computing steady-state queueing-time distributions of single-server queues: <i>GI</i><sup><i>X</i></sup>/<i>M</i>/1.
ZOR Methods Model. Oper. Res., 1993
1992
Exact and approximate numerical solutions to steady-state single-server queues: <i>M/G</i>/1 - a unified approach.
Queueing Syst. Theory Appl., 1992
Exact and approximate numerical solutions of steady-state distributions arising in the queue<i>GI/G</i>/1.
Queueing Syst. Theory Appl., 1992
Computational Results of Multiserver Bulk-Arrival Queues with Constant Service Time MX/D/c.
Oper. Res., 1992
Numerical Issues in Computing Steady-State Queueing-Time Distributions of Single-Server Bulk-Service Queues: M/Gb/1 and M/Gd/1.
INFORMS J. Comput., 1992
1991
On exact computational analysis of distributions of numbers in systems for <i>M/G</i>/1/<i>N</i> + 1 and <i>GI/M</i>/1/<i>N</i> + 1 queues using roots.
Comput. Oper. Res., 1991
1990
1988
Computational analysis of single-server bulk-arrival queues <i>M</i><sup><i>x</i></sup>/<i>G</i>/1.
Comput. Oper. Res., 1988
1987
Computational Analysis of Steady-State Probabilities of M/G<sup>a, b</sup>/1 and Related Nonbulk Queues.
Queueing Syst. Theory Appl., 1987
Queueing Syst. Theory Appl., 1987
1984
Distribution of busy period for the bulk-service queueing system E<sub>k</sub>/M<sup>a, b</sup>/1.
Comput. Oper. Res., 1984
1982
The queueing system <i>E</i><sub><i>k</i></sub>/<i>M</i><sup><i>a</i>, <i>b</i></sup>/1 and its numerical analysis.
Comput. Oper. Res., 1982
1966