中文

The effective bandwidth problem revisited

概率论 2008-11-04 v6 经典分析与常微分方程

摘要

The paper studies a single-server queueing system with autonomous service and \ell priority classes. Arrival and departure processes are governed by marked point processes. There are \ell buffers corresponding to priority classes, and upon arrival a unit of the kkth priority class occupies a place in the kkth buffer. Let N(k)N^{(k)}, k=1,2,...,k=1,2,...,\ell denote the quota for the total kkth buffer content. The values N(k)N^{(k)} are assumed to be large, and queueing systems both with finite and infinite buffers are studied. In the case of a system with finite buffers, the values N(k)N^{(k)} characterize buffer capacities. The paper discusses a circle of problems related to optimization of performance measures associated with overflowing the quota of buffer contents in particular buffers models. Our approach to this problem is new, and the presentation of our results is simple and clear for real applications.

关键词

引用

@article{arxiv.math/0604182,
  title  = {The effective bandwidth problem revisited},
  author = {Vyacheslav M. Abramov},
  journal= {arXiv preprint arXiv:math/0604182},
  year   = {2008}
}

备注

29 pages, 11pt, Final version, that will be published as is in Stochastic Models