...
首页> 外文期刊>Applied Mathematical Modelling >A tandem network with a sharing buffer
【24h】

A tandem network with a sharing buffer

机译:具有共享缓冲区的串联网络

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

摘要

In this paper, we consider a two-stage tandem network. The customers waiting in these two stages share one finite buffer. By constructing a Markov process, we derive the stationary probability distribution of the system and the sojourn time distribution. Given some constraints on the minimum loss probability and the maximum waiting time, we also derive the optimal buffer size and the shared-buffer size by minimizing the total buffer costs. Numerical results show that, by adopting the buffer-sharing policy, the customer acceptance fraction and the delivery reliability are more sensitive to buffer size comparing with the buffer-allocation policy.
机译:在本文中,我们考虑一个两阶段串联网络。在这两个阶段中等待的客户共享一个有限缓冲区。通过构造马尔可夫过程,我们得出系统的平稳概率分布和停留时间分布。给定对最小丢失概率和最大等待时间的一些限制,我们还通过最小化总缓冲区成本来得出最佳缓冲区大小和共享缓冲区大小。数值结果表明,与缓冲区分配策略相比,采用缓冲区共享策略,客户接受率和交付可靠性对缓冲区大小更敏感。

著录项

相似文献

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

客服邮箱:kefu@zhangqiaokeyan.com

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

  • 服务号