Queueing Systems with Demands of Random Space Requirement and Limited Queueing or Sojourn Time

被引：1
|
作者：
Tikhonenko, Oleg [1 ]
Zajac, Pawel [2 ]
机构：
[1] Cardinal Stefan Wyszynski Univ Warsaw, Coll Sci, Fac Math & Nat Sci, Ul Woycickiego 1-3, PL-01938 Warsaw, Poland
[2] Czestochowa Tech Univ, Inst Math, Al Armii Krajowej 21, PL-42200 Czestochowa, Poland
来源：
COMPUTER NETWORKS (CN 2017) | 2017年 / 718卷
关键词：
Queueing system; Buffer space capacity; Demand volume; Demands total volume; Queueing time; Sojourn time; INVERSION;
D O I：
10.1007/978-3-319-59767-6_30
中图分类号：
TP [自动化技术、计算机技术];
学科分类号：
0812 ;
摘要：
We investigate queueing systems with demands of random space requirements and limited buffer space, in which queueing or sojourn time are limited by some constant value. For such systems, in the case of exponentially distributed service time and Poisson entry, we obtain the steady-state demands number distribution and probability of demands losing.
引用
收藏
页码：380 / 391
页数：12
相关论文
共 50 条
12345