A Complete and Simple Solution to a Discrete-Time Finite-Capacity BMAP/D/c Queue
A Complete and Simple Solution to a Discrete-Time Finite-Capacity BMAP/D/c Queue作者机构：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
出 版 物：《Applied Mathematics》 (应用数学（英文）)
年 卷 期：2012年第3卷第12期
页 面：2169-2173页
学科分类：07[理学] 0701[理学-数学] 070101[理学-基础数学]
主 题：Discrete-Time Queue Batch Markovian Arrival Process Deterministic Service Time Multiple Server
摘 要：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.
维普期刊数据库