Browse Papers
From IFORS
Contact Us
English
Remember me
Login
Forgot password?
M.L. Chaudhry
Information about the author M.L. Chaudhry will soon be added to the site.
Found
21 papers
in total
Date Descending
Date Ascending
Title Descending
Title Ascending
Discrete-time GeoX/G(a,b)/1/N queues with single and multiple vacations
2007
In this paper, we consider a discrete-time single-server finite-buffer batch arrival...
Complete analytic and computational analyses of the discrete-time bulk-arrival infinite-server system: GIX/Geom/∞
2004
In this paper, we consider the discrete-time queueing system with bulk arrivals,...
On discrete-time multiserver queues with finite buffer GI/Geom/m/N
2004
Multiserver queues are often encountered in telecommunications systems and have...
Modeling and analysis of discrete-time multiserver queues with batch arrivals: GIX/Geom/m.
2001
Multiserver queues are often encountered in telecommunications systems and have...
Modelling and analysis of M/Ga,b/1/N queue – A simple alternative approach
1999
In this paper, we consider a single-server finite-capacity queue with general bulk...
Algorithmic discussions of distributions of numbers of busy channels for GI/Geom/m/m queues
2000
The high speed multi-access communication channels such as BISDN and ATM operate on a...
Queue-length and waiting-time distributions of discrete-time GIX/Geom/1 queueing systems with early and late arrivals
1997
In this paper, we give a unified approach to solving discrete-time GI X /Geom/1 queues...
On the steady-state distribution of number in the queue Geom/G/1
1999
Discrete-time queues are frequently used in telecommunication networks. This paper...
On steady-state queue size distributions of the discrete-time GI/G/1 queue
1996
In this paper, the authors present results for the steady-state system length...
On the relations among the distributions at different epochs for discrete-time GI/Geom/1 queues
1996
In this paper the authors discuss the discrete-time GI/Geom/1 queue and derive...
On computations of the mean and variance of the number of renewals: A unified approach
1995
This paper presents a unified approach to finding both the mean (the so-called renewal...
Exact computational analysis of waiting-time distributions of single-server bulk-arrival queues: M’X/G/1
1992
This paper presents a closed-form analysis and computationally efficient method to...
Analysis of the discrete-time GI/Geom(n)/1/N queue
1996
In this paper, the authors consider the discrete-time single-server finite-buffer late...
First-passage-time and busy-period distributions of discrete-time Markovian queues: Geom(n)/Geom(n)/1/N.
1994
This paper gives simple explicit solutions of various first-passage-time distributions...
Alternative numerical solutions of stationary queueing-time distributions in discrete-time queues: GI/G/1.
1993
This paper gives closed-form expressions, in terms of the roots of certain equations,...
Computing steady-state queueing-time distributions of single-server queues: GI/M/1.
1993
This paper presents a computationally efficient method to find the steady-state...
Computing stationary queueing-time distributions of GI/D/1 and GI/D/c queues
1992
This article gives closed-form analytic expressions as well as the exact computational...
Computational results of multiserver bulk-arrival queues with constant service time MX/D/c.
1992
The authors present an algorithm for numerically finding the limiting distribution of...
On exact computational analysis of distributions of numbers in systems for M/G/1/N+1 and GI/M/1/N+1 queues using roots
1991
In this paper, the authors obtain the distribution of number in system and other...
Computational analysis of the distribution of number in the system MX/G/1-An alternative approach
1992
In this paper, the authors propose an alternative method to obtain the limiting...
Numerical analysis for bulk-arrival queueing system root-finding and steady-state probabilities in GIr/M/1 queues
1987
Queueing theorists have presented, as solutions to many queueing models, probability...
Papers per page:
6 Papers
12 Papers
24 Papers
36 Papers
48 Papers