首页> 美国政府科技报告 >Many Server Queueing Processes with Poisson Input and Exponential Service Times
【24h】

Many Server Queueing Processes with Poisson Input and Exponential Service Times

机译:具有泊松输入和指数服务时间的许多服务器排队过程

获取原文

摘要

A sample of the type of problems treated is as follows:(l) to obtain a usable formula for the transition probability P(t);(2) to compute the distribution of the length of a busy period;(3) to compute the distribution of the number of customers served during a busy period;(4) to compute the distribution of the maximum length of the queue during a busy period and similar questions.

著录项

相似文献

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

客服邮箱:kefu@zhangqiaokeyan.com

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

  • 服务号