...
首页> 外文期刊>Performance Evaluation >Approximation of discrete time tandem queueing networks with unreliable servers and blocking
【24h】

Approximation of discrete time tandem queueing networks with unreliable servers and blocking

机译:具有不可靠服务器和阻塞的离散时间串联排队网络的逼近

获取原文
获取原文并翻译 | 示例
           

摘要

We consider the discrete time tandem queues with single unreliable server at each service station and a buffer of finite capacity between service stations. The blocking after service (BAS) mechanism and operation dependent failure (ODF) rule are adopted. The service time of each server is a constant unit time. A failure of each server occurs in a time slot with a fixed probability and the repair time distribution of each server is of discrete phase type. In this paper, we present an approximate analysis for the system based on the decomposition method and show that the approach can be applied to the variants of the system. (C) 2018 Elsevier B.V. All rights reserved.
机译:我们考虑离散时间串联队列,每个服务站具有单个不可靠的服务器,服务站之间具有有限容量的缓冲区。采用了服务后阻塞(BAS)机制和操作相关故障(ODF)规则。每个服务器的服务时间是恒定的单位时间。每个服务器的故障都在具有固定概率的时隙中发生,并且每个服务器的维修时间分布是离散阶段类型的。在本文中,我们提出了一种基于分解方法的系统近似分析,并表明该方法可以应用于系统的变体。 (C)2018 Elsevier B.V.保留所有权利。

著录项

相似文献

  • 外文文献
  • 中文文献
  • 专利
获取原文

客服邮箱:kefu@zhangqiaokeyan.com

京公网安备:11010802029741号 ICP备案号:京ICP备15016152号-6 六维联合信息科技 (北京) 有限公司©版权所有
  • 客服微信

  • 服务号