• 主题
高级搜索  >
历史搜索 清空历史
首页> 美国政府科技报告 >Some Explicit Formulas and Computational Methods for Infinite Server Queues with Phase Type Arrivals.
【24h】

Some Explicit Formulas and Computational Methods for Infinite Server Queues with Phase Type Arrivals.

机译：具有相位类型到达的无限服务器队列的一些显式公式和计算方法。

获取原文
页面导航
  • 摘要
  • 著录项
  • 相似文献
  • 相关主题

摘要

This paper discusses infinite server queues whose input is a Phase Type Renewal Process. The problems of obtaining the transient and steady-state distributions and moments of the queue length are reduced to the solution of certain well-behaved systems of linear differential equations. Sample computations are provided with as many as ten phases. The paper contains some useful explicit formulas and also discusses the interesting special case where the service time is also of phase type. The Phase Type Distributions include a wide variety of models such as generalized Erlang, hyperexponential (mixtures of a finite number of exponentials) as very special cases and possess great versatality in modeling a number of interesting qualitative features such as bimodality.

著录项

相似文献

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

客服邮箱：kefu@zhangqiaokeyan.com

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

  • 客服微信

  • 服务号