Analysis of the MAP/Ga,b/1/N Queue

Authors:
U. C. Gupta;P. Vijaya Laxmi
Affiliations:
Department of Mathematics, Indian Institute of Technology, Kharagpur-721302, India umesh@maths.iitkgp.ernet.in;Department of Mathematics, Indian Institute of Technology, Kharagpur-721302, India
Venue:
Queueing Systems: Theory and Applications
Year:
2001

Citing 4
Cited 8

Computational analysis of steady-state probabilities of M/Ga,b/1 and related nonbulk queues

Queueing Systems: Theory and Applications
Frontiers in queueing: models and applications in science and engineering

Frontiers in queueing: models and applications in science and engineering
Modelling and analysis of M/G^{a,b}/1/N queue – A simple alternative approach

Queueing Systems: Theory and Applications
On the finite-buffer bulk-service queue with general independent arrivals: GI/M[b]/1/N

Operations Research Letters

Finite-buffer bulk service queue under Markovian service process

Proceedings of the 2nd international conference on Performance evaluation methodologies and tools
Queueing network analysis on dynamic lot streaming

Computers and Operations Research
Queueing analysis and optimal control of BMAP/G(a,b)/1/N and BMAP/MSP(a,b)/1/N systems

Computers and Industrial Engineering
Computing system-time and system-length distributions for MAP/D/1 queue using distributional Little's law

Performance Evaluation
Analyzing state-dependent arrival in GI/BMSP/1/∞ queues

Mathematical and Computer Modelling: An International Journal
Complete analysis of finite and infinite buffer GI/MSP/ 1 queue-A computational approach

Operations Research Letters
Finite buffer vacation models under E-limited with limit variation service and Markovian arrival process

Operations Research Letters
Analysis of a versatile batch-service queueing model with correlation in the arrival process

Performance Evaluation

Quantified Score

Hi-index	0.00

Visualization

Abstract

The Markovian arrival process (MAP) is used to represent the bursty and correlated traffic arising in modern telecommunication network. In this paper, we consider a single server finite capacity queue with general bulk service rule in which arrivals are governed by MAP and service times are arbitrarily distributed. The distributions of the number of customers in the queue at arbitrary, post-departure and pre-arrival epochs have been obtained using the supplementary variable and the embedded Markov chain techniques. Computational procedure has been given when the service time distribution is of phase type.