Gagan L. Choudhury
Research Subjects
Research Interests
Gagan L. Choudhury has a total of 6 co-authors. Here are the top co-authors by number of shared publications:
- Ward Whitt
AT&T Labs, Florham Park, New Jersey 07932-0971
3 shared publications David M. Lucantoni
IsoQuantic Technologies, Wayside, New Jersey
2 shared publicationsWard Whitt
AT&T Laboratories, Murray Hill, New Jersey
2 shared publications- David M. Lucantoni
AT&T Bell Laboratories , Room 3K-601, Holmdel, New Jersey, 07733
1 shared publication Joseph Abate
1 shared publication- Kin K. Leung
AT&T Bell Labs, Holmdel, NJ
1 shared publication
Latest Publications
- 1 January 2000
- Published by Springer Nature
- p. 257-323
An Introduction to Numerical Transform Inversion and Its Application to Probability Models
- 1 January 2000
- Published by Springer Nature
- p. 257-323
An Introduction to Numerical Transform Inversion and Its Application to Probability Models
- 1 June 1997
- Published by Institute for Operations Research and the Management Sciences (INFORMS) in Operations Research
- Vol. 45 (3) , 451-463
Numerical Solution of Piecewise-Stationary Mt/Gt/1 Queues
We develop an algorithm for computing the (exact) cumulative distribution function of the time-dependent workload in a piecewise-stationary Mt/Gt/1 queue with a work-conserving service discipline and general service-time distributions, where service times are determined at arrival instants. The t subscripts indicate that the arrival rate and the general service-time distribution may change with time, but we allow changes only at finitely many time points. The algorithm is based on numerical transform inversion, using the classical Takács double-transform of the transient workload in an M/G/1 queue recursively over the successive stationary intervals. In particular, we apply our recently developed Fourier-series-based inversion algorithms for two-dimensional transforms and nested one-dimensional transforms. We also do additional work to greatly speed up the computation while tightly controlling the error. As a consequence, the computation time grows only quadratically with the number of intervals. The algorithm is effective for ten or fewer intervals, where the intervals may have unlimited and possibly unequal lengths, typically running in at most a few minutes and maintaining high accuracy. We have also demonstrated that the algorithm can solve a 21-interval example with 7-to-10-digit accuracy in about half an hour. Models with only a few intervals are useful to study overload control strategies.
- 1 June 1997
- Published by Institute for Operations Research and the Management Sciences (INFORMS) in Operations Research
- Vol. 45 (3) , 451-463
Numerical Solution of Piecewise-Stationary Mt/Gt/1 Queues
We develop an algorithm for computing the (exact) cumulative distribution function of the time-dependent workload in a piecewise-stationary Mt/Gt/1 queue with a work-conserving service discipline and general service-time distributions, where service times are determined at arrival instants. The t subscripts indicate that the arrival rate and the general service-time distribution may change with time, but we allow changes only at finitely many time points. The algorithm is based on numerical transform inversion, using the classical Takács double-transform of the transient workload in an M/G/1 queue recursively over the successive stationary intervals. In particular, we apply our recently developed Fourier-series-based inversion algorithms for two-dimensional transforms and nested one-dimensional transforms. We also do additional work to greatly speed up the computation while tightly controlling the error. As a consequence, the computation time grows only quadratically with the number of intervals. The algorithm is effective for ten or fewer intervals, where the intervals may have unlimited and possibly unequal lengths, typically running in at most a few minutes and maintaining high accuracy. We have also demonstrated that the algorithm can solve a 21-interval example with 7-to-10-digit accuracy in about half an hour. Models with only a few intervals are useful to study overload control strategies.
- 1 January 1995
- Published by Springer Nature
- p. 255-282
Resource-Sharing Models with State-Dependent Arrivals of Batches
- 1 January 1995
- Published by Springer Nature
- p. 255-282
Resource-Sharing Models with State-Dependent Arrivals of Batches
- 1 January 1994
- Published by Elsevier
- p. 1043-1052
Numerical Transform Inversion to Analyze Teletraffic Models
- 1 January 1994
- Published by Elsevier
- p. 1043-1052
Numerical Transform Inversion to Analyze Teletraffic Models
- 1 January 1994
- Published by Taylor & Francis in Communications in Statistics. Stochastic Models
- Vol. 10 (1) , 145-182
The transient BMAP/G/l queue
We derive the two-dimensional transforms of the transient workload and queue-length distributions in the single-server queue with general service times and a batch Markovian arrival process (BMAP). This arrival process includes the familiar phase-type renewal process and the Markov modulated Poisson process as special cases, as well as superpositions of these processes, and allows correlated interarrival times and batch sizes. Numerical results are obtained via two-dimensional transform inversion algorithms based on the Fourier-series method. From the numerical examples we see that predictions of system performance based on transient and stationary performance measures can be quite different
- 1 January 1994
- Published by Taylor & Francis in Communications in Statistics. Stochastic Models
- Vol. 10 (1) , 145-182
The transient BMAP/G/l queue
We derive the two-dimensional transforms of the transient workload and queue-length distributions in the single-server queue with general service times and a batch Markovian arrival process (BMAP). This arrival process includes the familiar phase-type renewal process and the Markov modulated Poisson process as special cases, as well as superpositions of these processes, and allows correlated interarrival times and batch sizes. Numerical results are obtained via two-dimensional transform inversion algorithms based on the Fourier-series method. From the numerical examples we see that predictions of system performance based on transient and stationary performance measures can be quite different