Umesh Chandra Gupta
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Research Subjects
Umesh Chandra Gupta has a total of 14 co-authors. Here are the top co-authors by number of shared publications:
- Nitin Kumar
Department of Mathematics, Indian Institute of Technology Jammu, Jammu, India
7 shared publications - F. P. Barbhuiya
Indian Institute of Technology Kharagpur
5 shared publications Nitin Kumar
Department of Mathematics, Indian Institute of Technology Kharagpur, Kharagpur, India
4 shared publicationsF. P. Barbhuiya
Indian Institute of Technology Kharagpur
2 shared publications- Anuradha Banerjee
Department of Mathematical Sciences, IIT BHU
1 shared publication Arunava Maity
Indian Institute of Technology Kharagpur
1 shared publication
Latest Publications
- 1 September 2026
- Published by Springer Nature in OPSEARCH
- p. 1-19
Analyzing a bulk service queue with general input and batch size dependent service: $GI/M_{n}^{Y}/1$- 1 September 2026
- Published by Springer Nature in OPSEARCH
- p. 1-19
Analyzing a bulk service queue with general input and batch size dependent service: $GI/M_{n}^{Y}/1$- 3 July 2022
- Published by Taylor & Francis in International Journal of Computer Mathematics: Computer Systems Theory
- Vol. 7 (3) , 149-171
Analysis of batch size-dependent bulk service queue with multiple working vacation
The present article analyzes an infinite buffer batch size-dependent bulk service queue with multiple working vacation (MWV). The customer's arrival pattern follows the Poisson process, and they get the service in batches according to the general bulk service (GBS) rule in regular period (RP) as well as in working vacation period (WVP). After one service in RP, if the queue size is greater or equal to the lower threshold of the GBS rule, then the server performs the service in RP, otherwise, it starts the working vacation (WV) following exponential vacation time distribution. During the WVP, the server serves the customers in batches (if any) at a lower service rate than the usual service rate. The service time in the RP as well as in WVP is generally distributed. At an arbitrary epoch the joint probabilities of the queue size and batch size with the server in RP as well as in WVP have been obtained using the supplementary variable technique (SVT) and the bivariate generating function method. Finally, some numerical observations are presented to enhance the applicability of the analytical results.
- 3 July 2022
- Published by Taylor & Francis in International Journal of Computer Mathematics: Computer Systems Theory
- Vol. 7 (3) , 149-171
Analysis of batch size-dependent bulk service queue with multiple working vacation
The present article analyzes an infinite buffer batch size-dependent bulk service queue with multiple working vacation (MWV). The customer's arrival pattern follows the Poisson process, and they get the service in batches according to the general bulk service (GBS) rule in regular period (RP) as well as in working vacation period (WVP). After one service in RP, if the queue size is greater or equal to the lower threshold of the GBS rule, then the server performs the service in RP, otherwise, it starts the working vacation (WV) following exponential vacation time distribution. During the WVP, the server serves the customers in batches (if any) at a lower service rate than the usual service rate. The service time in the RP as well as in WVP is generally distributed. At an arbitrary epoch the joint probabilities of the queue size and batch size with the server in RP as well as in WVP have been obtained using the supplementary variable technique (SVT) and the bivariate generating function method. Finally, some numerical observations are presented to enhance the applicability of the analytical results.
- 24 January 2022
- Published by Springer Nature in Methodology and Computing in Applied Probability
- Vol. 24 (4) , 2287-2312
Markovian Arrival Process Subject to Renewal Generated Binomial Catastrophes
- 24 January 2022
- Published by Springer Nature in Methodology and Computing in Applied Probability
- Vol. 24 (4) , 2287-2312
Markovian Arrival Process Subject to Renewal Generated Binomial Catastrophes
- 19 October 2021
- Published by Taylor & Francis in Communications in Statistics - Theory and Methods
- Vol. 52 (12) , 4283-4309
Analysis of BMAP/MSP/1 queue with MAP generated negative customers and disasters
This paper studies an infinite-buffer single server queueing model with negative customers and disasters. The ordinary (positive) customers arrive in the system according to the batch Markovian arrival process and join the queue for service. The negative customer and disaster are characterized by two independent Markovian arrival processes. A negative customer removes the positive customer undergoing service, if any, and a disaster makes the system empty by simultaneously removing all the positive customers present in the system. We obtain the steady-state vector generating function (VGF) of the distribution of the number of positive customers in the system at arbitrary epoch. Further, the inversion of the VGF is carried out using the roots method to obtain the distribution. Moreover, the probability vectors at post-departure and pre-arrival epochs are also obtained. The results obtained throughout the analysis are computationally tractable, as illustrated by few numerical examples. Finally, we discuss the impact of the correlation of the arrival process of negative customers and disasters on the performance of the system through some graphical representations.
- 19 October 2021
- Published by Taylor & Francis in Communications in Statistics - Theory and Methods
- Vol. 52 (12) , 4283-4309
Analysis of BMAP/MSP/1 queue with MAP generated negative customers and disasters
This paper studies an infinite-buffer single server queueing model with negative customers and disasters. The ordinary (positive) customers arrive in the system according to the batch Markovian arrival process and join the queue for service. The negative customer and disaster are characterized by two independent Markovian arrival processes. A negative customer removes the positive customer undergoing service, if any, and a disaster makes the system empty by simultaneously removing all the positive customers present in the system. We obtain the steady-state vector generating function (VGF) of the distribution of the number of positive customers in the system at arbitrary epoch. Further, the inversion of the VGF is carried out using the roots method to obtain the distribution. Moreover, the probability vectors at post-departure and pre-arrival epochs are also obtained. The results obtained throughout the analysis are computationally tractable, as illustrated by few numerical examples. Finally, we discuss the impact of the correlation of the arrival process of negative customers and disasters on the performance of the system through some graphical representations.
- 7 August 2021
- Published by Springer Nature in International Journal of Applied and Computational Mathematics
- Vol. 7 (5) , 1-34
Computational and Numerical Investigation of the Batch Markovian Arrival Process Subject to Renewal Generated Geometric Catastrophes
In this paper, we consider a stochastic model in which the population grows according to the batch Markovian arrival process and is subjected to renewal generated geometric catastrophes. Our analytical work starts from the vector generating function (VGF) of the population size at post-catastrophe epoch. We develop a methodology for extracting the population size distribution at post-catastrophe epoch from the VGF, which is based on the inversion of VGF using the roots method. The method is analytically quite simple and easy to implement. Further, we obtain the population size distribution at arbitrary, pre-catastrophe and pre-arrival epochs along with their factorial moments. To show the applicability and correctness of the proposed methodology, we match our results with the available ones in special cases and present several numerical examples for different inter-catastrophe time distributions. Moreover, we investigate the effect of key parameters on the system performance and display the results in the form of graphs along with a detailed description.
- 7 August 2021
- Published by Springer Nature in International Journal of Applied and Computational Mathematics
- Vol. 7 (5) , 1-34
Computational and Numerical Investigation of the Batch Markovian Arrival Process Subject to Renewal Generated Geometric Catastrophes
In this paper, we consider a stochastic model in which the population grows according to the batch Markovian arrival process and is subjected to renewal generated geometric catastrophes. Our analytical work starts from the vector generating function (VGF) of the population size at post-catastrophe epoch. We develop a methodology for extracting the population size distribution at post-catastrophe epoch from the VGF, which is based on the inversion of VGF using the roots method. The method is analytically quite simple and easy to implement. Further, we obtain the population size distribution at arbitrary, pre-catastrophe and pre-arrival epochs along with their factorial moments. To show the applicability and correctness of the proposed methodology, we match our results with the available ones in special cases and present several numerical examples for different inter-catastrophe time distributions. Moreover, we investigate the effect of key parameters on the system performance and display the results in the form of graphs along with a detailed description.
- 11 May 2021
- Published by EDP Sciences in RAIRO - Operations Research
- Vol. 55 (3) , 1231-1256
Complete analysis of a discrete-time batch service queue with batch-size-dependent service time under correlated arrival process: D-MAP/Gn(a,b)/1
Discrete-time queueing models find a large number of applications as they are used in modeling queueing systems arising in digital platforms like telecommunication systems and computer networks. In this paper, we analyze an infinite-buffer queueing model with discrete Markovian arrival process. The units on arrival are served in batches by a single server according to the general bulk-service rule, and the service time follows general distribution with service rate depending on the size of the batch being served. We mathematically formulate the model using the supplementary variable technique and obtain the vector generating function at the departure epoch. The generating function is in turn used to extract the joint distribution of queue and server content in terms of the roots of the characteristic equation. Further, we develop the relationship between the distribution at the departure epoch and the distribution at arbitrary, pre-arrival and outside observer's epochs, where the first is used to obtain the latter ones. We evaluate some essential performance measures of the system and also discuss the computing process extensively which is demonstrated by some numerical examples.
- 11 May 2021
- Published by EDP Sciences in RAIRO - Operations Research
- Vol. 55 (3) , 1231-1256
Complete analysis of a discrete-time batch service queue with batch-size-dependent service time under correlated arrival process: D-MAP/Gn(a,b)/1
Discrete-time queueing models find a large number of applications as they are used in modeling queueing systems arising in digital platforms like telecommunication systems and computer networks. In this paper, we analyze an infinite-buffer queueing model with discrete Markovian arrival process. The units on arrival are served in batches by a single server according to the general bulk-service rule, and the service time follows general distribution with service rate depending on the size of the batch being served. We mathematically formulate the model using the supplementary variable technique and obtain the vector generating function at the departure epoch. The generating function is in turn used to extract the joint distribution of queue and server content in terms of the roots of the characteristic equation. Further, we develop the relationship between the distribution at the departure epoch and the distribution at arbitrary, pre-arrival and outside observer's epochs, where the first is used to obtain the latter ones. We evaluate some essential performance measures of the system and also discuss the computing process extensively which is demonstrated by some numerical examples.
- 1 September 2020
- Published by Springer Nature in Methodology and Computing in Applied Probability
- Vol. 22 (3) , 1293-1324
A Renewal Generated Geometric Catastrophe Model with Discrete-Time Markovian Arrival Process
- 1 September 2020
- Published by Springer Nature in Methodology and Computing in Applied Probability
- Vol. 22 (3) , 1293-1324
A Renewal Generated Geometric Catastrophe Model with Discrete-Time Markovian Arrival Process
- 30 August 2020
- Published by Springer Nature
- p. 143-157
A Queueing System with Batch Renewal Input and Negative Arrivals
- 30 August 2020
- Published by Springer Nature
- p. 143-157
A Queueing System with Batch Renewal Input and Negative Arrivals
- Open Access
Analysis of an infinite-buffer batch-size-dependent service queue with discrete-time Markovian arrival process: D-$MAP/G_n^{(a,b)}/1$
Discrete-time queueing models find huge applications as they are used in modeling queueing systems arising in digital platforms like telecommunication systems, computer networks, etc. In this paper, we analyze an infinite-buffer queueing model with discrete Markovian arrival process. The units on arrival are served in batches by a single server according to the general bulk-service rule, and the service time follows general distribution with service rate depending on the size of the batch being served. We mathematically formulate the model using the supplementary variable technique and obtain the vector generating function at the departure epoch. The generating function is in turn used to extract the joint distribution of queue and server content in terms of the roots of the characteristic equation. Further, we develop the relationship between the distribution at the departure epoch and the distribution at arbitrary, pre-arrival and outside observer's epoch, which is used to obtain the latter ones. We evaluate some essential performance measures of the system and also discuss the computing process extensively which is demonstrated by a few numerical examples.
Open AccessAnalysis of an infinite-buffer batch-size-dependent service queue with discrete-time Markovian arrival process: D-$MAP/G_n^{(a,b)}/1$
Discrete-time queueing models find huge applications as they are used in modeling queueing systems arising in digital platforms like telecommunication systems, computer networks, etc. In this paper, we analyze an infinite-buffer queueing model with discrete Markovian arrival process. The units on arrival are served in batches by a single server according to the general bulk-service rule, and the service time follows general distribution with service rate depending on the size of the batch being served. We mathematically formulate the model using the supplementary variable technique and obtain the vector generating function at the departure epoch. The generating function is in turn used to extract the joint distribution of queue and server content in terms of the roots of the characteristic equation. Further, we develop the relationship between the distribution at the departure epoch and the distribution at arbitrary, pre-arrival and outside observer's epoch, which is used to obtain the latter ones. We evaluate some essential performance measures of the system and also discuss the computing process extensively which is demonstrated by a few numerical examples.
- 1 April 2020
- Published by Springer Nature in Annals of Operations Research
- Vol. 287 (1) , 257-283
Analysis of batch Bernoulli process subject to discrete-time renewal generated binomial catastrophes
- 1 April 2020
- Published by Springer Nature in Annals of Operations Research
- Vol. 287 (1) , 257-283
Analysis of batch Bernoulli process subject to discrete-time renewal generated binomial catastrophes