首页> 外文会议>Proceeding from the 2006 workshop on Tools for solving structured Markov chains >A matrix analytical method for the discrete time Lindley equation using the generalized Schur decomposition
【24h】

A matrix analytical method for the discrete time Lindley equation using the generalized Schur decomposition

机译:广义Schur分解的离散时间Lindley方程的矩阵分析方法。

获取原文
获取原文并翻译 | 示例

摘要

In this paper, we study the discrete time Lindley equation governing an infinite size GI/GI/1 queue. In this queuing system, the arrivals and services are independent and identically distributed but they obey a discrete time matrix geometric distribution not necessarily with finite support. Our GI/GI/1 model allows geometric batch arrivals and also treats late, early, and hybrid arrival models in a unified manner. We reduce the problem of finding the steady state probabilities for the Lindley equation to finding the generalized ordered Schur form of a matrix pair (E, A) where the size of these matrices are the sum, not the product, of the orders of individual arrival and service distributions. The approach taken in this paper is purely matrix analytical and we obtain a matrix geometric representation for the related quantities (queue lengths or waiting times) for the discrete time GI/GI/1 queue using this approach.
机译:在本文中,我们研究了控制无限大小GI / GI / 1队列的离散时间Lindley方程。在此排队系统中,到达和服务是独立的,并且分布相同,但是它们服从离散时间矩阵的几何分布,而不一定需要有限的支持。我们的GI / GI / 1模型允许几何批量到达,并且也以统一的方式处理晚期,早期和混合到达模型。我们减少了找到Lindley方程稳态概率的问题,从而找到了矩阵对( E,A )的广义有序Schur形式,其中这些矩阵的大小是总和,而不是乘积,个人到达和服务分配的订单。本文采用的方法是纯粹的矩阵分析方法,使用这种方法,我们获得了离散时间GI / GI / 1队列的相关数量(队列长度或等待时间)的矩阵几何表示。

著录项

相似文献

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

客服邮箱:kefu@zhangqiaokeyan.com

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

  • 服务号