Some bounds for many-server systems GI/G/s
作者:
Dietrich Stoyan,
期刊:
Mathematische Operationsforschung und Statistik
(Taylor Available online 1974)
卷期:
Volume 5,
issue 2
页码: 117-129
ISSN:0047-6277
年代: 1974
DOI:10.1080/02331887408801152
出版商: Akademie-Verlag
数据来源: Taylor
摘要:
In the paper some bounds are proved for the mean waising time in reany server queues, especially inM/G/squeues which are more precise than those of KINGMAL and BRUMELLE. ForM/G/squeues bounds are given for the probility that an arriving customor has to loss probility inG/M/sloss systems using a semi-ordering relation.
点击下载:
PDF (467KB)
返 回