【24h】

An M/M/1-Type Queue with an Individual Deterministic Retrial Rate

机译:具有单独确定的重试率的M / M / 1类型队列

获取原文
获取原文并翻译 | 示例
获取外文期刊封面目录资料

摘要

Consider a system where customers arrive to a single-server queue according to a Poisson process with rate λ. The service times are independent and exponential distributed with rate μ. A customer who arrives when the server is busy is blocked and goes to orbit. Each orbit customer then every T units of time to re-enter the system. If he is blocked again, he will keep trying every T units of time. Balking is not allowed. In this paper, we consider retrial policy with deterministic T and we calculate the expected number of customers in orbit (without using balance equations).
机译:考虑一个系统,在该系统中,客户根据泊松过程以速率λ到达单服务器队列。服务时间是独立的,并且以速率μ指数分布。当服务器繁忙时到达的客户被阻止并进入轨道。然后,每个轨道客户每隔T个时间单位重新进入系统。如果再次被阻止,他将继续尝试每T单位的时间。禁止吠叫。在本文中,我们考虑具有确定性T的重试策略,并计算在轨用户的预期数量(不使用平衡方程)。

著录项

相似文献

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

客服邮箱:kefu@zhangqiaokeyan.com

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

  • 服务号