A Complete and Simple Solution to a Discrete-Time Finite-Capacity BMAP/D/c Queue - Applied Mathematics

AM > Vol.3 No.12, December 2012

Applied Mathematics

Volume 3, Issue 12 (December 2012)

ISSN Print: 2152-7385 ISSN Online: 2152-7393

Google-based Impact Factor: 0.96 Citations

A Complete and Simple Solution to a Discrete-Time Finite-Capacity BMAP/D/c Queue ()

HTML

Download as PDF (Size: 190KB) PP. 2169-2173

DOI: 10.4236/am.2012.312A297 3,743 Downloads 5,930 Views Citations

Author(s)

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

Affiliation(s)

Defense Management College, Korea National Defense University, Seoul, South Korea.
Department of Industrial Engineering, Chonnam National University, Gwangju, South Korea.
Department of Management Engineering, Sangmyung University, Cheonan, South Korea.
Department of Mathematics and Computer Science, Royal Military College of Canada, Kingston, Canada.

ABSTRACT

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

Share and Cite:

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

Cited by

[1]	Communication Patterns for Randomized Algorithms
	2018

[2]	Analysis of a discrete-time single-server queue with an occasional extra server
	Performance Evaluation, 2017

[3]	FINITE CAPACITY M/M/r/N QUEUEING MODEL WITH ADDITIONAL SERVERS
	2017

[4]	Self-Stabilizing Balls and Bins in Batches
	Algorithmica, 2016

[5]	Self-stabilizing balls & bins in batches: The power of leaky bins
	Proceedings of the …, 2016

Journals Menu

Follow SCIRP

	+1 323-425-8868
	customer@scirp.org
	+86 18163351462(WhatsApp)
	1655362766

	Paper Publishing WeChat

Journals Menu

Home

About SCIRP

Service

Policies