首页> 外文期刊>Queueing systems >The two-moment three-parameter decomposition approximation of queueing networks with exponentialresidual renewal processes
【24h】

The two-moment three-parameter decomposition approximation of queueing networks with exponentialresidual renewal processes

机译:具有指数剩余更新过程的排队网络的两矩三参数分解逼近

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

摘要

We propose a two-moment three-parameter decomposition approximation of general open queueing networks by which both autocorrelation and cross correlation are accounted for. Each arrival process is approximated as an exponential residual (ER) renewal process that is characterized by three parameters: intensity, residue, and decrement. While the ER renewal process is adopted for modeling autocorrelated processes, the innovations method is used for modeling the cross correlation between randomly split streams. As the interarrival times of an ER renewal process follow a two-stage mixed generalized Erlang distribution, viz., MGE(2), each station is analyzed as an MGE(2)/G/1 system for the approximate mean waiting time. Variability functions are also used in network equations for a more accurate modeling of the propagation of cross correlations in queueing networks. Since an ER renewal process is a special case of a Markovian arrival process (MAP), the value of the variability function is determined by a MAP/MAP/1 approximation of the departure process. Numerical results show that our proposed approach greatly improves the performance of the parametric decomposition approximation of open queueing networks.
机译:我们提出了一般开放排队网络的两步三参数分解逼近,其中考虑了自相关和互相关。每个到达过程都近似为一个指数残差(ER)更新过程,其特征在于三个参数:强度,残差和减量。在采用ER更新过程对自相关过程进行建模的同时,采用创新方法对随机拆分流之间的互相关进行建模。由于ER更新过程的到达时间遵循两阶段混合广义Erlang分布,即MGE(2),因此将每个站点分析为MGE(2)/ G / 1系统的平均等待时间。可变性函数还用于网络方程式中,以更精确地建模排队网络中互相关的传播。由于ER更新过程是马尔可夫到达过程(MAP)的特例,因此变异函数的值由离场过程的MAP / MAP / 1近似值确定。数值结果表明,本文提出的方法大大提高了开放排队网络参数分解逼近的性能。

著录项

相似文献

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

客服邮箱:kefu@zhangqiaokeyan.com

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

  • 服务号