Abhijit Datta Banik
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Previous Organizations / Institutes
The organizations / institutes from the scholar's other articles in the past ten years
Research Subjects
Abhijit Datta Banik has a total of 42 co-authors. Here are the top co-authors by number of shared publications:
- Mohan L. Chaudhry
Department of Mathematics and Computer Science, Royal Military College of Canada, Kingston, ON K7K 7B4, Canada
10 shared publications - Veena Goswami
School of Computer Applications, Kalinga Institute of Industrial Technology, Bhubaneswar, India
9 shared publications - Souvik Ghosh
Indian Institute of Technology Bhubaneswar
6 shared publications - Dibyajyoti Guha
School of Computer Engineering, KIIT University, Bhubaneswar 751024, India
5 shared publications M. L. Chaudhry
Royal Military College of Canada
5 shared publications- Mohan Chaudhry
Department of Mathematics and Computer Science, Royal Military College of Canada, Kingston, Canada
5 shared publications
Latest Publications
- 3 April 2026
- Published by Taylor & Francis in American Journal of Mathematical and Management Sciences
- Vol. 45 (1-2) , 118-146
Performance Characteristics and Optimization in Bulk-Service Queues: M / G(a,Y) /1/ ∞
1. Batch-service queueing systems are important in many real-life situations for efficient resource delivery, utilization and distribution. In particular, batch-service queues are useful in group t...
- 3 April 2026
- Published by Taylor & Francis in American Journal of Mathematical and Management Sciences
- Vol. 45 (1-2) , 118-146
Performance Characteristics and Optimization in Bulk-Service Queues: M / G(a,Y) /1/ ∞
1. Batch-service queueing systems are important in many real-life situations for efficient resource delivery, utilization and distribution. In particular, batch-service queues are useful in group t...
- 17 March 2026
- Published by Springer Nature in OPSEARCH
- p. 1-25
Analysis and optimal control in an $M^X/G/1$ queueing model with heavy-tailed service-time distribution- 17 March 2026
- Published by Springer Nature in OPSEARCH
- p. 1-25
Analysis and optimal control in an $M^X/G/1$ queueing model with heavy-tailed service-time distribution- 11 August 2025
- Published by Springer Nature in Annals of Operations Research
- Vol. 352 (1-2) , 1-24
A simple derivation of the waiting-time distribution (in the queue) for the bulk-service $M/G^{(a,b)}/1$ queueing system- 11 August 2025
- Published by Springer Nature in Annals of Operations Research
- Vol. 352 (1-2) , 1-24
A simple derivation of the waiting-time distribution (in the queue) for the bulk-service $M/G^{(a,b)}/1$ queueing system- 11 August 2025
- Published by Wiley in ChemistrySelect
- Vol. 10 (31) , 1-24
Correction to “ZnO Nanoparticles Derived from Pineapple Waste: Synthesis, Photodegradation of Organic Dyes, and Antibacterial Mechanisms Investigated Experimentally and In Silico”
- 11 August 2025
- Published by Wiley in ChemistrySelect
- Vol. 10 (31) , 1-24
Correction to “ZnO Nanoparticles Derived from Pineapple Waste: Synthesis, Photodegradation of Organic Dyes, and Antibacterial Mechanisms Investigated Experimentally and In Silico”
- Open Access
- 1 August 2025
- Published by Universal Wiser Publisher Pte. Ltd in Contemporary Mathematics
- p. 4604-4620
On the Queueing Time Analysis for State-Dependent Fixed-Cycle Traffic Light Queues
We analyze a Fixed-Cycle Traffic Light (FCTL) intersection model. Vehicles arrive according to a Poisson process and must wait for a green signal. Each signal period (red or green) consists of a number of phases. Exactly one waiting vehicle is released (passes through the intersection) per green signal period phase, while vehicles remain waiting during red signal periods phases. The lengths of red and green signal periods are not constants, rather they depend on the number of vehicles in the queue. That is, we propose a state-dependent scheduling mechanism for green and red signal periods in an FCTL intersection. The number of green phases increases if the number of vehicles waiting in the intersection is greater than or equal to a threshold N(> 0). The number of green phases increases from g(> 0) to g1(≥ g) and the number of red phases decreases from r(> 0) to r1(≤ r) in such a way that the total length of a cycle period, c = g + r = g1 + r1, is fixed. This mechanism allows one to control the waiting time of vehicles through the FCTL intersection. We analyze the distributions of queue length and vehicle waiting time during each phase of the green signal period. We provide several numerical examples to gain insight into the performance of our proposed FCTL scheduling mechanism. The proposed state-dependent FCTL queueing model dynamically adjusts green and red light durations based on the volume of traffic in queues. This FCTL model with state-dependent scheduling is ideal for smart city traffic optimization, improves traffic flow, reduces delays, and minimizes fuel consumption in busy urban areas.
- 1 August 2025
- Published by Universal Wiser Publisher Pte. Ltd in Contemporary Mathematics
- p. 4604-4620
Open AccessOn the Queueing Time Analysis for State-Dependent Fixed-Cycle Traffic Light Queues
We analyze a Fixed-Cycle Traffic Light (FCTL) intersection model. Vehicles arrive according to a Poisson process and must wait for a green signal. Each signal period (red or green) consists of a number of phases. Exactly one waiting vehicle is released (passes through the intersection) per green signal period phase, while vehicles remain waiting during red signal periods phases. The lengths of red and green signal periods are not constants, rather they depend on the number of vehicles in the queue. That is, we propose a state-dependent scheduling mechanism for green and red signal periods in an FCTL intersection. The number of green phases increases if the number of vehicles waiting in the intersection is greater than or equal to a threshold N(> 0). The number of green phases increases from g(> 0) to g1(≥ g) and the number of red phases decreases from r(> 0) to r1(≤ r) in such a way that the total length of a cycle period, c = g + r = g1 + r1, is fixed. This mechanism allows one to control the waiting time of vehicles through the FCTL intersection. We analyze the distributions of queue length and vehicle waiting time during each phase of the green signal period. We provide several numerical examples to gain insight into the performance of our proposed FCTL scheduling mechanism. The proposed state-dependent FCTL queueing model dynamically adjusts green and red light durations based on the volume of traffic in queues. This FCTL model with state-dependent scheduling is ideal for smart city traffic optimization, improves traffic flow, reduces delays, and minimizes fuel consumption in busy urban areas.
- 9 July 2025
- Published by Springer Nature in Indian Journal of Pure and Applied Mathematics
- Vol. 56 (3) , 973-988
Computational Procedure for System Length and Waiting-time Distribution in an $M^{X}/D/c/N$ Queue- 9 July 2025
- Published by Springer Nature in Indian Journal of Pure and Applied Mathematics
- Vol. 56 (3) , 973-988
Computational Procedure for System Length and Waiting-time Distribution in an $M^{X}/D/c/N$ Queue- Open Access
- 24 February 2023
- Published by MDPI AG in Mathematics
- Vol. 11 (5) , 1142
A Novel Computational Procedure for the Waiting-Time Distribution (In the Queue) for Bulk-Service Finite-Buffer Queues with Poisson Input
In this paper, we discuss the waiting-time distribution for a finite-space, single-server queueing system, in which customers arrive singly following a Poisson process and the server operates under -bulk service rule. The queueing system has a finite-buffer capacity ‘N’ excluding the batch in service. The service-time distribution of batches follows a general distribution, which is independent of the arrival process. We first develop an alternative approach of obtaining the probability distribution for the queue length at a post-departure epoch of a batch and, subsequently, the probability distribution for the queue length at a random epoch using an embedded Markov chain, Markov renewal theory and the semi-Markov process. The waiting-time distribution (in the queue) of a random customer is derived using the functional relation between the probability generating function (pgf) for the queue-length distribution and the Laplace–Stieltjes transform (LST) of the queueing-time distribution for a random customer. Using LSTs, we discuss the derivation of the probability density function of a random customer’s waiting time and its numerical implementations.- 24 February 2023
- Published by MDPI AG in Mathematics
- Vol. 11 (5) , 1142
Open AccessA Novel Computational Procedure for the Waiting-Time Distribution (In the Queue) for Bulk-Service Finite-Buffer Queues with Poisson Input
In this paper, we discuss the waiting-time distribution for a finite-space, single-server queueing system, in which customers arrive singly following a Poisson process and the server operates under -bulk service rule. The queueing system has a finite-buffer capacity ‘N’ excluding the batch in service. The service-time distribution of batches follows a general distribution, which is independent of the arrival process. We first develop an alternative approach of obtaining the probability distribution for the queue length at a post-departure epoch of a batch and, subsequently, the probability distribution for the queue length at a random epoch using an embedded Markov chain, Markov renewal theory and the semi-Markov process. The waiting-time distribution (in the queue) of a random customer is derived using the functional relation between the probability generating function (pgf) for the queue-length distribution and the Laplace–Stieltjes transform (LST) of the queueing-time distribution for a random customer. Using LSTs, we discuss the derivation of the probability density function of a random customer’s waiting time and its numerical implementations. - 3 January 2023
- Published by Taylor & Francis in Communications in Statistics - Theory and Methods
- Vol. 53 (10) , 3517-3546
Classical and Bayesian estimations of performance measures in a single server Markovian queueing system based on arrivals during service times
The present study considers a single-server Markovian queueing system by observing the number of customer arrivals during the service time of a customer. We estimate the traffic intensity in this queueing system along with the average queue length and the expected number of customers in the system. We propose classical and Bayesian frameworks to estimate the parameters of interest. In the Bayesian setup, three forms of prior distributions for ρ and two loss functions are considered. Furthermore, the predictive distribution of the number of customer arrivals during the service time of a customer and the equal-tailed credible region of ρ are obtained. The aforementioned approaches are illustrated with numerical examples based on simulation studies.
- 3 January 2023
- Published by Taylor & Francis in Communications in Statistics - Theory and Methods
- Vol. 53 (10) , 3517-3546
Classical and Bayesian estimations of performance measures in a single server Markovian queueing system based on arrivals during service times
The present study considers a single-server Markovian queueing system by observing the number of customer arrivals during the service time of a customer. We estimate the traffic intensity in this queueing system along with the average queue length and the expected number of customers in the system. We propose classical and Bayesian frameworks to estimate the parameters of interest. In the Bayesian setup, three forms of prior distributions for ρ and two loss functions are considered. Furthermore, the predictive distribution of the number of customer arrivals during the service time of a customer and the equal-tailed credible region of ρ are obtained. The aforementioned approaches are illustrated with numerical examples based on simulation studies.