Analysis of a G/M/K/O queueing loss system with heterogeneous servers and retrials
作者:
BEHNAM POURBABAI,
期刊:
International Journal of Systems Science
(Taylor Available online 1987)
卷期:
Volume 18,
issue 5
页码: 985-992
ISSN:0020-7721
年代: 1987
DOI:10.1080/00207728708964025
出版商: Taylor & Francis Group
数据来源: Taylor
摘要:
Consider a G/M/K/O queueing loss system with K heterogeneous servers, exponentially distributed service times, no waiting room, a stationary counting arrival process, and an ordered entry. The ordered entry rule implies that, if the servers are indexed from 1 to K, units first arrive at the first server, then at the second server, and finally at theKth server. In this queueing system, units that find the servers busy are not lost. Those units re-try to receive service by merging with the incoming units to be reconsidered for service by one of the free servers. This queueing system is analysed in terms of approximating the flows of units inside the system by a two parameter method. An example is introduced and approximation results are compared with those from a simulation study.
点击下载:
PDF (260KB)
返 回