A Complete and Simple Solution to a Discrete-Time Finite-Capacity BMAP-D-c QueueReport as inadecuate




A Complete and Simple Solution to a Discrete-Time Finite-Capacity BMAP-D-c Queue - Download this document for free, or read online. Document in PDF available to download.

We consider a discrete-time multi-server finite-capacity queueing system with correlated batch arrivals and deterministic service times of single slot, which has a variety of potential applications in slotted digital telecommunication systems and other related areas. For this queueing system, we present, based on Markov chain analysis, not only the steady-state distributions but also the transient distributions of the system length and of the system waiting time in a simple and unified manner. From these distributions, important performance measures of practical interest can be easily obtained. Numerical examples concerning the superposition of certain video traffics are presented at the end.

KEYWORDS

Discrete-Time Queue; Batch Markovian Arrival Process; Deterministic Service Time; Multiple Server

Cite this paper

N. Kim, M. Chaudhry, B. Yoon and K. Kim -A Complete and Simple Solution to a Discrete-Time Finite-Capacity BMAP-D-c Queue,- Applied Mathematics, Vol. 3 No. 12A, 2012, pp. 2169-2173. doi: 10.4236-am.2012.312A297.





Author: Nam K. Kim, Mohan L. Chaudhry, Bong K. Yoon, Kilhwan Kim

Source: http://www.scirp.org/



DOWNLOAD PDF




Related documents