• 主题
高级搜索  >
历史搜索 清空历史
首页> 美国政府科技报告 >Queueing System with Independent Markov Input Streams
【24h】

Queueing System with Independent Markov Input Streams

机译：具有独立马尔可夫输入流的排队系统

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

摘要

In this work, a discrete time single server queueing system with arbitrary (finite) number of input streams, is considered. The input streams are assumed to be independent but successive arrivals in a single stream are not. More specifically, it is assumed that for each stream, arrivals are governed by an underlying finite state space Markov chain and that a visit to a state corresponds to one or none arrivals, according to a stationary mapping rule. The first in-first out service policy is adopted. For the system described above we develop a method to calculate the average number of customers in the queueing system. Then, the mean time that a customer spends in the system is calculated by using Little's theorem.

著录项

相似文献

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

客服邮箱：kefu@zhangqiaokeyan.com

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

  • 客服微信

  • 服务号