Premium
Analysis of a finite‐buffer bulk‐service queue with discrete‐Markovian arrival process: D‐MAP/ G a,b /1/ N
Author(s) -
Chaudhry M.L.,
Gupta U.C.
Publication year - 2003
Publication title -
naval research logistics (nrl)
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 0.665
H-Index - 68
eISSN - 1520-6750
pISSN - 0894-069X
DOI - 10.1002/nav.10047
Subject(s) - markovian arrival process , queue , markov chain , computer science , markov process , process (computing) , real time computing , random variable , service (business) , queueing theory , discrete time and continuous time , algorithm , mathematics , mathematical optimization , computer network , statistics , economy , machine learning , economics , operating system
Discrete‐time queues with D‐MAP arrival process are more useful in modeling and performance analysis of telecommunication networks based on the ATM environment. This paper analyzes a finite‐buffer discrete‐time queue with general bulk‐service rule, wherein the arrival process is D‐MAP and service times are arbitrarily and independently distributed. The distributions of buffer contents at various epochs (departure, random, and prearrival) have been obtained using imbedded Markov chain and supplementary variable methods. Finally, some performance measures such as loss probability and average delay are discussed. Numerical results are also presented in some cases. © 2003 Wiley Periodicals, Inc. Naval Research Logistics 50: 345–363, 2003.