The BMAP/G/1 Queue with Level-Dependent Arrivals – An Overview

被引：0

作者：

Jens Hofmann

机构：

[1] Universität Trier,

[2] FB IV – Informatik,undefined

来源：

Telecommunication Systems | 2001年 / 16卷

关键词：

queueing theory; BMAP/G/1 queue; state-dependent arrivals;

D O I：

暂无

中图分类号：

学科分类号：

摘要：

The BMAP/G/1 queue is a field of intensive research since several years. We generalize the BMAP/G/1 queue by allowing the arrival process to depend on the state (level) of the queue, i.e., on the number of customers in the system. This will be called a BMAP/G/1 queueing system with level-dependent arrivals. A suitable arrival process is defined by nesting a countable number of BMAPs.

引用

页码：347 / 359

页数：12

共 5 条

[1] Hunter J.J.(1969)On the moments of Markov renewal processes Advances in Applied Probability 1 188-210
[2] Lucantoni D.M.(1991)New results on the single server queue with a batch Markovian arrival process, Communications in Statistics Stochastic Models 7 1-46
[3] Pakes A.G.(1969)Some conditions for ergodicity and recurrence of Markov chains Operations Research 17 1058-1061
[4] Ramaswami V.(1980)The N/G Advances in Applied Probability 12 222-261
[5] Ramaswami V.(1988)1 queue and its detailed analysis Stochastic Models 4 183-188

← 1 →