Analysis of a finite-buffer bulk-service queue with discrete-Markovian arrival process: D–MAP/Ga,b/1/N

Analysis of a finite-buffer bulk-service queue with discrete-Markovian arrival process: D–MAP/Ga,b/1/N

0.00 Avg rating0 Votes
Article ID: iaor2004416
Country: United States
Volume: 50
Issue: 4
Start Page Number: 345
End Page Number: 363
Publication Date: Jun 2003
Journal: Naval Research Logistics
Authors: ,
Keywords: communications
Abstract:

Discrete-time queues with D-MAP arrival process are more useful in modeling and performance analysis of telecommunication networks based on the asynchronous transfer mode 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.

Reviews

Required fields are marked *. Your email address will not be published.