Simultaneity in discrete-time single server queues with Bernoulli inputs
Performance Evaluation
A recursive method for Bernoulli arrival queues and its application to partial buffer sharing in ATM
Computers and Operations Research
Discrete-Time Models for Communication Systems Including ATM
Discrete-Time Models for Communication Systems Including ATM
Computers and Operations Research
Multiserver bulk service discrete-time queue with finite buffer and renewal input
Computers & Mathematics with Applications
Discrete-time bulk-service queue with two heterogeneous servers
Computers and Industrial Engineering
Performance improvement of dynamic buffered ATM switch
Computers and Electrical Engineering
Computers and Industrial Engineering
A batch-service queueing model with a discrete batch Markovian arrival process
ASMTA'10 Proceedings of the 17th international conference on Analytical and stochastic modeling techniques and applications
Analysis of discrete-time batch service renewal input queue with multiple working vacations
Computers and Industrial Engineering
Tail distribution of the delay in a general batch-service queueing model
Computers and Operations Research
Analysis of the discrete-time bulk-service queue Geo/GY/1/N+B
Operations Research Letters
A discrete-time queueing model with a batch server operating under the minimum batch size rule
NEW2AN'07 Proceedings of the 7th international conference on Next Generation Teletraffic and Wired/Wireless Advanced Networking
Analysis of a versatile batch-service queueing model with correlation in the arrival process
Performance Evaluation
Computers and Operations Research
Hi-index | 0.01 |
Discrete-time queues are extensively used in modelling the ATM environment at the cell level. In this paper, we model a single-server queue with finite buffer space in a discrete-time environment where the services are performed in batches of maximum size 'b' with a minimum threshold value 'a'. The analytic analysis of the model is carried out for the both arrival first (AF) and departure first (DF) management policies and distributions of buffer content at various epochs have been obtained. The system performance measures such as average buffer content, average delay and probability of blocking are discussed. A comparative study of AF and DF management policies on certain performance measures is also presented.