一类可修非周期Fork-Join排队网络分析
Analysis of a Class of Repairable Acyclic Fork-Join Queuing Networks
-
摘要: 研究一类排队空间有限且服务台可修的非周期Fork-Join排队网络,给出求解稳态 概率的直接法和等效法,并计算一些排队指标和可修指标(如稳态队长、服务台的可用度和服 务台的失效概率),最后通过仿真验证其正确性.Abstract: A class of repairable acyclic fork-join queuing networks (RAFJQN) with finite queuing spaces and repairable service machine is considered. In calculating steady-state probability, both direct method and equivalient method are proposed. In addition, some indices (such as steady-state queuing length, failure probabilities of server and utilizable rates of server) in queueing theory and repairable theoy are obtained. Finally, examples are given by simulation.
-
Key words:
- Queuing network models /
- reliability /
- steady states /
- probability
-
计量
- 文章访问数: 3098
- HTML全文浏览量: 103
- PDF下载量: 1511
- 被引次数: 0
下载:
