【24h】

Discrete time queues with phase dependent arrivals

机译:具有阶段相关到达的离散时间队列

获取原文

摘要

The queuing behavior of many communication systems is well modeled by a queuing system in which time is slotted and in which the number of entities arriving during a slot is dependent upon the state of a discrete-time, discrete-state Markov chain. The probability generating function is presented for joint and marginal buffer occupancy distributions of statistical time-division multiplexing systems in this class. A simple technique is discussed for obtaining moments of the queue length distribution. In addition, a discussion is presented of inversion of the probability generating function. Numerical results, including queue length distributions for some special cases, are presented.
机译:许多通信系统的排队行为都由一个排队系统很好地建模,在该排队系统中,对时间进行了时隙划分,并且在时隙中到达的实体数量取决于离散时间,离散状态马尔可夫链的状态。针对此类统计时分多路复用系统的联合和边际缓冲区占用率分布,提供了概率生成函数。讨论了一种用于获取队列长度分布时刻的简单技术。另外,讨论了概率生成函数的求逆。给出了数值结果,包括某些特殊情况下的队列长度分布。

著录项

相似文献

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

客服邮箱:kefu@zhangqiaokeyan.com

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

  • 服务号