首页> 外文期刊>IEEE Transactions on Software Engineering >Approximate throughput analysis of cyclic queueing networks with finite buffers
【24h】

Approximate throughput analysis of cyclic queueing networks with finite buffers

机译:具有有限缓冲区的循环排队网络的近似吞吐量分析

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

摘要

An approximation method for obtaining the throughput of cyclic queueing networks with blocking as a function of the number of customers in it is presented. The approximation method was developed for two different blocking mechanisms. It was also extended to the case of the central server model with blocking. Validation tests show that the algorithm is fairly accurate.
机译:提出了一种近似的方法,该方法获得具有阻塞的循环排队网络的吞吐量,该吞吐量取决于其中的客户数量。针对两种不同的阻塞机制开发了近似方法。它也扩展到具有阻塞功能的中央服务器模型。验证测试表明该算法相当准确。

著录项

相似文献

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

客服邮箱:kefu@zhangqiaokeyan.com

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

  • 服务号